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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

Photogrammetric aspects of remapping procedures

Photogrammetric control generation is discussed. Techniques in remote sensing data reduction are described. Emphasis is placed on methods of rectification of aerial photography and frame photography. Examples of multispectral band scanner data that were processed are presented.

Mikhail, E. M.↗
NASA NTRS1987

Optimal pre-scheduling of problem remappings

A large class of scientific computational problems can be characterized as a sequence of steps where a significant amount of computation occurs each step, but the work performed at each step is not necessarily identical. Two good examples of this type of computation are: (1) regridding methods which change the problem discretization during the course of the computation, and (2) methods for solving sparse triangular systems of linear equations. Recent work has investigated a means of mapping such computations onto parallel processors; the method defines a family of static mappings with differing degrees of importance placed on the conflicting goals of good load balance and low communication/synchronization overhead. The performance tradeoffs are controllable by adjusting the parameters of the mapping method. To achieve good performance it may be necessary to dynamically change these parameters at run-time, but such changes can impose additional costs. If the computation's behavior can be determined prior to its execution, it can be possible to construct an optimal parameter schedule using a low-order-polynomial-time dynamic programming algorithm. Since the latter can be expensive, the performance is studied of the effect of a linear-time scheduling heuristic on one of the model problems, and it is shown to be effective and nearly optimal.

Nicol, David M.↗
NASA NTRS1991

Improved Remapping Processor For Digital Imagery

Proposed digital image processor improved version of Programmable Remapper, which performs geometric and radiometric transformations on digital images. Features include overlapping and variably sized preimages. Overcomes some of limitations of image-warping circuit boards implementing only those geometric tranformations expressible in terms of polynomials of limited order. Also overcomes limitations of existing Programmable Remapper and made to perform transformations at video rate.

Fisher, Timothy E.↗
NASA NTRS1996

Clinical Verification of Image Warping as a Potential Aid for the Visually Handicapped

The bulk of this research was to designed determine potential of the Programmable Remapper (PR) as a device to enhance vision for the visually handicapped. This research indicated that remapping would have potential as a low vision device if the eye position could be monitored with feedback to specify the proper location of the remapped image. This must be accomplished at high rate so that there is no lag of the image behind the eye position. Since at this time, there is no portable eye monitor device (at a reasonable cost) that will operate under the required conditions, it would not be feasible to continue with remapping experiments for patients with central field defects. However, since patients with peripheral field defects do not have the same eye positioning requirements, they may indeed benefit from this technology. Further investigations must be performed to determine plausibility of this application of remapping.

Loshin, David↗
NASA NTRS2003

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↗
NASA NTRS2001

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↗
DOE OSTI2024

Optimization-based, property-preserving algorithm for passive tracer transport

Here we present a new optimization-based property-preserving algorithm for passive tracer transport. The algorithm utilizes a semi-Lagrangian approach based on incremental remapping of the mass and the total tracer. However, unlike traditional semi-Lagrangian schemes, which remap the density and the tracer mixing ratio through monotone reconstruction or flux correction, we utilize an optimization-based remapping that enforces conservation and local bounds as optimization constraints. In so doing we separate accuracy considerations from preservation of physical properties to obtain a conservative, second-order accurate transport scheme that also has a notion of optimality. Moreover, we prove that the optimization-based algorithm preserves linear relationships between tracer mixing ratios. We illustrate the properties of the new algorithm using a series of standard tracer transport test problems in a plane and on a sphere.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Conservative high-order data transfer method on generalized polygonal meshes

A conservative data transfer (remap) between two meshes is an important step of arbitrary Lagrangian-Eulerian (ALE) hydrodynamics simulations. High-order numerical methods for ALE simulations require both high-order (curvilinear) meshes and high-order remap algorithms. Here we develop a conservative and bounds-preserving method for accurate remapping of discrete fields on generalized polygonal meshes with curvilinear edges. The properties of the proposed method are studied theoretically and numerically for various (smooth and non-smooth) mesh deformations and discrete fields that represent smooth and discontinuous functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Divergence Reduction in Monte Carlo Neutron Transport with On-GPU Asynchronous Scheduling

While Monte Carlo Neutron Transport (MCNT) is near-embarrasingly parallel, the effectively unpredictable lifetime of neutrons can lead to divergence when MCNT is evaluated on GPUs. Divergence is the phenomenon of adjacent threads in a warp executing different control flow paths; on GPUS, it reduces performance because each work group may only execute one path at a time. The process of Thread Data Remapping (TDR) resolves these discrepancies by moving data across hardware such that data in the same warp will be processed through similar paths. A common issue among prior implementations of TDR is the synchronous nature of its remapping and processing cycles, which exhaustively sort data produced by prior processing passes and exhaustively evaluate the sorted data. In another work, we defined a method of remapping data through an asynchronous scheduler which allows for work to be stored in shared memory and deferred arbitrarily until that work is a viable option for low-divergence evaluation. This article surveys a wider set of cases, with the goal of characterizing performance trends across a more comprehensive set of parameters. These parameters include cross sections of scattering/capturing/fission, use of implicit capture, source neutron counts, simulation time spans, and tuned memory allocations. Across these cases, we have recorded minimum and average execution times, as well as a heuristically tuned near-optimal memory allocation size for both synchronous and asynchronous scheduling. Across the collected data, it is shown that the asynchronous method is faster and more memory efficient in the majority of cases, and that it requires less tuning to achieve competitive performance.

Computer Science↗