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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Data Movement Categories

We have endeavored to classify the commonly seen data movement needs, as observed in data-intensive institutions (both commercial and non-profit), into four categories. Knowing how to map a data movement task into one of the four categories helps select proper data mover tools. For each category, how the data storage is involved, high-level examples and the nature of typical solutions are described. Finally, some general remarks are provided to help further orient readers new to this field - the 4th IT pillar.

99 GENERAL AND MISCELLANEOUS↗
NASA NTRS1991

The performance evaluation of a new neural network based traffic management scheme for a satellite communication network

A neural-network-based traffic management scheme for a satellite communication network is described. The scheme consists of two levels of management. The front end of the scheme is a derivation of Kohonen's self-organization model to configure maps for the satellite communication network dynamically. The model consists of three stages. The first stage is the pattern recognition task, in which an exemplar map that best meets the current network requirements is selected. The second stage is the analysis of the discrepancy between the chosen exemplar map and the state of the network, and the adaptive modification of the chosen exemplar map to conform closely to the network requirement (input data pattern) by means of Kohonen's self-organization. On the basis of certain performance criteria, whether a new map is generated to replace the original chosen map is decided in the third stage. A state-dependent routing algorithm, which arranges the incoming call to some proper path, is used to make the network more efficient and to lower the call block rate. Simulation results demonstrate that the scheme, which combines self-organization and the state-dependent routing mechanism, provides better performance in terms of call block rate than schemes that only have either the self-organization mechanism or the routing mechanism.

Ansari, Nirwan↗
NASA NTRS1998

The Fundamental Physical Processes Producing and Controlling Stellar Coronal/ Transition-Region/Chromospheric Activity and Structure

Our LTSA grant supports a long-term collaborative investigation of stellar activity. The project involves current NASA spacecraft and supporting ground-based telescopes, will make use of future missions, and utilizes the extensive archives of IUE, ROSAT, HST, and EUVE. Our interests include observational work (with a nonnegligible groundbased component); specialized processing techniques for imaging and spectral data; and semiempirical modeling, ranging from optically-thin emission measure studies to simulations of optically-thick resonance lines. Collaborations with our cool-star colleagues here in Boulder (at JILA and the High Altitude Observatory) provide access to even broader expertise, particularly on the solar corona, convection, and magnetohydrodynamic phenomena (including "dynamo" theories). The broad-brush of our investigation include the following: (1) where do coronae occur in the Hertzsprung-Russell diagram? (2) the winds of coronal stars: hot, cool, or both? (3) age, activity, rotation relations; (4) atmospheric inhomogeneities; and (5) heating mechanisms, subcoronal flows and flares. Our observation task has been to map the global properties of chromospheres and coronae in the H-R diagram and conduct detailed studies of key objects.

Ayres, Thomas R.↗
NASA NTRS2001

Quality of Service for Real-Time Applications Over Next Generation Data Networks

This project, which started on January 1, 2000, was funded by NASA Glenn Research Center for duration of one year. The deliverables of the project included the following tasks: Study of QoS mapping between the edge and core networks envisioned in the Next Generation networks will provide us with the QoS guarantees that can be obtained from next generation networks. Buffer management techniques to provide strict guarantees to real-time end-to-end applications through preferential treatment to packets belonging to real-time applications. In particular, use of ECN to help reduce the loss on high bandwidth-delay product satellite networks needs to be studied. Effect of Prioritized Packet Discard to increase goodput of the network and reduce the buffering requirements in the ATM switches. Provision of new IP circuit emulation services over Satellite IP backbones using MPLS will be studied. Determine the architecture and requirements for internetworking ATN and the Next Generation Internet for real-time applications.

Ivancic, William↗
NASA NTRS1991

The design of electronic map displays

This paper presents a cognitive analysis of a pilot's navigation task and describes an experiment comparing a new map display that employs the principle of visual momentum with the two traditional approaches, track-up and north-up. The data show that the advantage of a track-up alignment is its congruence with the egocentered forward view; however, the inconsistency of the rotating display hinders development of a cognitive map. The stability of a north-up alignment aids the acquisition of a cognitive map, but there is a cost associated with the mental rotation of the display to a track-up alignment for tasks involving the ego-centered forward view. The data also show that the visual momentum design captures the benefits and reduces the costs associated with the two traditional approaches.

Aretz, Anthony J.↗
DOE OSTI2025

Code Release for “Unlocking Extreme Space Weather through Advanced Modeling of Legacy Vela Spacecraft” ER

The software being developed for this project has two mains aims. First, a Bayesian Model Calibration (BMC) procedure is being developed to calibrate a spallation model that simulates protons hitting a spacecraft orbiting earth to real data. The procedure will be developed for general data (there is no data release requested as part of this code release). Second, an inverse physics modeling task is being undertaken to map the number of resulting neutrons observed from this process to the expected number of protons that hit the model. This second task is of statistical interest; to publish on it, the code will need to be open source.

Murph, Alexander↗
NASA NTRS2014

Modeling and Prediction of the Noise from Non-Axisymmetric Jets

The new source model was combined with the original sound propagation model developed for rectangular jets to produce a new version of the rectangular jet noise prediction code. This code was validated using a set of rectangular nozzles whose geometries were specified by NASA. Nozzles of aspect ratios two, four and eight were studied at jet exit Mach numbers of 0.5, 0.7 and 0.9, for a total of nine cases. Reynolds-averaged Navier-Stokes solutions for these jets were provided to the contactor for use as input to the code. Quantitative comparisons of the predicted azimuthal and polar directivity of the acoustic spectrum were made with experimental data provided by NASA. The results of these comparisons, along with a documentation of the propagation and source models, were reported in a journal article publication (Ref. 4). The complete set of computer codes and computational modules that make up the prediction scheme, along with a user's guide describing their use and example test cases, was provided to NASA as a deliverable of this task. The use of conformal mapping, along with simplified modeling of the mean flow field, for noise propagation modeling was explored for other nozzle geometries, to support the task milestone of developing methods which are applicable to other geometries and flow conditions of interest to NASA. A model to represent twin round jets using this approach was formulated and implemented. A general approach to solving the equations governing sound propagation in a locally parallel nonaxisymmetric jet was developed and implemented, in aid of the tasks and milestones charged with selecting more exact numerical methods for modeling sound propagation, and developing methods that have application to other nozzle geometries. The method is based on expansion of both the mean-flowdependent coefficients in the governing equation and the Green's function in series of orthogonal functions. The method was coded and tested on two analytically prescribed mean flows which were meant to represent noise reduction concepts being considered by NASA. Testing (Ref. 5) showed that the method was feasible for the types of mean flows of interest in jet noise applications. Subsequently, this method was further developed to allow use of mean flow profiles obtained from a Reynolds-averaged Navier-Stokes (RANS) solution of the flow. Preliminary testing of the generalized code was among the last tasks completed under this contract. The stringent noise-reduction goals of NASA's Fundamental Aeronautics Program suggest that, in addition to potentially complex exhaust nozzle geometries, next generation aircraft will also involve tighter integration of the engine with the airframe. Therefore, noise generated and propagated by jet flows in the vicinity of solid surfaces is expected to be quite significant, and reduced-order noise prediction tools will be needed that can deal with such geometries. One important source of noise is that generated by the interaction of a turbulent jet with the edge of a solid surface (edge noise). Such noise is generated, for example, by the passing of the engine exhaust over a shielding surface, such as a wing. Work under this task supported an effort to develop a RANS-based prediction code for edge noise based on an extension of the classical Rapid Distortion Theory (RDT) to transversely sheared base flows (Refs. 6 and 7). The RDT-based theoretical analysis was applied to the generic problem of a turbulent jet interacting with the trailing edge of a flat plate. A code was written to evaluate the formula derived for the spectrum of the noise produced by this interaction and results were compared with data taken at NASA Glenn for a variety of jet/plate configurations and flow conditions (Ref. 8). A longer-term goal of this task was to work toward the development of a high-fidelity model of sound propagation in spatially developing non-axisymmetric jets using direct numerical methods for solving the relevant equations. Working with NASA Glenn Acoustics Branch personnel, numerical methods and boundary conditions appropriate for use in a high-resolution calculation of the full equations governing sound propagation in a steady base flow were identified. Computer codes were then written (by NASA) and tested (by OAI) for an increasingly complex set of flow conditions to validate the methods. The NASA-supplied codes were ported to the High-End Computing resources of the NASA Advanced Supercomputing facility for testing and validation against analytical (where possible) and independent numerical solutions. The cases which were completed during the course of this contract were solutions of the two-dimensional linearized Euler equations with no mean flow, a uniform mean flow and a nonuniform mean flow representative of a parallel flow jet.

Leib, Stewart J.↗
NASA NTRS1991

Optimal processor assignment for pipeline computations

The availability of large scale multitasked parallel architectures introduces the following processor assignment problem for pipelined computations. Given a set of tasks and their precedence constraints, along with their experimentally determined individual responses times for different processor sizes, find an assignment of processor to tasks. Two objectives are of interest: minimal response given a throughput requirement, and maximal throughput given a response time requirement. These assignment problems differ considerably from the classical mapping problem in which several tasks share a processor; instead, it is assumed that a large number of processors are to be assigned to a relatively small number of tasks. Efficient assignment algorithms were developed for different classes of task structures. For a p processor system and a series parallel precedence graph with n constituent tasks, an O(np2) algorithm is provided that finds the optimal assignment for the response time optimization problem; it was found that the assignment optimizing the constrained throughput in O(np2log p) time. Special cases of linear, independent, and tree graphs are also considered.

Nicol, David M.↗
NASA NTRSDate not supplied

Task Load Management in Earth Independent Medical Operations

BACKGROUND: Medical care in spaceflight carries a high task load and can easily overwhelm a small crew. Present day operations in low Earth orbit (LEO) offload most medical tasks to ground teams in mission control. This team includes dozens of flight surgeons, specialists, and engineers and supports the on-orbit crew in monitoring environmental systems, tracking medications, guiding procedures, providing expert advice, and many other tasks. However, the physical limitations of the speed of light and technical limitations of bandwidth, channel capacity, and signal processing mean that missions beyond LEO cannot rely on this level of telemedical support. The further we travel from Earth the more these tasks will fall on the shoulders of the crew and the greater the risk of task saturation to the wellbeing of the crew and the success of the mission. Exploration class space crews will need progressively more robust systems for managing task load as they progress further out in space. OVERVIEW: Medical task management systems will need to assist with two broad categories of tasks; cognitively intensive tasks and procedure execution tasks. In both cases the goal is for the systems to operate in the background with minimal human-in-the-loop intervention. To accomplish this such systems will need to be designed with careful consideration for human factors and human systems integration to maximize efficiency, minimize alarm fatigue, and avoid inadvertently increasing task loads. Finally, the key domains of space medicine tasking can be used to map present day and near future technologies to the areas where they are best suited to support and identify gaps which can be targeted for research and development. DISCUSSION: Task load is a major challenge for Earth Independent Medical Operations to overcome. It will require careful coordination between experts in a variety of fields paying attention to human factors and human systems integration as well as technical and medical expertise. If done well medical task management systems can handle many of the tasks currently run by humans in mission control and enable human crews to maintain terrestrial standards of care in the extraterrestrial environment.

Dana Levin↗
NASA NTRS1993

Crew performance and communication: Performing a terrain navigation task

A study was conducted to examine the map and route cues pilots use while navigating under controlled, but realistic, nap-of-the-earth (NOE) flight conditions. US Army helicopter flight crews were presented a map and route overlay and asked to perform normal mission planning. They then viewed a video-recording of the out-the-window scene during low-level flights, without the route overlay, and were asked periodically to locate their current position on the map. The pilots and navigators were asked to communicate normally during the planning and flight phases. During each flight the navigator's response time, accuracy, and subjective workload were assessed. Post-flight NASA-TLX workload ratings were collected. No main effect of map orientation (north-up vs. track-up) was found for errors or response times on any of the tasks evaluated. Navigators in the north-up group rated their workload lower than those in the track-up group.

Battiste, Vernol↗
NASA NTRS1992

How to handle 6GBytes a night and not get swamped

The Macho Project has undertaken a 5 year effort to search for dark matter in the halo of the Galaxy by scanning the Magellanic Clouds for micro-lensing events. Each evening's raw image data will be reduced in real-time into the observed stars' photometric measurements. The actual search for micro-lensing events will be a post-processing operation. The theoretical prediction of the rate of such events necessitates the collection of a large number of repeated exposures. The project designed camera subsystem delivers 64 Mbytes per exposure with exposures typically occurring every 500 seconds. An ideal evening's observing will provide 6 Gbytes of raw image data and 40 Mbytes of reduced photometric measurements. Recognizing the difficulty of digging out from a snowballing cascade of raw data, the project requires the real-time reduction of each evening's data. The software team's implementation strategy centered on this non-negotiable mandate. Accepting the reality that 2 full time people needed to implement the core real-time control and data management system within 6 months, off-the-shelf vendor components were explored to provide quick solutions to the classic needs for file management, data management, and process control. Where vendor solutions were lacking, state-of-the-art models were used for hand tailored subsystems. In particular, petri nets manage process control, memory mapped bulletin boards provide interprocess communication between the multi-tasked processes, and C++ class libraries provide memory mapped, disk resident databases. The differences between the implementation strategy and the final implementation reality are presented. The necessity of validating vendor product claims are explored. Both the successful and hindsight decisions enabling the collection and processing of the nightly data barrage are reviewed.

Allsman, R.↗
NASA NTRS2010

Employing Geodatabases for Planetary Mapping Conduct - Requirements, Concepts and Solutions

Planetary geologic mapping has become complex in terms of merging and co-registering a variety of different datasets for analysis and mapping. But it has also become more convenient when it comes to conducting actual (geoscientific) mapping with the help of desktop Geographic Information Systems (GIS). The complexity and variety of data, however, are major issues that need to be taken care of in order to provide mappers with a consistent and easy-to-use mapping basis. Furthermore, a high degree of functionality and interoperability of various commercial and open-source GIS and remote sensing applications allow mappers to organize map data, map components and attribute data in a more sophisticated and intuitional way when compared to workflows 15 years ago. Integration of mapping results of different groups becomes an awkward task as each mapper follows his/her own style, especially if mapping conduct is not coordinated and organized programmatically. Problems of data homogenization start with various interpretations and implementations of planetary map projections and reference systems which form the core component of any mapping and analysis work. If the data basis is inconsistent, mapping results in terms of objects georeference become hard to integrate. Apart from data organization and referencing issues, which are important on the mapping as well as the data-processing side of every project, the organization of planetary geologic map units and attributes, as well as their representation within a common GIS environment, are key components that need to be taken care of in a consistent and persistent way.

vanGasselt, Stephan↗
NASA NTRS1998

Creation and Delivery of New Superpixelized DIRBE Map Products

Phase 1 called for the following tasks: (1) completion of code to generate intermediate files containing the individual DIRBE observations which would be used to make the superpixelized maps; (2) completion of code necessary to generate the maps themselves; and (3) quality control on test-case maps in the form of point-source extraction and photometry. Items 1 and 2 are well in hand and the tested code is nearly complete. A few test maps have been generated for the tests mentioned in item 3. Map generation is not in production mode yet.

Weiland, J.↗
NASA NTRS1990

Workload and strategic adaptation under transformations of visual-coordinative mappings

A study involving a bimanual pursuit-tracking task is conducted to examine strategic exploration of differing visual and motor coordination patterns emphasizing workload as an indicator of strategic behavior. The mappings are conducted for 16 possible variations of order, speed, and combination. Performance is assessed by means of the rms and percent time-on-target, and the NASA task-load index is used to classify subjective reports on workload. The results are broken down into four primary performance mappings and four hybrid mappings called contradictory conditions. The order of difficulty of the conditions is apparently determined by the workload, except that in the case of the three most difficult decoupled conditions some dissociation is reported.

Caird, J. K.↗
NASA NTRS1992

Reformulating Constraints for Compilability and Efficiency

KBSDE is a knowledge compiler that uses a classification-based approach to map solution constraints in a task specification onto particular search algorithm components that will be responsible for satisfying those constraints (e.g., local constraints are incorporated in generators; global constraints are incorporated in either testers or hillclimbing patchers). Associated with each type of search algorithm component is a subcompiler that specializes in mapping constraints into components of that type. Each of these subcompilers in turn uses a classification-based approach, matching a constraint passed to it against one of several schemas, and applying a compilation technique associated with that schema. While much progress has occurred in our research since we first laid out our classification-based approach [Ton91], we focus in this paper on our reformulation research. Two important reformulation issues that arise out of the choice of a schema-based approach are: (1) compilability-- Can a constraint that does not directly match any of a particular subcompiler's schemas be reformulated into one that does? and (2) Efficiency-- If the efficiency of the compiled search algorithm depends on the compiler's performance, and the compiler's performance depends on the form in which the constraint was expressed, can we find forms for constraints which compile better, or reformulate constraints whose forms can be recognized as ones that compile poorly? In this paper, we describe a set of techniques we are developing for partially addressing these issues.

Tong, Chris↗
NASA NTRS1990

Map display design

This paper presents a cognitive model of a pilot's navigation task and describes an experiment comparing a visual momentum map display to the traditional track-up and north-up approaches. The data show the advantage to a track-up map is its congruence with the ego-centered forward view; however, the development of survey knowledge is hindered by the inconsistency of the rotating display. The stable alignment of a north-up map aids the acquisition of survey knowledge, but there is a cost associated with the mental rotation of the display to a track-up alignment for ego-centered tasks. The results also show that visual momentum can be used to reduce the mental rotation costs of a north-up display.

Aretz, Anthony J.↗
NASA NTRS1989

Parallel eigenanalysis of finite element models in a completely connected architecture

A parallel algorithm is presented for the solution of the generalized eigenproblem in linear elastic finite element analysis, (K)(phi) = (M)(phi)(omega), where (K) and (M) are of order N, and (omega) is order of q. The concurrent solution of the eigenproblem is based on the multifrontal/modified subspace method and is achieved in a completely connected parallel architecture in which each processor is allowed to communicate with all other processors. The algorithm was successfully implemented on a tightly coupled multiple-instruction multiple-data parallel processing machine, Cray X-MP. A finite element model is divided into m domains each of which is assumed to process n elements. Each domain is then assigned to a processor or to a logical processor (task) if the number of domains exceeds the number of physical processors. The macrotasking library routines are used in mapping each domain to a user task. Computational speed-up and efficiency are used to determine the effectiveness of the algorithm. The effect of the number of domains, the number of degrees-of-freedom located along the global fronts and the dimension of the subspace on the performance of the algorithm are investigated. A parallel finite element dynamic analysis program, p-feda, is documented and the performance of its subroutines in parallel environment is analyzed.

Akl, F. A.↗