Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “function 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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Foliar functional traits from imaging spectroscopy across biomes in eastern North America

Summary Foliar functional traits are widely used to characterize leaf and canopy properties that drive ecosystem processes and to infer physiological processes in Earth system models. Imaging spectroscopy provides great potential to map foliar traits to characterize continuous functional variation and diversity, but few studies have demonstrated consistent methods for mapping multiple traits across biomes. With airborne imaging spectroscopy data and field data from 19 sites, we developed trait models using partial least squares regression, and mapped 26 foliar traits in seven NEON (National Ecological Observatory Network) ecoregions (domains) including temperate and subtropical forests and grasslands of eastern North America. Model validation accuracy varied among traits (normalized root mean squared error, 9.1–19.4%; coefficient of determination, 0.28–0.82), with phenolic concentration, leaf mass per area and equivalent water thickness performing best across domains. Across all trait maps, 90% of vegetated pixels had reasonable values for one trait, and 28–81% provided high confidence for multiple traits concurrently. Maps of 26 traits and their uncertainties for eastern US NEON sites are available for download, and are being expanded to the western United States and tundra/boreal zone. These data enable better understanding of trait variations and relationships over large areas, calibration of ecosystem models, and assessment of continental‐scale functional diversity.

Wang, Zhihui↗
NASA NTRS2010

A Survey of Health Management User Objectives Related to Diagnostic and Prognostic Metrics

One of the most prominent technical challenges to effective deployment of health management systems is the vast difference in user objectives with respect to engineering development. In this paper, a detailed survey on the objectives of different users of health management systems is presented. These user objectives are then mapped to the metrics typically encountered in the development and testing of two main systems health management functions: diagnosis and prognosis. Using this mapping, the gaps between user goals and the metrics associated with diagnostics and prognostics are identified and presented with a collection of lessons learned from previous studies that include both industrial and military aerospace applications.

Wheeler, Kevin R.↗
DOE OSTI2017

KINETIC TOMOGRAPHY. I. A METHOD FOR MAPPING THE MILKY WAY’S INTERSTELLAR MEDIUM IN FOUR DIMENSIONS

We have developed a method for deriving the distribution of the Milky Way’s interstellar medium as a function of longitude, latitude, distance, and line-of-sight velocity. This method takes as input maps of reddening as a function of longitude, latitude, distance, and maps of line emission as a function of longitude, latitude, and line-of-sight velocity. We have applied this method to data sets covering much of the Galactic plane. The output of this method correctly reproduces the line-of-sight velocities of high-mass star-forming regions with known distances from Reid et al. and qualitatively agrees with results from the Milky Way kinematics literature. These maps will be useful for measuring flows of gas around the Milky Way’s spiral arms and into and out of giant molecular clouds.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Medium amplitude parallel superposition (MAPS) rheology. Part 2: Experimental protocols and data analysis

An experimental protocol is developed to directly measure the new material functions revealed by medium amplitude parallel superposition (MAPS) rheology. This protocol measures the medium amplitude response of a material to a simple shear deformation composed of three sine waves at different frequencies, revealing a rich dataset consisting of up to 19 measurements of the third-order complex modulus at distinct three-frequency coordinates. We discuss how the choice of input frequencies influences the features of the MAPS domain studied by the experiment. A polynomial interpolation method for reducing the bias of measured values from spectral leakage and reducing variance due to noise is discussed, including a derivation of the optimal range of amplitudes for the input signal. This leads to the conclusion that conducting the experiment in a stress-controlled fashion possesses a distinct advantage to the strain-controlled mode. The experimental protocol is demonstrated through measurements of the MAPS response of a model complex fluid: a surfactant solution of wormlike micelles. The resulting dataset is indeed large and feature-rich, while still acquired in a time comparable to similar medium amplitude oscillatory shear (MAOS) experiments. We demonstrate that the data represent measurements of an intrinsic material function by studying its internal consistency, compatibility with low-frequency predictions for Coleman–Noll simple fluids, and agreement with data obtained via MAOS amplitude sweeps. Finally, the data are compared to predictions from the corotational Maxwell model to demonstrate the power of MAPS rheology in determining whether a constitutive model is consistent with a material’s time-dependent response.

Lennon, Kyle R. (ORCID:0000000212515461)↗
DOE OSTI2017

Transmutation of a trans-series: the Gross-Witten-Wadia phase transition

We study the change in the resurgent asymptotic properties of a trans-series in two parameters, a coupling g 2 and a gauge index N , as a system passes through a large N phase transition, using the universal example of the Gross-Witten-Wadia third-order phase transition in the unitary matrix model. This transition is well-studied in the immediate vicinity of the transition point, where it is characterized by a double-scaling limit Painlevé II equation, and also away from the transition point using the pre-string difference equation. Here we present a complementary analysis of the transition at all coupling and all finite N , in terms of a differential equation, using the explicit Tracy-Widom mapping of the Gross-Witten-Wadia partition function to a solution of a Painlevé III equation. This mapping provides a simple method to generate trans-series expansions in all parameter regimes, and to study their transmutation as the parameters are varied. For example, at any finite N the weak coupling expansion is divergent, with a non-perturbative trans-series completion; on the other hand, the strong coupling expansion is convergent, and yet there is still a non-perturbative trans-series completion. We show how the different instanton terms ‘condense’ at the transition point to match with the double-scaling limit trans-series. Furthermore, we also define a uniform large N strong-coupling expansion (a non-linear analogue of uniform WKB), which is much more precise than the conventional large N expansion through the transition region, and apply it to the evaluation of Wilson loops.

1/N Expansion↗
DOE OSTI2015

Asymmetric projections of the arcuate fasciculus to the temporal cortex underlie lateralized language function in the human brain

The arcuate fasciculus (AF) in the human brain has asymmetric structural properties. However, the topographic organization of the asymmetric AF projections to the cortex and its relevance to cortical function remain unclear. Here we mapped the posterior projections of the human AF in the inferior parietal and lateral temporal cortices using surface-based structural connectivity analysis based on diffusion MRI and investigated their hemispheric differences. We then performed the cross-modal comparison with functional connectivity based on resting-state functional MRI (fMRI) and task-related cortical activation based on fMRI using a semantic classification task of single words. Structural connectivity analysis showed that the left AF connecting to Broca's area predominantly projected in the lateral temporal cortex extending from the posterior superior temporal gyrus to the mid part of the superior temporal sulcus and the middle temporal gyrus, whereas the right AF connecting to the right homolog of Broca's area predominantly projected to the inferior parietal cortex extending from the mid part of the supramarginal gyrus to the anterior part of the angular gyrus. The left-lateralized projection regions of the AF in the left temporal cortex had asymmetric functional connectivity with Broca's area, indicating structure-function concordance through the AF. During the language task, left-lateralized cortical activation was observed. Among them, the brain responses in the temporal cortex and Broca's area that were connected through the left-lateralized AF pathway were specifically correlated across subjects. These results suggest that the human left AF, which structurally and functionally connects the mid temporal cortex and Broca's area in asymmetrical fashion, coordinates the cortical activity in these remote cortices during a semantic decision task. As a result, the unique feature of the left AF is discussed in the context of the human capacity for language.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Compressive Neural Representations of Volumetric Scalar Fields

Here, we present an approach for compressing volumetric scalar fields using implicit neural representations. Our approach represents a scalar field as a learned function, wherein a neural network maps a point in the domain to an output scalar value. By setting the number of weights of the neural network to be smaller than the input size, we achieve compressed representations of scalar fields, thus framing compression as a type of function approximation. Combined with carefully quantizing network weights, we show that this approach yields highly compact representations that outperform state-of-the-art volume compression approaches. The conceptual simplicity of our approach enables a number of benefits, such as support for time-varying scalar fields, optimizing to preserve spatial gradients, and random-access field evaluation. We study the impact of network design choices on compression performance, highlighting how simple network architectures are effective for a broad range of volumes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

The standard operating procedure of the DOE-JGI Metagenome Annotation Pipeline (MAP v.4)

Abstract The DOE-JGI Metagenome Annotation Pipeline (MAP v.4) performs structural and functional annotation for metagenomic sequences that are submitted to the Integrated Microbial Genomes with Microbiomes (IMG/M) system for comparative analysis. The pipeline runs on nucleotide sequences provided via the IMG submission site. Users must first define their analysis projects in GOLD and then submit the associated sequence datasets consisting of scaffolds/contigs with optional coverage information and/or unassembled reads in fasta and fastq file formats. The MAP processing consists of feature prediction including identification of protein-coding genes, non-coding RNAs and regulatory RNAs, as well as CRISPR elements. Structural annotation is followed by functional annotation including assignment of protein product names and connection to various protein family databases.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Quantization: History and problems

In this work, I explore the concept of quantization as a mapping from classical phase space functions to quantum operators. I discuss the early history of this notion of quantization with emphasis on the works of Schrödinger and Dirac, and how quantization fit into their overall understanding of quantum theory in the 1920's. Dirac, in particular, proposed a quantization map which should satisfy certain properties, including the property that quantum commutators should be related to classical Poisson brackets in a particular way. However, in 1946, Groenewold proved that Dirac's mapping was inconsistent, making the problem of defining a rigorous quantization map more elusive than originally expected. This result, known as the Groenewold-Van Hove theorem, is not often discussed in physics texts, but here I will give an account of the theorem and what it means for potential ``corrections” to Dirac's scheme. Other proposals for quantization have arisen over the years, the first major one being that of Weyl in 1927, which was later developed by many, including Groenewold, and which has since become known as Weyl Quantization in the mathematical literature. Another, known as Geometric Quantization, formulates quantization in differential-geometric terms by appealing to the character of classical phase spaces as symplectic manifolds; this approach began with the work of Souriau, Kostant, and Kirillov in the 1960's. I will describe these proposals for quantization and comment on their relation to Dirac's original program. Along the way, the problem of operator ordering and of quantizing in curvilinear coordinates will be described, since these are natural questions that immediately present themselves when thinking about quantization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1989

Efficient mapping algorithms for scheduling robot inverse dynamics computation on a multiprocessor system

Two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p identical homogeneous processors with processor and communication costs to achieve minimum computation time are presented. An objective function is defined in terms of the sum of the processor finishing time and the interprocessor communication time. The minimax optimization is performed on the objective function to obtain the best mapping. This mapping problem can be formulated as a combination of the graph partitioning and the scheduling problems; both have been known to be NP-complete. Thus, to speed up the searching for a solution, two heuristic algorithms were proposed to obtain fast but suboptimal mapping solutions. The first algorithm utilizes the level and the communication intensity of the task modules to construct an ordered priority list of ready modules and the module assignment is performed by a weighted bipartite matching algorithm. For a near-optimal mapping solution, the problem can be solved by the heuristic algorithm with simulated annealing. These proposed optimization algorithms can solve various large-scale problems within a reasonable time. Computer simulations were performed to evaluate and verify the performance and the validity of the proposed mapping algorithms. Finally, experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithms. Computer simulation and experimental results are compared and discussed.

Lee, C. S. G.↗
DOE OSTI2025

Foaming prediction in pure liquids from dimensionless numbers inspired by the theory of fluid behavior for drops

Foaming prediction is critical for selecting materials and designing processes in industries such as bioprocessing and gas processing. Existing models lack the generality needed for a wide range of materials and overlook the foaming behavior in pure liquids. Here, this work presents a novel method for predicting foaming in pure liquids based on their density, surface tension, and viscosity, using Reynolds ( Re ) and Ohnesorge ( Oh ) numbers. A foaming prediction map, leveraging the theory of fluid drop behavior, was developed by plotting these numbers. This map delineates distinct non-foaming and foaming regions, functioning as a binary classifier for foaming predictions. The map was fitted and validated through shake test experiments on 46 liquids, demonstrating reliable predictions, except for a specific region characterized by small Oh and large Re numbers. This region corresponded to relatively low foam stability and high turbulence, making foaming predictions challenging for liquids in this category.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Dynamic recrystallization of a wrought magnesium alloy: Grain size and texture maps and their application for mechanical behavior predictions

Effect of dynamic recrystallization (DRX) on the grain refinement and texture modification was studied by conducting a series of hot compression on AZ31B Mg alloy. Processing-grain size-texture maps were established as a function of temperature, strain rate, strain, and the Zener-Hollomon parameter (Z). Moreover, influence of simultaneous changes in the grain size and texture on tensile yield strength and ductility of the hot-worked Mg alloy was studied using the grain size and texture maps established. The processing-grain size map showed that the DRX grain size decreased with the increase in Z, also revealing various characteristics ranging from a grain growth, grain refinement, to a bimodal distribution of ultrafine grains and partially recrystallized grains. The effect of twinning on the grain refinement was also evident at high Z conditions. The processing-texture map revealed that the initial fiber texture was altered significantly to a shear, off-normal, or extension-twin texture with the increase in Z. The Schmid-factor maps were calculated to identify a dominant deformation mode during a subsequent tensile deformation of the hot-worked samples. Finally, a corresponding Hall-Petch relationship for each dominant deformation mode was used to establish tensile yield-strength maps, which agree well with the measured data.

36 MATERIALS SCIENCE↗
NASA NTRS1990

On the periodicity of symbolic observations of piecewise smooth discrete-time systems

A study is made of the behavior of discrete-time systems composed of a set of smooth transition maps coupled by a quantized feedback function. The feedback function partitions the state space into disjoint regions and assigns a smooth transition function to each region. The main result is that under a constraint on the norm of the derivative of the transition maps, a bounded state trajectory with limit points in the interior of the switching regions leads to a region index sequence that is eventually periodic. Under these assumptions, it is shown that eventually the feedback function is determined by a finite state automaton. A similar result is proved in the case of finite state dynamic feedback.

Ramadge, Peter J.↗
DOE OSTI2019

Consistent spatial expansion functions on hexagonal surfaces for use in radiation transport methods

Some of the radiation transport solvers that are based on expansion function methods in hexagonal geometry generally use projection techniques that transform the spatial dependence of the angular flux in hexagonal geometry to Cartesian geometry by mapping and then expanding in terms of expansion functions (e.g., Legendre polynomials). However, this approach usually requires a relatively higherorder expansion in space for accurate representation of the spatial distribution of the flux. To overcome this limitation, a set of consistent spatial expansion functions have been developed in hexagonal geometry in this paper. These functions satisfy the orthogonality condition on hexagonal surfaces and guarantee the conservation of currents after expansion regardless of the truncation order. The latter is an important property for preservation of neutron balance. The new spatial expansion method has been implemented into the coarse mesh radiation transport (COMET) code and tested in both the single assembly and the full core Advanced High Temperature Reactor (AHTR) benchmark problems. The eigenvalues and assembly-averaged and stripe-wise fission density distributions predicted by the new method with 2nd order spatial expansion functions were found to exhibit similar accuracy as those computed by the current mapping method with 4th order spatial expansion functions. This indicates that the angular fluxes in AHTRs can be predominantly represented by a low order expansion if the new spatial expansion functions are used. As a result, to maintain the same accuracy, the computational efficiency of COMET is improved significantly (2–5 times) by using the new spatial expansion method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2013

Template-based CTA to x-ray angio rigid registration of coronary arteries in frequency domain with automatic x-ray segmentation

Purpose: A key challenge for image guided coronary interventions is accurate and absolutely robust image registration bringing together preinterventional information extracted from a three-dimensional (3D) patient scan and live interventional image information. In this paper, the authors present a novel scheme for 3D to two-dimensional (2D) rigid registration of coronary arteries extracted from preoperative image scan (3D) and a single segmented intraoperative x-ray angio frame in frequency and spatial domains for real-time angiography interventions by C-arm fluoroscopy.Methods: Most existing rigid registration approaches require a close initialization due to the abundance of local minima and high complexity of search algorithms. The authors' method eliminates this requirement by transforming the projections into translation-invariant Fourier domain for estimating the 3D pose. For 3D rotation recovery, template Digitally Reconstructed Radiographs (DRR) as candidate poses of 3D vessels of segmented computed tomography angiography are produced by rotating the camera (image intensifier) around the DICOM angle values with a specific range as in C-arm setup. The authors have compared the 3D poses of template DRRs with the segmented x-ray after equalizing the scales in three domains, namely, Fourier magnitude, Fourier phase, and Fourier polar. The best rotation pose candidate was chosen by one of the highest similarity measures returned by the methods in these domains. It has been noted in literature that frequency domain methods are robust against noise and occlusion which was also validated by the authors' results. 3D translation of the volume was then recovered by distance-map based BFGS optimization well suited to convex structure of the authors' objective function without local minima due to distance maps. A novel automatic x-ray vessel segmentation was also performed in this study.Results: Final results were evaluated in 2D projection space for patient data; and with ground truth values and landmark distances for the images acquired with a solid phantom vessel. Results validate that rotation recovery in frequency domain is robust against differences in segmentations in two modalities. Distance-map translation is successful in aligning coronary trees with highest possible overlap.Conclusions: Numerical and qualitative results show that single view rigid alignment in projection space is successful. This work can be extended with multiple views to resolve depth ambiguity and with deformable registration to account for nonrigid motion in patient data.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2012

Subdifferential of Optimal Value Functions in Nonlinear Infinite Programming

This paper presents an exact formula for computing the normal cones of the constraint set mapping including the Clarke normal cone and the Mordukhovich normal cone in infinite programming under the extended Mangasarian-Fromovitz constraint qualification condition. Then, we derive an upper estimate as well as an exact formula for the limiting subdifferential of the marginal/optimal value function in a general Banach space setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2012

Mapping Dense LU Factorization on Multicore Supercomputer Nodes

Dense LU factorization is a prominent benchmark used to rank the performance of supercomputers. Many implementations use block-cyclic distributions of matrix blocks onto a two-dimensional process grid. The process grid dimensions drive a trade-off between communication and computation and are architecture- and implementation-sensitive. The critical panel factorization steps can be made less communication-bound by overlapping asynchronous collectives for pivoting with the computation of rank-k updates. By shifting the computation-communication trade-off, a modified block-cyclic distribution can beneficially exploit more available parallelism on the critical path, and reduce panel factorization's memory hierarchy contention on now-ubiquitous multicore architectures. During active panel factorization, rank-1 updates stream through memory with minimal reuse. In a column-major process grid, the performance of this access pattern degrades as too many streaming processors contend for access to memory. A block-cyclic mapping in the row-major order does not encounter this problem, but consequently sacrifices node and network locality in the critical pivoting steps. We introduce 'striding' to vary between the two extremes of row- and column-major process grids. The maximum available parallelism in the critical path work (active panel factorization, triangular solves, and subsequent broadcasts) is bounded by the length or width of the process grid. Increasing one dimension of the process grid decreases the number of distinct processes and nodes in the other dimension. To increase the harnessed parallelism in both dimensions, we start with a tall process grid. We then apply periodic 'rotation' to this grid to restore exploited parallelism along the row to previous levels. As a test-bed for further mapping experiments, we describe a dense LU implementation that allows a block distribution to be defined as a general function of block to processor. Other mappings can be tested wit...

Computer Science↗
DOE OSTI2012

Dense LU Factorization on Multicore Supercomputer Nodes

Dense LU factorization is a prominent benchmark used to rank the performance of supercomputers. Many implementations, including the reference code HPL, use block-cyclic distributions of matrix blocks onto a two-dimensional process grid. The process grid dimensions drive a trade-off between communication and computation and are architecture- and implementation-sensitive. We show how the critical panel factorization steps can be made less communication-bound by overlapping asynchronous collectives for pivot identification and exchange with the computation of rank-k updates. By shifting this trade-off, a modified block-cyclic distribution can beneficially exploit more available parallelism on the critical path, and reduce panel factorization's memory hierarchy contention on now-ubiquitous multi-core architectures. The missed parallelism in traditional block-cyclic distributions arises because active panel factorization, triangular solves, and subsequent broadcasts are spread over single process columns or rows (respectively) of the process grid. Increasing one dimension of the process grid decreases the number of distinct processes in the other dimension. To increase parallelism in both dimensions, periodic 'rotation' is applied to the process grid to recover the row-parallelism lost by a tall process grid. During active panel factorization, rank-1 updates stream through memory with minimal reuse. In a column-major process grid, the performance of this access pattern degrades as too many streaming processors contend for access to memory. A block-cyclic mapping in the more popular row-major order does not encounter this problem, but consequently sacrifices node and network locality in the critical pivoting steps. We introduce 'striding' to vary between the two extremes of row- and column-major process grids. As a test-bed for further mapping experiments, we describe a dense LU implementation that allows a block distribution to be defined as a general function of block to processor. Other mappings can be tested with only small, local changes to the code.

99 GENERAL AND MISCELLANEOUS↗