SEARCH · Engineering Papers

Results for “Partitioning”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

NASA NTRS1998

Element Partitioning Constraints on Formation and Composition of the Earth's Core

Element partitioning study provides a number of constraints on the formation and composition of the core. First, partitioning of siderophile elements between the core and mantle should explain the "excess" siderophile elements in the mantle. Second, partitioning of light element(s) between the core and mantle should supply the core with the right amount of light element(s) to account for the density deficit in the core. Third, partitioning of light element(s) between the inner and outer core should be consistent with the observed difference in density deficits (relative to pure Fe) between these two reservoirs. In this study, high-pressure and high-temperature experiments have been conducted to investigate the pressure, temperature, and composition effects on partitioning of siderophile elements Ni and Co between core-forming Fe alloy and mantle silicate melt and minerals, partitioning of light elements S, O, and Si between core-forming Fe alloy and mantle silicate melt and minerals, and partitioning of light elements S and C between solid and liquid Fe. The implications of these results for mechanism of core formation and the composition of the core are discussed.

Li, J.↗

NASA NTRS2002

Graph Partitioning for Parallel Applications in Heterogeneous Grid Environments

The problem of partitioning irregular graphs and meshes for parallel computations on homogeneous systems has been extensively studied. However, these partitioning schemes fail when the target system architecture exhibits heterogeneity in resource characteristics. With the emergence of technologies such as the Grid, it is imperative to study the partitioning problem taking into consideration the differing capabilities of such distributed heterogeneous systems. In our model, the heterogeneous system consists of processors with varying processing power and an underlying non-uniform communication network. We present in this paper a novel multilevel partitioning scheme for irregular graphs and meshes, that takes into account issues pertinent to Grid computing environments. Our partitioning algorithm, called MiniMax, generates and maps partitions onto a heterogeneous system with the objective of minimizing the maximum execution time of the parallel distributed application. For experimental performance study, we have considered both a realistic mesh problem from NASA as well as synthetic workloads. Simulation results demonstrate that MiniMax generates high quality partitions for various classes of applications targeted for parallel execution in a distributed heterogeneous environment.

Bisws, Rupak↗

NASA NTRS2012

Domain decomposition by the advancing-partition method for parallel unstructured grid generation

In a method for domain decomposition for generating unstructured grids, a surface mesh is generated for a spatial domain. A location of a partition plane dividing the domain into two sections is determined. Triangular faces on the surface mesh that intersect the partition plane are identified. A partition grid of tetrahedral cells, dividing the domain into two sub-domains, is generated using a marching process in which a front comprises only faces of new cells which intersect the partition plane. The partition grid is generated until no active faces remain on the front. Triangular faces on each side of the partition plane are collected into two separate subsets. Each subset of triangular faces is renumbered locally and a local/global mapping is created for each sub-domain. A volume grid is generated for each sub-domain. The partition grid and volume grids are then merged using the local-global mapping.

Pirzadeh, Shahyar Z.↗

NASA NTRS2013

A New Spinel-Olivine Oxybarometer: Near-Liquidus Partitioning of V between Olivine-Melt, Spinel-Melt, and Spinel-Olivine in Martian Basalt Composition Y980459 as a Function of Oxygen Fugacity

Our research on valence state partitioning began in 2005 with a review of Cr, Fe, Ti, and V partitioning among crystallographic sites in olivine, pyroxene, and spinel [1]. That paper was followed by several on QUE94201 melt composition and specifically on Cr, V, and Eu partitioning between pyroxene and melt [2-5]. This paper represents the continuation of our examination of the partitioning of multivalent V between olivine, spinel, and melt in martian olivine-phyric basalts of Y980459 composition [6, 7]. Here we introduce a new, potentially powerful oxybarometer, V partitioning between spinel and olivine, which can be used when no melt is preserved in the meteorite. The bulk composition of QUE94201 was ideal for our study of martian pyroxene-phyric basalts and specifically the partitioning between pyroxene-melt for Cr, V, and Eu. Likewise, bulk composition Y980459 is ideal for the study of martian olivine-phyric basalts and specifically for olivine-melt, spinel-melt, and spinel-olivine partitioning of V as a function of oxygen fugacity.

Papike, J. J.↗

DOE OSTI2017

Method for chemical amplification based on fluid partitioning in an immiscible liquid

A system for nucleic acid amplification of a sample comprises partitioning the sample into partitioned sections and performing PCR on the partitioned sections of the sample. Another embodiment of the invention provides a system for nucleic acid amplification and detection of a sample comprising partitioning the sample into partitioned sections, performing PCR on the partitioned sections of the sample, and detecting and analyzing the partitioned sections of the sample.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2018

Chemical amplification based on fluid partitioning

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Chemical amplification based on fluid partitioning

Anderson, Brian L.↗

DOE OSTI2023

Multi–Modular Design of Stable Pore–Space–Partitioned Metal–Organic Frameworks for Gas Separation Applications

Pore space partition (PSP) is an effective materials design method for developing high-performance small-pore materials for storage and separation of gas molecules. The continued success of PSP depends on broad availability and judicious choice of pore-partition ligands and better understanding of each structural module on stability and sorption properties. Here, by using substructural bioisosteric strategy (sub-BIS), a dramatic expansion of pore-partitioned materials is targeted by using ditopic dipyridyl ligands with non-aromatic cores or extenders, as well as by expanding heterometallic clusters to uncommon nickel–vanadium and nickel–indium clusters rarely known before in porous materials. The dual-module iterative refinement of pore-partition ligands and trimers leads to remarkable enhancement of chemical stability and porosity. Here a family of 23 pore-partitioned materials synthesized from five pore-partition ligands and seven types of trimeric clusters is reported. New materials with such compositionally and structurally diverse framework modules reveal key factors that dictate stability, porosity, and gas separation properties. Among these, materials based on heterometallic vanadium–nickel trimeric clusters give rise to the highest long-term hydrolytic stability and remarkable uptake capacity for CO 2 , C 2 H 2 /C 2 H 4 /C 2 H 6 , and C 3 H 6 /C 3 H 8 hydrocarbon gases. Here, the breakthrough experiment shows the potential application of new materials for separating gas mixtures such as C 2 H 2 /CO 2 .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2017

A novel partitioning method for block-structured adaptive meshes

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics

The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several advanced algorithms relying on evaluations of matrix polynomials have been published in the literature for such simulations. We aim to use a special type of graph partitioning to efficiently parallelize these computations. For this, we create a graph representing the zero–nonzero structure of a thresholded density matrix, and partition that graph into several components. Each separate submatrix (corresponding to each subgraph) is then substituted into the matrix polynomial, and the result for the full matrix polynomial is reassembled at the end from the individual polynomials. This paper starts by introducing a rigorous definition as well as a mathematical justification of this partitioning problem. We assess the performance of several methods to compute graph partitions with respect to both the quality of the partitioning and their runtime.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Fast shared-memory streaming multilevel graph partitioning

In this report we show that a fast parallel graph partitioner can benefit many applications by reducing data transfers. The online methods for partitioning graphs have to be fast and they often rely on simple one-pass streaming algorithms, while the offline methods for partitioning graphs contain more involved algorithms and the most successful methods in this category belong to the multilevel approaches. In this work, we assess the feasibility of using streaming graph partitioning algorithms within the multilevel framework. Our end goal is to come up with a fast parallel offline multilevel partitioner that can produce competitive cutsize quality. We rely on a simple but fast and flexible streaming algorithm throughout the entire multilevel framework. This streaming algorithm serves multiple purposes in the partitioning process: a clustering algorithm in the coarsening, an effective algorithm for the initial partitioning, and a fast refinement algorithm in the uncoarsening. Its simple nature also lends itself easily for parallelization. The experiments on various graphs show that our approach is on the average up to 5.1x faster than the multi-threaded MeTiS, which comes at the expense of only 2x worse cutsize.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Width-Based Discharge Partitioning in Distributary Networks: How Right We Are

River deltas are home to large populations and can be composed of complex channel networks which convey flows of matter to the shoreline. Knowledge of flow within individual channels is needed to quantify the distribution of discharge across the delta, and thus its sustainability over time. Due to a lack of field measurements at the local channel scale, researchers leverage remote sensing data to estimate the partitioning of flow. We compare data from 15 river deltas to discharge partitioning estimates based on channel network graphs derived from remote sensing imagery. We quantify errors in the common width-based method and test alternative partitioning techniques to find that width-based discharge partitioning is universally applicable, suggesting that absent any site-specific information, discharge partitioning by average channel width is an appropriate approach. We also provide networks, streamflow measurements, and flux partitioning estimates for 28 delta networks as the Discharge In Distributary NeTworks (DIDNT) dataset.

58 GEOSCIENCES↗

DOE OSTI2020

Gauges, loops, and polynomials for partition functions of graphical models

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and optimization applications. The problem is #P-hard that is of an exponential complexity with respect to the number of variables. Here, aimed at approximating the partition function, we consider multi-graph models where binary variables and multivariable factors are associated with edges and nodes, respectively, of an undirected multi-graph. We suggest a new methodology for analysis and computations that combines the Gauge function technique from Chertkov and Chernyak with the technique developed in Anari and Oveis Gharan 2017 arXiv:1702.02937; Gurvits 2011 arXiv:1106.2844; Straszak and Vishnoi 2017 55th Annual Allerton Conf. on Communication, Control, and Computing, based on the recent progress in the field of real stable polynomials. We show that the Gauge function, representing a single-out term in a finite sum expression for the partition function which achieves extremum at the so-called belief-propagation gauge, has a natural polynomial representation in terms of gauges/variables associated with edges of the multi-graph. Moreover, Gauge function can be used to recover the partition function through a sequence of transformations allowing appealing algebraic and graphical interpretations. Algebraically, one step in the sequence consists of the application of a differential operator over gauges associated with an edge. Graphically, the sequence is interpreted as a repetitive elimination/contraction of edges resulting in multi-graph models on decreasing in size (number of edges) graphs with the same partition function as in the original multi-graph model. Even though the complexity of computing factors in the sequence of the derived multi-graph models and respective Gauge functions grow exponentially with the number of eliminated edges, polynomials associated with the new factors remain bi-stable if the original factors have this property. Moreover, we show that BP estimations in the sequence do not decrease, each low-bounding the partition function.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Modeling the partitioning of amphiphilic molecules and co-solvents in biomembranes

We report amphiphilic co-solvents can have a significant impact on the structure, organization and physical properties of lipid bilayers. Describing the mutual impact of partitioning and induced structure changes is therefore a crucial consideration for a range of topics such as anesthesia and other pharmacokinetic effects, as well as microbial solvent tolerance in the production of biofuels and other fermentation products, where molecules such as ethanol, butanol or acetic acid might be generated. Small-angle neutron scattering (SANS) is a key method for studying lipid and polymer bilayer structures, with many models for extracting bilayer structure (thickness, area per lipid etc.) from scattering data in use today. However, the molecular details of co-solvent partitioning are conflated with induced changes to bilayer structure, making interpretation and modeling of the scattering curves a challenge with the existing set of models. To address this, a model of a bilayer structure is presented which invokes a two-term partition constant accounting for the localization of the co-solvent within the bilayer. This model was validated using a series of SANS measurements of lipid vesicles in the presence of the co-solvent tetrahydrofuran (THF), showing several strategies of how to deploy the two-parameter partition constant model to describe scattering data and extract both structure and partitioning information from the data. Molecular dynamics simulations are then used to evaluate assumptions of the model, provide additional molecular scale details and illustrate its complementary nature to the data fitting procedure. This approach results in estimates of the partition coefficient for THF in 1,2-dimyristoyl-sn-glycero-3-phosphocholine at 35°C, along with an estimate of the fraction of THF residing in the hydrophobic core of the membrane. The authors envision that this model will be applicable to a wide range of other bilayer/amphiphile interactions and provide the associated code needed to implement this model as a fitting algorithm for scattering data in the SasView suite.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2021

A novel approach to partitioning evapotranspiration into evaporation and transpiration in flooded ecosystems

Reliable partitioning of micrometeorologically measured evapotranspiration (ET) into evaporation (E) and transpiration (T) would greatly enhance our understanding of the water cycle and its response to climate change related shifts in local-to-regional climate conditions and rising global levels of vapor pressure deficit (VPD). While some methods on ET partitioning have been developed, their underlying assumptions make them difficult to apply more generally, especially in sites with large contributions of E. Here, we report a novel ET partitioning method using artificial neural networks (ANNs) in combination with a range of environmental input variables to predict daytime E from nighttime ET measurements. The study uses eddy covariance data from four restored wetlands in the Sacramento-San Joaquin Delta, California, USA, as well as leaf-level T data for validation. The four wetlands vary in their vegetation make-up and structure, representing a range of ET conditions. The ANNs were built with increasing complexity by adding the input variable that resulted in the next highest average value of model testing R 2 across all sites. The order of variable inclusion (and importance) was: VPD > gap-filled sensible heat flux (H_gf) > air temperature (T air ) > friction velocity (u * ) > other variables. The model using VPD, H_gf, T air , and u * showed the best performance during validation with independent data and had a mean testing R 2 value of 0.853 (averaged across all sites, range from 0.728 to 0.910). In comparison to other methods, our ANN method generated T/ET partitioning results which were more consistent with CO 2 exchange data especially for more heterogeneous sites with large E contributions. Further, our method improves the understanding of T/ET partitioning. While it may be particularly suited to flooded ecosystems, it can also improve T/ET partitioning in other systems, increasing our knowledge of the global water cycle and ecosystem functioning.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS1984

Partition coefficients of Hf, Zr, and REE between phenocrysts and groundmasses

Partition coefficients of Hf, Zr, and REE between olivine, orthopyroxene, clinopyroxene, plagioclase, garnet, amphibole, ilmenite, phlogopite, and liquid are presented. Samples consist of megacrysts in kimberlite, phenocrysts in alkaline basalts, tholeiitic basalts and andesitic to dacitic rocks, and synthetic garnet and clinopyroxene in Hawaiian tholeiites. The Hf-Lu and Zr-Lu elemental fractionations are as large as the Lu-Sm or Lu-Nd fractionation. The Hf and Zr partition coefficients between mafic phenocrysts and liquids are smaller than the Lu partition coefficients, but are similar to the Nd or Sm partition coefficients. The Hf and Zr partition coefficients between ilmenite, phlogopite, and liquid are larger than the Lu partition coefficients for these minerals and their corresponding liquids. The Hf-Zr elemental fractionation does not occur except for extreme fractionation involving Zr-minerals and extremely low fO2. These data have an important bearing on chronological and petrogenetic tracer studies involving the Lu-Hf isotopic system.

Fujimaki, H.↗

NASA NTRS1987

Hierarchically partitioned nonlinear equation solvers

By partitioning solution space into a number of subspaces, a new multiply constrained partitioned Newton-Raphson nonlinear equation solver is developed. Specifically, for a given iteration, each of the various separate partitions are individually and simultaneously controlled. Due to the generality of the scheme, a hierarchy of partition levels can be employed. For finite-element-type applications, this includes the possibility of degree-of-freedom, nodal, elemental, geometric substructural, material and kinematically nonlinear group controls. It is noted that such partitioning can be continuously updated, depending on solution conditioning. In this context, convergence is ascertained at the individual partition level.

Padovan, Joseph↗

NASA NTRS1991

Rectilinear partitioning of irregular data parallel computations

New mapping algorithms for domain oriented data-parallel computations, where the workload is distributed irregularly throughout the domain, but exhibits localized communication patterns are described. Researchers consider the problem of partitioning the domain for parallel processing in such a way that the workload on the most heavily loaded processor is minimized, subject to the constraint that the partition be perfectly rectilinear. Rectilinear partitions are useful on architectures that have a fast local mesh network. Discussed here is an improved algorithm for finding the optimal partitioning in one dimension, new algorithms for partitioning in two dimensions, and optimal partitioning in three dimensions. The application of these algorithms to real problems are discussed.

Nicol, David M.↗