SEARCH · Search NASA
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.
Enantioselectivity is examined in the addition of allyl groups to fluorinated ketones.
Not provided.
Multiphase materials are widely applied in engineering due to desirable mechanical properties and are of interest to geoscience as rocks are multiphase. High-pressure mechanical behavior is important for understanding the deep Earth where rocks deform at extreme pressure and temperature. In order to systematically study the underlying physics of multiphase deformation at high pressure, we perform diamond anvil cell deformation experiments on MgO + NaCl aggregates with varying phase proportions. Lattice strain and texture evolution are recorded using in-situ synchrotron x-ray diffraction and are modeled using two-phase elasto-viscoplastic self-consistent (EVPSC) simulations to deduce stress, strain, and deformation mechanisms in individual phases and the aggregate. Texture development of MgO and NaCl are affected by phase proportions. In NaCl, a (100) compression texture is observed when small amounts of MgO are present. In contrast, when deformed as a single phase or when large amounts of MgO are present, NaCl develops a (110) texture. Stress and strain evolution in MgO and NaCl also show different trends with varying phase proportions. Based on the results from this study, we construct a general scheme of stress evolution as a function of phase proportion for individual phases and the aggregate.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that takes advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low-permeability fractured media in the subsurface by explicitly representing fractures as discrete entities. The governing equations for flow and transport are numerically integrated on computational meshes generated on the interconnected fracture networks. Modern high-fidelity DFN simulations require high-performance computing on multiple processors where performance and scalability depends partially on obtaining a high-quality partition of the mesh to balance work-loads and minimize communication across all processors. The discrete structure of a DFN naturally lends itself to various graph representations, which can be thought of as coarse-scale representations of the computational mesh. Using this concept, we develop two applications of the multilevel graph partitioning algorithm to partition the mesh of a DFN. In the first, we project a partition of the graph based on the DFN topology onto the mesh of the DFN and in the second, this DFN-based projection is used as the initial condition for further partitioning refinement of the mesh. We compare the performance of these methods with standard multi-level graph partitioning using graph-based metrics (cut, imbalance, partitioning time), computational-based metrics (FLOPS, iterations, solver time), and total run time. The DFN-based and the mesh-based partitioning methods are comparable in terms of the graph-based metrics, but the time required to obtain the partition is several orders of magnitude faster using the DFN-based partitions. The computation-based metrics show comparable performance between both methods so, in combination, the DFN-based partitions are several orders of magnitude faster than the mesh-based partition. Furthermore, the method which uses the DFN-partition solution as the initial condition of the mesh partition provided cut and imbalance values that were close to the mesh-based partition but in a fraction of the time. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.
Mineral/melt partition coefficients have been widely used to provide insights into magmatic processes. Olivine is one of the most abundant and important minerals in the lunar mantle and mare basalts. Yet, no systematic olivine/melt partitioning data are available for lunar conditions. We report trace element partition data between host mineral olivine and its melt inclusions in lunar basalts. Equilibrium is evaluated using the Fe-Mg exchange coefficient, leading to the choice of melt inclusion-host olivine pairs in lunar basalts 12040, 12009, 15016, 15647, and 74235. Partition coefficients of 21 elements (Li, Mg, Al, Ca, Ti, V, Cr, Mn, Fe, Co, Y, Zr, Nb, Gd, Tb, Dy, Ho, Er, Tm, Yb and Lu) were measured. Except for Li, V, and Cr, these elements show no significant difference in olivine-melt partitioning compared to the data for terrestrial samples. The partition coefficient of Li between olivine and melt in some lunar basalts with low Mg# (Mg# < 0.75 in olivine, or < ~0.5 in melt) is higher than published data for terrestrial * Corresponding author. Email address: youxue@umich.edu 2 samples, which is attributed to the dependence of DLi on Mg# and the lack of literature DLi data with low Mg#. The partition coefficient of V in lunar basalts is measured to be 0.17 to 0.74, significantly higher than that in terrestrial basalts (0.003 to 0.21), which can be explained by the lower oxygen fugacity in lunar basalts. The significantly higher DV can explain why V is less enriched in evolved lunar basalts than terrestrial basalts. The partition coefficient of Cr between olivine and basalt melt in the Moon is 0.11 to 0.62, which is lower than those in terrestrial settings by a factor of approximately 2. This is surprising because previous authors showed that Cr partition coefficient is independent of fO2. A quasi-thermodynamically based model is developed to correlate Cr partition coefficient to olivine and melt composition and fO2. The lower Cr partition coefficient between olivine and basalt in the Moon can lead to more Cr enrichment in the lunar magma ocean, as well as more Cr enrichment in mantle-derived basalts in the Moon. Hence, even though Cr is typically a compatible element in terrestrial basalts, it is moderately incompatible in primitive lunar basalts, with a similar degree of incompatibility as V based on partition coefficients in this work, as also evidenced by the relatively constant V/Cr ratio of 0.039 ± 0.011 in lunar basalts. The confirmation of constant V/Cr ratio is important for constraining concentrations of Cr (slightly volatile and siderophile) and V (slightly siderophile) in the bulk silicate Moon.
Data partitioning becomes necessary when a large-scale simulation produces more data than can be feasibly stored. The goal is to partition the data, typically so that every element belongs to one and only one partition, and store summary information about the partition, either a representative value plus an estimate of the error or a distribution. Once the partitions are determined and the summary information stored, the raw data is discarded. This process can be performed in-situ; meaning while the simulation is running. When creating the partitions there are many decisions that researchers must make. For instance, how to determine once an adequate number of partitions have been created, how are the partitions created with respect to dividing the data, or how many variables should be considered simultaneously. In addition, decisions must be made for how to summarize the information within each partition. Because of the combinatorial number of possible ways to partition and summarize the data, a method of comparing the different possibilities will help guide researchers into choosing a good partitioning and summarization scheme for their application.
Graph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication. One seeks to distribute the workload by partitioning the graph so that every processor has approximately the same workload, and the communication cost (measured as a function of edges exposed by the partition) is minimized. Measures of partition quality vary; in this paper we consider a processor's cost to be the sum of its computation and communication costs, and consider the cost of a partition to be the bottleneck, or maximal processor cost induced by the partition. For a general graph the problem of finding an optimal partitioning is intractable. In this paper we restrict our attention to the class of k-art n-cube graphs with uniformly weighted nodes. Given mild restrictions on the node weight and number of processors, we identify partitions yielding the smallest bottleneck. We also demonstrate by example that some restrictions are necessary for the partitions we identify to be optimal. In particular, there exist cases where partitions that evenly partition nodes need not be optimal.
We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1], [2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discretized system of partial differential equations (PDEs) or problems naturally modeled as coupled systems of ODEs. The sufficient conditions to build arbitrarily high-order partitioned SDC schemes are derived. Based on these conditions, various of partitioned SDC schemes are designed. The stability of the first-order partitioned SDC scheme is analyzed in detail on a coupled, linear model problem. We show that the scheme is conditionally stable, and under conditions on the coupling strength, the scheme can be unconditionally stable. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems with moderate coupling strength. They include a stiff linear system of ODEs, advection-diffusion-reaction systems, and fluid-structure interaction problems with both incompressible and compressible flows, where we verify the design order of the SDC schemes and study various stability properties. We also directly compare the accuracy, stability, and cost of the proposed partitioned SDC solver with the partitioned IMEX method in [1], [2] on this suite of test problems. The results suggest that the high-order partitioned SDC solvers are more robust than the partitioned IMEX solvers for the numerical examples considered in this work, while the IMEX methods require fewer implicit solves.
Here we present a novel neural network architecture called AutoAtlas for fully unsupervised partitioning and representation learning of 3D brain Magnetic Resonance Imaging (MRI) volumes. AutoAtlas consists of two neural network components: one neural network to perform multi-label partitioning based on local texture in the volume, and a second neural network to compress the information contained within each partition. We train both of these components simultaneously by optimizing a loss function that is designed to promote accurate reconstruction of each partition, while encouraging spatially smooth and contiguous partitioning, and discouraging relatively small partitions. We show that the partitions adapt to the subject specific structural variations of brain tissue while consistently appearing at similar spatial locations across subjects. AutoAtlas also produces very low dimensional features that represent local texture of each partition. We demonstrate prediction of metadata associated with each subject using the derived feature representations and compare the results to prediction using features derived from FreeSurfer anatomical parcellation. Since our features are intrinsically linked to distinct partitions, we can then map values of interest, such as partition-specific feature importance scores onto the brain for visualization.
Load balancing and partitioning are critical when it comes to parallel computations. Popular partitioning strategies based on space filling curves focus on equally dividing work. The partitions produced are independent of the architecture or the application. Given the ever-increasing relative cost of data movement and increasing heterogeneity of our architectures, it is no longer sufficient to only consider an equal partitioning of work. Minimizing communication costs are equally if not more important. Our hypothesis is that an unequal partitioning that minimizes communication costs significantly can scale and perform better than conventional equal-work partitioning schemes. This tradeoff is dependent on the architecture as well as the application. We validate our hypothesis in the context of a finite-element computation utilizing adaptive mesh-refinement. Our central contribution is a new partitioning scheme that minimizes the overall runtime of subsequent computations by performing architecture and application-aware non-uniform work assignment in order to decrease time to solution, primarily by minimizing data-movement. We evaluate our algorithm by comparing it against standard space-filling curve based partitioning algorithms and observing time-to-solution as well as energy-to-solution for solving Finite Element computations on adaptively refined meshes. We demonstrate excellent scalability of our new partition algorithm up to $262,144$ cores on ORNL's Titan and demonstrate that the proposed partitioning scheme reduces overall energy as well as time-to-solution for application codes by up to 22.0%.
Carbon partitioning in plants may be viewed as a dynamic process composed of the many interactions between sources and sinks. The accumulation and distribution of fixed carbon is not dictated simply by the sink strength and number but is dependent upon the source, pathways, and interactions of the system. As such, the study of carbon partitioning through perturbations to the system or through focus on individual traits may fail to produce actionable developments or a comprehensive understanding of the mechanisms underlying this complex process. Using the recently published sorghum carbon-partitioning panel, we collected both macroscale phenotypic characteristics such as plant height, above-ground biomass, and dry weight along with microscale compositional traits to deconvolute the carbon-partitioning pathways in this multipurpose crop. Multivariate analyses of traits resulted in the identification of numerous loci associated with several distinct carbon-partitioning traits, which putatively regulate sugar content, manganese homeostasis, and nitrate transportation. Using a multivariate adaptive shrinkage approach, we identified several loci associated with multiple traits suggesting that pleiotropic and/or interactive effects may positively influence multiple carbon-partitioning traits, or these overlaps may represent molecular switches mediating basal carbon allocating or partitioning networks. Conversely, we also identify a carbon tradeoff where reduced lignin content is associated with increased sugar content. The results presented here support previous studies demonstrating the convoluted nature of carbon partitioning in sorghum and emphasize the importance of taking a holistic approach to the study of carbon partitioning by utilizing multiscale phenotypes.
Locally, plant species richness supports many ecosystem functions. Yet, the mechanisms driving these often-positive biodiversity–ecosystem functioning relationships are not well understood. Spatial resource partitioning across vertical resource gradients is one of the main hypothesized causes for enhanced ecosystem functioning in more biodiverse grasslands. Spatial resource partitioning occurs if species differ in where they acquire resources and can happen both above- and belowground. However, studies investigating spatial resource partitioning in grasslands provide inconsistent evidence. We present the results of a meta-analysis of 21 data sets from experimental species-richness gradients in grasslands. We test the hypothesis that increasing spatial resource partitioning along vertical resource gradients enhances ecosystem functioning in diverse grassland plant communities above- and belowground. To test this hypothesis, we asked three questions. (1) Does species richness enhance biomass production or community resource uptake across sites? (2) Is there evidence of spatial resource partitioning as indicated by resource tracer uptake and biomass allocation above- and belowground? (3) Is evidence of spatial resource partitioning correlated with increased biomass production or community resource uptake? Although plant species richness enhanced community nitrogen and potassium uptake and biomass production above- and belowground, we found that plant communities did not meet our criteria for spatial resource partitioning, though they did invest in significantly more aboveground biomass in higher canopy layers in mixture relative to monoculture. Furthermore, the extent of spatial resource partitioning across studies was not positively correlated with either biomass production or community resource uptake. Our results suggest that spatial resource partitioning across vertical resource gradients alone does not offer a general explanation for enhanced ecosystem functioning in more diverse temperate grasslands.
The phospholipid-water partition coefficient is a commonly measured parameter that correlates with drug efficacy, small-molecule toxicity, and accumulation of molecules in biological systems in the environment. Despite the utility of this parameter, methods for measuring phospholipid-water partition coefficients are limited. This is due to the difficulty of making quantitative measurements in vesicle membranes or supported phospholipid bilayers, both of which are small-volume phases that challenge the sensitivity of many analytical techniques. In this paper, we employ in-situ confocal Raman microscopy to probe the partitioning of a model membrane-active compound, 2-(4-isobutylphenyl) propionic acid or ibuprofen, into both hybrid- and supported-phospholipid bilayers deposited on the pore walls of individual chromatographic particles. The large surface-area-to-volume ratio of chromatographic silica allows interrogation of a significant lipid bilayer area within a very small volume. The local phospholipid concentration within a confocal probe volume inside the particle can be as high as 0.5 M, which overcomes the sensitivity limitations of making measurements in the limited membrane areas of single vesicles or planar supported bilayers. Quantitative determination of ibuprofen partitioning is achieved by using the phospholipid acyl-chains of the within-particle bilayer as an internal standard. This approach is tested for measurements of pH-dependent partitioning of ibuprofen into both hybrid-lipid and supported-lipid bilayers within silica particles, and the results are compared with octanol-water partitioning and with partitioning into individual optically-trapped phospholipid vesicle membranes. Finally and additionally, the impact of ibuprofen partitioning on bilayer structure is evaluated for both within-particle model membranes and compared with the structural impacts of partitioning into vesicle lipid bilayers.
A graph is a mathematical representation of a network; we say it consists of a set of vertices, which are connected by edges. Graphs have numerous applications in various fields, as they can model all sorts of connections, processes, or relations. For example, graphs can model intricate transit systems or the human nervous system. However, graphs that are large or complicated become difficult to analyze. This is why there is an increased interest in the area of graph partitioning, reducing the size of the graph into multiple partitions. For example, partitions of a graph representing a social network might help identify clusters of friends or colleagues. Graph partitioning is also a widely used approach to load balancing in parallel computing. The partitioning of a graph is extremely useful to decompose the graph into smaller parts and allow for easier analysis. There are different ways to solve graph partitioning problems. For this work, we focus on a spectral partitioning method which forms a partition based upon the eigenvectors of the graph Laplacian (details presented in Acer, et. al.). This method uses the LOBPCG algorithm to compute these eigenvectors. LOBPCG can be accelerated by an operator called a preconditioner. For this internship, we evaluate a randomized Cholesky (rchol) preconditioner for its effectiveness on graph partitioning problems with LOBPCG. We compare it with two standard preconditioners: Jacobi and Incomplete Cholesky (ichol). This research was conducted from August to December 2021 in conjunction with Sandia National Laboratories.
Given a discretization stencil, partitioning the problem domain is an important first step for the efficient solution of partial differential equations on multiple processor systems. Partitions are derived that minimize interprocessor communication when the number of processors is known a priori and each domain partition is assigned to a different processor. This partitioning technique uses the stencil structure to select appropriate partition shapes. For square problem domains, it is shown that non-standard partitions (e.g., hexagons) are frequently preferable to the standard square partitions for a variety of commonly used stencils. This investigation is concluded with a formalization of the relationship between partition shape, stencil structure, and architecture, allowing selection of optimal partitions for a variety of parallel systems.