Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “system partition”

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 1,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

m-CUBES An efficient and portable implementation of multi-dimensional integration for gpus

The task of multi-dimensional numerical integration is frequently encountered in physics and other scientific fields, e.g., in modeling the effects of systematic uncertainties in physical systems and in Bayesian parameter estimation. Multi-dimensional integration is often time-prohibitive on CPUs. Efficient implementation on many-core architectures is challenging as the workload across the integration space cannot be predicted a priori. We propose m-Cubes, a novel implementation of the well-known Vegas algorithm for execution on GPUs. Vegas transforms integration variables followed by calculation of a Monte Carlo integral estimate using adaptive partitioning of the resulting space. m-Cubes improves performance on GPUs by maintaining relatively uniform workload across the processors. As a result, our optimized Cuda implementation for Nvidia GPUs outperforms parallelization approaches proposed in past literature. We further demonstrate the efficiency of m-Cubes by evaluating a six-dimensional integral from a cosmology application, achieving significant speedup and greater precision than the CUBA library's CPU implementation of VEGAS. We also evaluate m-Cubes on a standard integrand test suite. m-Cubes outperforms the serial implementations of the Cuba and GSL libraries by orders of magnitude speedup while maintaining comparable accuracy. Our approach yields a speedup of at least 10 when compared against publicly available Monte Carlo based GPU implementations. In summary, m-Cubes can solve integrals that are prohibitively expensive using standard libraries and custom implementations. A modern C++ interface header-only implementation makes m-Cubes portable, allowing its utilization in complicated pipelines with easy to define stateful integrals. Compatibility with non-Nvidia GPUs is achieved with our initial implementation of m-Cubes using the Kokkos framework.

Sakiotis, Ioannis↗
DOE OSTI2020

Ion separations with membranes

Ion separations are important for resource recovery, water treatment, and energy production and storage. Techniques such as chemical precipitation, selective adsorption, and solvent extraction are effective, but membranes may separate ions continuously with less waste and lower energy costs. Separation of monovalent and multivalent ions with nanofiltration or electrodialysis membranes already enables water softening and edible salt purification. Similar membranes are attractive as separators in vanadium redox flow batteries. Selective partitioning of divalent counter-ions into ion-exchange membranes even allows transport of these ions against their concentration gradients in salt mixtures. However, separations of ions with the same charge is more challenging. Recent research demonstrated highly selective ion “sieving” at small scales. Here, separations using electrical potentials and differences in ion electrophoretic mobilities are promising, but relatively unexplored. Carrier-mediated transport affords high selectivity in liquid membranes, but these systems are not very stable, and selective transport via hopping between anchored carriers has proven elusive. Finally, this paper discusses how concentration polarization decreases selectivities in many membrane processes. Although development of selective, inexpensive ion-separation membranes is a work in progress, successes in water softening and edible salt purification suggests that future selective membranes will serve as complementary methods to traditional purification techniques.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1976

Chemical equilibrium

The entropy of a gas system with the number of particles subject to external control is maximized to derive relations between the thermodynamic variables that obtain at equilibrium. These relations are described in terms of the chemical potential, defined as equivalent partial derivatives of entropy, energy, enthalpy, free energy, or free enthalpy. At equilibrium, the change in total chemical potential must vanish. This fact is used to derive the equilibrium constants for chemical reactions in terms of the partition functions of the species involved in the reaction. Thus the equilibrium constants can be determined accurately, just as other thermodynamic properties, from a knowledge of the energy levels and degeneracies for the gas species involved. These equilibrium constants permit one to calculate the equilibrium concentrations or partial pressures of chemically reacting species that occur in gas mixtures at any given condition of pressure and temperature or volume and temperature.

Source record↗
NASA NTRS1992

Evaluation of fuzzy inference systems using fuzzy least squares

Efforts to develop evaluation methods for fuzzy inference systems which are not based on crisp, quantitative data or processes (i.e., where the phenomenon the system is built to describe or control is inherently fuzzy) are just beginning. This paper suggests that the method of fuzzy least squares can be used to perform such evaluations. Regressing the desired outputs onto the inferred outputs can provide both global and local measures of success. The global measures have some value in an absolute sense, but they are particularly useful when competing solutions (e.g., different numbers of rules, different fuzzy input partitions) are being compared. The local measure described here can be used to identify specific areas of poor fit where special measures (e.g., the use of emphatic or suppressive rules) can be applied. Several examples are discussed which illustrate the applicability of the method as an evaluation tool.

Barone, Joseph M.↗
NASA NTRS2010

Medium Earth Orbits: Is There a Need for a Third Protected Region?

The Inter-Agency Space Debris Coordination Committee (IADC) and the United Nations have adopted the concept of near-Earth regions which should be afforded protection from the accumulation of orbital debris. These regions are low Earth orbit (LEO), which extends up to 2000 km altitude, and geosynchronous orbit (GEO), which includes the volume of space encompassed by 35,786 km +/- 200 km in altitude and +/- 15 degrees in inclination. The region between LEO and GEO is commonly referred to as Medium Earth Orbit (MEO). Although historically a small minority of spacecraft have operated in MEO, the number of such satellites residing in or routinely transiting the zone is increasing. The question thus arises: should MEO be considered an orbital debris protected region? This paper first reviews the characteristics of space systems now utilizing MEO, as well as those anticipated to join them in the near future. MEO is then contrasted with LEO and GEO, both physically and pragmatically. Recommended orbital debris mitigation guidelines for MEO space vehicles are highlighted, and the challenges of spacecraft and launch vehicle stage disposal are recognized. Note is also made of the principal tenets of the United Nations Outer Space Treaty and of recent trends toward de facto partitioning of MEO. Finally, the efficacy and practicality of establishing MEO as a new protected region with regard to orbital debris is addressed.

Johnson, Nicholas L.↗
DOE OSTI2026

A hybrid Penman-Monteith and machine learning model for simulating evapotranspiration and its components

Integrating physical processes with machine learning has advanced evapotranspiration (ET) simulation, yet most hybrid models fail to partition total ET into its components: soil evaporation (E) and vegetation transpiration (T). This study introduces Residual Neural Network–Penman–Monteith (RNN-PM), a novel hybrid dual-source ET model designed to overcome this limitation. The model synergizes the physically-based Penman–Monteith framework with three specialized residual neural networks trained to estimate key conductance parameters (canopy conductance, soil surface conductance, and aerodynamic conductance). Furthermore this explicit parameterization allows for the direct partitioning of total ET. Validation at National Ecological Observatory Network (NEON) flux sites using high-frequency partitioned E and T shows that RNN-PM reliably reproduces ET and the transpiration fraction (T/ET). For ET, the model achieves an average Kling–Gupta efficiency (KGE) of 0.89 and a root-mean-square error (RMSE) of 0.55 mm/day; for T/ET, the KGE is 0.87 with an RMSE of 0.06. Furthermore, RNN-PM demonstrates robust generalization, accurately simulating ET and its components well beyond the initial training dataset, even under extreme climatic conditions. This study extended the analysis by comparing the RNN-PM model with seven established dual-source ET models. The results indicate that RNN-PM outperforms both conventional machine learning models and purely physical process-based models in simulating ET components in most cases. Among the purely physical process-based dual-source models, those based on surface temperature decomposition showed improved performance as the leaf area index (LAI) decreased when evaluated against high-frequency ET component datasets. In contrast, the performance of conductance-based dual-source models declined with decreasing LAI. Although purely machine learning-based models can produce relatively accurate simulations of ET components, they often exhibit limited generalization capability, an issue that the RNN-PM model effectively overcomes. Ultimately, the RNN-PM model represents a significant advance in simulating ET components, offering a novel and scalable approach for improving the representation of land–atmosphere interactions in Earth system models.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Sectoral and growth rate control on elemental uptake by individual calcite crystals

Heterogeneous distribution of trace elements (impurities) within individual calcite crystals is a phenomenon commonly observed in natural and laboratory systems. Changes in thermodynamic intensive parameters (mostly chemical potential and temperature) cannot always explain the inhomogeneous impurity patterns in calcite crystals and it has been suggested that growth rate and crystallographic orientation may exert strong effects on elemental incorporation into calcite. In addition, there are a number of experimental studies on micro-scale element (E) distribution between non-equivalent pairs of calcite vicinal faces (known as sectoral zoning); however, the variability of partition coefficients (e.g., K E = (E/Ca) calcite /(E/Ca) fluid ) within individual crystals remains undetermined. In this study, we have extended the work on elemental distribution between crystal sectors to evaluation of partition coefficients of trace and minor elements (Li, B, Mg, and Sr) in calcite crystal faces (10–14) and (01-12), whose growth rates were assessed. Growth entrapment model (GEM) and lattice strain theory were applied to explain K E heterogeneity by varying near-surface diffusivity of Mg and Sr and by varying surface enrichment factor for Li, B, Mg, and Sr. Decoupling of sectoral and growth rate effects reveals that sectoral zoning plays a key role in elemental distribution. More specifically, K Li and K B vary by more than one order of magnitude and K Mg varies by a factor of two within individual crystal faces. Strontium sectoral distribution is different from those of Li, B, and Mg and K Sr varies by up to a factor of two. Finally, these behaviors likely reflect different mechanisms of incorporation of Li, B, Mg, and Sr into calcite.

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

Periodic GFN1-xTB Tight Binding: A Generalized Ewald Partitioning Scheme for the Klopman–Ohno Function

A novel formulation is presented for the treatment of electrostatics in the periodic GFN1-xTB tight-binding model. Periodic GFN1-xTB is hindered by the functional form of the second-order electrostatics, which only recovers Coulombic behavior at large interatomic distances and lacks a closed-form solution for its Fourier transform. We address this by introducing a binomial expansion of the Klopman–Ohno function to partition short- and long-range interactions, enabling the use of a generalized Ewald summation for the solution of the electrostatic energy. This approach is general and is applicable to any damped potential of the form |R n + c| –m . Benchmarks on the X23 molecular crystal dataset and a range of prototypical bulk semiconductors demonstrate that this systematic treatment of the electrostatics eliminates unphysical behavior in the equation of state curves. In the bulk systems studied, we observe a mean absolute error in total energy of 35 meV/atom, comparable to the machine-learned universal force field, M3GNet, and sufficiently precise for structure relaxation. These results highlight the promising potential of GFN1-xTB as a universal tight-binding parametrization.

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

Elemental characterization of crystalline silicotitanate following Hanford tank waste processing

To expedite vitrification of low activity waste at the Hanford Site, a Tank-Side Cesium Removal system is being evaluated. This method utilizes an inorganic ion exchange (IX) media, crystalline silicotitanate (CST), to remove 99.9% of the 137Cs from tank waste supernate. Laboratory scale testing of the ion exchange process has been conducted by Pacific Northwest National Laboratory to evaluate Cs removal with CST in supernates collected from Hanford tanks 241-AP-107 and 241-AW-102 under prototypic plant operating conditions. In an effort to understand the selectivity and partitioning of other analytes toward CST, specifically Resource Conservation and Recovery Act (RCRA) hazardous metals, selected +2 cations, and transuranic elements, a method for the complete dissolution of CST and Cs removal from the digestate was applied to the spent CST post-processing Hanford tank waste. The CST was shown to adsorb a relevant fraction of Ca, Cd, Pb, Sr, and potentially Fe by IX and/or other mechanisms. The spent CST also adsorbed actinides, including U, Pu, Np, and Am. This work discusses digestion of CST and removal of Cs from the digestate allowing effective analysis and provides insight as to what analytes may be competing for IX sites on the CST media.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2020

UPC++ v1.0 Specification, Revision 2020.10.0

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). All communication operations are syntactically explicit and default to non-blocking; asynchrony is managed through the use of futures, promises and continuation callbacks, enabling the programmer to construct a graph of operations to execute asynchronously as high-latency dependencies are satisfied. A global pointer abstraction provides system-wide addressability of shared memory, including host and accelerator memories. The parallelism model is primarily process-based, but the interface is thread-safe and designed to allow efficient and expressive use in multi-threaded applications. The interface is designed for extreme scalability throughout, and deliberately avoids design features that could inhibit scalability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

UPC++ v1.0 Specification, Revision 2021.9.0

UPC++ is a C++ library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). All communication operations are syntactically explicit and default to non-blocking; asynchrony is managed through the use of futures, promises and continuation callbacks, enabling the programmer to construct a graph of operations to execute asynchronously as high-latency dependencies are satisfied. A global pointer abstraction provides system-wide addressability of shared memory, including host and accelerator memories. The parallelism model is primarily process-based, but the interface is thread-safe and designed to allow efficient and expressive use in multi-threaded applications. The interface is designed for extreme scalability throughout, and deliberately avoids design features that could inhibit scalability.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2023

UPC++ v1.0 Specification (Rev. 2023.9.0)

UPC++ is a C++ library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). All communication operations are syntactically explicit and default to non-blocking; asynchrony is managed through the use of futures, promises and continuation callbacks, enabling the programmer to construct a graph of operations to execute asynchronously as high-latency dependencies are satisfied. A global pointer abstraction provides system-wide addressability of shared memory, including host and accelerator memories. The parallelism model is primarily process-based, but the interface is thread-safe and designed to allow efficient and expressive use in multi-threaded applications. The interface is designed for extreme scalability throughout, and deliberately avoids design features that could inhibit scalability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

UPC++ v1.0 Specification (Revision 2022.3.0)

UPC++ is a C++ library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). All communication operations are syntactically explicit and default to non-blocking; asynchrony is managed through the use of futures, promises and continuation callbacks, enabling the programmer to construct a graph of operations to execute asynchronously as high-latency dependencies are satisfied. A global pointer abstraction provides system-wide addressability of shared memory, including host and accelerator memories. The parallelism model is primarily process-based, but the interface is thread-safe and designed to allow efficient and expressive use in multi-threaded applications. The interface is designed for extreme scalability throughout, and deliberately avoids design features that could inhibit scalability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

UPC++ v1.0 Specification, Revision 2023.3.0

UPC++ is a C++ library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). All communication operations are syntactically explicit and default to non-blocking; asynchrony is managed through the use of futures, promises and continuation callbacks, enabling the programmer to construct a graph of operations to execute asynchronously as high-latency dependencies are satisfied. A global pointer abstraction provides system-wide addressability of shared memory, including host and accelerator memories. The parallelism model is primarily process-based, but the interface is thread-safe and designed to allow efficient and expressive use in multi-threaded applications. The interface is designed for extreme scalability throughout, and deliberately avoids design features that could inhibit scalability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

UPC++ v1.0 Specification (Revision 2021.3.0)

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). All communication operations are syntactically explicit and default to non-blocking; asynchrony is managed through the use of futures, promises and continuation callbacks, enabling the programmer to construct a graph of operations to execute asynchronously as high-latency dependencies are satisfied. A global pointer abstraction provides system-wide addressability of shared memory, including host and accelerator memories. The parallelism model is primarily process-based, but the interface is thread-safe and designed to allow efficient and expressive use in multi-threaded applications. The interface is designed for extreme scalability throughout, and deliberately avoids design features that could inhibit scalability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

UPC++ v1.0 Specification, Revision 2022.9.0

UPC++ is a C++ library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). All communication operations are syntactically explicit and default to non-blocking; asynchrony is managed through the use of futures, promises and continuation callbacks, enabling the programmer to construct a graph of operations to execute asynchronously as high-latency dependencies are satisfied. A global pointer abstraction provides system-wide addressability of shared memory, including host and accelerator memories. The parallelism model is primarily process-based, but the interface is thread-safe and designed to allow efficient and expressive use in multi-threaded applications. The interface is designed for extreme scalability throughout, and deliberately avoids design features that could inhibit scalability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

UPC++ v1.0 Specification, Revision 2020.3.0

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). All communication operations are syntactically explicit and default to non-blocking; asynchrony is managed through the use of futures, promises and continuation callbacks, enabling the programmer to construct a graph of operations to execute asynchronously as high-latency dependencies are satisfied. A global pointer abstraction provides system-wide addressability of shared memory, including host and accelerator memories. The parallelism model is primarily process-based, but the interface is thread-safe and designed to allow efficient and expressive use in multi-threaded applications. The interface is designed for extreme scalability throughout, and deliberately avoids design features that could inhibit scalability.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1986

A distributable APSE

A distributed Ada program library is a key element in a distributed Ada Program Support Environment (APSE). To implement this successfully, the program library universe as defined by the Ada Reference Manual must be broken up into independently manageable pieces. This in turn requires the support of a distributed database system, as well as a mechanism for identifying compilation units, linkable subprograms, and Ada types in a decentralized way, to avoid falling victim to the bottlenecks of a global database and/or global unique-identifier manager. It was found that the ability to decentralize Ada program library activity is a major advantage in the management of large Ada programs. Currently, there are 18 resource-catalog revision sets, each in its own Host Interface (HIF) partition, plus 18 partitions for testing each of these, plus 11 partitions for the top-level compiler/linker/program library manager components. Compiling and other development work can proceed in parallel in each of these partitions, without suffering the performance bottlenecks of global locks or global unique-identifier generation.

Taft, Tucker, S.↗