Search NASA⌕ Search

SEARCH · Search NASA

Results for “map task”

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 487 records · Page 27

Lunar Overview

This slide presentation reviews the programs and missions that are being planned to enhance our knowledge of the moon. (1) Lunar Precursor Robotics Program (LPRP): the goal of which is to undertake robotic lunar exploration missions that will return data to advance our knowledge of the lunar environment and allow United States (US) exploration architecture objectives to be accomplished earlier and with less cost through application of robotic systems. LPRP will also reduce risk to crew and maximize crew efficiency by accomplishing tasks through precursor robotic missions, and by providing assistance to human explorers on the Moon. The missions under this program ae: the Lunar Reconnaissance Orbiter (LRO), Lunar Crater Observation and Sensing Satellite (LCROSS), Lunar Mapping Project. (2) The Altair Project, the goal of which is to land a crew of 4 to and from the surface of the moon. The vehicle, the 3 design reference missions (DRMs) and a Draft Lunar Landing schedule are briefly reviewed. (3) Lunar Science Program (LSP) which describes two different lunar missions: (1) Lunar Atmosphere & Dust Environment Explorer (LADEE), and (2) International Lunar Network (ILN).

Clinton, Raymond G., Jr.↗

Coordinating complex decision support activities across distributed applications

Knowledge-based technologies have been applied successfully to automate planning and scheduling in many problem domains. Automation of decision support can be increased further by integrating task-specific applications with supporting database systems, and by coordinating interactions between such tools to facilitate collaborative activities. Unfortunately, the technical obstacles that must be overcome to achieve this vision of transparent, cooperative problem-solving are daunting. Intelligent decision support tools are typically developed for standalone use, rely on incompatible, task-specific representational models and application programming interfaces (API's), and run on heterogeneous computing platforms. Getting such applications to interact freely calls for platform independent capabilities for distributed communication, as well as tools for mapping information across disparate representations. Symbiotics is developing a layered set of software tools (called NetWorks! for integrating and coordinating heterogeneous distributed applications. he top layer of tools consists of an extensible set of generic, programmable coordination services. Developers access these services via high-level API's to implement the desired interactions between distributed applications.

Adler, Richard M.↗

A Flexible and Non-instrusive Approach for Computing Complex Structural Coverage Metrics

Software analysis tools and techniques often leverage structural code coverage information to reason about the dynamic behavior of software. Existing techniques instrument the code with the required structural obligations and then monitor the execution of the compiled code to report coverage. Instrumentation based approaches often incur considerable runtime overhead for complex structural coverage metrics such as Modified Condition/Decision (MC/DC). Code instrumentation, in general, has to be approached with great care to ensure it does not modify the behavior of the original code. Furthermore, instrumented code cannot be used in conjunction with other analyses that reason about the structure and semantics of the code under test. In this work, we introduce a non-intrusive preprocessing approach for computing structural coverage information. It uses a static partial evaluation of the decisions in the source code and a source-to-bytecode mapping to generate the information necessary to efficiently track structural coverage metrics during execution. Our technique is flexible; the results of the preprocessing can be used by a variety of coverage-driven software analysis tasks, including automated analyses that are not possible for instrumented code. Experimental results in the context of symbolic execution show the efficiency and flexibility of our nonintrusive approach for computing code coverage information

DO-178C↗

Earth Independent Medical Operations (EIMO)

Inherent in interplanetary space travel are unprecedented challenges that could threaten mission success and negatively impact crew health and performance. Return to definitive care is essentially untenable and resources will be constrained with practically no re-supply capability. Access to ground-based medical expertise will be significantly delayed under nominal conditions with exacerbation during conjunction or prolonged dust storms. Taken together, these challenges necessitate the development of a progressively autonomous medical operational support system to assist the crew medical officer (CMO). While support from ground based medical experts will remain indispensable for pre-mission planning, the approach to management of acute/emergent medical contingencies will require a gradual transition of medical care and decision making from terrestrial to space-based assets, enabling support of astronaut health and performance and reducing overall mission risk. To progressively enable EIMO, a series of meetings were convened with subject matter experts from within NASA, academia and industry to facilitate mapping of the path to support autonomous medical operations. Topics explored in these meetings included the scope of data (storage capacity, usage, transmission rate and bandwidth, computing capacity), CMO training, supply and resource management and task load balance. Recommendations from these meetings will inform the EIMO Concept of Operations and definition of the associated requirements culminating in updates to the NASA 3001 standards. The EIMO project team will work with stakeholders to conceptualize a clinical decision support system (CDSS) to assist the CMO in response to medical contingencies when terrestrial support is delayed or otherwise unavailable. The CDSS will be a system of systems that will utilize data from numerous input vectors. Successful deployment of the CDSS will facilitate medical decision making while decreasing the cognitive load leading to an improvement in task load balancing. Additional benefits of the envisioned CDSS include assistance with inventory management, locating resources, storage/retrieval of medical records, highlighting trends in recorded data, in addition to providing a consult for diagnosis and treatment. More advanced features might include passive monitoring to identify early warning signs of behavioral or medical anomalies to possibly pre-empt onset of conditions that would compromise crew health and performance.

Benjamin Easter↗

ORCHA: A performance portability system for extreme heterogeneity

Heterogeneity is the prevalent trend in the rapidly evolving high-performance computing (HPC) landscape in both hardware and application software. The diversity in hardware platforms, currently comprising various accelerators and a future possibility of specializable chiplets, poses a significant challenge for scientific software developers aiming to harness optimal performance across different computing platforms while maintaining the quality of solutions when their applications are simultaneously growing more complex. Code synthesis and code generation can provide mechanisms to mitigate this challenge. We have developed a divide and conquer approach where different aspects of performance are handled by different stand-alone tools that are interfaced with the application through generated code. This portability system, ORCHA, enables users to configure and orchestrate their computations among available resources on a platform by specifying a high-level recipe, thereby permitting a many-to-many paradigm where each recipe results in a different variant of the application. The core design goal is to let users decide the application’s hardware mapping and orchestration by editing only the high-level recipe—without modifying the maintained source code or binding the application to a particular runtime system. Tools in ORCHA distribution are: CG-Kit for translating the recipe into an execution graph; Milhoja to execute the graph by orchestrating data and task movement among hardware resources; and Macroprocessor that enables users to define their own code-shorthand for higher composability and easier management of code variants. Additionally, the design of ORCHA permits tools to work in a plug-and-play mode where the application can build and run without CG-Kit and Milhoja, and either tool can be swapped out for other tools with similar capabilities by modifying the code generation portion of ORCHA. In this paper, we describe the design of ORCHA and the role that code-generation plays in isolating applications from tools. We demonstrate the breadth of configurations ORCHA enables with a case study in which an application configuration is realized on three distinct hardware mappings—a GPU-centric, a CPU/GPU balanced, and a CPU/GPU concurrent layouts by using different recipes.

Lee, Youngjun↗

Visualization and Quantification of Rotor Tip Vortices in Helicopter Flows

Helicopter aeromechanics encompasses a highly vortical flow field. The vortices generated at each blade tip contain unsteady, complex, three-dimensional structures, which interact with each other, other blades, the fuselage and various components of the helicopter. It is crucial to understand vortex kinematics and their subsequent dynamic evolution. Much research has been devoted to the understanding of helicopter vortex dynamics, including a number of experimental studies.1-6 In May 2010 Particle Image Velocimetry (PIV) measurements of a full-scale UH-60A rotor were acquired in the National Full-Scale Aerodynamics Complex (NFAC) 40- by 80-Foot Wind Tunnel.1 These measurements were taken at a plane just downstream of the advancing blade in the vicinity of the blade tip—the so-called PIV plane. The resulting PIV data were then processed using an ensemble-average approach to create graphical representations of the vortical wake velocity and vorticity fields, which, in turn, have enhanced the understanding of rotorcraft vortical wake flow field physics and have provided a more detailed validation of vortical wake computer simulations.7 A common approach used to analyze flow field features is to compute and plot color contour maps of various scalar quantities such as pressure, velocity magnitude and vorticity magnitude. For example, the color map of the vorticity magnitude is typically used to determine vortical flow structure. With this approach the vortex core may appear larger or smaller, depending on the contour levels that are selected. Thus, the resulting visualization is sensitive to user-specified contour levels. For vortex core radius measurements, it is more accurate to calculate the vortex core radius using the cross-flow velocity profile across the vortex core. The task of extracting the cross-flow velocity profile can be time consuming with existing tools since the user needs to manually select the core center then specify sampling points along the profile axis. The task becomes even more challenging when the associated grid system uses AMR (Adaptive Mesh Refinement) where the profile axis could span multiple grid blocks. There are a number of existing techniques for profiling of vortex core attributes;8-9 however, these techniques are not fully automatic in that the user still needs to select the vortex core center to compute the cross-flow velocity profile. The present study introduces a new color map scheme that is based on the vortex core radius, which is fully automatic and does not require user intervention. Analysis and visualization of blade tip vortices on the PIV plane using the proposed new color map scheme are described in Section II. The new approach is evaluated using two case studies, which are described in Section III. The paper ends with a summary in Section IV.

Quantification↗

Proximity Portability and in Transit , M-to-N Data Partitioning and Movement in SENSEI [Book Chapter]

In high-performance parallel in situ processing, the term in transit processing refers to those configurations where data must move from a producer to a consumer that runs on separate resources. In the context of parallel and distributed computing on an HPC platform one of the central challenges is to determine a mapping of data from producer ranks to consumer ranks. This problem is complicated by the heterogeneity that arises in producer-consumer pairs, such as when producer and consumer codes have different levels of concurrency, different scaling characteristics, or different data models. The resulting mapping and movement of data from M producer to N consumer ranks can have a significant impact on aggregate application performance, particularly when the data consumer requires only a subset of the overall data for its task. This chapter focuses on the design considerations that underlie SENSEI’s implementation to this challenging problem. These design considerations extend the core SENSEI architecture and include ideas like the need to accommodate flexibility in the choice of different partitioning methods, the ability for a data consumer to request and receive only the subset of data needed for its particular operation, and the ability to leverage any of several different data transport tools. The idea of proximity portability, being able to use different data transport methods as part of an in transit workflow, is illustrated through the use of three different transport layers where switching from one transport tool to another is accomplished with only a configuration file change. Here, the chapter also includes a performance analysis summary showing the performance gains that are possible in terms of multiple metrics, such as memory footprint, time to solution, and amount of data moved, when using optimized partitioners in an in transit setting, gains that are made possible by the implementation shaped by specific design considerations.

Bethel, E. Wes↗

Concentric Spherical GNN for 3D Representation Learning

Learning 3D representations that generalize well to arbitrarily oriented inputs is a challenge of practical importance in applications varying from computer vision to physics and chemistry. We propose a novel multi-resolution convolutional architecture for learning over concentric spherical feature maps, of which the single sphere representation is a special case. Our hierarchical architecture is based on alternatively learning to incorporate both intra-sphere and inter-sphere information. We show the applicability of our method for two different types of 3D inputs, mesh objects, which can be regularly sampled, and point clouds, which are irregularly distributed. We also propose an efficient mapping of point clouds to concentric spherical images, thereby bridging spherical convolutions on grids with general point clouds. We demonstrate the effectiveness of our approach in improving state-of-the-art performance on 3D classification tasks with rotated data.

97 MATHEMATICS AND COMPUTING↗

Indexing, screening, coding and cataloging of earth resources aircraft mission data

Tasks completed are as follows: (1) preparation of large Area Crop Inventory experiment for data base entry;(2) preparation of Earth Observations Aircraft Flight summary reports for publication; (3) updating of the aircraft mission index coverage map and Ames aircraft flight map; (4) Prepared of Earth Observation Helicopter Flight reports for publication; and (5) indexing of LANDSAT imagery. (6) formulation of phase 3 biowindows 1, 2, 3, and 4 listings by country, footprint, and acqusition dates; (7) preparation of flight summary reports; and (8) preparation of an Alaska state index coverage map.

Source record↗

Scaling Automatic Vector Data Alignment to Satellite Imagery

Given the tremendous volume of accessible Earth Observation (EO) data, there is a need to develop scalable Geospatial Artificial Intelligence (GeoAI) solutions for time-sensitive applications. Scalability in this context refers to rapidly processing large-scale EO data using high performance computing resources. Accurate mapping of the built environment from remote sensing (RS) imagery has been one of the crucial components in GeoAI workflows for a wide spectrum of humanitarian applications. Derived vector data of built environment is often leveraged for disaster preparedness and response activities. However, factors such as differences in ortho-rectification, atmospheric conditions and human error, results in spatial misalignment between vector data and the timely available RS imagery. Model training for downstream tasks such as object detection, change analysis, etc., is negatively impacted due to such spatial misalignment. Although there has been progress towards automatic alignment of vector data, the lack of scalability remains an open research challenge. This paper proposes to leverage parallel computing to optimize an automatic vector data alignment workflow. It further employs CPU-level multi-core parallelism for improving the performance of the workflow for scalable built environment mapping. We report observations and discuss findings from the preliminary experiments performed on the Summit Supercomputer.

Potnis, Abhishek↗

A new method for recognizing quadric surfaces from range data and its application to telerobotics and automation

The problem of recognizing and positioning of objects in three-dimensional space is important for robotics and navigation applications. In recent years, digital range data, also referred to as range images or depth maps, have been available for the analysis of three-dimensional objects owing to the development of several active range finding techniques. The distinct advantage of range images is the explicitness of the surface information available. Many industrial and navigational robotics tasks will be more easily accomplished if such explicit information can be efficiently interpreted. In this research, a new technique based on analytic geometry for the recognition and description of three-dimensional quadric surfaces from range images is presented. Beginning with the explicit representation of quadrics, a set of ten coefficients are determined for various three-dimensional surfaces. For each quadric surface, a unique set of two-dimensional curves which serve as a feature set is obtained from the various angles at which the object is intersected with a plane. Based on a discriminant method, each of the curves is classified as a parabola, circle, ellipse, hyperbola, or a line. Each quadric surface is shown to be uniquely characterized by a set of these two-dimensional curves, thus allowing discrimination from the others. Before the recognition process can be implemented, the range data have to undergo a set of pre-processing operations, thereby making it more presentable to classification algorithms. One such pre-processing step is to study the effect of median filtering on raw range images. Utilizing a variety of surface curvature techniques, reliable sets of image data that approximate the shape of a quadric surface are determined. Since the initial orientation of the surfaces is unknown, a new technique is developed wherein all the rotation parameters are determined and subsequently eliminated. This approach enables us to position the quadric surfaces in a desired coordinate system. Experiments were conducted on raw range images of spheres, cylinders, and cones. Experiments were also performed on simulated data for surfaces such as hyperboloids of one and two sheets, elliptical and hyperbolic paraboloids, elliptical and hyperbolic cylinders, ellipsoids and the quadric cones. Both the real and simulated data yielded excellent results. Our approach is found to be more accurate and computationally inexpensive as compared to traditional approaches, such as the three-dimensional discriminant approach which involves evaluation of the rank of a matrix. Finally, we have proposed one other new approach, which involves the formulation of a mapping between the explicit and implicit forms of representing quadric surfaces. This approach, when fully realized, will yield a three-dimensional discriminant, which will recognize quadric surfaces based upon their component surfaces patches. This approach is faster than prior approaches and at the same time is invariant to pose and orientation of the surfaces in three-dimensional space.

Alvertos, Nicolas↗

Bundle Networks: Fiber Bundles, Local Trivializations, and a Generative Approach to Exploring Many-to-one Maps

Many-to-one maps are ubiquitous in machine learning, from the image recognition model that assigns a multitude of distinct images to the concept of ``cat'' to the time series forecasting model which assigns a range of distinct time-series to a single scalar regression value. While the primary use of such models is naturally to associate correct output to each input, in many problems it is also useful to be able to explore, understand, and sample from a model's fibers, which are the set of input values x such that f(x) = y, for fixed y in the output space. In this paper we show that popular generative architectures are ill-suited to such tasks. Motivated by this we introduce a novel generative architecture, a Bundle Network, based on the concept of a fiber bundle from (differential) topology. BundleNets exploit the idea of a local trivialization wherein a space can be locally decomposed into a product space that cleanly encodes the many-to-one nature of the map. By enforcing this decomposition in BundleNets and by utilizing state-of-the-art invertible components, investigating a network's fibers becomes natural.

Courts, Nicolas C.↗

WM26 Paper Multi-Robot Collaboration for Hazardous Environments

Hazardous nuclear and industrial facilities are rarely designed for robots. Work in these domains demand precise manipulation and robust mobility in cluttered, constrained spaces where off-the-shelf platforms struggle and “one-size-fits-all” machines become costly and complex. Idaho National Laboratory (INL) is developing an autonomous, multi-robot inspection system that coordinates task-specific platforms rather than relying on a single omni-tool robot. An electric truck serves as a power and compute hub for a custom manipulator co-developed with Florida International University (FIU), a commercial mini crawler, a pan–tilt–zoom camera, and a Nexxis Argus LiDAR mapping system. Working in concert, these robots generate spatial, radiation, and temperature maps of the pit environments at the Hanford Waste Tank Farms. These systems will capture visual records and environmental telemetry to allow for analysis post inspection. The system architecture uses Robot Operating System 2 (ROS 2) for publish/subscribe integration, NVIDIA Isaac Sim and Unity for simulation and visualization, and algorithms such as NVBlox to fuse data into unified 3D overlays. This robot-agnostic approach reduces operator burden by enabling autonomy across heterogeneous platforms and lets each robot be used where it is strongest. Having autonomous functions means operators don’t have to fully control multiple different components. The ease of use could allow for more widespread adoption of advanced robotics at waste management sites that see continued use. By coordinating simpler, purpose-built mechanisms, the approach lowers design and manufacturing complexity, reduces capital risk in contaminated settings, and improves controllability for complex inspection and manipulation tasks. We present the architecture, early results, and lessons learned from building and deploying this coordinated multi-robot system, with the goal of accelerating safe, cost-effective adoption of advanced robotics at waste-management sites.

42 - ENGINEERING↗

Mapping and geological analysis of Mercury radar data

Although many radar profiles and images of the area within 20 deg of Mercury's equator had been obtained from 1971 to 1981, at both Goldstone and Arecibo radar facilities, surprisingly little geological analysis had been done with these data until recently. Topographic profiles and radar roughness reflectivity images which can be derived from these data will be crucial in completing the geological mapping of Mercury now underway at the U.S. Geological Survey. Processing of available radar data must be completed to establish any systematic relationship between radar reflectivities and roughness, density, dielectric constant, and other related geological parameters. Specific tasks accomplished for these purposes include the following. Documentation was located and searched to establish the type and quantity of Goldstone 12.5 cm radar observations which were available for Mercury. Data has been collected during approximately 50 observation periods from 1971 to 1981. About half of the data, collected during 1972 and 1973, have been processed, but without adequate documentation. A standardized, well-documented procedure for processing and analysis for all Goldstone Earth-based observations of Mercury was established.

Clark, P. E.↗

Acousto-Optic Imaging Spectrometers for Mars Surface Science

NASA's long term plan for Mars sample collection and return requires a highly streamlined approach for spectrally characterizing a landing site, documenting the mineralogical make-up of the site and guiding the collections of samples which represent the diversity of the site. Ideally, image data should be acquired at hundreds of VIS and IR wavelengths, in order to separately distinguish numerous anticipated species, using principal component analysis and linear unmixing. Cameras with bore-sighted point spectrometers can acquire spectra of isolated scene elements, but it requires 10(exp 2) to 10(exp 2) successive motions and precise relative pointing knowledge in order to create a single data cube which qualifies as a spectral map. These and other competing science objectives have to be accomplished within very short lander/rover operational lifetime (a few sols). True, 2-D imaging spectroscopy greatly speeds up the data acquisition process, since the spectra of all pixels in the scene are collected at once. This task can be accomplished with cameras that use electronically tunable acousto-optic tunable filters (AOTFs) as the optical tuning element. AOTFs made from TeO2 are now a mature technology, and operate at wavelengths from near-UV to about 5 microns. Because of incremental improvements in the last few years, present generation devices are rugged, radiation-hard and operate at temperatures down to at least 150K so they can be safely integrated into the ambient temperature optics of in-situ instruments such as planetary or small-body landers. They have been used for ground-based astronomy, and were also baselined for the ST-4 Champollion IR comet lander experiment (CIRCLE), prior to cancellation of the ST-4 mission last year. AIMS (for Acousto-optic Imaging spectrometer), is a prototype lander instrument which is being built at GSFC with support by the NASA OSS Advanced Technologies and Mission Studies, Mars Instrument Definition and Development Program (MIDP). AIMS is capable of tunable spectroscopic imaging of surface mineralogy, ices and dust between 0.5 and 2.4 microns, at a resolving power (lambda/delta lambda) which is typically several hundred. The design spatial resolution, similar to IMP and SSI, will allow mapping at scales down to about 1 cm.

Glenar, D. A.↗

Transforming Uinta Basin Earth Materials for Advanced Products (TUBE-MAP)

The objectives of this project were to quantify, assess, and plan to enable the transformation of Uinta Basin earth resources, such as coal, oil shale, resin, rare earth elements, and critical minerals into high value metal, mineral, and carbon-based products. The specific major goals were 1) basinal assessments and initial planning (Task 2), 2) basinal assessment for waste stream reuse with associated plan development (Task 3), 3) basinal strategies development for infrastructure, industries, and business (Task 4), 4) technology assessment, development, and field-testing plan (Task 5), 5) technology innovation center plan (Task 6), and 6) stakeholder outreach and education plan (Task 7).

01 COAL, LIGNITE, AND PEAT↗

Holographic pseudoentanglement and the complexity of the AdS/CFT dictionary

The `quantum gravity in the lab' paradigm suggests that quantum computers might shed light on quantum gravity by simulating the CFT side of the AdS/CFT correspondence and mapping the results to the AdS side. This relies on the assumption that the duality map (the `dictionary') is efficient to compute. In this work, we show that the complexity of the AdS/CFT dictionary is surprisingly subtle: there might be cases in which one can efficiently apply operators to the CFT state (a task we call 'operator reconstruction') without being able to extract basic properties of the dual bulk state such as its geometry (which we call 'geometry reconstruction'). Geometry reconstruction corresponds to the setting where we want to extract properties of a completely unknown bulk dual from a simulated CFT boundary state. We demonstrate that geometry reconstruction may be generically hard due to the connection between geometry and entanglement in holography. In particular we construct ensembles of states whose entanglement approximately obey the Ryu-Takayanagi formula for arbitrary geometries, but which are nevertheless computationally indistinguishable. This suggests that even for states with the special entanglement structure of holographic CFT states, geometry reconstruction might be hard. This result should be compared with existing evidence that operator reconstruction is generically easy in AdS/CFT. A useful analogy for the difference between these two tasks is quantum fully homomorphic encryption (FHE): this encrypts quantum states in such a way that no efficient adversary can learn properties of the state, but operators can be applied efficiently to the encrypted state. We show that quantum FHE can separate the complexity of geometry reconstruction vs operator reconstruction, which raises the question whether FHE could be a useful lens through which to view AdS/CFT.

FOS: Physical sciences↗

Objective assessment of Advanced Very High Resolution Radiometer data for land cover mapping

The validity of using data from the Advanced Very High Resolution Radiometer (AVHRR) of the satellites NOAA-6 and NOAA-7 for land cover mapping is assessed by making comparisons with much higher resolution LANDSAT multi-spectral scanner (MSS) data. Near synchronous data for both systems are analysed for test sites in the Imperial Valley, California, the Nile Delta, and southern Italy. The results strongly indicate that despite the very coarse resolution of the AVHRR data compared with conventional MSS data they are sufficiently strongly correlated to suggest that the former have significant potential for land cover mapping, especially at small scales and for large areas. Hence the outstanding benefits of AVHRR data, namely their high temporal frequency, relative cheapness and low data volumes for image processing, may readily be taken advantage of for such tasks.

Townshend, J. R. G.↗