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,225 records · Page 68

Neural-Network-Development Program

NETS, software tool for development and evaluation of neural networks, provides simulation of neural-network algorithms plus computing environment for development of such algorithms. Uses back-propagation learning method for all of networks it creates. Enables user to customize patterns of connections between layers of network. Also provides features for saving, during learning process, values of weights, providing more-precise control over learning process. Written in ANSI standard C language. Machine-independent version (MSC-21588) includes only code for command-line-interface version of NETS 3.0.

Phillips, Todd A.↗

Solving Equations of Multibody Dynamics

Darts++ is a computer program for solving the equations of motion of a multibody system or of a multibody model of a dynamic system. It is intended especially for use in dynamical simulations performed in designing and analyzing, and developing software for the control of, complex mechanical systems. Darts++ is based on the Spatial-Operator- Algebra formulation for multibody dynamics. This software reads a description of a multibody system from a model data file, then constructs and implements an efficient algorithm that solves the dynamical equations of the system. The efficiency and, hence, the computational speed is sufficient to make Darts++ suitable for use in realtime closed-loop simulations. Darts++ features an object-oriented software architecture that enables reconfiguration of system topology at run time; in contrast, in related prior software, system topology is fixed during initialization. Darts++ provides an interface to scripting languages, including Tcl and Python, that enable the user to configure and interact with simulation objects at run time.

Jain, Abhinandan↗

SE-FIT

The mathematical theory of capillary surfaces has developed steadily over the centuries, but it was not until the last few decades that new technologies have put a more urgent demand on a substantially more qualitative and quantitative understanding of phenomena relating to capillarity in general. So far, the new theory development successfully predicts the behavior of capillary surfaces for special cases. However, an efficient quantitative mathematical prediction of capillary phenomena related to the shape and stability of geometrically complex equilibrium capillary surfaces remains a significant challenge. As one of many numerical tools, the open-source Surface Evolver (SE) algorithm has played an important role over the last two decades. The current effort was undertaken to provide a front-end to enhance the accessibility of SE for the purposes of design and analysis. Like SE, the new code is open-source and will remain under development for the foreseeable future. The ultimate goal of the current Surface Evolver Fluid Interface Tool (SEFIT) development is to build a fully integrated front-end with a set of graphical user interface (GUI) elements. Such a front-end enables the access to functionalities that are developed along with the GUIs to deal with pre-processing, convergence computation operation, and post-processing. In other words, SE-FIT is not just a GUI front-end, but an integrated environment that can perform sophisticated computational tasks, e.g. importing industry standard file formats and employing parameter sweep functions, which are both lacking in SE, and require minimal interaction by the user. These functions are created using a mixture of Visual Basic and the SE script language. These form the foundation for a high-performance front-end that substantially simplifies use without sacrificing the proven capabilities of SE. The real power of SE-FIT lies in its automated pre-processing, pre-defined geometries, convergence computation operation, computational diagnostic tools, and crash-handling capabilities to sustain extensive computations. SE-FIT performance is enabled by its so-called file-layer mechanism. During the early stages of SE-FIT development, it became necessary to modify the original SE code to enable capabilities required for an enhanced and synchronized communication. To this end, a file-layer was created that serves as a command buffer to ensure a continuous and sequential execution of commands sent from the front-end to SE. It also establishes a proper means for handling crashes. The file layer logs input commands and SE output; it also supports user interruption requests, back and forward operation (i.e. undo and redo), and others. It especially enables the batch mode computation of a series of equilibrium surfaces and the searching of critical parameter values in studying the stability of capillary surfaces. In this way, the modified SE significantly extends the capabilities of the original SE.

Chen, Yongkang↗

Request-Driven Schedule Automation for the Deep Space Network

The DSN Scheduling Engine (DSE) has been developed to increase the level of automated scheduling support available to users of NASA s Deep Space Network (DSN). We have adopted a request-driven approach to DSN scheduling, in contrast to the activity-oriented approach used up to now. Scheduling requests allow users to declaratively specify patterns and conditions on their DSN service allocations, including timing, resource requirements, gaps, overlaps, time linkages among services, repetition, priorities, and a wide range of additional factors and preferences. The DSE incorporates a model of the key constraints and preferences of the DSN scheduling domain, along with algorithms to expand scheduling requests into valid resource allocations, to resolve schedule conflicts, and to repair unsatisfied requests. We use time-bounded systematic search with constraint relaxation to return nearby solutions if exact ones cannot be found, where the relaxation options and order are under user control. To explore the usability aspects of our approach we have developed a graphical user interface incorporating some crucial features to make it easier to work with complex scheduling requests. Among these are: progressive revelation of relevant detail, immediate propagation and visual feedback from a user s decisions, and a meeting calendar metaphor for repeated patterns of requests. Even as a prototype, the DSE has been deployed and adopted as the initial step in building the operational DSN schedule, thus representing an important initial validation of our overall approach. The DSE is a core element of the DSN Service Scheduling Software (S(sup 3)), a web-based collaborative scheduling system now under development for deployment to all DSN users.

Johnston, Mark D.↗

An Automated Meshing Framework for Progressive Damage Analysis of Fabrics Using CompDam

A meshing and model construction framework for progressive damage analysis of fabric composites is proposed. A mesoscale idealization is used such that the fiber tows are considered homogeneous and transversely isotropic continua, and the matrix is a homogeneous isotropic continuum. By using this idealization, relatively mature damage modeling techniques developed for laminates of unidirectional plies are transferrable to fabrics. Cohesive interface elements and a continuum damage mechanics (CDM) model implemented in the software CompDam are used to account for the key damage modes including cracking at the tow/matrix interface, transverse matrix cracking in the tows, and fiber breakage in the tows. Matrix degradation is accounted for by plasticity. The modeling approach is demonstrated for a 3D orthogonal woven fabric. The main novelty of the proposed model construction framework is in its flexibility resulting from a formulation that is agnostic to the fabric architecture and implementation using mesh based operations. The algorithm does not make any assumptions about the tow sizes, shape, path, or proximity to other tows, thus it is applicable to a broad range of fabric architectures. The matrix region mesh surrounding the tows is constructed from domain boundary and tow surface meshes (i.e. through a series of mesh-based operations) such that the model domain can be arbitrarily shaped.

Andrew Cole Bergan↗

A System to Provide Deterministic Flight Software Operation and Maximize Multicore Processing Performance: The Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) Datapath

A method and design are described for a system that processes multiple data streams, utilizing a multicore asymmetric processing architecture, that eliminates data interrupts to the application processors. The design supports a deterministic environment for flight software in NASA’s Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) project. The SPLICE project develops sensor, algorithm, and compute technologies for Precision Landing and Hazard Avoidance (PL&HA) capabilities. The compute technology for SPLICE is the Descent and Landing Computer (DLC). The DLC hosts several SPLICE algorithms with high computational resource requirements that must be executed in a real-time and deterministic manner. The software runs on a custom Single Board Computer (SBC), with a Xilinx Ultrascale+ Multiprocessor System-on-a-Chip (MPSoC). Input data for the flight software is from a variety of sensors, unique with respect to data rate and packet size. A data path between the SPLICE sensors and algorithms is designed to efficiently deliver this data to the flight software using the MPSoC asymmetric processing cores and Field Programmable Gate Array (FPGA) fabric. This is implemented in a manner that isolates the application processors running the flight software from interrupts associated with the input data. By leveraging real-time processors on the MPSoC, and a structure with the appropriate interfaces in the shared memory on the SBC, the flight software can use the full set of application processors. The available utilization for each processor in this set is also maximized for the SPLICE applications, providing a sufficiently deterministic execution environment without the cost and overhead of a real-time operating system.

heterogeneous processing system↗

A System to Provide Deterministic Flight Software Operation and Maximize Multicore Processing Performance: The Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) Datapath

A method and design are described for a system that processes multiple data streams, utilizing a multicore asymmetric processing architecture, that eliminates data interrupts to the application processors. The design supports a deterministic environment for flight software in NASA’s Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) project. The SPLICE project develops sensor, algorithm, and compute technologies for Precision Landing and Hazard Avoidance (PL&HA) capabilities. The compute technology for SPLICE is the Descent and Landing Computer (DLC). The DLC hosts several SPLICE algorithms with high computational resource requirements that must be executed in a real-time and deterministic manner. The software runs on a custom Single Board Computer (SBC), with a Xilinx Ultrascale+ Multiprocessor System-on-a-Chip (MPSoC). Input data for the flight software is from a variety of sensors, unique with respect to data rate and packet size. A data path between the SPLICE sensors and algorithms is designed to efficiently deliver this data to the flight software using the MPSoC asymmetric processing cores and Field Programmable Gate Array (FPGA) fabric. This is implemented in a manner that isolates the application processors running the flight software from interrupts associated with the input data. By leveraging real-time processors on the MPSoC, and a structure with the appropriate interfaces in the shared memory on the SBC, the flight software can use the full set of application processors. The available utilization for each processor in this set is also maximized for the SPLICE applications, providing a sufficiently deterministic execution environment without the cost and overhead of a real-time operating system.

David K. Rutishauser↗

The Accelerator Neutrino Neutron InteractionExperiment: Design, Construction and Preparationfor First Physics

This thesis covers work performed for the Accelerator Neutrino Neutron Interaction Experiment (ANNIE) between 2015 and 2020. ANNIE is a beamline neutrino experiment located at the Fermi National Accelerator Laboratory in Chicago. Its primary physics goals are the measurement of neutrino interaction cross-sections on oxygen, and a measurement of the multiplicity of final state neutrons from these interactions, both as functions of final state kinematics. In order to achieve these goals ANNIE will be pioneering the use of Large Area Picosecond Photodetectors and the use of gadolinium doping to enhance neutron visibility in a water Cherenkov detector. Over the time period of this thesis the ANNIE detector was constructed, an initial 'Phase I' background run was completed, the detector was decommissioned and then substantially upgraded in preparation for the main 'Phase II' physics run. At the time of writing ANNIE is being re-commissioned, with Phase II data taking anticipated to begin in 2021. During this time I spent 21/2 years on-site contributing to almost all aspects of hardware work, while performing software development for the simulation and analysis frameworks. As my first software task I developed Monte Carlo simulations of the detector response, based on the WCSim framework. While thismore » framework provided a starting point for the tank simulation significant modifications were required to implement the complete ANNIE detector system. This included a rewrite of the geometry, along with modifications to the photosensor definitions, hit collections, digitization, triggering, input and output interfaces, etc. To take advantage of improved modelling of neutrons in Geant4.10 the physics lists were also reimplemented in the new version format. As part of this work I determined performance metrics based on the output files, calculating kinematic acceptance, detector efficiency and expected event rates. My contributions on reconstruction focused primarily on the MRD, for which I implemented two track reconstruction algorithms, specialised for high and low energy muons. The high energy algorithm achieves >90% efficiency for tracks with at least 8 hits, and is robust against dead paddles and unrelated hits. The low energy algorithm performs a search in combination with tank information to provide sensitivity down to a single MRD hit. Early data handling work for the Phase I background run included writing the code for handling TDC hits and performing studies on neutron detection without the requirement of multi-hit coincidence. As the collaboration moved to a new framework for the Phase II analysis I performed a substantial amount of work to develop the codebase, implementing tools to perform tasks such as file IO, data parsing, waveform processing, event building, timestamp alignment, time clustering, hit residual calculation, event visualisation etc. I helped develop the python API for integrating multi-language tools, and ported the framework into a Singularity container to provide a self-contained environment that…« less

43 PARTICLE ACCELERATORS↗

Surface enrichment dictates block copolymer orientation

Orientation of block copolymer (BCP) morphology in thin films is critical to applications as nanostructured coatings. Despite being well-studied, the ability to control BCP orientation across all possible block constituents remains challenging. Here, in this study, we deploy coarse-grained molecular dynamics simulations to study diblock copolymer ordering in thin films, focusing on chain makeup, substrate surface energy, and surface tension disparity between the two constituent blocks. We explore the multi-dimensional parameter space of ordering using a machine-learning approach, where an autonomous loop using a Gaussian process (GP) control algorithm iteratively selects high-value simulations to compute. The GP kernel was engineered to capture known symmetries. The trained GP model serves as both a complete map of system response, and a robust means of extracting material knowledge. We demonstrate that the vertical orientation of BCP phases depends on several counter-balancing energetic contributions, including entropic and enthalpic material enrichment at interfaces, distortion of morphological objects through the film depth, and of course interfacial energies. BCP lamellae are found more resistant to these effects, and thus more robustly form vertical orientations across a broad range of conditions; while BCP cylinders are found to be highly sensitive to surface tension disparity.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Affinity of small-molecule solutes to hydrophobic, hydrophilic, and chemically patterned interfaces in aqueous solution

Significance Increasing global population, urbanization, and climate change pose tremendous constraints on water availability. While membrane processes offer attractive, energy-efficient options, transformative advances in membrane technology are needed to enable reuse of poor-quality waters from diverse sources. This work brings fundamental understanding of solute–surface interactions to membrane phenomena, including selectivity and fouling. Molecular simulations reveal limitations of traditional predictive measures of solute–surface partitioning, suggesting alternative thermodynamic signatures for solute binding that highlight the contextual nature of hydrophobicity. An inverse design algorithm provides a tool to pattern membrane nanoscale chemistry to optimize solute affinity and selectivity. This work demonstrates how simulations can inform practical materials design for sustainable water treatment and, more broadly, many technologies involving water-mediated solute–surface interactions.

36 MATERIALS SCIENCE↗

A system for intelligent teleoperation research

The Automation Technology Branch of NASA Langley Research Center is developing a research capability in the field of artificial intelligence, particularly as applicable in teleoperator/robotics development for remote space operations. As a testbed for experimentation in these areas, a system concept has been developed and is being implemented. This system termed DAISIE (Distributed Artificially Intelligent System for Interacting with the Environment), interfaces the key processes of perception, reasoning, and manipulation by linking hardware sensors and manipulators to a modular artificial intelligence (AI) software system in a hierarchical control structure. Verification experiments have been performed: one experiment used a blocksworld database and planner embedded in the DAISIE system to intelligently manipulate a simple physical environment; the other experiment implemented a joint-space collision avoidance algorithm. Continued system development is planned.

Orlando, N. E.↗

The paradigm compiler: Mapping a functional language for the connection machine

The Paradigm Compiler implements a new approach to compiling programs written in high level languages for execution on highly parallel computers. The general approach is to identify the principal data structures constructed by the program and to map these structures onto the processing elements of the target machine. The mapping is chosen to maximize performance as determined through compile time global analysis of the source program. The source language is Sisal, a functional language designed for scientific computations, and the target language is Paris, the published low level interface to the Connection Machine. The data structures considered are multidimensional arrays whose dimensions are known at compile time. Computations that build such arrays usually offer opportunities for highly parallel execution; they are data parallel. The Connection Machine is an attractive target for these computations, and the parallel for construct of the Sisal language is a convenient high level notation for data parallel algorithms. The principles and organization of the Paradigm Compiler are discussed.

Dennis, Jack B.↗

Quantifying Pilot Visual Attention in Low Visibility Terminal Operations

Quantifying pilot visual behavior allows researchers to determine not only where a pilot is looking and when, but holds implications for specific behavioral tracking when these data are coupled with flight technical performance. Remote eye tracking systems have been integrated into simulators at NASA Langley with effectively no impact on the pilot environment. This paper discusses the installation and use of a remote eye tracking system. The data collection techniques from a complex human-in-the-loop (HITL) research experiment are discussed; especially, the data reduction algorithms and logic to transform raw eye tracking data into quantified visual behavior metrics, and analysis methods to interpret visual behavior. The findings suggest superior performance for Head-Up Display (HUD) and improved attentional behavior for Head-Down Display (HDD) implementations of Synthetic Vision System (SVS) technologies for low visibility terminal area operations. Keywords: eye tracking, flight deck, NextGen, human machine interface, aviation

Ellis, Kyle K.↗

Unitary quantum lattice simulations for Maxwell equations in vacuum and in dielectric media

Utilizing the similarity between the spinor representation of the Dirac and the Maxwell equations that has been recognized since the early days of relativistic quantum mechanics, a quantum lattice algorithm (QLA) representation of unitary collision-stream operators of Maxwell's equations is derived for both homogeneous and inhomogeneous media. A second-order accurate 4-spinor scheme is developed and tested successfully for two-dimensional (2-D) propagation of a Gaussian pulse in a uniform medium whereas for normal (1-D) incidence of an electromagnetic Gaussian wave packet onto a dielectric interface requires 8-component spinors because of the coupling between the two electromagnetic polarizations. In particular, the well-known phase change, field amplitudes and profile widths are recovered by the QLA asymptotic profiles without the imposition of electromagnetic boundary conditions at the interface. The QLA simulations yield the time-dependent electromagnetic fields as the wave packet enters and straddles the dielectric boundary. QLA involves unitary interleaved non-commuting collision and streaming operators that can be coded onto a quantum computer: the non-commutation being the very reason why one perturbatively recovers the Maxwell equations.

Physics↗

Strong Upper-Plate Heterogeneity at the Hikurangi Subduction Margin (North Island, New Zealand) Imaged by Adjoint Tomography

We use earthquake-based adjoint tomography to invert for three-dimensional structure of the North Island, New Zealand, and the adjacent Hikurangi subduction zone. The study area, having a shallow depth to the plate interface below the North Island, offers a rare opportunity for imaging material properties at an active subduction zone using land-based measurements. Starting from an initial model derived using ray tomography, we perform iterative model updates using spectral element and adjoint simulations to fit waveforms with periods ranging from 4–30 s. We perform 28 model updates using an L-BFGS optimization algorithm, improving data fit and introducing P- and S-wave velocity changes of up to ±30%. Resolution analysis using point spread functions show that our measurements are most sensitive to heterogeneities in the upper 30 km. The most striking velocity changes coincide with areas related to the active Hikurangi subduction zone. Lateral velocity structures in the upper 5 km correlate well with New Zealand geology. Here, the inversion reveals increased along-strike heterogeneity on the margin. In Cook Strait we observe a low-velocity zone interpreted as deep sedimentary basins. In the central North Island, low-velocity anomalies are linked to surface geology, and we relate velocity structures at depth to crustal magmatic activity below the Taupō Volcanic Zone.

58 GEOSCIENCES↗

Real-time processor for the Danish airborne SAR

A real-time processor for the Danish high-resolution SAR is presented in terms of its functional performance, algorithm, architecture, and implementation. The real-time processor is mainly intended to assist the operator in using the SAR system, but since the processor has been designed to produce high-quality images, it is expected to make off-line processing superfluous in many cases. The range-Doppler algorithm is adopted and supplemented with an extensive motion compensation, considering the special conditions related to the real-time strip mapping of large scenes. The processor is a pipeline of about 20 elements interconnected by a dedicated data path and a control bus. Only three different types of elements are involved: a programmable signal processing element, a multipurpose memory element, and a multipurpose interface element. The prototypes of these three elements have been tested with satisfactory results.

Dall, J.↗

Automatic adaptive grid refinement for the Euler equations

A method of adaptive grid refinement for the solution of the steady Euler equations for transonic flow is presented. Algorithm automatically decides where the coarse grid accuracy is insufficient, and creates locally uniform refined grids in these regions. This typically occurs at the leading and trailing edges. The solution is then integrated to steady state using the same integrator (FL052) in the interior of each grid. The boundary conditions needed on the fine grids are examined and the importance of treating the fine/coarse grid interface conservatively is discussed. Numerical results are presented.

Berger, M. J.↗