Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “TOPOLOGICAL 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 55 records · Page 3

Navier-Stokes computations for exotic airfoils

An efficient hyperbolic grid generator with improvements for handling sharp corners and concave surfaces is combined with an efficient and accurate Navier-Stokes flow solver. This combination is applied to some rather complex two-dimensional airfoil configurations. Steady separated flow about an iced leading edge of an airfoil is presented. Unsteady viscous separated flows past an airfoil at two angles of attack with a spoiler deployed at 60 degrees are presented and compared with experiment. The spoiler computations are performed with two different topological maps of the physical domain to the computational domain. Innovative graphical techniques for both the static and unsteady display of the flow fields are presented and discussed.

Barth, T. J.↗

Timber inventory using Landsat

The results of recent efforts to apply Landsat MSS imagery, in concert with topological maps, to forestry timber inventories via the FOCIS program are reported. FOCIS (Forests Classification and Inventory System) was defined for inventorying the lumber volume of coniferous tree types in rugged terrain regions. Data from four bands serve as input for unsupervised clustering and iterative labeling of the elevation, slope angle, and subregions of interest. Simulated photographic maps are generated which serve as overlays for regular maps for assessing timber harvests and sales goals. Sample procedures followed in mapping the Eldorado region forests in the Sierra Nevada mountains are discussed.

Strahler, A. H.↗

Navier-Stokes computations for exotic airfoils

A hyperbolic grid generator with improvements for handling sharp corners and concave surfaces combined with a Navier-Stokes flow solver is applied to complex two dimensional airfoil configurations. Steady separated flow about an iced leading edge of an airfoil is presented. Unsteady viscous separated flows past an airfoil at two angles of attack with a spoiler deployed at 60 deg are compared with experiment. The spoiler computations are performed with two different topological maps of the physical domain to the computational domain. Graphical techniques for the static and unsteady display of the flow fields are discussed.

Barth, T. J.↗

Three-dimensional singular points in aerodynamics

When three-dimensional separation occurs on a body immersed in a flow governed by the incompressible Navier-Stokes equations, the geometrical surfaces formed by the three vector fields (velocity, vorticity and the skin-friction) and a scalar field (pressure) become interrelated through topological maps containing their respective singular points and extremal points. A mathematically consistent description of these singular points becomes inevitable when we want to study the geometry of the separation. A separated stream surface requires, for example, the existence of a saddle-type singular point on the skin-friction surface. This singular point is actually, in the proper language of mathematics, a saddle of index two. The index is a measure of the dimension of the outset (set leaving the singular point). Hence, when a saddle of index two is specified, a two dimensional surface that becomes separated from the osculating plane of the saddle is implied. The three-dimensional singular point is interpreted mathematically and the most common aerodynamical singular points are discussed through this perspective.

Unal, Aynur↗

Joint Characterization of Vegetation by Satellite Observations from Visible to Microwave Wavelengths - A Sensitivity Analysis

This study presents an evaluation and comparison of visible, near-infrared, passive, and active microwave observations for vegetation characterization on a global basis for a year, with spatial resolution compatible with climatological studies. Visible and near-infrared observations along with the Normalized Difference Vegetation Index come from the Advanced Very High Resolution Radiometer. An atlas of monthly mean microwave land surface emissivities from 19 to 85 GHz has been calculated from the Special Sensor Microwave/Imager for a year, suppressing the atmospheric problems encountered with the use of simple channel combinations. The active microwave measurements are provided by the ERS-1 scatterometer at 5.25 GHz. The capacity to discriminate between vegetation types and to detect the vegetation phenology is assessed in the context of a vegetation classification obtained from in situ observations. A clustering technique derived from the Kohonen topological maps is used to merge the three data sets and interpret their relative variations. NDVI varies with vegetation density but is not very sensitive in semiarid environments and in forested areas. Spurious seasonal cycles and large spatial variability in several areas suggest that atmospheric contamination and/or solar zenith angle drift still affect the NDVI.

NORMALIZED DIFFERENCE VEGETATIVE INDEX↗

The topology of large-scale structure. V - Two-dimensional topology of sky maps

A 2D algorithm is applied to observed sky maps and numerical simulations. It is found that when topology is studied on smoothing scales larger than the correlation length, the topology is approximately in agreement with the random phase formula for the 2D genus-threshold density relation, G2(nu) varies as nu(e) exp-nu-squared/2. Some samples show small 'meatball shifts' similar to those seen in corresponding 3D observational samples and similar to those produced by biasing in cold dark matter simulations. The observational results are thus consistent with the standard model in which the structure in the universe today has grown from small fluctuations caused by random quantum noise in the early universe.

Gott, J. R., III↗

Replays of spatial memories suppress topological fluctuations in cognitive map

The spiking activity of the hippocampal place cells plays a key role in producing and sustaining an internalized representation of the ambient space—a cognitive map. These cells do not only exhibit location-specific spiking during navigation, but also may rapidly replay the navigated routs through endogenous dynamics of the hippocampal network. Physiologically, such reactivations are viewed as manifestations of “memory replays” that help to learn new information and to consolidate previously acquired memories by reinforcing synapses in the parahippocampal networks. Below we propose a computational model of these processes that allows assessing the effect of replays on acquiring a robust topological map of the environment and demonstrate that replays may play a key role in stabilizing the hippocampal representation of space.

60 APPLIED LIFE SCIENCES↗

Dependence of Coronary 3-Dimensional Dose Maps on Coronary Topologies and Beam Set in Breast Radiation Therapy: A Study Based on CT Angiographies

Purpose: In left-side breast radiation therapy (RT), doses to the left main (LM) and left anterior descending (LAD) coronary arteries are usually assessed after delineation by prior anatomic knowledge on the treatment planning computed tomography (CT) scan. In this study, dose sensitivity due to interindividual coronary topology variation was assessed, and hot spots were located. Methods and Materials: Twenty-two detailed heart models, created from heart computed tomography angiographies, were fitted into a single representative female thorax. Two breast RT protocols were then simulated into a treatment planning system: the first protocol comprised tangential and tumoral bed beams (TGs{sub T}B) at 50 + 16 Gy, the second protocol added internal mammary chain beams at 50 Gy to TGs{sub T}B (TGs{sub T}B{sub I}MC). For the heart, the LAD, and the LM, several dose indicators were calculated: dose-volume histograms, mean dose (D{sub mean}), minimal dose received by the most irradiated 2% of the volume (D{sub 2%}), and 3-dimensional (3D) dose maps. Variations of these indicators with anatomies were studied. Results: For the LM, the intermodel dispersion of D{sub mean} and D{sub 2%} was 10% and 11%, respectively, with TGs{sub T}B and 40% and 80%, respectively, with TGs{sub T}B{sub I}MC. For the LAD, these dispersions were 19% (D{sub mean}) and 49% (D{sub 2%}) with TGs{sub T}B and 35% (D{sub mean}) and 76% (D{sub 2%}) with TGs{sub T}B{sub I}MC. The 3D dose maps revealed that the internal mammary chain beams induced hot spots between 20 and 30 Gy on the LM and the proximal LAD for some coronary topologies. Without IMC beams, hot spots between 5 and 26 Gy are located on the middle and distal LAD. Conclusions: Coronary dose distributions with hot spot location and dose level can change significantly depending on coronary topology, as highlighted by 3D coronary dose maps. In clinical practice, coronary imaging may be required for a relevant coronary dose assessment, especially in cases of internal mammary chain irradiation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Communication Characterization and Optimization of Applications Using Topology-Aware Task Mapping on Large Supercomputers

On large supercomputers, the job scheduling systems may assign a non-contiguous node allocation for user applications depending on available resources. With parallel applications using MPI (Message Passing Interface), the default process ordering does not take into account the actual physical node layout available to the application. This contributes to non-locality in terms of physical network topology and impacts communication performance of the application. In order to mitigate such performance penalties, this work describes techniques to identify suitable task mapping that takes the layout of the allocated nodes as well as the application's communication behavior into account. During the first phase of this research, we instrumented and collected performance data to characterize communication behavior of critical US DOE (United States - Department of Energy) applications using an augmented version of the mpiP tool. Subsequently, we developed several reordering methods (spectral bisection, neighbor join tree etc.) to combine node layout and application communication data for optimized task placement. We developed a tool called mpiAproxy to facilitate detailed evaluation of the various reordering algorithms without requiring full application executions. This work presents a comprehensive performance evaluation (14,000 experiments) of the various task mapping techniques in lowering communication costs on Titan, the leadership class supercomputer at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗

Communication Characterization and Optimization of Applications Using Topology-Aware Task Mapping on Large Supercomputers

On large supercomputers, the job scheduling systems may assign a non-contiguous node allocation for user applications depending on available resources. With parallel applications using MPI (Message Passing Interface), the default process ordering does not take into account the actual physical node layout available to the application. This contributes to non-locality in terms of physical network topology and impacts communication performance of the application. In order to mitigate such performance penalties, this work describes techniques to identify suitable task mapping that takes the layout of the allocated nodes as well as the application's communication behavior into account. During the first phase of this research, we instrumented and collected performance data to characterize communication behavior of critical US DOE (United States - Department of Energy) applications using an augmented version of the mpiP tool. Subsequently, we developed several reordering methods (spectral bisection, neighbor join tree etc.) to combine node layout and application communication data for optimized task placement. We developed a tool called mpiAproxy to facilitate detailed evaluation of the various reordering algorithms without requiring full application executions. This work presents a comprehensive performance evaluation (14,000 experiments) of the various task mapping techniques in lowering communication costs on Titan, the leadership class supercomputer at Oak Ridge National Laboratory.

Sreepathi, Sarat↗

Mapping to Irregular Torus Topologies and Other Techniques for Petascale Biomolecular Simulation, In: SC '14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis

Currently deployed petascale supercomputers typically use toroidal network topologies in three or more dimensions. While these networks perform well for topology-agnostic codes on a few thousand nodes, leadership machines with 20,000 nodes require topology awareness to avoid network contention for communication-intensive codes. Topology adaptation is complicated by irregular node allocation shapes and holes due to dedicated input/output nodes or hardware failure. In the context of the popular molecular dynamics program NAMD, we present methods for mapping a periodic 3-D grid of fixed-size spatial decomposition domains to 3-D Cray Gemini and 5-D IBM Blue Gene/Q toroidal networks to enable hundred-million atom full machine simulations, and to similarly partition node allocations into compact domains for smaller simulations using multiple copy algorithms. Additional enabling techniques are discussed and performance is reported for NCSA Blue Waters, ORNL Titan, ANL Mira, TACC Stampede, and NERSC Edison.

Computer Science↗

Adaptive Neuron Model: An architecture for the rapid learning of nonlinear topological transformations

A method for the rapid learning of nonlinear mappings and topological transformations using a dynamically reconfigurable artificial neural network is presented. This fully-recurrent Adaptive Neuron Model (ANM) network was applied to the highly degenerate inverse kinematics problem in robotics, and its performance evaluation is bench-marked. Once trained, the resulting neuromorphic architecture was implemented in custom analog neural network hardware and the parameters capturing the functional transformation downloaded onto the system. This neuroprocessor, capable of 10(exp 9) ops/sec, was interfaced directly to a three degree of freedom Heathkit robotic manipulator. Calculation of the hardware feed-forward pass for this mapping was benchmarked at approximately 10 microsec.

Tawel, Raoul↗

A Flexible Forwarding Scheme to Improve Latency-Bound Irregular P2P Communication in MPI

We propose an algorithm to efficiently perform latency-bound communication scenarios that consist of many small messages. In these parallel scenarios, processes typically pass around a lot of small-sized messages of a few KBs of size. Performing communication operations with P2P MPI routines or collective MPI routines (including neighborhood collectives) in such scenarios may not always yield the optimal results and may not resolve the latency bottleneck. To this end, we develop a regular structure called virtual process topology (VPT) on which the messages can be communicated in a structured and controlled manner. Using parameters of this topology, one can tune the rate of aggression in tackling the latency costs. We demonstrate that our communication algorithm is preferable to MPI P2P and collective routines for latency-bound communication and it can easily be adapted only by replacing calls to MPI routines in a parallel application. We show how to adapt existing topology-aware mapping heuristics to address the volume overhead due to communicating messages on the VPT. Moreover, we propose a novel swap-based mapping heuristic to address this overhead by optimizing the maximum volume handled by a process. Experiments on synthetic communication graphs as well as real-world applications such as parallel Canonical Polyadic sparse tensor decomposition and parallel sparse matrix-dense matrix multiplication show that our approach is a powerful way of overcoming the bottlenecks posed by sparse and latency-bound irregular communication.

communication algorithm↗

Performance analysis of distributed symmetric sparse matrix vector multiplication algorithm for multi-core architectures

In this article, sparse matrix vector multiply (SpMVM) is an important kernel that frequently arises in high performance computing applications. Due to its low arithmetic intensity, several approaches have been proposed in literature to improve its scalability and efficiency in large scale computations. In this paper, our target systems are high end multi-core architectures and we use messaging passing interface + open multiprocessing hybrid programming model for parallelism. We analyze the performance of recently proposed implementation of the distributed symmetric SpMVM, originally developed for large sparse symmetric matrices arising in ab initio nuclear structure calculations. We also study important features of this implementation and compare with previously reported implementations that do not exploit underlying symmetry. Our SpMVM implementations leverage the hybrid paradigm to efficiently overlap expensive communications with computations. Our main comparison criterion is the "CPU core hours" metric, which is the main measure of resource usage on supercomputers. We analyze the effects of topology-aware mapping heuristic using simplified network load model. Furthermore, we have tested the different SpMVM implementations on two large clusters with 3D Torus and Dragonfly topology. Our results show that the distributed SpMVM implementation that exploits matrix symmetry and hides communication yields the best value for the "CPU core hours" metric and significantly reduces data movement overheads.

97 MATHEMATICS AND COMPUTING↗

Bounds for the moduli of continuity for conformal mappings of domains near their accessible boundary arcs

The paper presents bounds for the moduli of continuity {omega}(f, G-bar ,{delta}) of conformal mappings w=f(z) of a bounded simply connected domain G with an arbitrary Jordan boundary onto a bounded simply connected domain with an arbitrary Jordan boundary, the 'quality' of boundaries being taken into account. For a Jordan curve (simple arc or a closed contour), its quality is characterized in general by its modulus of oscillation, and if it has finite length, by a more sensitive modulus of rectifiability-these purely metric concepts were introduced by the author in 1996. Theorems on the behaviour of conformal mappings of simply connected domains of arbitrary nature near open accessible boundary arcs are established. Bibliography: 18 titles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗