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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Quantum/AI Topology-Aware Latency-Adaptive HPC Workflow Scheduling Optimization

The growing demand for more powerful high-performance computing (HPC) systems has led to a steady rise in energy consumption by supercomputing worldwide. This study is focused on comparing our Application-Topology Mapper (ATMapper) to the popular Simple Linux Utility for Resource Management (SLURM) for the purpose of exploring methods that can further optimize job-scheduling within HPC systems. ATMapper is an Artificial-Intelligence based approach to job-scheduling that is currently being enhanced with quantum annealing (QA) to generate optimal schedules faster. We are applying QA to speedup our ATMapper process to achieve higher computing efficiency, thereby reducing HPC energy consumption. Here, we examine how four job-scheduling approaches perform in processor node assignment when using an example network architecture of 4 interconnected nodes. Using a specialized script, we are assessing the schedule of a computation flow with 11 interdependent tasks. The data movements among nodes were tracked to count for the number of interactions (network hops) between nodes needed to complete the tasks. The total number of hops and the job completion time were then used to quantify the efficiency of the different mapping approaches. In addition to SLURM, we also compare our ATMapper to the QA-enabled LBNL TIGER and the D-Wave Distributed Computing processor assignment approaches. The preliminary results showed that our topology-aware, latency-adaptive ATMapper is significantly more efficient when compared to the other scheduling approaches due to its load-imbalance network allocation. The scheduler displayed a computing efficiency of 53% by performing significantly fewer network hops than its alternatives. By reducing the number of hops, ATMapper was able to perform all 11 tasks by using only 3 nodes out of given 4. This research indicates the potential to use QA/AI for HPC job-scheduling. Later, we will test a SLURM simulator program to draw further comparisons on the effectiveness of ATMapper's scheduling approach. The results of this comparison will serve as a baseline for later improving SLURM's performance using a QA-enhanced ATMapper approach.

Caraveo, Braulio [University of Huston - Clear Lak↗
DOE OSTI2024

Mapping use cases and dataset needs for benchmarking buildings data

A perennial challenge in buildings research is the lack of high-quality datasets that can be relied upon for a wide array of tasks, including model calibration and improving energy efficiency and load flexibility. Instrumenting a building for data collection is resource intensive, so it is important to be methodical in the approach and ensure that resulting data are flexible and useful for a broad range of analyses. This study aims to fill the gaps in characterizing potential use cases for buildings datasets and mapping them to dataset needs using a well-defined data infrastructure. Here, we have developed a systematic mapping strategy between buildings dataset needs and use cases to help streamline the processes of efficiently targeting datasets, designing building sensing systems, and determining buildings research use cases. We selected 14 prospective use cases and 11 refined buildings data categories for developing the preliminary dataset-needs-to-use-cases mapping matrix (‘DN-UC mapping matrix’) with generic ‘Tags’—a detailed sub-level of data categories extracted by justifying the needs of an aspect of the datasets to use cases. We present two example applications of the developed mapping matrix to demonstrate use of the mapping matrix and its effectiveness.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2019

Deep Transfer Learning With Field-Based Measurements for Large Area Classification

Classification of Electro-Optical (EO) datasets using Deep Neural Networks (DNNs) has lead to high-performance supervised learning algorithms. However, DNNs require a large amount of labeled data for training which often have limited availability in ecological studies. Up-to-date classification of vegetation in sensitive Arctic ecosystems continue to be a challenge. In an ecosystem undergoing rapid change, capturing the dynamics of vegetation requires the existing maps of vegetation (such as Alaska Existing Vegetation Type (AKEVT), circa 2000) to be updated based on frequent field based observation of vegetation. A method is needed to transfer the knowledge gained from field-collected observations to a larger area using DNNs. Transfer learning is a machine learning technique where a model trained on one task is re-purposed on another similar task. This paper seeks to train DNNs using field-collected observations and apply transfer learning to apply the knowledge gained to update existing vegetation map at larger scale. We test two DNN methods, (1) a deep multilayer perceptron (MLP) model and (2) siamese MLP network that uses a structure to rank similarity between inputs and can be used for training datasets with few samples and show good performance with limited datasets (e.g. few-shot learning). The results show ∼90% accuracy (using the field observations for evaluation) when transfer learning is applied to a siamese network, compared to ∼45% accurate when a MLP is trained on the AKEVT and evaluated on the field observations. The approach show promise for improving and update the existing vegetation maps over large areas using limited field-based observations.

Langford, Zach↗
DOE OSTI2021

Radiological Scouting, Monitoring and Inspection Using Drones

Human populations and natural ecosystems are bound to be exposed to ionizing radiation from the deposition of artificial radionuclides resulting from nuclear accidents, nuclear devices or radiological dispersive devices (“dirty bombs”). On the other hand, Naturally Occurring Radioactive Material industries such as phosphate production or uranium mining, contribute to the on site storage of residuals with enhanced concentrations of natural radionuclides. Therefore, in the context of the European agreements concerning nuclear energy, namely the European Atomic Energy Community Treaty, monitoring is an essential feature of the environmental radiological surveillance. In this work, we obtain 3D maps from outdoor scenarios, and complete such maps with measured radiation levels and with its radionuclide signature. In such scenarios, we face challenges such as unknown and rough terrain, limited number of sampled locations and the need for different sensors and therefore different tasks. We propose a radiological solution for scouting, monitoring and inspecting an area of interest, using a fleet of drones and a controlling ground station. First, we scout an area with a Light Detection and Ranging sensor onboard a drone to accurately 3D-map the area. Then, we monitor that area with a Geiger–Müller Counter at a low-vertical distance from the ground to produce a radiological (heat)map that is overlaid on the 3D map of the scenario. Next, we identify the hotspots of radiation, and inspect them in detail using a drone by landing on them, to reveal its radionuclide signature using a Cadmium–Zinc–Telluride detector. We present the algorithms used to implement such tasks both at the ground station and on the drones. The three mission phases were validated using actual experiments in three different outdoor scenarios. We conclude that drones can not only perform the mission efficiently, but in general they are faster and as reliable as personnel on the ground.

Pinto, Luís Ramos (ORCID:0000000319975484)↗
NASA NTRS2020

Cross-Cutting Computational Modeling Project: Exploration Medical Station Analysis

Astronauts will be away from Earth-based medical care for long periods during future exploration missions. Thus, it will be necessary for the astronauts to perform various medical tasks to monitor and maintain their health in the microgravity environment of space. Performance of these tasks will be constrained due to the limited volume available to perform the task, the absence of gravity and the limited resources and capabilities available in the medical work area. It is therefore necessary to evaluate exploration medical workstation designs for how well the designs will support crew performance of medical tasks. This evaluation featured two trained medical caregivers (99th percentile male, 26th percentile female) performing emergent care procedures (alone and in tandem) on a medical manikin. The procedures came from the The procedures came from the International Space Station Medical Checklist, and they are designed for spaceflight. The objectives of the evaluation included determining the operational volume required to perform the tasks, examining the effect of constraining the operational volume with partitions, determining candidate locations for foot restraints and equipment placements and determining the effect of single vs. dual caregiver on the operational volume.A marker-based motion capture system collected the motion data, which enabled computation of operational volumes and foot placement maps using custom Python code. Additional data collected included heart rate, time to perform the procedures, and feedback from the caregivers in the form of the NASA Task Load Index (TLX), the US Government System Usability Survey, and an open-ended questionnaire.

Christopher A Gallo↗
NASA NTRS2011

Integrated Graphics Operations and Analysis Lab Development of Advanced Computer Graphics Algorithms

The focus of this project is to aid the IGOAL in researching and implementing algorithms for advanced computer graphics. First, this project focused on porting the current International Space Station (ISS) Xbox experience to the web. Previously, the ISS interior fly-around education and outreach experience only ran on an Xbox 360. One of the desires was to take this experience and make it into something that can be put on NASA s educational site for anyone to be able to access. The current code works in the Unity game engine which does have cross platform capability but is not 100% compatible. The tasks for an intern to complete this portion consisted of gaining familiarity with Unity and the current ISS Xbox code, porting the Xbox code to the web as is, and modifying the code to work well as a web application. In addition, a procedurally generated cloud algorithm will be developed. Currently, the clouds used in AGEA animations and the Xbox experiences are a texture map. The desire is to create a procedurally generated cloud algorithm to provide dynamically generated clouds for both AGEA animations and the Xbox experiences. This task consists of gaining familiarity with AGEA and the plug-in interface, developing the algorithm, creating an AGEA plug-in to implement the algorithm inside AGEA, and creating a Unity script to implement the algorithm for the Xbox. This portion of the project was unable to be completed in the time frame of the internship; however, the IGOAL will continue to work on it in the future.

Wheaton, Ira M.↗
NASA NTRS1982

Proceedings of the NASA Workshop on Registration and Rectification

Issues associated with the registration and rectification of remotely sensed data. Near and long range applications research tasks and some medium range technology augmentation research areas are recommended. Image sharpness, feature extraction, inter-image mapping, error analysis, and verification methods are addressed.

Bryant, N. A.↗
NASA NTRS1993

A summary of image segmentation techniques

Machine vision systems are often considered to be composed of two subsystems: low-level vision and high-level vision. Low level vision consists primarily of image processing operations performed on the input image to produce another image with more favorable characteristics. These operations may yield images with reduced noise or cause certain features of the image to be emphasized (such as edges). High-level vision includes object recognition and, at the highest level, scene interpretation. The bridge between these two subsystems is the segmentation system. Through segmentation, the enhanced input image is mapped into a description involving regions with common features which can be used by the higher level vision tasks. There is no theory on image segmentation. Instead, image segmentation techniques are basically ad hoc and differ mostly in the way they emphasize one or more of the desired properties of an ideal segmenter and in the way they balance and compromise one desired property against another. These techniques can be categorized in a number of different groups including local vs. global, parallel vs. sequential, contextual vs. noncontextual, interactive vs. automatic. In this paper, we categorize the schemes into three main groups: pixel-based, edge-based, and region-based. Pixel-based segmentation schemes classify pixels based solely on their gray levels. Edge-based schemes first detect local discontinuities (edges) and then use that information to separate the image into regions. Finally, region-based schemes start with a seed pixel (or group of pixels) and then grow or split the seed until the original image is composed of only homogeneous regions. Because there are a number of survey papers available, we will not discuss all segmentation schemes. Rather than a survey, we take the approach of a detailed overview. We focus only on the more common approaches in order to give the reader a flavor for the variety of techniques available yet present enough details to facilitate implementation and experimentation.

Spirkovska, Lilly↗
NASA NTRS2000

Scheduling and Estimating the Cost of Crew Time

In a previous paper, Theory and Application of the Equivalent System Mass Metric, Julie Levri, David Vaccari, and Alan Drysdale developed a method for computing the Equivalent System Mass (ESM) of crew time. ESM is an analog of cost. The suggested approach has been applied but seems to impose too high a cost for small additional requirements for crew time. The proposed method is based on the minimum average cost of crew time. In this work, the scheduling of crew time is examined in more detail, using suggested crew time allocations and daily work schedules. Crew tasks are typically assigned using priorities, which can also be used to construct a crew time demand curve mapping the value or cost per hour versus the total number of hours worked. The cost of additional crew time can be estimated by considering the intersection and shapes of the demand and supply curves. If e assume a mathematical form for the demand curve, a revised method can be developed for computing the cost or ESM of crew time. This method indicates a low cost per hour for small additional requirements for crew time and an increasing cost per hour for larger requirements.

Jones, Harry↗
NASA NTRS2013

Video Altimeter and Obstruction Detector for an Aircraft

Video-based altimetric and obstruction detection systems for aircraft have been partially developed. The hardware of a system of this type includes a downward-looking video camera, a video digitizer, a Global Positioning System receiver or other means of measuring the aircraft velocity relative to the ground, a gyroscope based or other attitude-determination subsystem, and a computer running altimetric and/or obstruction-detection software. From the digitized video data, the altimetric software computes the pixel velocity in an appropriate part of the video image and the corresponding angular relative motion of the ground within the field of view of the camera. Then by use of trigonometric relationships among the aircraft velocity, the attitude of the camera, the angular relative motion, and the altitude, the software computes the altitude. The obstruction-detection software performs somewhat similar calculations as part of a larger task in which it uses the pixel velocity data from the entire video image to compute a depth map, which can be correlated with a terrain map, showing locations of potential obstructions. The depth map can be used as real-time hazard display and/or to update an obstruction database.

Delgado, Frank J.↗
NASA NTRS2018

An Active Subspace Method for Accelerating Convergence in Delaunay-Based Optimization via Dimension Reduction

Delaunay-based derivative-free optimization, ∆DOGS, is an efficient and provably-convergent global optimization method for the problems which has computationally expensive objection function and the analytical expression for the objective function is not available. ∆-DOGS is a novel optimization scheme in the family of response surface methods (RSMs); however, it suffers from the curse of dimensionality since the computational cost increases dramatically as the number of design parameters increases. As a result, the number of design parameters in ∆-DOGS algorithm is relatively low (n.10). To avoid such problems, this paper proposes a combination of derivative-free optimization, seeking the global minimizer of an expensive and nonconvex objective function f(x) and active subspace method, detecting the directions of the most variability using evaluations of the gradient. The contribution of other directions to the objective function is bounded by a sufficiently small constant. This new algorithm iteratively applied Delaunay-based derivative-free optimization to seek the minimizer on the d-dimensional active subspace that has most function variation. Inverse mapping is needed to project data from active subspace to full-model for evaluating function values. This task is overcome by solving an inequality constrained problem that curves the response surface of the objective function. The test results show that this strategy is effective on a handful of optimization problems.

Bewley, Thomas R.↗
DOE OSTI2020

Autonomous Monitoring of Nuclear Repositories: Current State of the Art and Future Directions

Geological repositories for nuclear waste, including spent nuclear fuel, present a significant challenge for traditional International Atomic Energy Agency (IAEA) safeguards tools due to their inaccessibility and demanding operational conditions. The IAEA has been working closely with Member State organizations currently involved in repository construction and planning, including Euratom, the Finnish and Swedish regulatory authorities, and relevant facility operators. However, the verification challenge remains unsolved, and there persists an out- standing need for tools and approaches that will help the IAEA verify that no nuclear material is diverted from a repository environment. The challenge is also not static. Activities must encompass verification of the design, prior to and during the construction/operation phase, and post backfill. Throughout these various phases, it is imperative that the IAEA maintains a continuity of knowledge (CoK) of all material including information on material inventory and flow. This paper highlights these challenges and outlines how they might be addressed by using remote or autonomous vehicles. Specifically, we discuss the current state of the art in robotic autonomy for known or partially known environment mapping and patrolling, as well as shared autonomy, where humans collaborate with closed-loop autonomation to complete tasks. We explore the feasibility of using rovers for these verification tasks, along with the challenges associated with system implementation. Hardware and software suggestions are provided based on the adoption of similar technologies in other comparable areas and ability to close technical gaps. Lastly, human-robotic interactions are considered based on the challenges of the environment of the repository and effective deployment and continued operation of the robot system.

geologic repository, safeguards, IAEA, Robotics↗
NASA NTRS1972

Mapping an operator's perception of a parameter space

Operators monitored the output of two versions of the crossover model having a common random input. Their task was to make discrete, real-time adjustments of the parameters k and tau of one of the models to make its output time history converge to that of the other, fixed model. A plot was obtained of the direction of parameter change as a function of position in the (tau, k) parameter space relative to the nominal value. The plot has a great deal of structure and serves as one form of representation of the operator's perception of the parameter space.

Pew, R. W.↗
NASA NTRS1993

Synthesis of global thematic mapping, Venus: Geologic correlations/questions for the Magellan gravity mission

An important characteristic of the Magellan mission and the resulting data is that it is both global in coverage as well as extremely high in resolution. As a result, global questions may be addressed based on the constraints of extremely detailed geological evidence. An important first step in the task of interpreting the global geological record will be a synthesis of the primary geological characteristics and their relationship to significant questions. The following is a brief synthesis based on a comparison of mapped distributions, initial interpretations, and some questions that these results raise.

Crumpler, L. S.↗
DOE OSTI2019

Patterned probes for high precision 4D-STEM bragg measurements

Nanoscale strain mapping by four-dimensional scanning transmission electron microscopy (4D-STEM) relies on determining the precise locations of Bragg-scattered electrons in a sequence of diffraction patterns, a task which is complicated by dynamical scattering, inelastic scattering, and shot noise. These features hinder accurate automated computational detection and position measurement of the diffracted disks, limiting the precision of measurements of local deformation. Here, we investigate the use of patterned probes to improve the precision of strain mapping. We imprint a "bullseye" pattern onto the probe, by using a binary mask in the probe-forming aperture, to improve the robustness of the peak finding algorithm to intensity modulations inside the diffracted disks. We show that this imprinting leads to substantially improved strain-mapping precision at the expense of a slight decrease in spatial resolution. In experiments on an unstrained silicon reference sample, we observe an improvement in strain measurement precision from 2.7% of the reciprocal lattice vectors with standard probes to 0.3% using bullseye probes for a thin sample, and an improvement from 4.7% to 0.8% for a thick sample. Additionally, we use multislice simulations to explore how sample thickness and electron dose limit the attainable accuracy and precision for 4D-STEM strain measurements.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Attention-Augmented Parametric Kernel Graph Neural Network (APKGNN) for Node Classification

We present a new graph neural network, the Attention-based Parametric-Kernel augmented Graph Neural Network (APKGNN), developed for node classification tasks. Despite extensive work on modeling multi-faceted relationships between connected nodes of a graph, the effect of attention on edge features mapped to relationships has not yet been analyzed through learning representation. This study derives such an attention vector by first calculating node features corresponding to endpoints of an edge and then aggregating these with extracted local intrinsic patches of a given graph to generate augmented local patch vectors. This process uses a parametric kernel based on Gaussian mixture models (GMMs) to embed local neighborhoods of the graph in local patches. The patch vectors then convolve with the above node features to produce an updated node representation. We show that this new learning representation (APKGNN) achieves higher node classification accuracy on tasks - both standard benchmarks (Cora, PubMed, Citeseer) and new experimental short text corpora where nodes correspond to text documents and words. This implementation of the GNN convolution layer outperforms state-of-the-art (SOTA) algorithms, achieving higher training, validation, and test accuracy by a significant margin on three standard benchmark data sets under both SOTA experimental settings and those for new testbeds.

Bose, Avishek↗
DOE OSTI2022

tapir: A tool for topologies, amplitudes, partial fraction decomposition and input for reductions

The demand for precision predictions in the field of high energy physics has dramatically increased over recent years. Experiments conducted at the LHC, as well as precision measurements at the intensity frontier such as Belle II require equally precise theoretical predictions to make full use of the acquired data. To match the experimental precision, second-, third- and, for certain quantities, even higher-order calculations in perturbative quantum field theory are required. To facilitate such calculations, computer software automating as many steps as possible is required. Yet, each calculation poses different challenges and thus, a high level of configurability is required. In this context we present tapir: a tool for identification, manipulation and minimization of Feynman integral families. It is designed to integrate in toolchains based on the computer algebra system FORM, the use of which is common practice in the field. tapir can be used to reduce the complexity of multi-loop problems with cut-filters, topology mapping, partial fraction decomposition and alike. Program Title:tapir CPC Library link to program files:https://doi.org/10.17632/ptc9t46xyn.1 Developer's repository link:https://gitlab.com/tapir-devs/tapir Licensing provisions: GPLv3 Programming language:python 3, C++ Nature of problem: Multi-loop computations require the automatization of a large number of different tasks related to Feynman integral topologies. Among them are the identification and minimization of integral topologies, partial fraction decomposition of topologies in the case of linearly dependent propagators as well as mapping scalar products of loop momenta to scalar functions. Solution method: The minimization of topologies is performed by comparison of their respective Nickel indices [1], even further minimization utilizes Pak's algorithm [2]. To efficiently map scalar products of loop momenta to scalar functions FORM [3] code is generated. Additional comments including restrictions and unusual features: Minimization based on Pak's algorithm slows down for many lines and scales. A coarser minimization using the Nickel indices, however, is still possible. [1]B. Nickel, D. Meiron, G.A.J. Baker, Compilation of 2-pt and 4-pt graphs for continuous spin model, Report, University of Guelph, 1977.[2]A. Pak, J. Phys. Conf. Ser. 368 (2012) 012049, https://doi.org/10.1088/1742-6596/368/1/012049, arXiv:1111.0868.[3]B. Ruijl, T. Ueda, J. Vermaseren, FORM version 4.2, arXiv:1707.06453, 7 2017.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗