Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 937 records · Page 52

Software Helps Retrieve Information Relevant to the User

The Adaptive Indexing and Retrieval Agent (ARNIE) is a code library, designed to be used by an application program, that assists human users in retrieving desired information in a hypertext setting. Using ARNIE, the program implements a computational model for interactively learning what information each human user considers relevant in context. The model, called a "relevance network," incrementally adapts retrieved information to users individual profiles on the basis of feedback from the users regarding specific queries. The model also generalizes such knowledge for subsequent derivation of relevant references for similar queries and profiles, thereby, assisting users in filtering information by relevance. ARNIE thus enables users to categorize and share information of interest in various contexts. ARNIE encodes the relevance and structure of information in a neural network dynamically configured with a genetic algorithm. ARNIE maintains an internal database, wherein it saves associations, and from which it returns associated items in response to a query. A C++ compiler for a platform on which ARNIE will be utilized is necessary for creating the ARNIE library but is not necessary for the execution of the software.

Mathe, Natalie↗

CASM — A software package for first-principles based study of multicomponent crystalline solids

CASM is a software package that enables first-principles based studies of crystalline materials. It has been designed to treat coupled chemical, mechanical, vibrational, and magnetic degrees of freedom to determine ground state and finite temperature properties of crystals. The symmetry of the underlying parent crystal structure is used to enumerate perturbations of the parent crystal structure and generate derivative structures which can be input to first-principles calculations in order to explore the ground state energy landscape. CASM algorithmically constructs cluster expansions that fully couple discrete and continuous degrees of freedom, and generates highly efficient code to evaluate the cluster expansion basis functions. Widely used machine learning methods are integrated for fitting expansion coefficients to first-principle calculations. The fully parameterized cluster expansions can be combined with (kinetic) Monte Carlo methods to calculate finite temperature thermodynamic and kinetic properties. CASM Alloy Manager identifies distinct parent crystal structures in an alloy system, creating individual projects for each, and integrating the results. The integrated infrastructure facilitates the linkage between first-principles statistical mechanics predictions with higher length scale computational methods, such as phase field simulations. In conclusion, CASM projects are designed to be easy to share in repositories, to re-use, and to extend to include additional chemical species or types of degrees of freedom.

36 MATERIALS SCIENCE↗

A NWB-based dataset and processing pipeline of human single-neuron activity during a declarative memory task

A challenge for data sharing in systems neuroscience is the multitude of different data formats used. Neurodata Without Borders: Neurophysiology 2.0 (NWB:N) has emerged as a standardized data format for the storage of cellular-level data together with meta-data, stimulus information, and behavior. A key next step to facilitate NWB:N adoption is to provide easy to use processing pipelines to import/export data from/to NWB:N. Here, we present a NWB-formatted dataset of 1863 single neurons recorded from the medial temporal lobes of 59 human subjects undergoing intracranial monitoring while they performed a recognition memory task. We provide code to analyze and export/import stimuli, behavior, and electrophysiological recordings to/from NWB in both MATLAB and Python. The data files are NWB:N compliant, which affords interoperability between programming languages and operating systems. This combined data and code release is a case study for how to utilize NWB:N for human single-neuron recordings and enables easy re-use of this hard-to-obtain data for both teaching and research on the mechanisms of human memory.

Science & Technology - Other Topics↗

Berkeley Lab Finite Element Framework (BELFEM) v0.1

The software program, referred to as BELFEM, is a specialized finite element code designed for the magnetodynamic modeling of high-temperature superconducting (HTS) tapes. It incorporates novel mixed finite element formulations, particularly the h-ϕ-formulation with thin-shell simplification, to efficiently simulate larger geometries. This methodology is extremely promising for predicting the electrodynamic performance of HTS tapes used in superconducting cables and magnets, offering the benefit of reduced computational cost. Compared to similar technologies like COMSOL Multiphysics and GetDP, BELFEM's performance benchmarking indicates superior efficiency in its thin-shell implementation. In the future, it will also support features like thermal coupling and inter-tape current sharing, enhancing its utility in research and development, particularly in nuclear fusion applications. The intent is to develop BELFEM as a robust and efficient tool for the HTS community, contributing to the analysis and design of superconducting cables and magnets.

Messe, Christian↗

Conversion of LARSYS III.1 to an IBM 370 computer

A software system for processing multispectral aircraft or satellite data (LARSYS) was designed and written at the Laboratory for Applications of Remote Sensing at Purdue University. This system, being implemented on an IBM 360/67 computer utilizing the Cambridge Monitor System, is of an interactive nature. TAMU LARSYS maintains the essential capabilities of Purdue's LARSYS. The machine configuration for which it has been converted is an IBM-compatible Amdahl 470V/6 computer utilizing the time sharing option of the currently implemented OS/VS2 Operating System. Due to TSO limitations, the NASA-JSC deliverable TAMU LARSYS is comprised of two parts. Part one is a TSO Control Card Checker for LARSYS control cards, and part two is a batch version of LARSYS. Used together, they afford most of the capabilities of the original LARSYS III.1. Additionally, two programs have been written by TAMU to support LARSYS processing. The first is an ERTS-to-MIST conversion program used to convert ERTS data to the LARSYS input form, the MIST tape. The second is a system runtable code which maintains tape/file location information for the MIST data sets.

Williams, G. N.↗

Supersonic airplane study and design

A supersonic airplane creates shocks which coalesce and form a classical N-wave on the ground, forming a double bang noise termed sonic boom. A recent supersonic commercial transport (the Concorde) has a loud sonic boom (over 100 PLdB) and low aerodynamic performance (cruise lift-drag ratio 7). To enhance the U.S. market share in supersonic transport, an airframer's market risk for a low-boom airplane has to be reduced. Computational fluid dynamics (CFD) is used to design airplanes to meet the dual constraints of low sonic boom and high aerodynamic performance. During the past year, a research effort was focused on three main topics. The first was to use the existing design tools, developed in past years, to design one of the low-boom wind-tunnel configurations (Ames Model 3) for testing at Ames Research Center in April 1993. The second was to use a Navier-Stokes code (Overflow) to support the Oblique-All-Wing (OAW) study at Ames. The third was to study an optimization technique applied on a Haack-Adams body to reduce aerodynamic drag.

Cheung, Samson↗

Analysis of the Harrier forebody/inlet design using computational techniques

Under the support of this Cooperative Agreement, computations of transonic flow past the complex forebody/inlet configuration of the AV-8B Harrier II have been performed. The actual aircraft configuration was measured and its surface and surrounding domain were defined using computational structured grids. The thin-layer Navier-Stokes equations were used to model the flow along with the Chimera embedded multi-grid technique. A fully conservative, alternating direction implicit (ADI), approximately-factored, partially flux-split algorithm was employed to perform the computation. An existing code was altered to conform with the needs of the study, and some special engine face boundary conditions were developed. The algorithm incorporated the Chimera technique and an algebraic turbulence model in order to deal with the embedded multi-grids and viscous governing equations. Comparison with experimental data has yielded good agreement for the simplifications incorporated into the analysis. The aim of the present research was to provide a methodology for the numerical solution of complex, combined external/internal flows. This is the first time-dependent Navier-Stokes solution for a geometry in which the fuselage and inlet share a wall. The results indicate the methodology used here is a viable tool for transonic aircraft modeling.

Chow, Chuen-Yen↗

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↗

SHARP/PRONGHORN Interoperability: Mesh Generation

Progress toward collaboration between the SHARP and MOOSE computational frameworks has been demonstrated through sharing of mesh generation and ensuring mesh compatibility of both tools with MeshKit. MeshKit was used to build a three-dimensional, full-core very high temperature reactor (VHTR) reactor geometry with 120-degree symmetry, which was used to solve a neutron diffusion critical eigenvalue problem in PRONGHORN. PRONGHORN is an application of MOOSE that is capable of solving coupled neutron diffusion, heat conduction, and homogenized flow problems. The results were compared to a solution found on a 120-degree, reflected, three-dimensional VHTR mesh geometry generated by PRONGHORN. The ability to exchange compatible mesh geometries between the two codes is instrumental for future collaboration and interoperability. The results were found to be in good agreement between the two meshes, thus demonstrating the compatibility of the SHARP and MOOSE frameworks. This outcome makes future collaboration possible.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Logic Simulator Program

The source code for the SPICE 2 program was deblocked in order to isolate and compile the subroutine in an effort to provide a software simulation of discrete and combinatorial electronic components. Incompatibilities between the UNIVAC 1180 FORTRAN and the Sigma V CP-V FORTRAN 4 were resolved. The SPICE 2 model is to be used to determine gate and fan-out delays, logic state conditions, and signal race conditions for transistor array elements and circuit logic to be patterned in the (SPI) 7101 CMOS silicon gate semicustom array. The simulator is to be operable from the CP-V time sharing terminals.

Agarwal, R. K.↗

NASA Environmentally Responsible Aviation High Overall Pressure Ratio Compressor Research Pre-Test CFD

This paper describes a collaborative and cost-shared approach to reducing fuel burn under the NASA Environmentally Responsible Aviation project. NASA and General Electric (GE) Aviation are working together aa an integrated team to obtain compressor aerodynamic data that is mutually beneficial to both NASA and GE Aviation. The objective of the High OPR Compressor Task is to test a single stage then two stages of an advanced GE core compressor using state-of-the-art research instrumentation to investigate the loss mechanisms and interaction effects of embedded transonic highly-loaded compressor stages. This paper presents preliminary results from NASA's in-house multistage computational code, APNASA, in preparation for this advanced transonic compressor rig test.

Celestina, Mark L.↗

LevSeq: Rapid Generation of Sequence-Function Data for Directed Evolution and Machine Learning

Sequence-function data provides valuable information about the protein functional landscape but is rarely obtained during directed evolution campaigns. Here, we present Long-read every variant Sequencing (LevSeq), a pipeline that combines a dual barcoding strategy with nanopore sequencing to rapidly generate sequence-function data for entire protein-coding genes. LevSeq integrates into existing protein engineering workflows and comes with open-source software for data analysis and visualization. The pipeline facilitates data-driven protein engineering by consolidating sequence-function data to inform directed evolution and provide the requisite data for machine learning-guided protein engineering (MLPE). LevSeq enables quality control of mutagenesis libraries prior to screening, which reduces time and resource costs. Simulation studies demonstrate LevSeq’s ability to accurately detect variants under various experimental conditions. Lastly, we show LevSeq’s utility in engineering protoglobins for new-to-nature chemistry. Widespread adoption of LevSeq and sharing of the data will enhance our understanding of protein sequence-function landscapes and empower data-driven directed evolution.

59 BASIC BIOLOGICAL SCIENCES↗

INVESTIGATING THE CIRCUMSTELLAR DISK OF THE Be SHELL STAR 48 LIBRAE

A global disk oscillation implemented in the viscous decretion disk (VDD) model has been used to reproduce most of the observed properties of the well known Be star ζ Tau. 48 Librae shares several similarities with ζ Tau—they are both early-type Be stars, display shell characteristics in their spectra, and exhibit cyclic V / R variations—but has some marked differences as well, such as a much denser and more extended disk, a much longer V / R cycle, and the absence of the so-called triple-peak features. We aim to reproduce the photometric, polarimetric, and spectroscopic observables of 48 Librae with a self-consistent model, and to test the global oscillation scenario for this target. Our calculations are carried out with the three-dimensional NLTE radiative transfer code HDUST. We employ a rotationally deformed, gravity-darkened central star surrounded by a disk whose unperturbed state is given by the VDD model. A two-dimensional global oscillation code is then used to calculate the disk perturbation and superimpose it on the unperturbed disk. A very good, self-consistent fit to the time-averaged properties of the disk is obtained with the VDD. The calculated perturbation has a period P = 12 years, which agrees with the observed period, and the behavior of the V / R cycle is well reproduced by the perturbed model. The perturbed model improves the fit to the photometric data and reproduces some features of the observed spectroscopic data. Some suggestions to improve the synthesized spectroscopy in a future work are given.

79 ASTRONOMY AND ASTROPHYSICS↗

Classical Flutter Analysis of X-57 Aircraft Mod II, III, and IV Configurations

To support airworthiness assessment of the X-57 electric propulsion demonstrator aircraft, the National Aeronautics and Space Administration (NASA) completed classical flutter analysis of the Mod II, Mod III, and Mod IV aircraft configurations. Aeroelastic analysis was primarily performed using the ZAERO analysis code developed by Zona Technology. Supplemental computational fluid dynamics (CFD) flutter analysis for the Mod III and Mod IV configurations was performed using NASA’s FUN3D software to verify the aeroelastic behavior at deployed flaps conditions. The NASTRAN finite element models (FEMs) used for aeroelastic analysis were developed by NASA. The final Mod II FEM utilized shell elements for the wing and fuselage, and beam elements for the tail and wing control surfaces. For Mod III and Mod IV aircraft models, shell element wing FEMs developed throughout the Mod III/IV wing design cycle were utilized. The fuselage and empennage FEM components were shared between the Mod II, III, and IV aircraft models. ZAERO analyses predicted flutter boundaries were >60% beyond the X-57 flight-test envelope never exceed airspeed (V NE ) for all configurations. Aeroelastic Reynolds-averaged Navier–Stokes (RANS) CFD simulations using FUN3D of the Mod III/IV configurations predicted flap mode instability did not occur until at least speeds of 60% higher than the Mod III/IV maximum flap deployment airspeed (V FE ).

Keerti K. Bhamidipati↗

SU-D-BRD-01: An Automated Physics Weekly Chart Checking System Supporting ARIA

Purpose: A software tool was developed in this study to perform automatic weekly physics chart check on the patient data in ARIA. The tool accesses the electronic patient data directly from ARIA server and checks the accuracy of treatment deliveries, and generates reports which summarize the delivery history and highlight the errors. Methods: The tool has four modules. 1) The database interface is designed to directly access treatment delivery data from the ARIA database before reorganizing the data into the patient chart tree (PCT). 2) PCT is a core data structure designed to store and organize the data in logical hierarchies, and to be passed among functions. 3) The treatment data check module analyzes the organized data in PCT and stores the checking results into PCT. 4) Report generation module generates reports containing the treatment delivery summary, chart checking results and plots of daily treatment setup parameters (couch table positions, shifts of image guidance). The errors that are found by the tool are highlighted with colors. Results: The weekly check tool has been implemented in MATLAB and clinically tested at two major cancer centers. Javascript, cascading style sheets (CSS) and dynamic HTML were employed to create the user-interactive reports. It takes 0.06 second to search the delivery records of one beam with PCT and compare the delivery records with beam plan. The reports, saved in the HTML files on shared network folder, can be accessed by web browser on computers and mobile devices. Conclusion: The presented weekly check tool is useful to check the electronic patient treatment data in Varian ARIA system. It could be more efficient and reliable than the manually check by physicists. The work was partially supported by a research grant from Varian Medical System.

60 APPLIED LIFE SCIENCES↗

EVSE DERMS Controls [SWR-26-010]

An MQTT (Message Queuing Telemetry Transport) and OCPP (Open Charge Point Protocol) based remote smart charging controller framework for AC Electric Vehicle Supply Equipments (EVSEs). The code in this repo allows for the National Laboratory of the Rockies (NLR) controls to interface with the real Distributed Energy Resource Management System (DERMS) and EVSEs in NLR's ESIF Optimization and Control Laboratory (OCL). Different charge management algorithms can be tested to determine which power allocation method is most effective with the overall goal of demonstrating clear and well documented test results as well as providing functional control algorithms which could be utilized to provide effective smart charge management (SCM) at EV charging stations. Different power allocation methods are programmed in lab_demo_controller.py and include allocation based on first come first served, equal sharing, state of charge (SOC), priority factors, and behind the meter control methods.

Panossian, Nadia [National Laboratory of the Rocki↗

The MolSSI QCArchive project: An open-source platform to compute, organize, and share quantum chemistry data

The Molecular Sciences Software Institute's (MolSSI) Quantum Chemistry Archive (QCArchive) project is an umbrella name that covers both a central server hosted by MolSSI for community data and the Python-based software infrastructure that powers automated computation and storage of quantum chemistry (QC) results. The MolSSI-hosted central server provides the computational molecular sciences community a location to freely access tens of millions of QC computations for machine learning, methodology assessment, force-field fitting, and more through a Python interface. Facile, user-friendly mining of the centrally archived quantum chemical data also can be achieved through web applications found at the website. The software infrastructure can be used as a standalone platform to compute, structure, and distribute hundreds of millions of QC computations for individuals or groups of researchers at any scale. The QCArchiveInfrastructure is open-source (BSD-3C), code repositories can be found at github, and releases can be downloaded via PyPI and Conda. This article is categorized under: Electronic Structure Theory > Ab Initio Electronic Structure Methods Software > Quantum Chemistry Data Science > Computer Algorithms and Programming

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Automatic Parallelization of Numerical Python Applications using the Global Arrays Toolkit

Global Arrays is a software system from Pacific Northwest National Laboratory that enables an efficient, portable, and parallel shared-memory programming interface to manipulate distributed dense arrays. The NumPy module is the de facto standard for numerical calculation in the Python programming language, a language whose use is growing rapidly in the scientific and engineering communities. NumPy provides a powerful N-dimensional array class as well as other scientific computing capabilities. However, like the majority of the core Python modules, NumPy is inherently serial. Using a combination of Global Arrays and NumPy, we have reimplemented NumPy as a distributed drop-in replacement called Global Arrays in NumPy (GAiN). Serial NumPy applications can become parallel, scalable GAiN applications with only minor source code changes. Scalability studies of several different GAiN applications will be presented showing the utility of developing serial NumPy codes which can later run on more capable clusters or supercomputers.

99 GENERAL AND MISCELLANEOUS↗