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 1,099 records · Page 61
All sourcesNASA NTRSDOE OSTI
NASA NTRS2013

Gesture-Based Robot Control with Variable Autonomy from the JPL Biosleeve

This paper presents a new gesture-based human interface for natural robot control. Detailed activity of the user's hand and arm is acquired via a novel device, called the BioSleeve, which packages dry-contact surface electromyography (EMG) and an inertial measurement unit (IMU) into a sleeve worn on the forearm. The BioSleeve's accompanying algorithms can reliably decode as many as sixteen discrete hand gestures and estimate the continuous orientation of the forearm. These gestures and positions are mapped to robot commands that, to varying degrees, integrate with the robot's perception of its environment and its ability to complete tasks autonomously. This flexible approach enables, for example, supervisory point-to-goal commands, virtual joystick for guarded teleoperation, and high degree of freedom mimicked manipulation, all from a single device. The BioSleeve is meant for portable field use; unlike other gesture recognition systems, use of the BioSleeve for robot control is invariant to lighting conditions, occlusions, and the human-robot spatial relationship and does not encumber the user's hands. The BioSleeve control approach has been implemented on three robot types, and we present proof-of-principle demonstrations with mobile ground robots, manipulation robots, and prosthetic hands.

BioSleeve↗
NASA NTRS2020

The bioclimatic extent and pattern of the cold edge of the boreal forest: the circumpolar taiga-tundra ecotone

Current configurations of forest structure at the cold edge of the boreal may help understand the future of ecosystem functioning in high northern latitudes. The circumpolar biome boundary at the boreal (taiga) forest and tundra interface is an ecological transition zone (taiga-tundra ecotone; TTE) experiencing changes that affect its forest structure. We accounted for the TTE's horizontal forest structure with an estimate of its extent and pattern as represented by tree canopy cover (TCC). We quantified TCC patterns with an algorithm that describes its spatial gradient, and summarized landscape patterns of structure to represent heterogeneity, capturing abrupt, diffuse, and uniform forest at mesoscales. We used these landscape patterns to constrain the spatial extent of sparse and open canopy forest, and non-forest (forest-adjacent) edge that defines the TTE extent. The resulting map of the TTE extent is based on forest structure spatial patterns resolved at 30 m, highlights structural variability across landscapes, and helps distinguish tundra from boreal domains. We classified 14 594 landscapes as those associated with the TTE within a circumpolar bioclimatic envelope (11.575 million km2), where 44.83% of the area of these landscapes were forest and non-forest edge, yet 36.43% contributed to the TTE extent. We report the overall extent of the TTE (3.032 million km2) across North America and Greenland (53%), and Eurasia (47%), where 0.697 million km2 is non-forest edge, 0.549 million km2 is sparse forest, and 1.787 million km2 is open canopy forest. Diffuse forest landscapes dominate the TTE (79%), and abrupt landscapes (~19%) indicate portions of the TTE where sparse forest and non-forest edge are the prevailing structural patterns. This account of the TTE quantifies the area of the cold edge of the boreal forest where previous global estimates show high discrepancies, and can help target monitoring and prediction of circumpolar dynamics.

Paul M Montesano↗
DOE OSTI2020

Behind the Meter Storage for Electric Vehicle Charging, Electrochemical and Thermal Energy Storage, and Solar Photovoltaic

In response to the potentially large and irregular demand from EVs, along with changing load profiles from buildings with on-site generation, utilities are evaluating multiple options for managing dynamic loads, including time-of-use pricing, demand charges, battery storage, and curtailment of variable generation. Buildings, as well as commercial, public, and workplace EV charging operations, can use a combination of electrochemical battery storage and thermal energy storage coupled with on-site generation to manage energy costs as well as provide resiliency and reliability for EV charging and building energy loads. We are completing a behind the meter storage analysis that focuses on determining the optimal system designs and energy flows for thermal and electrochemical behind the meter storage with on-site solar photovoltaic (PV) generation enabling electric vehicle charging in various climates, building types, and utility rate structures. In completing this analysis, we have developed a tool that combines existing battery models via the System Advisor Model (SAM) and building modeling software via EnergyPlus into a single interface. This tool allows us to simulate a building with a detailed battery model to properly size the battery, thermal energy storage, and solar PV systems to maximize profit for the system owner. This also allows us to assess how the battery degrades under various supervisory control dispatch algorithms to control charging/discharging; we can also see how thermal energy storage is created and used to complement the battery to reduce thermal loads in the building. With this project, we can analyze new batteries that are designed specifically for energy storage, rather than designed to be extremely energy dense for electric vehicle applications, using battery lifetime models from other national labs and the existing SAM battery model, which has detailed lifetime and degradation parameters. We can also assess novel thermal storage technologies by integrating them into the whole building energy simulation program EnergyPlus. Because the model calls both SAM and EnergyPlus, required inputs need to be compatible for both models. These inputs include, on a high-level, the following: weather files, building and electric vehicle load profiles, electricity rate tariff information, and system cost information for the stationary battery, solar PV, and thermal storage system. The various buildings we are studying for this analysis are retail big-box grocery store, commercial office building, fleet vehicle depot and operations facility, multi-family residential, and electric vehicle charging station. For these different applications, the battery and thermal storage will be dispatched differently, and the various technologies are sized differently to optimize cost.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2026

Counting topological interface modes using simplicial characteristic classes

A computational approach for predicting the number of topological interface modes (TIMs) in hermitian systems using the spectral flow—monopole correspondence is presented. The number of TIMs is determined by calculating the Chern number of a complex line bundle of local polarisation vectors over a phase space sphere surrounding a Weyl point. The Chern number is computed by constructing the simplicial first Chern class of a discrete vector bundle on a simplicial mesh. This approach is gauge invariant, derivative free, structure preserving, and robust to noise. The algorithm is shown to reproduce the expected number of TIMs for the case of equatorial fluid waves and the topological Langmuir cyclotron wave. The possibility of using this algorithm to analyse experimental measurements of bulk wave polarisations and predict the associated number of TIMs is explored in a synthetic example.

discrete vector bundles↗
DOE OSTI2024

Cluster expansion by transfer learning for phase stability predictions

Recent progress towards universal machine-learned interatomic potentials holds considerable promise for materials discovery. Yet the accuracy of these potentials for predicting phase stability may still be limited. In contrast, cluster expansions provide accurate phase stability predictions but are computationally demanding to parameterize from first principles, especially for structures of low dimension or with a large number of components, such as interfaces or multimetal catalysts. We overcome this trade-off via transfer learning. Using Bayesian inference, we incorporate prior statistical knowledge from machine-learned and physics-based potentials, enabling us to sample the most informative configurations and to efficiently fit first-principles cluster expansions. Furthermore, this algorithm is tested on Pt:Ni, showing robust convergence of the mixing energies as a function of sample size with reduced statistical fluctuations.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Photoacoustic 3-D imaging of polycrystalline microstructure improved with transverse acoustic waves

Non-invasive fast imaging of grain microstructure of polycrystalline ceria with sub-micrometric spatial resolution is performed via time-domain Brillouin scattering. The propagation of a nanoacoustic pulse is monitored down to 8 µm deep in a 30 × 30 µm2 area. Grains boundaries are reconstructed in three-dimensions via a twostep processing method, relying on the wavelet synchro-squeezed transform and the alpha shape algorithm. Imaging contrast is improved by taking advantage of stronger sensitivity to anisotropy of transverse acoustic waves, compared with longitudinal waves. Utilization of transverse waves in the image processing reveals additional boundaries that are not discerned using longitudinal waves, confirmed by an electron backscattering diffraction pattern. A buried inclined interface between differently oriented grains is identified by monitoring changes in amplitude (phase) of the portion of the signal associated with transverse (longitudinal) waves. Estimates of the inclination angle of this interface prove the sensitivity of our laser ultrasonic method to image inclined boundaries.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Bimodal Visualization of Industrial X-Ray and Neutron Computed Tomography Data

Advanced manufacturing creates increasingly complex objects with material compositions that are often difficult to characterize by a single modality. Our collaborating domain scientists are going beyond traditional methods by employing both X-ray and neutron computed tomography to obtain complementary representations expected to better resolve material boundaries. However, the use of two modalities creates its own challenges for visualization, requiring either complex adjustments of bimodal transfer functions or the need for multiple views. Together with experts in nondestructive evaluation, we designed a novel interactive bimodal visualization approach to create a combined view of the co-registered X-ray and neutron acquisitions of industrial objects. Using an automatic topological segmentation of the bivariate histogram of X-ray and neutron values as a starting point, the system provides a simple yet effective interface to easily create, explore, and adjust a bimodal visualization. Here, we propose a widget with simple brushing interactions that enables the user to quickly correct the segmented histogram results. Our semiautomated system enables domain experts to intuitively explore large bimodal datasets without the need for either advanced segmentation algorithms or knowledge of visualization techniques. We demonstrate our approach using synthetic examples, industrial phantom objects created to stress bimodal scanning techniques, and real-world objects, and we discuss expert feedback.

image segmentation↗
DOE OSTI2025

SPADES (Scalable Parallel Discrete Events Simulation) [SWR-24-99]

SPADES (Solver for PArallel Discrete Event Simulation) is an open-source parallel discrete event simulation (PDES) package built on the AMReX library. Targeted at solving discrete event systems in parallel, this software package aims to be performance portable and scalable on heterogeneous computing architectures, e.g., graphic processing units (GPU). SPADES implements optimistic synchronization with rollback through an implementation of the Time Warp algorithm. An alternative conservative synchronization approach is also implemented using the Lower Bound on Incoming Time Stamp. In our implementation, logical processes are represented as cells in a grid and event messages are represented as particles. SPADES supports various parallel decomposition strategies, including the use of the Message Passing Interface (MPI) and OpenMP threading. All major GPU architectures (e.g., Intel, AMD, NVIDIA) are supported through the use of performance portability functionalities implemented in AMReX. The SPADES software is released in NREL Software Record SWR-24-99 “SPADES (Scalable Parallel Discrete Events Simulation)”.

Henry de Frahan, Marc [National Renewable Energy L↗
DOE OSTI2018

Exploring Applications of Random Walks on Spiking Neural Algorithms

Neuromorphic computing has many promises in the future of computing due to its energy efficient and scalable implementation. Here we extend a neural algorithm that is able to solve the diffusion equation PDE by implementing random walks on neuromorphic hardware. Additionally, we introduce four random walk applications that use this spiking neural algorithm. The four applications currently implemented are: generating a random walk to replicate an image, finding a path between two nodes, finding triangles in a graph, and partitioning a graph into two sections. We then made these four applications available to be implemented on software using a graphical user interface (GUI).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

The Kinetic Monte Carlo Algorithm in Materials Science: Study of Radiation-Induced Segregation in Fe-Cr alloys [Slides]

KMC is a flexible tool applicable to many fields in Material Science. Continuum models need free energies and transport coefficients. Atomistic KMC: an efficient tool to study RIS especially when coupled with ab initio calculations. AKMC generates crucial data to incorporate in Phase Field methods. AKMC shows that RIS profiles depend strongly on the interface spacing. Drawbacks include that it is time consuming and limited to relatively short times. Self-Consistent Mean-Field (SCMF) is an alternative approach to calculate phenomenological coefficients that avoids the KMC caveats.

36 MATERIALS SCIENCE↗
DOE OSTI2022

ExaSGD: 2022 Kernel Thrust Activities

The Kernel Thrust milestone ADSE22-407 covers the development of device-capable optimization algorithms and solvers technologies required by the ExaSGD project’s software stack in order to solve security-constrained alternating current optimal power flow (SC-ACOPF) problems on emerging exascale architectures. To this extent, in FY22 the main objective of the Kernel Thrust was (i) provide sparse optimization solver that runs efficiently on hardware accelerator devices (i.e., NVIDIA and AMD GPUs) to perform intra-node computations, (ii) strengthen the reliability and increase the performance of the mixed-dense sparse (MDS) solver of HiOp for deployment on the FY22 target architectures, Summit and Crusher, and (iii) increase performance by improving the mathematical algorithm and refining the parallel MPI-based implementation of the coarse-grain parallel solver HiOp-PriDec for capabilities deployment on the FY22 target architectures, Summit and Crusher. This document presents the developments and contributions done by the Kernels Thrust Team in FY22 toward completion of the above-mentioned objectives. These contributions progressed along four main development (sub)thrusts: (1) Design and implementation of a sparse optimization solver for use on hardware accelerators; (2) Improvement of the mathematical algorithm and of the parallel implementation of HiOp-PriDec to ensure readiness and efficient coarse-grain parallelism for FY23 target exascale machine; and (3) Support Software and Application Development Thrusts of the exaSGD project in their deployment of the project’s software stack on AMD- and NVIDIA-based architectures. The development of the sparse optimization solver (thrust 1 above) was new in FY22 and resulted in a new sparse solver in HiOp (available as of version 0.6). The second development thrust was a continuation of the efforts from FY21 and improved the mathematical algorithm and the communication strategy of the HiOp-PriDec solver. The last developement thrust is a large collaborative effort. Namely, the project’s teams from multiple labs (LLNL, PNNL, ORNL, and NREL) performed large-scale demonstration of the ExaSGD software stack, namely the optimization solvers of HiOp interfaced with the modeling front-end ExaGO and the stochastic sampler PowerScenarios. These demonstration efforts solved large-scale instances of the SC-ACOPF challenge problem of medium network sizes (10, 000-bus system) and large number of contingencies on Summit (NVIDIA accelerators) and Crusher (AMD accelerators) systems at ORNL.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

NEAMS Technical Area Support in MOOSE

The Multiphysics Object-Oriented Simulation Environment (MOOSE) framework is a foundational capability used by the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program to create over 15 different simulation tools for advanced nuclear reactors. Due to this ubiquity, improvements to the framework in support of modeling and simulation goals are critical to the program. These improvements can take many forms, including optimization, improved user experience, streamlined application programming interfaces (APIs), parallelism, and new capabilities. The work transcribed in this report was conducted in direct support of the simulation tools and has already been deployed. The capabilities outlined in this report include addition of Times and Positions systems, redesign of mechanical contact constraints to enable the augmented Lagrange algorithm, overhaul of the restart system, and incorporation of p-refinement in MOOSE.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

Theoretical and software considerations for general dynamic analysis using multilevel substructured models

The dynamic analysis of complex structural systems using the finite element method and multilevel substructured models is presented. The fixed-interface method is selected for substructure reduction because of its efficiency, accuracy, and adaptability to restart and reanalysis. This method is extended to reduction of substructures which are themselves composed of reduced substructures. The implementation and performance of the method in a general purpose software system is emphasized. Solution algorithms consistent with the chosen data structures are presented. It is demonstrated that successful finite element software requires the use of software executives to supplement the algorithmic language. The complexity of the implementation of restart and reanalysis porcedures illustrates the need for executive systems to support the noncomputational aspects of the software. It is shown that significant computational efficiencies can be achieved through proper use of substructuring and reduction technbiques without sacrificing solution accuracy. The restart and reanalysis capabilities and the flexible procedures for multilevel substructured modeling gives economical yet accurate analyses of complex structural systems.

Schmidt, R. J.↗
NASA NTRS1990

EDNA: Expert fault digraph analysis using CLIPS

Traditionally fault models are represented by trees. Recently, digraph models have been proposed (Sack). Digraph models closely imitate the real system dependencies and hence are easy to develop, validate and maintain. However, they can also contain directed cycles and analysis algorithms are hard to find. Available algorithms tend to be complicated and slow. On the other hand, the tree analysis (VGRH, Tayl) is well understood and rooted in vast research effort and analytical techniques. The tree analysis algorithms are sophisticated and orders of magnitude faster. Transformation of a digraph (cyclic) into trees (CLP, LP) is a viable approach to blend the advantages of the representations. Neither the digraphs nor the trees provide the ability to handle heuristic knowledge. An expert system, to capture the engineering knowledge, is essential. We propose an approach here, namely, expert network analysis. We combine the digraph representation and tree algorithms. The models are augmented by probabilistic and heuristic knowledge. CLIPS, an expert system shell from NASA-JSC will be used to develop a tool. The technique provides the ability to handle probabilities and heuristic knowledge. Mixed analysis, some nodes with probabilities, is possible. The tool provides graphics interface for input, query, and update. With the combined approach it is expected to be a valuable tool in the design process as well in the capture of final design knowledge.

Dixit, Vishweshwar V.↗
NASA NTRS1992

Display of scientific data structures for algorithm visualization

We present a technique for defining graphical depictions for all the data types defined in an algorithm. The ability to display arbitrary combinations of an algorithm's data objects in a common frame of reference, coupled with interactive control of algorithm execution, provides a powerful way to understand algorithm behavior. Type definitions are constrained so that all primitive values occurring in data objects are assigned scalar types. A graphical display, including user interaction with the display, is modeled by a special data type. Mappings from the scalar types into the display model type provide a simple user interface for controlling how all data types are depicted, without the need for type-specific graphics logic.

Hibbard, William↗
NASA NTRS1998

Annual Research Briefs, 1998

The topics contained in this progress report are direct numerical simulation of turbulent non-premixed combustion with realistic chemistry; LES of non-premixed turbulent reacting flows with conditional source term estimation; measurements of the three-dimensional scalar dissipation rate in gas-phase planar turbulent jets; direct simulation of a jet diffusion flame; on the use of interpolating wavelets in the direct numerical simulation of combustion; on the use of a dynamically adaptive wavelet collocation algorithm in DNS (direct numerical simulation) of non-premixed turbulent combustion; 2D simulations of Hall thrusters; computation of trailing-edge noise at low mach number using LES and acoustic analogy; weakly nonlinear modeling of the early stages of bypass transition; interactions between freestream turbulence and boundary layers; interfaces at the outer boundaries of turbulent motions; largest scales of turbulent wall flows; the instability of streaks in near-wall turbulence; an implementation of the v(sup 2) - f model with application to transonic flows; heat transfer predictions in cavities; a structure-based model with stropholysis effects; modeling a confined swirling coaxial jet; subgrid-scale models based on incremental unknowns for large eddy simulations; subgrid scale modeling taking the numerical error into consideration; towards a near-wall model for LES of a separated diffuser flow; on the feasibility of merging LES with RANS (Reynolds Averaging Numerical simulation) for the near-wall region of attached turbulent flows; large-eddy simulation of a separated boundary layer; numerical study of a channel flow with variable properties; on the construction of high order finite difference schemes on non-uniform meshes with good conservation properties; development of immersed boundary methods for complex geometries; and particle methods for micro and macroscale flow simulations.

Spinks, Debra↗
NASA NTRS2004

Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented an effective optimization framework that incorporates a direct-CAD interface. In this work, we enhance the capabilities of this framework with efficient gradient computations using the discrete adjoint method. We present details of the adjoint numerical implementation, which reuses the domain decomposition, multigrid, and time-marching schemes of the flow solver. Furthermore, we explain and demonstrate the use of CAD in conjunction with the Cartesian adjoint approach. The final paper will contain a number of complex geometry, industrially relevant examples with many design variables to demonstrate the effectiveness of the adjoint method on Cartesian meshes.

Nemec, Marian↗
NASA NTRS2016

Autonomous Closed-Loop Tasking, Acquisition, Processing, and Evaluation for Situational Awareness Feedback

This presentation describes the closed loop satellite autonomy methods used to connect users and the assets on Earth Orbiter- 1 (EO-1) and similar satellites. The base layer is a distributed architecture based on Goddard Mission Services Evolution Concept (GMSEC) thus each asset still under independent control. Situational awareness is provided by a middleware layer through common Application Programmer Interface (API) to GMSEC components developed at GSFC. Users setup their own tasking requests, receive views into immediate past acquisitions in their area of interest, and into future feasibilities for acquisition across all assets. Automated notifications via pubsub feeds are returned to users containing published links to image footprints, algorithm results, and full data sets. Theme-based algorithms are available on-demand for processing.

mission autonomy↗