Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “remap”

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 37 records · Page 2

Spatial updating in human parietal cortex

Single neurons in monkey parietal cortex update visual information in conjunction with eye movements. This remapping of stimulus representations is thought to contribute to spatial constancy. We hypothesized that a similar process occurs in human parietal cortex and that we could visualize it with functional MRI. We scanned subjects during a task that involved remapping of visual signals across hemifields. We observed an initial response in the hemisphere contralateral to the visual stimulus, followed by a remapped response in the hemisphere ipsilateral to the stimulus. We ruled out the possibility that this remapped response resulted from either eye movements or visual stimuli alone. Our results demonstrate that updating of visual information occurs in human parietal cortex.

NASA Discipline Neuroscience↗

Hippocampal place-cell firing during movement in three-dimensional space

"Place" cells of the rat hippocampus are coupled to "head direction" cells of the thalamus and limbic cortex. Head direction cells are sensitive to head direction in the horizontal plane only, which leads to the question of whether place cells similarly encode locations in the horizontal plane only, ignoring the z axis, or whether they encode locations in three dimensions. This question was addressed by recording from ensembles of CA1 pyramidal cells while rats traversed a rectangular track that could be tilted and rotated to different three-dimensional orientations. Cells were analyzed to determine whether their firing was bound to the external, three-dimensional cues of the environment, to the two-dimensional rectangular surface, or to some combination of these cues. Tilting the track 45 degrees generally provoked a partial remapping of the rectangular surface in that some cells maintained their place fields, whereas other cells either gained new place fields, lost existing fields, or changed their firing locations arbitrarily. When the tilted track was rotated relative to the distal landmarks, most place fields remapped, but a number of cells maintained the same place field relative to the x-y coordinate frame of the laboratory, ignoring the z axis. No more cells were bound to the local reference frame of the recording apparatus than would be predicted by chance. The partial remapping demonstrated that the place cell system was sensitive to the three-dimensional manipulations of the recording apparatus. Nonetheless the results were not consistent with an explicit three-dimensional tuning of individual hippocampal neurons nor were they consistent with a model in which different sets of cells are tightly coupled to different sets of environmental cues. The results are most consistent with the statement that hippocampal neurons can change their "tuning functions" in arbitrary ways when features of the sensory input or behavioral context are altered. Understanding the rules that govern the remapping phenomenon holds promise for deciphering the neural circuitry underlying hippocampal function.

Non-NASA Center↗

A general interactive system for compositing digital radar and satellite data

Reynolds and Smith (1979) have considered the combined use of digital weather radar and satellite data in interactive systems for case study analysis and forecasting. Satellites view the top of clouds, whereas radar is capable of observing the detailed internal structure of clouds. The considered approach requires the use of a common coordinate system. In the present investigation, it was decided to use the satellite coordinate system as the base system in order to maintain the fullest resolution of the satellite data. The investigation is concerned with the development of a general interactive software system called RADPAK for remapping and analyzing conventional and Doppler radar data. RADPAK is implemented as a part of a minicomputer-based image processing system, called Atmospheric and Oceanographic Image Processing System. Attention is given to a general description of the RADPAK system, remapping methodology, and an example of satellite remapping.

Ghosh, K. K.↗

An interactive system for compositing digital radar and satellite data

This paper describes an approach for compositing digital radar data and GOES satellite data for meteorological analysis. The processing is performed on a user-oriented image processing system, and is designed to be used in the research mode. It has a capability to construct PPIs and three-dimensional CAPPIs using conventional as well as Doppler data, and to composite other types of data. In the remapping of radar data to satellite coordinates, two steps are necessary. First, PPI or CAPPI images are remapped onto a latitude-longitude projection. Then, the radar data are projected into satellite coordinates. The exact spherical trigonometric equations, and the approximations derived for simplifying the computations are given. The use of these approximations appears justified for most meteorological applications. The largest errors in the remapping procedure result from the satellite viewing angle parallax, which varies according to the cloud top height. The horizontal positional error due to this is of the order of the error in the assumed cloud height in mid-latitudes. Examples of PPI and CAPPI data composited with satellite data are given for Hurricane Frederic on 13 September 1979 and for a squall line on 2 May 1979 in Oklahoma.

Heymsfield, G. M.↗

Accurate modeling of parallel scientific computations

Scientific codes are usually parallelized by partitioning a grid among processors. To achieve top performance it is necessary to partition the grid so as to balance workload and minimize communication/synchronization costs. This problem is particularly acute when the grid is irregular, changes over the course of the computation, and is not known until load time. Critical mapping and remapping decisions rest on the ability to accurately predict performance, given a description of a grid and its partition. This paper discusses one approach to this problem, and illustrates its use on a one-dimensional fluids code. The models constructed are shown to be accurate, and are used to find optimal remapping schedules.

Nicol, David M.↗

Programmable remapper with single flow architecture

The invention relates to image processing systems and methods and in particular to a machine which accepts a real time video image in the form of a matrix of picture elements (pixels) and remaps such image according to a selectable one of a plurality of mapping functions to create an output matrix of pixels. Such mapping functions, or transformations, may be any one of a number of different transformations depending on the objective of the user of the system. The system remaps input images from one coordinate system to another using a set of look-up tables for the data necessary for the transform. The transforms, which are operator selectable, are precomputed and loaded into massive look-up tables. Input pixels, via the look-up tables of any particular transform selected, are mapped into output pixels with the radiance information of the input pixels being appropriately weighted. An earlier embodiment of the system included two parallel processors: a collective processor which mapped multiple input pixels into a single output pixel and an interpolative processor. The interpolative processor performed an interpolation among pixels in the input image where a given input pixel may affect the value of many output pixels. Several advantages are provided over previous embodiments in that the two distinct processors are replaced by a single processor capable of performing both types of operations (collective and interpolative) with no more complexity. Previously, there has existed no image processor or 'remapper' that can operate with sufficient speed and flexibility to permit investigating different transformation patterns in real time.

Fisher, Timothy E.↗

An implicit method for two-dimensional hydrodynamics

An implicit method for compressible multidimensional flows is presented. The method, which is strongly oriented toward astrophysical applications, enables one to simulate very subsonic flows by removing the Courant condition upon time steps. It consists of an implicit purely Lagrangian step, followed by an explicit and second-order accurate (at least in one dimension) remapping step, which is optional. When the remapping step is performed the time step is limited by the 'particle crossing time' and otherwise it is limited only by accuracy considerations. The suggested method, which results from a compromise between accuracy and efficiency, is very efficient relative to other methods. It enables the computation of many multidimensional problems in stellar evolution, such as those governed by very subsonic flows, which were not calculable with existing explicit methods.

Livne, Eli↗

Tests of a simple data merging algorithm for the GONG project

The GONG (Global Oscillation Network Group) project proposes to reduce the impact of diurnal variations on helioseismic measurements by making long-term observations of solar images from six sites placed around the globe. The sun will be observed nearly constantly for three years, resulting in the acquisition of l+ terabyte of image data. To use the solar network to maximum advantage, the images from the sites must be combined into a single time series to determine mode frequencies, amplitudes, and line widths. Initial versions of combined, i.e., merged, time series were made using a simple weighted average of data from different sites taken simultaneously. In order to accurately assess the impact of the data merge on the helioseismic measurements, a set of artificial solar disk images was made using a standard solar model and containing a well known set of oscillation modes and frequencies. This undegraded data set and data products computed from it were used to judge the relative merits of various data merging schemes. The artificial solar disk images were subjected to various instrumental and atmospheric degradations, dependent on site and time, in order to create a set of images simulating those likely to be taken at the site. The degraded artificial solar disk images for the six observing sites were combined in various ways to form merged time series of images and mode coefficients. Various forms of a weighted average were used, including an equally-weighted average, an average with weights dependent upon air mass and averages with weights dependent on various quality assurance parameters. Both the undegraded solar disk image time series and several time series made up of various combinations of the degraded solar disk images from the six sites were subjected to standard helioseismic measurement processing. This processing consisted of coordinate remapping, detrending, spherical harmonic transformation, computation of power series for the oscillation mode coefficients, and mode frequency identification. Visual and statistical evaluation of the merged data sets themselves and differences between the merged and undegraded data set shows good agreement between the two data sets. Some slight differences in image scale and registration appear between the undegraded data set and the various merged data sets. In the set of power series made from the mode coefficients of the merged data sets, some power leakage is observed into the background and into slightly lower l-value modes, especially at higher l-value mode frequencies. The results of the comparison of time series and mode oscillation frequencies of the undegraded data with those of the data merged using weighted averages indicate that, at least for p-mode solar oscillations, a weighted average of either the detrended remapped images or the mode coefficients gives good determination of the mode frequencies and adequate-to-good determination of the amplitudes and widths of the mode frequency lines. This conclusion is most advantageous to the analysis of the massive amounts of data to be received by the GONG network.

Williams, W. E.↗

An adaptive technique to maximize lossless image data compression of satellite images

Data compression will pay an increasingly important role in the storage and transmission of image data within NASA science programs as the Earth Observing System comes into operation. It is important that the science data be preserved at the fidelity the instrument and the satellite communication systems were designed to produce. Lossless compression must therefore be applied, at least, to archive the processed instrument data. In this paper, we present an analysis of the performance of lossless compression techniques and develop an adaptive approach which applied image remapping, feature-based image segmentation to determine regions of similar entropy and high-order arithmetic coding to obtain significant improvements over the use of conventional compression techniques alone. Image remapping is used to transform the original image into a lower entropy state. Several techniques were tested on satellite images including differential pulse code modulation, bi-linear interpolation, and block-based linear predictive coding. The results of these experiments are discussed and trade-offs between computation requirements and entropy reductions are used to identify the optimum approach for a variety of satellite images. Further entropy reduction can be achieved by segmenting the image based on local entropy properties then applying a coding technique which maximizes compression for the region. Experimental results are presented showing the effect of different coding techniques for regions of different entropy. A rule-base is developed through which the technique giving the best compression is selected. The paper concludes that maximum compression can be achieved cost effectively and at acceptable performance rates with a combination of techniques which are selected based on image contextual information.

Stewart, Robert J.↗

Scalability study of parallel spatial direct numerical simulation code on IBM SP1 parallel supercomputer

The implementation and the performance of a parallel spatial direct numerical simulation (PSDNS) code are reported for the IBM SP1 supercomputer. The spatially evolving disturbances that are associated with laminar-to-turbulent in three-dimensional boundary-layer flows are computed with the PS-DNS code. By remapping the distributed data structure during the course of the calculation, optimized serial library routines can be utilized that substantially increase the computational performance. Although the remapping incurs a high communication penalty, the parallel efficiency of the code remains above 40% for all performed calculations. By using appropriate compile options and optimized library routines, the serial code achieves 52-56 Mflops on a single node of the SP1 (45% of theoretical peak performance). The actual performance of the PSDNS code on the SP1 is evaluated with a 'real world' simulation that consists of 1.7 million grid points. One time step of this simulation is calculated on eight nodes of the SP1 in the same time as required by a Cray Y/MP for the same simulation. The scalability information provides estimated computational costs that match the actual costs relative to changes in the number of grid points.

Hanebutte, Ulf R.↗

Load Balancing Sequences of Unstructured Adaptive Grids

Mesh adaption is a powerful tool for efficient unstructured grid computations but causes load imbalance on multiprocessor systems. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. This paper makes several important additions to our previous work. First, a new remapping cost model is presented and empirically validated on an SP2. Next, our load balancing strategy is applied to sequences of dynamically adapted unstructured grids. Results indicate that our framework is effective on many processors for both steady and unsteady problems with several levels of adaption. Additionally, we demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required for a fine initial mesh. Finally, we show that the data remapping overhead can be significantly reduced by applying our heuristic processor reassignment algorithm.

Biswas, Rupak↗

PLUM: Parallel Load Balancing for Unstructured Adaptive Meshes

Dynamic mesh adaption on unstructured grids is a powerful tool for computing large-scale problems that require grid modifications to efficiently resolve solution features. Unfortunately, an efficient parallel implementation is difficult to achieve, primarily due to the load imbalance created by the dynamically-changing nonuniform grid. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. First, we present an efficient parallel implementation of a tetrahedral mesh adaption scheme. Extremely promising parallel performance is achieved for various refinement and coarsening strategies on a realistic-sized domain. Next we describe PLUM, a novel method for dynamically balancing the processor workloads in adaptive grid computations. This research includes interfacing the parallel mesh adaption procedure based on actual flow solutions to a data remapping module, and incorporating an efficient parallel mesh repartitioner. A significant runtime improvement is achieved by observing that data movement for a refinement step should be performed after the edge-marking phase but before the actual subdivision. We also present optimal and heuristic remapping cost metrics that can accurately predict the total overhead for data redistribution. Several experiments are performed to verify the effectiveness of PLUM on sequences of dynamically adapted unstructured grids. Portability is demonstrated by presenting results on the two vastly different architectures of the SP2 and the Origin2OOO. Additionally, we evaluate the performance of five state-of-the-art partitioning algorithms that can be used within PLUM. It is shown that for certain classes of unsteady adaption, globally repartitioning the computational mesh produces higher quality results than diffusive repartitioning schemes. We also demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required a fine initial mesh. Results indicate that our parallel load balancing strategy will remain viable on large numbers of processors.

Oliker, Leonid↗

PLUM: Parallel Load Balancing for Adaptive Unstructured Meshes

Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. We present a novel method called PLUM to dynamically balance the processor workloads with a global view. This paper presents the implementation and integration of all major components within our dynamic load balancing strategy for adaptive grid calculations. Mesh adaption, repartitioning, processor assignment, and remapping are critical components of the framework that must be accomplished rapidly and efficiently so as not to cause a significant overhead to the numerical simulation. A data redistribution model is also presented that predicts the remapping cost on the SP2. This model is required to determine whether the gain from a balanced workload distribution offsets the cost of data movement. Results presented in this paper demonstrate that PLUM is an effective dynamic load balancing strategy which remains viable on a large number of processors.

Oliker, Leonid↗

Parallel Load Balancing for Adaptive Unstructured Meshes

Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. We describe a novel method to dynamically balance the processor workloads with a global view. Mesh question, repartitioning, processor assignment, and remapping are critical components of the framework that must be accomplished rapidly and efficiently so as not to cause a significant overhead to the numerical simulation. A data redistribution model will also be presented that predicts the remapping cost. This model is required to determine whether the gain from a balanced workload distribution offsets the cost of data movement. Results presented will demonstrate that this is an effective dynamic load balancing strategy which remains viable on a large number of processors.

Biswas, Rupak↗

Materials Science

The Materials Science Program is structured so that NASA s headquarters is responsible for the program content and selection, through the Enterprise Scientist, and MSFC provides for implementation of ground and flight programs with a Discipline Scientist and Discipline Manager. The Discipline Working Group of eminent scientists from outside of NASA acts in an advisory capacity and writes the Discipline Document from which the NRA content is derived. The program is reviewed approximately every three years by groups such as the Committee on Microgravity Research, the National Materials Advisory Board, and the OBPR Maximization and Prioritization (ReMaP) Task Force. The flight program has had as many as twenty-six principal investigators (PIs) in flight or flight definition stage, with the numbers of PIs in the future dependent on the results of the ReMaP Task Force and internal reviews. Each project has a NASA-appointed Project Scientist, considered a half-time job, who assists the PI in understanding and preparing for internal reviews such as the Science Concept Review and Requirements Definition Review. The Project Scientist also insures that the PI gets the maximum science support from MSFC, represents the PI to the MSFC community, and collaborates with the Project Manager to insure the project is well-supported and remains vital. Currently available flight equipment includes the Materials Science Research Rack (MSRR-1) and Microgravity Science Glovebox. Ground based projects fall into one or more of several categories. Intellectual Underpinning of Flight Program projects include theoretical studies backed by modeling and computer simulations; bring to maturity new research, often by young researchers, and may include preliminary short duration low gravity experiments in the KC-135 aircraft or drop tube; enable characterization of data sets from previous flights; and provide thermophysical property determinations to aid PIs. Radiation Shielding and preliminary In Situ Resource Utilization (ISRU) studies work towards future long duration missions. Biomaterials support materials issues affecting crew health. Nanostructured Materials are currently considered to be maturing new research, and Advanced Materials for Space Transportation has as yet no PIs. PIs are assigned a NASA Technical Monitor to maintain contact, a position considered to be a 5 percent per PI effort. Currently 33 PIs are supported on the 1996 NRA, which is about to expire, and 59 on the 1998 NRA. Two new NRAs, one for Radiation Shielding and one for Materials Science for Advanced Space Propulsion are due to be announced by the 2003 fiscal year. MSFC has a number of facilities supporting materials science. These include the Microgravity Development Laboratory/SD43; Electrostatic Levitator Facility; SCN Purification Facility; Electron Microscope/Microprobe Facility; Static and Rotating Magnetic Field Facility; X-Ray Diffraction Facility; and the Furnace Development Laboratory.

Source record↗

Parallel DSMC Solution of Three-Dimensional Flow Over a Finite Flat Plate

This paper describes a parallel implementation of the direct simulation Monte Carlo (DSMC) method. Runtime library support is used for scheduling and execution of communication between nodes, and domain decomposition is performed dynamically to maintain a good load balance. Performance tests are conducted using the code to evaluate various remapping and remapping-interval policies, and it is shown that a one-dimensional chain-partitioning method works best for the problems considered. The parallel code is then used to simulate the Mach 20 nitrogen flow over a finite-thickness flat plate. It is shown that the parallel algorithm produces results which compare well with experimental data. Moreover, it yields significantly faster execution times than the scalar code, as well as very good load-balance characteristics.

Nance, Robert P.↗

Postprocessing classification images

Program cleans up remote-sensing maps. It can be used with existing image-processing software. Remapped images closely resemble familiar resource information maps and can replace or supplement classification images not postprocessed by this program.

Kan, E. P.↗

Stereographic observations from geosynchronous satellites - An important new tool for the atmospheric sciences

Observations of cloud geometry using scan-synchronized stereo geostationary satellites having images with horizontal spatial resolution of approximately 0.5 km, and temporal resolution of up to 3 min are presented. The stereo does not require a cloud with known emissivity to be in equilibrium with an atmosphere with a known vertical temperature profile. It is shown that absolute accuracies of about 0.5 km are possible. Qualitative and quantitative representations of atmospheric dynamics were shown by remapping, display, and stereo image analysis on an interactive computer/imaging system. Applications of stereo observations include: (1) cloud top height contours of severe thunderstorms and hurricanes, (2) cloud top and base height estimates for cloud-wind height assignment, (3) cloud growth measurements for severe thunderstorm over-shooting towers, (4) atmospheric temperature from stereo heights and infrared cloud top temperatures, and (5) cloud emissivity estimation. Recommendations are given for future improvements in stereo observations, including a third GOES satellite, operational scan synchronization of all GOES satellites and better resolution sensors.

Hasler, A. F.↗