Search NASA⌕ Search

SEARCH · Search NASA

Results for “task mapping”

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 109 records · Page 6

Feature Engineering and Process Mining to Enable Hazard Detection in Health Information Technology

Motivation for this work originates from a recognized need for developing data-driven approaches through analysis of complex electronic health records. Specifically, we aim to enhance the reliability of health information technology (HIT) systems by detection of plausible HIT hazards in clinical order transactions. In the absence of well-defined event logs in corporate data warehouses, our proposed approach identifies relevant timestamped data fields that could indicate transactions in the clinical order life cycle generating raw event sequences. Subsequently, we adopt state transitions of the OASIS Human Task standard to map the raw event sequences and simplify the complex process that clinical radiology orders go through. We describe how the current approach provides the potential to investigate areas of improvement and potential hazards in HIT systems. The discussion concludes with a use case and opportunities for future applications.

Ozmen, Ozgur↗

Classification

A supervised learning task involves constructing a mapping from input data (normally described by several features) to the appropriate outputs. Within supervised learning, one type of task is a classification learning task, in which each output is one or more classes to which the input belongs. In supervised learning, a set of training examples---examples with known output values---is used by a learning algorithm to generate a model. This model is intended to approximate the mapping between the inputs and outputs. This model can be used to generate predicted outputs for inputs that have not been seen before. For example, we may have data consisting of observations of sunspots. In a classification learning task, our goal may be to learn to classify sunspots into one of several types. Each example may correspond to one candidate sunspot with various measurements or just an image. A learning algorithm would use the supplied examples to generate a model that approximates the mapping between each supplied set of measurements and the type of sunspot. This model can then be used to classify previously unseen sunspots based on the candidate's measurements. This chapter discusses methods to perform machine learning, with examples involving astronomy.

Oza, Nikunj C.↗

Locus of the single-channel bottleneck in dual-task interference

Two experiments used the locus-of-cognitive-slack method to determine whether dual-task interference occurs before or after the response selection stage. The experiments used the overlapping tasks paradigm, in which two signals, each requiring a different speeded choice response, are presented in rapid succession. In Experiment 1, stimulus-response (S-R) compatibility was manipulated by varying whether Task 2 stimuli were mapped onto their responses by a rule or arbitrarily. Compatibility effects were additive with the effects of degree of task overlap, manipulated by varying the stimulus onset asynchrony between the signals. Experiment 2 examined 2 additional forms of S-R compatibility: symbolic compatability (arrows vs. letters) and spatial compatibility (the 'Simon' effect). Effects of symbolic compatibility were additive with effects of degree of task overlap, whereas the effects of spatial compatibility and degree of task overlap were underadditive. It is argued that only a central-bottleneck model provides a consistent account of these results. The nature of the central bottleneck is considered.

Mccann, Robert S.↗

The Functional Task Test (FTT): An Interdisciplinary Testing Protocol to Investigate the Factors Underlying Changes in Astronaut Functional Performance

Exposure to space flight causes adaptations in multiple physiological systems including changes in sensorimotor, cardiovascular, and neuromuscular systems. These changes may affect a crewmember s ability to perform critical mission tasks immediately after landing on a planetary surface. The overall goal of this project is to determine the effects of space flight on functional tests that are representative of high priority exploration mission tasks and to identify the key underlying physiological factors that contribute to decrements in performance. To achieve this goal we developed an interdisciplinary testing protocol (Functional Task Test, FTT) that evaluates both astronaut functional performance and related physiological changes. Functional tests include ladder climbing, hatch opening, jump down, manual manipulation of objects and tool use, seat egress and obstacle avoidance, recovery from a fall and object translation tasks. Physiological measures include assessments of postural and gait control, dynamic visual acuity, fine motor control, plasma volume, orthostatic intolerance, upper- and lower-body muscle strength, power, endurance, control, and neuromuscular drive. Crewmembers perform this integrated test protocol before and after short (Shuttle) and long-duration (ISS) space flight. Data are collected on two sessions before flight, on landing day (Shuttle only) and 1, 6 and 30 days after landing. Preliminary results from both Shuttle and ISS crewmembers indicate decrement in performance of the functional tasks after both short and long-duration space flight. On-going data collection continues to improve the statistical power required to map changes in functional task performance to alterations in physiological systems. The information obtained from this study will be used to design and implement countermeasures that specifically target the physiological systems most responsible for the altered functional performance associated with space flight.

Bloomberg, J. J.↗

Separating the Wheat from the Chaff: Comparative Visual Cues for Transparent Diagnostics of Competing Models

Experts in data and physical sciences have to regularly grapple with the problem of competing models. Be it analytical or physics-based models, a cross-cutting challenge for experts is to reliably diagnose which model outcomes appropriately predict or simulate real-world phenomena. Expert judgment involves reconciling information across many, and often, conflicting criteria that describe the quality of model outcomes. In this paper, through a design study with climate scientists, we develop a deeper understanding of the problem and solution space of model diagnostics, resulting in the following contributions: i) a problem and task characterization using which we map experts’ model diagnostics goals to multi-way visual comparison tasks, ii) a design space of comparative visual cues for letting experts quickly understand the degree of disagreement among competing models and gauge the degree of stability of model outputs with respect to alternative criteria, and iii) design and evaluation of MyriadCues, an interactive visualization interface for exploring alternative hypotheses and insights about good and bad models by leveraging comparative visual cues. Here, we present case studies and subjective feedback by experts, which validate how MyriadCues enables more transparent model diagnostic mechanisms, as compared to the state of the art.

54 ENVIRONMENTAL SCIENCES↗

The PRP Effect Following Callosotomy: Residual Interference Despite Uncoupling of Lateralized Response Codes

A callosotomy patient was tested in two dual-task experiments requiring successive speeded responses to lateralized stimuli. In accord with the recent findings of Pashler, O'Brien, Luck, Hillyard, Mangun, and Gazzaniga (in press), the patient showed a robust psychological refractory period effect (PRP) responses on Task 2 were inversely related to the stimulus-onset asynchrony (SOA). However, three aspects of our data indicated that the processing limitations for the patient were different than those observed with control subjects. First, the split-brain patient did not show an increase in reaction time when the two tasks required responses from a common output system (i.e., both manual responses) in comparison to when different output systems were used (i.e., manual-vocal). Second, inconsistent stimulus-response mappings for the two tasks greatly inflated response latencies for the control subjects, but had minimal effect on the performance of the split-brain patient. Third, the consistency manipulation was underadditive with SOA for only the patient, suggesting a later bottleneck in processing following callosotomy than was observed for the control subjects. It is proposed that sectioning the corpus callosum eliminates interference resulting from competing stimulus response codes. Nonetheless, dual-task interference persists for the split-brain subject because a subcortical gate constrains when selected responses can be implemented.

Ivry, Richard B.↗

Mapping unstructured grid computations to massively parallel computers

Investigated here is this mapping problem: assign the tasks of a parallel program to the processors of a parallel computer such that the execution time is minimized. First, a taxonomy of objective functions and heuristics used to solve the mapping problem is presented. Next, we develop a highly parallel heuristic mapping algorithm, called Cyclic Pairwise Exchange (CPE), and discuss its place in the taxonomy. CPE uses local pairwise exchanges of processor assignments to iteratively improve an initial mapping. A variety of initial mapping schemes are tested and recursive spectral bipartitioning (RSB) followed by CPE is shown to result in the best mappings. For the test cases studied here, problems arising in computational fluid dynamics and structural mechanics on unstructured triangular and tetrahedral meshes, RSB and CPE outperform methods based on simulated annealing. Much less time is required to do the mapping and the results obtained are better. Compared with random and naive mappings, RSB and CPE reduce the communication time two fold for the test problems used. Finally, we use CPE in two applications on a CM-2. The first application is a data parallel mesh-vertex upwind finite volume scheme for solving the Euler equations on 2-D triangular unstructured meshes. CPE is used to map grid points to processors. The performance of this code is compared with a similar code on a Cray-YMP and an Intel iPSC/860. The second application is parallel sparse matrix-vector multiplication used in the iterative solution of large sparse linear systems of equations. We map rows of the matrix to processors and use an inner-product based matrix-vector multiplication. We demonstrate that this method is an order of magnitude faster than methods based on scan operations for our test cases.

Hammond, Steven Warren↗

SafeMAP: Safe Multi-Agent Planning Framework Based on Dynamic Probabilistic Risk Assessment

This paper proposes a risk-aware framework for Safe Multi-Agent Planning (SafeMAP) that unifies disparate models for multi-agent systems in a Markovian process that allows for simultaneous system health monitoring, decision making under uncertainty, and multi-agent system collaboration. As operations beyond low earth orbit mature, there is an increased need for autonomous cyber-physical systems with onboard decision making capabilities. Multi-agent cyber-physical systems in particular offer the potential of increased efficiency, resiliency, and mission capabilities for future applications such as multi-rover terrain operations, distributed satellite operations, and management of smart lunar habitats. SafeMAP utilizes physics-based models of each agent and the relevant components, probability models of the environment and component operational states, and reward models for mission-specific objectives such as scientific task completion or resource consumption. The output of SafeMAP is a set of mission plans that satisfy the mission objective under specified risk/reward constraints. A readable interpretation of each of these generated mission plans is provided as an additional output. SafeMAP has been demonstrated on a simulated case study involving a four-rover system performing surface mapping operations and science tasks. Results of this paper demonstrate SafeMAP’s ability to generate explainable mission plans that satisfy the mission objective while minimizing risk under nominal and off-nominal conditions.

Mohammad Hejase↗

SafeMAP: Safe Multi-Agent Planning framework based on Dynamic Probabilistic Risk Assessment

This paper proposes a risk-aware framework for Safe Multi-Agent Planning (SafeMAP) that unifies disparate models for multi-agent systems in a Markovian process that allows for simultaneous system health monitoring, decision making under uncertainty, and multi-agent system collaboration. As operations beyond low earth orbit mature, there is an increased need for autonomous cyber-physical systems with onboard decision making capabilities. Multi-agent cyber-physical systems in particular offer the potential of increased efficiency, resiliency, and mission capabilities for future applications such as multi-rover terrain operations, distributed satellite operations, and management of smart lunar habitats. SafeMAP utilizes physics-based models of each agent and the relevant components, probability models of the environment and component operational states, and reward models for mission-specific objectives such as scientific task completion or resource consumption. The output of SafeMAP is a set of mission plans that satisfy the mission objective under specified risk/reward constraints. A readable interpretation of each of these generated mission plans is provided as an additional output. SafeMAP has been demonstrated on a simulated case study involving a four-rover system performing surface mapping operations and science tasks. Results of this paper demonstrate SafeMAP’s ability to generate explainable mission plans that satisfy the mission objective while minimizing risk under nominal and off-nominal conditions.

Mohammad Hejase↗

The Moon is a Planet Too: Lunar Science and Robotic Exploration

The first decades of the 21st century will be marked by major lunar science and exploration activities. The Moon is a witness to 4.5 billion years of solar system history, recording that history more completely and more clearly than any other planetary body. Lunar science encompasses early planetary evolution and differentiation, lava eruptions and fire fountains, impact scars throughout time, and billions of years of volatile input. I will cover the main outstanding issues in lunar science today and the most intriguing scientific opportunities made possible by renewed robotic and human lunar exploration. Barbara is a planetary scientist at NASA s Marshall Space Flight Center. She studies meteorites from the Moon, Mars and asteroids and has been to Antarctica twice to hunt for them. Barbara also works on the Mars Exploration Rovers Spirit and Opportunity and has an asteroid named after her. She is currently helping the Lunar Precursor Robotics Program on the Lunar Mapping and Modeling Project, a project tasked by the Exploration System Mission Directorate (ESMD) to develop maps and tools of the Moon to benefit the Constellation Program lunar planning. She is also supporting the Science Mission Directorate s (SMD) lunar flight projects line at Marshall as the co-chair of the Science Definition Team for NASA s next robotic landers, which will be nodes of the International Lunar Network, providing geophysical information about the Moon s interior structure and composition.

Cohen, Barbara↗

Method and apparatus for fast context cloning in a data processing system

A data processing system includes a memory system, a first processing element, a first address translator that maps virtual addresses to system addresses, a second address translator that maps system address to physical addresses, and a task management unit. A first program task uses a first virtual memory space that is mapped to a first system address range using a first table. The context of the first program task includes an address of the first table and is cloned by creating a second table indicative of a mapping from a second virtual address space to a second range of system addresses, where the second range is mapped to the same physical addresses as the first range until a write occurs, at which time memory is allocated and the mapping of the second range is updated. The cloned context includes an address of the second table.

Beard, Jonathan Curtis↗

Cognitive perspectives on map displays for helicopter flight

Currently accessible technologies are providing entirely new display concepts for enhancing helicopter navigation. Yet the effectiveness of such displays depends on the extent to which they are configured according to principles from research on human performance. Computer generated map displays in the present study were configured according to previous research on maps, navigational problem solving, and spatial cognition in large scale environments. Interest centered on the representation of different spatial relationships that would best support helicopter navigational problem solving. One map display emphasized the global relationships between objects in the environment. The other map showed the pilot's relationship to objects as he traveled through the environment. Twenty skilled pilots used the maps to complete several navigational tasks that occurred within a realistic simulation program tailored for helicopter navigation. Findings indicate that the type of task and mode of flight (low level or Nap of the Earth (NOE)) are important determinants of map display effectiveness.

Harwood, Kelly↗

Glovebox Handling of High-Consequence Materials with Super Baxter and Gesture-Based Programming - 18598

The handling of high-consequence materials is a difficult task requiring safe object manipulation while avoiding the risk of contamination or spillage. Specific operations including opening containers, segregating the wastes, and repackaging are required to be safely executed inside contained spaces such as gloveboxes. However, the workers' ability and dexterity to manipulate objects through thick protective gloves are compromised in many aspects. The fixed position of the glovebox arm ports restricts the movements of the workers' arms, which also makes it hard to lift heavy objects. Further, the operational workspace inside the glovebox is restricted by the gloves' reachability. Safety of workers is the paramount concern in glovebox operations and the very reason for their existence. Sharp edges and tools increases the risk of glove punctures, which may expose the operator to chemicals and radiation and risks contamination in the vicinity outside the glovebox. The operators are also affected by ergonomic stressors due to prolonged and repetitive operations. To achieve a high degree of human safety, robotic solutions to handle high-consequence materials inside the glovebox are desirable, as they remove the operators from the hazards listed above. However, robots, in general, lack the degree of adaptability necessary for most high-consequence material handling tasks as these tasks are often unstructured or highly variable. Likewise, most human operators, while highly skilled in the tasks at hand (task expertise), lack the robot programming skills necessary to adapt the robot's motions to the variations (programming expertise). A way to bridge this divide is to make robot programming more intuitive to human operators. Since humans naturally teach one another through demonstration and learning, robotic 'programming by demonstration' paradigms have begun to appear to reduce the burden of robot reprogramming. Gesture-Based Programming attempts to achieve that by enabling a robot to observe the normal actions and affordances of a human performing a task to learn to map those onto the skills of the robot. In the end, this approach permits benefits from both the human and the robot: the human's adaptive decision making and the robot's resilience to high-consequence material. Robotic solutions assuringly provide protection for the operators, however their autonomy brings about other potential risks. Artificial Intelligence is not perfect; it is a black box, which can produce results, but the full extent of those results may not be known precisely. In self-driving cars, a hypothetical AI problem is the 'green man detector'. Since self-driving cars have presumably never seen a green man, how can we know it won't veer toward him the first time it sees a green man? Likewise, even though GbP provides an open method for safe task execution replicating a human, incorrect task inferences can lead to potential collisions or unintended operations. Thus, a hardware safety measure is proposed to provide reliable operation inside the glovebox, and true safe operations are achieved by mechanically limiting the operational range of each arm link. The operational range is computed and validated through exhaustive offline simulations, which can be streamlined by affordable computing power. Super Baxter is one such robot which incorporates these capabilities. It is a human-like, bimanual robot, being developed at the Collaborative Robotics Lab (CRL) in conjunction with the Dept. of Energy/Environmental Management, Rethink Robotics, Barrett Technology, and the NSF Center for Robots and Sensors for the Human Well-Being (RoSe-HUB). Super Baxter is envisioned to represent the next generation of collaborative robots that will be intrinsically human-safe, as well as exceptionally human-intuitive. In summary, Super Baxter will enable safe glovebox operations through low-shot Gesture based Programming incorporated with hardware safety measures. Two aspects of safety will be discussed in the paper. First, the safety of the operator achieved by allowing him to program Super Baxter remotely through Gesture based Programming. Second, the safety of the glovebox, achieved by incorporating hardware safety measures using joint limits. Further, the capability of Super Baxter on Gesture based Programming is demonstrated through typical object manipulation tasks in glovebox operations. (authors)

42 ENGINEERING↗

DS-GL: Advancing Graph Learning via Harnessing the Power of Nature within Dynamic Systems

With the rapid digitization of the world, an increasing number of real-world applications are turning to nonEuclidean data, modeled as graphs. Due to their intrinsic high complexity and irregularity, learning from graph data demands tremendous computational power. Recently, CMOS-compatible Ising machines, i.e., dynamic systems composed of CMOS components, have emerged as a new approach that harnesses the inherent power of natural annealing within dynamic systems to efficiently resolve binary optimization problems and have been adopted for traditional graph computation, such as max-cut. However, when performing complex Graph Learning (GL) tasks, Ising machines face significant hurdles: (i) they are inherently binary and thus ill-suited for real-valued problems; (ii) their expensive all-to-all coupling network that guarantees effective natural annealing poses daunting scalability concerns. To address these challenges, this paper proposes a nature-powered graph learning framework dubbed DS-GL, which is the first effort to transform the process of solving graph learning problems into the natural annealing process within a parameterized dynamic system embodied as a CMOS chip. To tackle the two major hurdles, DS-GL first augments the Ising machine architecture to modify the self-reaction term of its Hamiltonian function from linear to quadratic, effectively serving as an energy regulator. This adjustment maintains the system’s original physical interpretation while enabling it to process continuous, real-valued data. Second, to address the scaling issue, DS-GL further upgrades the real-valued dense Ising machine by decomposing it into a mesh-based multi-PE dynamic system that supports efficient distributed spatial-temporal co-annealing across different PEs through sparse interconnects. By exploiting the inherent sparsity and component structures in real-world graphs, DS-GL is able to map complex graph learning tasks onto the scalable dynamic system while maintaining high accuracy. Evaluations with three diverse GL applications across six real-world datasets, including traffic flow and COVID-19 prediction, show that DS-GL can deliver from 102× to 106× speedups and 500× energy reduction over Graph Neural Networks on GPUs, with 5% - 20% accuracy enhancement.

Song, Ruibing↗

A Behavioral Robotics Approach to Radiation Mapping Using Adaptive Sampling

Radiation mapping is a desirable task to automate because of the inherent risks involved and its tedious nature. A novel system was designed to address this by combining various existing technologies, utilizing behavior-based robotics and Bayesian optimization. The system uses a quadruped robot equipped with a manipulator and gamma detector to take measurements at locations that are selected based on the uncertainty of a surrogate model used to estimate the true radiation field. The robot uses input from the world with depth cameras to avoid collisions with the robot’s body, and unreachable points for the end effector are addressed by both allowing for a soft collision with the environment to occur, prompting the system to abandon that point, and varying the exploration tendency of the optimization based on consecutive collisions. This approach provides unique traversability and adaptability over other strategies in the literature. Experiments were performed by placing a Cesium-137 source on the ground and varying geometric setups and an optimization parameter demonstrating the adaptability to diverse environments and the increased robustness resulting from the designed behavior. The results additionally demonstrate that dynamically adjusting the optimization algorithm’s exploration tendency based on the arm’s collision history improves the system’s ability to navigate cluttered environments and construct accurate radiation maps without getting stuck in unreachable areas.

Adams, Joel↗

High-Dimensional Intrinsic Interpolation Using Gaussian Process Regression and Diffusion Maps

This article considers the challenging task of estimating geologic properties of interest using a suite of proxy measurements. The current work recast this task as a manifold learning problem. In this process, this article introduces a novel regression procedure for intrinsic variables constrained onto a manifold embedded in an ambient space. The procedure is meant to sharpen high-dimensional interpolation by inferring non-linear correlations from the data being interpolated. The proposed approach augments manifold learning procedures with a Gaussian process regression. It first identifies, using diffusion maps, a low-dimensional manifold embedded in an ambient high-dimensional space associated with the data. It relies on the diffusion distance associated with this construction to define a distance function with which the data model is equipped. This distance metric function is then used to compute the correlation structure of a Gaussian process that describes the statistical dependence of quantities of interest in the high-dimensional ambient space. The proposed method is applicable to arbitrarily high-dimensional data sets. Here, it is applied to subsurface characterization using a suite of well log measurements. The predictions obtained in original, principal component, and diffusion space are compared using both qualitative and quantitative metrics. Considerable improvement in the prediction of the geological structural properties is observed with the proposed method.

58 GEOSCIENCES↗

Automatic identification and classification of Palomar Transient Factory astrophysical objects in GLADE

Palomar Transient Factory (PTF) is a comprehensive detection system for the identification and classification of transient astrophysical objects. In this paper, we make two significant contributions to the PTF pipeline. First, we present an experimental study that evaluates a novel implementation of the real-time classifier in GLADE - a parallel data processing system that combines the efficiency of a database with the extensibility of map-reduce. We show how each stage in the classifier maps optimally into GLADE tasks by taking advantage of the unique features of the system - range-based data partitioning, columnar storage, multi-query execution, and in-database support for complex aggregate computation. Second, we introduce a novel parallel similarity join algorithm for advanced transient classification. In conclusion, we implement this algorithm in GLADE and execute it on a massive supercomputer with more than 3,000 threads, achieving more than three orders of magnitude improvement over the PostgreSQL solution.

79 ASTRONOMY AND ASTROPHYSICS↗