Search NASA⌕ Search

SEARCH · Search NASA

Results for “interface algorithm”

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 757 records · Page 42

Characterization of local morphology and availability of triple-phase boundaries in solid oxide cell electrodes

The performance of solid oxide cells is known to be dependent upon the density of three phase boundaries (TPB), but the potential for improving their effective electrocatalytic activity by morphological adjustments is imprecisely known. A spilling algorithm was developed to characterize the surfaces available for diffusion at TPBs. It scans each slice in a 3-D imaging dataset to measure the interfaces between the solid and the pore phases at each TPB. Because of the stereological approach, these surfaces are defined as “available lengths” (L A ). The measurement was tested on artificial packed spheres structures with controlled properties and a percolation theory-based model before application to a real Ni-YSZ. The L A distributions cover 2 orders of magnitude. The subset shorter than the extent of diffusion profiles reported in the literature is in the range of 3% and 20% for Ni and YSZ, respectively, suggesting possible limitations of their effective electrocatalytic properties. The average L A is larger on YSZ than on Ni, which is a trend opposite to the phase diameter. The available length analysis revealed microstructural characteristics that stem from the manufacturing route and cannot be identified by the inspection of standard metric and topological properties. A strong correlation between the available length and the extension of TPB lines is observed for Ni but not for YSZ, despite the predominance of convex shapes, which likely originates from the Ni reduction. This suggests possibilities for controlling the available length by the manufacturing route, depending specifically on the electrocatalytic properties of the phases in composite materials.

3-D electron microscopy↗

Modeling wave propagation in elastic solids via high-order accurate implicit-mesh discontinuous Galerkin methods

Here, a high-order accurate implicit-mesh discontinuous Galerkin framework for wave propagation in single-phase and bi-phase solids is presented. The framework belongs to the embedded-boundary techniques and its novelty regards the spatial discretization, which enables boundary and interface conditions to be enforced with high-order accuracy on curved embedded geometries. High-order accuracy is achieved via high-order quadrature rules for implicitly-defined domains and boundaries, whilst a cell-merging strategy addresses the presence of small cut cells. The framework is used to discretize the governing equations of elastodynamics, written using a first-order hyperbolic momentum-strain formulation, and an exact Riemann solver is employed to compute the numerical flux at the interface between dissimilar materials with general anisotropic properties. The space-discretized equations are then advanced in time using explicit high-order Runge–Kutta algorithms. Several two- and three-dimensional numerical tests including dynamic adaptive mesh refinement are presented to demonstrate the high-order accuracy and the capability of the method in the elastodynamic analysis of single- and bi-phases solids containing complex geometries.

42 ENGINEERING↗

CalderaCast Web Interface

CalderaCast may be accessed as a web-based tool at the first link in the references section of this dataset. All of the necessary datasets to run the tool are built into the simulation software running behind the web interface. These input datasets are referenced by the additional links in the references section below. Many of those datasets are taken into machine-learning algorithms by the Caldera team and heavily processed to create internal datasets, which are then relied upon by the simulation to produce individual results. These internal datasets are not accessible and are not necessary for use of the CalderaCast tool.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Framework for Extensible, Asynchronous Task Scheduling (FEATS) in Fortran

Most parallel scientific programs contain compiler directives (pragmas) such as those from OpenMP, explicit calls to runtime library procedures such as those implementing the Message Passing Interface (MPI), or compiler-specific language extensions such as those provided by CUDA. By contrast, the recent Fortran standards empower developers to express parallel algorithms without directly referencing lower-level parallel programming models. Fortran’s parallel features place the language within the Partitioned Global Address Space (PGAS) class of programming models. When writing programs that exploit data-parallelism, application developers often find it straightforward to develop custom parallel algorithms. Problems involving complex, heterogeneous, staged calculations, however, pose much greater challenges. Such applications require careful coordination of tasks in a manner that respects dependencies prescribed by a directed acyclic graph. When rolling one’s own solution proves difficult, extending a customizable framework becomes attractive. The paper presents the design, implementation, and use of the Framework for Extensible Asynchronous Task Scheduling (FEATS), which we believe to be the first task-scheduling tool written in modern Fortran. We describe the benefits and compromises associated with choosing Fortran as the implementation language, and we propose ways in which future Fortran standards can best support the use case in this paper.

Richardson, Brad↗

Cobweb/3: A portable implementation

An algorithm is examined for data clustering and incremental concept formation. An overview is given of the Cobweb/3 system and the algorithm on which it is based, as well as the practical details of obtaining and running the system code. The implementation features a flexible user interface which includes a graphical display of the concept hierarchies that the system constructs.

Mckusick, Kathleen↗

On the dynamics of a shock-bubble interaction

We present a detailed numerical study of the interaction of a weak shock wave with an isolated cylindrical gas inhomogenity. Such interactions have been studied experimentally in an attempt to elucidate the mechanisms whereby shock waves propagating through random media enhance mixing. Our study concentrates on the early phases of the interaction process which are dominated by repeated refractions of acoustic fronts at the bubble interface. Specifically, we have reproduced two of the experiments performed by Haas and Sturtevant : M(sub s) = 1.22 planar shock wave, moving through air, impinges on a cylindrical bubble which contains either helium or Refrigerant 22. These flows are modelled using the two-dimensional, compressible Euler equations for a two component fluid (air-helium or air-Refrigerant 22). Although simulations of shock wave phenomena are now fairly commonplace, they are mostly restricted to single component flows. Unfortunately, multi-component extensions of successful single component schemes often suffer from spurious oscillations which are generated at material interfaces. Here we avoid such problems by employing a novel, nonconservative shock-capturing scheme. In addition, we have utilized a sophisticated adaptive mesh refinement algorithm which enables extremely high resolution simulations to be performed relatively cheaply. Thus we have been able to reproduce numerically all the intricate mechanisms that were observed experimentally (e.g., transitions from regular to irregular refraction, cusp formation and shock wave focusing, multi-shock and Mach shock structures, jet formation, etc.), and we can now present an updated description for the dynamics of a shock-bubble interaction.

Quirk, James J.↗

Design Optimization and Analysis of a Composite Honeycomb Intertank

Intertanks, the structure between tanks of launch vehicles, are prime candidates for weight reduction of rockets. This paper discusses the optimization and detailed follow up analysis and testing of a 96 in. diameter, 77 in. tall intertank. The structure has composite face sheets with an aluminum honeycomb core. The ends taper to a thick built up laminate for a double lap bolted splice joint interface. It is made in 8 full length panels joined with bonded double lap joints. The nominal load is 4000 lb/in. Optimization is by Genetic Algorithm and minimizes weight by varying core thickness, number and orientation of acreage and buildup plies, and the size, number and spacing of bolts. A variety of design cases were run with populations up to 2000 and chromosomes as long as 150 bits. Constraints were buckling; face stresses (normal, shear, wrinkling and dimpling); bolt stress; and bolt hole stresses (bearing, net tension, wedge splitting, shear out and tension/shear out). Analysis is by a combination of elasticity solutions and empirical data. After optimization, a series of coupon tests were performed in conjunction with a rigorous analysis involving a variety of finite element models. This analysis and testing resulted in several small changes to the optimized design. The equation used for hole bearing strength was found to be inadequate, resulting in thicker ends. The core thickness increased 0.05", and potting compound was added in the taper to strengthen the facesheet bond. The intertank has undergone a 250,000 lb limit load test and been mated with a composite liquid hydrogen tank. The tank/intertank unit is being installed in a test stand where it will see 200 thermal/load cycles. Afterwards the intertank will be demated and loaded in compression to failure.

Finckenor, Jeff↗

Design Description of the X-33 Avionics Architecture

In this paper, we provide a design description of the X-33 avionics architecture. The X-33 is an autonomous Single Stage to Orbit (SSTO) launch vehicle currently being developed by Lockheed Martin for NASA as a technology demonstrator for the VentureStar Reusable Launch Vehicle (RLV). The X-33 avionics provides autonomous control of die vehicle throughout takeoff, ascent, descent, approach, landing, rollout, and vehicle safing. During flight the avionics provides communication to the range through uplinked commands and downlinked telemetry. During pre-launch and post-safing activities, the avionics provides interfaces to ground support consoles that perform vehicle flight preparations and maintenance. The X-33 Avionics is a hybrid of centralized and distributed processing elements connected by three dual redundant Mil-Std 1553 data buses. These data buses are controlled by a central processing suite located in the avionics bay and composed of triplex redundant Vehicle Mission Computers (VMCs). The VMCs integrate mission management, guidance, navigation, flight control, subsystem control and redundancy management functions. The vehicle sensors, effectors and subsystems are interfaced directly to the centralized VMCs as remote terminals or through dual redundant Data Interface Units (DIUs). The DIUs are located forward and aft of the avionics bay and provide signal conditioning, health monitoring, low level subsystem control and data interface functions. Each VMC is connected to all three redundant 1553 data buses for monitoring and provides a complete identical data set to the processing algorithms. This enables bus faults to be detected and reconfigured through a voted bus control configuration. Data is also shared between VMCs though a cross channel data link that is implemented in hardware and controlled by AlliedSignal's Fault Tolerant Executive (FTE). The FTE synchronizes processors within the VMC and synchronizes redundant VMCs to each other. The FTE provides an output-voting plane to detect, isolate and contain faults due to internal hardware or software faults and reconfigures the VMCs to accommodate these faults. Critical data in the 1553 messages are scheduled and synchronized to specific processing frames in order to minimize data latency. In order to achieve an open architecture, military and commercial off-the-shelf equipment is incorporated using common processors, standard VME backplanes and chassis, the VxWorks operating system, and MartixX for automatic code generation. The use of off-the-shelf tools and equipment helps reduce development time and enables software reuse. The open architecture allows for technology insertion, while the distributed modular elements allow for expansion to increased redundancy levels to meet the higher reliability goals of future RLVs.

Reichenfeld, Curtis J.↗

Retrospective Data Assimilation for GEOS-4

The NASA/Goddard Earth Observing System 3 (GEOS-3) has recently been replaced operationally by GEOS-4. One of the major components of the new system is the finite-volume general circulation model (GCM) of Lin and Rood. Updating the GEOS-3 retrospective data assimilation system of Zhu et al. to GEOS-4 requires two main steps: (i) developing the adjoint of the finite-volume GCM; and (ii) developing the adjoint of the procedures interfacing the GCM with the Physical-space Statistical Analysis System. These required adjoints are being developed automatically through the use of the Transformation of Algorithms in Fortran compiler of Giering and Kaminski. In this presentation we discuss the current status of development and plans for the near future as well as show preliminary results.

Todling, Ricardo↗

Framework for Extensible, Asynchronous Task Scheduling (FEATS) in Fortran

Most parallel scientific programs contain compiler directives (pragmas) such as those from OpenMP, explicit calls to runtime library procedures such as those implementing the Message Passing Interface (MPI), or compiler-specific language extensions such as those provided by CUDA. By contrast, the recent Fortran standards empower developers to express parallel algorithms without directly referencing lower-level parallel programming models. Fortran’s parallel features place the language within the Partitioned Global Address Space (PGAS) class of programming models. When writing programs that exploit data-parallelism, application developers often find it straightforward to develop custom parallel algorithms. Problems involving complex, heterogeneous, staged calculations, however, pose much greater challenges. Such applications require careful coordination of tasks in a manner that respects dependencies prescribed by a directed acyclic graph. When rolling one’s own solution proves difficult, extending a customizable framework becomes attractive. The paper presents the design, implementation, and use of the Framework for Extensible Asynchronous Task Scheduling (FEATS), which we believe to be the first task-scheduling tool written in modern Fortran. We describe the benefits and compromises associated with choosing Fortran as the implementation language, and we propose ways in which future Fortran standards can best support the use case in this paper.

Modern Fortran↗

Entropy Stable Nonconforming Discretizations with the Summation-By-Parts Property for Curvilinear Coordinates

The entropy conservative/stable algorithm of Friedrichet al.(2018) for hyperbolic conservation laws on nonconforming p-refined/coarsened Cartesian grids, is extended to curvilinear grids for the compressible Euler equations. The primary focus is on constructing appropriate coupling procedures across the curvilinear nonconforming interfaces. A simple and flexible approach is proposed that uses interpolation operators from one element to the other. On the element faces,the analytic metrics are used to construct coupling terms, while metric terms in the volume are approximated to satisfy a discretization of the geometric conservation laws. The resulting scheme is entropy conservative/stable, elementwise conservative, and freestream preserving. The accuracy and stability properties of the resulting numerical algorithm are shown to be comparable to those ofthe original conforming scheme (∼p+ 1 convergence) in the context of the isentropic Euler vortex and the inviscid Taylor–Green vortex problems on manufactured high order grids.

David Del Rey Fernandez↗

Assessment of Cloud Fraction Derived from a New Geostationary Satellite Cloud Retrieval Algorithm for CERES and Progress Towards Cross-platform Continuity

For over two decades The Clouds and the Earth’s Radiant Energy System (CERES) project has produced long-term records of top-of-atmosphere (TOA) and surface irradiances for detecting changes in the Earth’s radiation budget and advancing understanding of how clouds contribute to those changes. Accurate characterization of the spatial and temporal distributions of clouds are a critical component for producing CERES datasets. The CERES Cloud Working Group (CWG) derives cloud properties from both geostationary (GEO) and low-Earth orbit (LEO) satellite sensors in order to provide complete global coverage at hourly temporal resolution. However, the use of multiple sensors to provide this spatiotemporal coverage throughout a long-term record presents some challenges, because the various sensors generally have different spectral band characteristics (e.g., spectral band width and response) and spatial resolution. These differences can result in spatial artifacts at the coverage boundary between two sensors or temporal artifacts when one sensor replaces another in the record. For the upcoming Edition 5 release of CERES products, the CWG is developing cloud retrieval algorithms which utilize only spectral bands common to most modern passive satellite radiometers and account for differences in spectral width and response. The goal with this approach is to provide global cloud properties for CERES with greater cross-platform consistency than the previous Edition 4 products and thus mitigate artifacts which are evident at the interface of two sensors. This study focuses on retrieval of total cloud fraction from various GEO sensors, and we use Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) observations to assess the accuracy of total cloud fraction derived from the various sensors. The Edition 5 cloud mask algorithm depends on estimates of cloud-free TOA spectral radiances to differentiate clear and cloudy conditions, and CALIOP is used to assess the accuracy of those estimates when cloud-free conditions are indeed observed.

CALIOP↗

Aero-Engines AI - A Machine-Learning App for Aircraft Engine Concepts Assessment

Effective deployment of machine-learning (ML) models could drive a high level of efficiency in aircraft engine conceptual design. Aero-Engines AI is a user-friendly app that has been created to deploy trained machine-learning (ML) models to assess aircraft engine concepts. It was created using tkinter, a GUI (graphical user interface) module that is built into the standard Python library. Employing tkinter greatly facilitates the sharing of ML application as an executable file which can be run on Windows machines (without the need to have Python or any library installed). The app gets user input for a turbofan design, preprocesses the input data, and deploys trained ML models to predict turbofan thrust specific fuel consumption (TSFC), engine weight, core size, and turbomachinery stage-counts. The ML predictive models were built by employing supervised deep-learning and K-nearest neighbor regression algorithms to study patterns in an existing open-source database of production and research turbofan engines. They were trained, cross-validated, and tested in Keras, an open-source neural networks API (application programming interface) written in Python, with TensorFlow (Google open-source artificial intelligence library) serving as the backend engine. The smooth deployment of these ML models using the app shows that Aero-Engines AI is an easy-touse and a time-saving tool for aircraft engine design-space exploration during the conceptual design stage. Current version of the app focuses on the performance prediction of conventional turbofans. However, the scope of the app can easily be expanded to include other engine types (such as turboshaft and hybrid-electric systems) after their ML models are developed. Overall, the use of a machine-learning app for aircraft engine concept assessment represents a promising area of development in aircraft engine conceptual design.

machine learning↗

Aero-Engines AI - A Machine-Learning App for Aircraft Engine Concepts Assessment

Effective deployment of machine-learning (ML) models could drive a high level of efficiency in aircraft engine conceptual design. Aero-Engines AI is a user-friendly app that has been created to deploy trained machine-learning (ML) models to assess aircraft engine concepts. It was created using tkinter, a GUI (graphical user interface) module that is built into the standard Python library. Employing tkinter greatly facilitates the sharing of ML application as an executable file which can be run on Windows machines (without the need to have Python or any library installed). The app gets user input for a turbofan design, preprocesses the input data, and deploys trained ML models to predict turbofan thrust specific fuel consumption (TSFC), engine weight, core size, and turbomachinery stage-counts. The ML predictive models were built by employing supervised deep-learning and K-nearest neighbor regression algorithms to study patterns in an existing open-source database of production and research turbofan engines. They were trained, cross-validated, and tested in Keras, an open-source neural networks API (application programming interface) written in Python, with TensorFlow (Google open-source artificial intelligence library) serving as the backend engine. The smooth deployment of these ML models using the app shows that Aero-Engines AI is an easy-touse and a time-saving tool for aircraft engine design-space exploration during the conceptual design stage. Current version of the app focuses on the performance prediction of conventional turbofans. However, the scope of the app can easily be easily expanded to include other engine types (such as turboshaft and hybrid-electric systems) after their ML models are developed. Overall, the use of a machine-learning app for aircraft engine concept assessment represents a promising area of development in aircraft engine conceptual design.

machine learning↗

Adaptive laser link reconfiguration using constraint propagation

This paper describes Harris AI research performed on the Adaptive Link Reconfiguration (ALR) study for Rome Lab, and focuses on the application of constraint propagation to the problem of link reconfiguration for the proposed space based Strategic Defense System (SDS) Brilliant Pebbles (BP) communications system. According to the concept of operations at the time of the study, laser communications will exist between BP's and to ground entry points. Long-term links typical of RF transmission will not exist. This study addressed an initial implementation of BP's based on the Global Protection Against Limited Strikes (GPALS) SDI mission. The number of satellites and rings studied was representative of this problem. An orbital dynamics program was used to generate line-of-site data for the modeled architecture. This was input into a discrete event simulation implemented in the Harris developed COnstraint Propagation Expert System (COPES) Shell, developed initially on the Rome Lab BM/C3 study. Using a model of the network and several heuristics, the COPES shell was used to develop the Heuristic Adaptive Link Ordering (HALO) Algorithm to rank and order potential laser links according to probability of communication. A reduced set of links based on this ranking would then be used by a routing algorithm to select the next hop. This paper includes an overview of Constraint Propagation as an Artificial Intelligence technique and its embodiment in the COPES shell. It describes the design and implementation of both the simulation of the GPALS BP network and the HALO algorithm in COPES. This is described using a 59 Data Flow Diagram, State Transition Diagrams, and Structured English PDL. It describes a laser communications model and the heuristics involved in rank-ordering the potential communication links. The generation of simulation data is described along with its interface via COPES to the Harris developed View Net graphical tool for visual analysis of communications networks. Conclusions are presented, including a graphical analysis of results depicting the ordered set of links versus the set of all possible links based on the computed Bit Error Rate (BER). Finally, future research is discussed which includes enhancements to the HALO algorithm, network simulation, and the addition of an intelligent routing algorithm for BP.

Crone, M. S.↗

AXI4MLIR: User-Driven Automatic Host Code Generation for Custom AXI-Based Accelerators

Tensor algebra operations represent an important class of algorithms used across many applications, including machine learning, scientific computing, and data analytics. As a result, the efficient generation of custom accelerators for tensor operations has received increased attention. Previous efforts have produced automated tools enabling users to prototype and explore optimized accelerators. However, little effort has been focused on the host-accelerator interaction in these tools. Efficient use of hardware accelerators requires knowledge about the accelerator's capabilities (operations, data formats, and opcode support), the host CPU microarchitecture (e.g., memory hierarchy), the host-accelerator interface, and the application's features (which code regions should be mapped onto an accelerator). Manually rewriting the original applications to facilitate improved custom accelerator mapping is an error-prone and time-consuming endeavor. To cope with this, we propose AXI4MLIR, a new framework to automatically generate and optimize the communication between the host CPU and arbitrary accelerators that implement linear algebra algorithms. AXI4MLIR extends the MLIR compiler framework to automatically generate efficient host-accelerator driver code for accelerators with AXI-based interfaces. Our compiler extensions enable automatic driver code generation while carefully considering the host's memory hierarchy and target accelerator features. To demonstrate the flexibility and utility of AXI4MLIR, we test it with diverse use cases that include different types of accelerators, tiling scenarios, and dataflow schemes. We compare our experimental results to manual implementations of host-accelerator driver code and find that our approach can reduce CPU cache references by 56% and deliver up to a 1.65x speedup.

Bohm Agostini, Nicolas↗

Absorption of charged particles in perfectly matched layers by optimal damping of the deposited current

Perfectly matched layers (PMLs) are widely used in particle-in-cell simulations, in order to absorb electromagnetic waves that propagate out of the simulation domain. However, when charged particles cross the interface between the simulation domain and the PMLs, a number of numerical artifacts can arise. Here, in order to mitigate these artifacts, we introduce a PML algorithm whereby the current deposited by the macroparticles in the PML is damped by an analytically derived optimal coefficient. The benefits of this algorithm are illustrated in practical simulations. In particular, it is shown that this algorithm is well suited for particles exiting the box in near-normal incidence, in the sense that the fields behave as if the exiting particle is propagating in an infinite vacuum.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

MATBOX (Microstructure Analysis Toolbox) [SWR-20-76]

MATBOX is a MATLAB application for performing various microstructure-related tasks including microstructure numerical generation, image filtering and microstructure segmentation, microstructure characterization, result three-dimensional visualization and result correlation, and microstructure meshing. MATBOX was originally developed to analyze electrode microstructures for lithium ion batteries; however, the algorithms provided by the toolbox are widely applicable to other heterogeneous materials. The toolbox provides a user-friendly experience thanks to a Graphic-User Interface.

Usseglio Viretta, Francois↗