Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network 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 217 records · Page 12

p14 ARF forms meso-scale assemblies upon phase separation with NPM1

NPM1 is an abundant nucleolar chaperone that, in addition to facilitating ribosome biogenesis, contributes to nucleolar stress responses and tumor suppression through its regulation of the p14 Alternative Reading Frame tumor suppressor protein (p14 ARF ). Oncogenic stress induces p14 ARF to inhibit MDM2, stabilize p53 and arrest the cell cycle. Under non-stress conditions, NPM1 stabilizes p14 ARF in nucleoli, preventing its degradation and blocking p53 activation. However, the mechanisms underlying the regulation of p14 ARF by NPM1 are unclear because the structural features of the p14 ARF -NPM1 complex were elusive. Here we show that p14 ARF assembles into a gel-like meso-scale network upon phase separation with NPM1. This assembly is mediated by intermolecular contacts formed by hydrophobic residues in an α-helix and β-strands within a partially folded N-terminal portion of p14 ARF . These hydrophobic interactions promote phase separation with NPM1, enhance p14 ARF nucleolar partitioning, restrict NPM1 diffusion within condensates and nucleoli, and reduce cellular proliferation. Our structural analysis provides insights into the multifaceted chaperone function of NPM1 in nucleoli by mechanistically linking the nucleolar localization of p14 ARF to its partial folding and meso-scale assembly upon phase separation with NPM1.

59 BASIC BIOLOGICAL SCIENCES↗

Stream Temperature Prediction in a Shifting Environment: Explaining the Influence of Deep Learning Architecture

Stream temperature is a fundamental control on ecosystem health. Recent efforts incorporating process guidance into deep learning models for predicting stream temperature have been shown to outperform existing statistical and physical models. This performance is in part because deep learning architectures can actively learn spatiotemporal relationships that govern how water and energy propagate through a river network. However, exploration of how spatiotemporal awareness and process guidance influence a model's generalizability under shifting environmental conditions such as climate change is limited. Here, we use Explainable Artificial Intelligence (XAI) to interrogate how differing deep learning architectures affect a model's learned spatial and temporal dependencies, and how those learned dependencies affect a model's ability to maintain high accuracy when applied to unseen environmental conditions. Using the Delaware River Basin in the northeastern United States as a test case, we compare two spatiotemporally aware process–guided deep learning models for predicting stream temperature (a recurrent graph convolution network—RGCN, and a temporal convolution graph model—Graph WaveNet). Both models achieve equally high predictive performance when testing data are well represented in the training data (test root mean squared errors of 1.64°C and 1.65°C); however, Graph WaveNet significantly outperforms RGCN in 4 out of 5 experiments where test partitions represent different types of unseen environmental conditions. XAI results show that the architecture of Graph WaveNet leads to learned spatial relationships with greater fidelity to physical processes, and that this fidelity improves the generalizability of the model when applied to shifting and/or unseen environmental conditions.

54 ENVIRONMENTAL SCIENCES↗

How Does Escherichia coli Allocate Proteome?

Microorganisms are shown to actively partition their intracellular resources, such as pro- teins, for growth optimization. Recent experiments have begun to reveal molecular com- ponents unpinning the partition; however, it remains unclear quantitatively how individual parts orchestrate to yield precise resource allocation that is both robust and dynamic. Here we developed a coarse-grained mathematical framework that centers on guanosine pentaphosphate (ppGpp)-mediated regulation, and used it to systematically uncover the design principles of proteome allocation in Escherichia coli. Our results showed that cellular ability of resource partition lies in an ultrasensitive, negative feedback control- ling topology with the ultrasensitivity arising from zero-order amino acid kinetics and the negative feedback from ppGpp-controlled ribosome synthesis. In addition, together with the time-scale separation between slow ribosome kinetics and fast turnovers of ppGpp and amino acids, the network topology confers the organism an optimization mechanism which mimics sliding mode control, a nonlinear optimization strategy that is widely used in man-made systems. We further showed that such a controlling mechanism is robust against parameter variations and molecular fluctuations, and is also efficient for biomass production over time. Furthermore, this work elucidates the fundamental controlling mechanism of E. coli proteome allocation, thereby providing insights into quantitative microbial physiology as well as the design of synthetic gene networks.

59 BASIC BIOLOGICAL SCIENCES↗

A multistage linear array assignment problem

The implementation of certain algorithms on parallel processing computing architectures can involve partitioning contiguous elements into a fixed number of groups, each of which is to be handled by a single processor. It is desired to find an assignment of elements to processors that minimizes the sum of the maximum workloads experienced at each stage. This problem can be viewed as a multi-objective network optimization problem. Polynomially-bounded algorithms are developed for the case of two stages, whereas the associated decision problem (for an arbitrary number of stages) is shown to be NP-complete. Heuristic procedures are therefore proposed and analyzed for the general problem. Computational experience with one of the exact problems, incorporating certain pruning rules, is presented with one of the exact problems. Empirical results also demonstrate that one of the heuristic procedures is especially effective in practice.

Nicol, David M.↗

Metabolic and transcriptomic study of pennycress natural variation identifies targets for oil improvement

Pennycress (Thlaspi arvense L.), a member of the Brassicaceae family, produces seed oil high in erucic acid, suitable for biodiesel and aviation fuel. Although pennycress, a winter annual, could be grown as a dedicated bioenergy crop, an increase in its seed oil content is required to improve its economic competitiveness. The success of crop improvement relies upon finding the right combination of biomarkers and targets, and the best genetic engineering and/or breeding strategies. In this work, we combined biomass composition with metabolomic and transcriptomic studies of developing embryos from 22 pennycress natural variants to identify targets for oil improvement. The selected accession collection presented diverse levels of fatty acids at maturity ranging from 29% to 41%. Pearson correlation analyses, weighted gene co‐expression network analysis and biomarker identifications were used as complementary approaches to detect associations between metabolite level or gene expression and oil content at maturity. The results indicated that improving seed oil content can lead to a concomitant increase in the proportion of erucic acid without affecting the weight of embryos. Processes, such as carbon partitioning towards the chloroplast, lipid metabolism, photosynthesis, and a tight control of nitrogen availability, were found to be key for oil improvement in pennycress. Besides identifying specific targets, our results also provide guidance regarding the best timing for their modification, early or middle maturation. Thus, this work lays out promising strategies, specific for pennycress, to accelerate the successful development of lines with increased seed oil content for biofuel applications.

59 BASIC BIOLOGICAL SCIENCES↗

Search for supporting methodologies - Or how to support SEI for 35 years

Concepts relevant to the development of an evolvable information management system are examined in terms of support for the Space Exploration Initiative. The issues of interoperability within NASA and industry initiatives are studied including the Open Systems Interconnection standard and the operating system of the Open Software Foundation. The requirements of partitioning functionality into separate areas are determined with attention given to the infrastructure required to ensure system-wide compliance. The need for a decision-making context is a key to the distributed implementation of the program, and this environment is concluded to be next step in developing an evolvable, interoperable, and securable support network.

Handley, Thomas H., Jr.↗

Data-driven Whitney forms for structure-preserving control volume analysis

Control volume analysis models physics via the exchange of generalized fluxes between subdomains. Here, we introduce a scientific machine learning framework adopting a partition of unity architecture to identify physically-relevant control volumes, with generalized fluxes between subdomains encoded via Whitney forms. The approach provides a differentiable parameterization of geometry which may be trained in an end-to-end fashion to extract reduced models from full field data while exactly preserving physics. The architecture admits a data-driven finite element exterior calculus allowing discovery of mixed finite element spaces with closed form quadrature rules. An equivalence between Whitney forms and graph networks reveals that the geometric problem of control volume learning is equivalent to an unsupervised graph discovery problem. The framework is developed for manifolds in arbitrary dimension, with examples provided for H(div) problems in $\mathbb{R}$ establishing convergence and structure preservation properties. Finally, we consider a lithium-ion battery problem where we discover a reduced finite element space encoding transport pathways from high-fidelity microstructure resolved simulations. The approach reduces the 5.89M finite element simulation to 136 elements while reproducing pressure to under 0.1% error and preserving conservation.

97 MATHEMATICS AND COMPUTING↗

Distributed Multi-GPU Community Detection on Exascale Computing Platforms

Community detection is a fundamental operation in graph mining, and by uncovering hidden structures and patterns within complex systems it helps solve fundamental problems pertaining to social networks, such as information diffusion, epidemics, and recommender systems. Scaling graph algorithms for massive networks becomes challenging on modern distributed-memory multi-GPU (Graphics Processing Unit) systems due to limitations such as irregular memory access patterns, load imbalances, higher communication-computation ratios, and cross-platform support. We present a novel algorithm HiPDPL-GPU (distributed parallel Louvain) to address these challenges. We conduct experiments involving different partitioning techniques to achieve optimized performance of HiPDPL-GPU on the two largest supercomputers: Frontier and Summit. Remarkably, HiPDPL-GPU processes a graph with 4.2 billion edges in less than 3 minutes using 1024 GPUs. Qualitatively performance of HiPDPL-GPU is similar or better compared to other state-of-the-art CPU- and GPU-based implementations. While prior GPU implementations have predominantly employed CUDA, our first-of-its-kind implementation for community detection is cross-platform, accommodating both AMD and NVIDIA GPUs.

graph algorithms, high performance comptuing↗

Distributed Multi-GPU Community Detection on Exascale Computing Platforms

Community detection is a fundamental operation in graph mining, and by uncovering hidden structures and patterns within complex systems it helps solve fundamental problems pertaining to social networks, such as information diffusion, epidemics, and recommender systems. Scaling graph algorithms for massive networks becomes challenging on modern distributed-memory multi-GPU (Graphics Processing Unit) systems due to limitations such as irregular memory access patterns, load imbalances, higher communication-computation ratios, and cross-platform support. We present a novel algorithm HiPDPL-GPU (Distributed Parallel Louvain) to address these challenges. We conduct experiments involving different partitioning techniques to achieve an optimized performance of HiPDPL-GPU on the two largest supercomputers: Frontier and Summit. Remarkably, HiPDPL-GPU processes a graph with 4.2 billion edges in less than 3 minutes using 1024 GPUs. Qualitatively, the performance of HiPDPL-GPU is similar or better compared to other state-of-the-art CPU- and GPU-based implementations. While prior GPU implementations have predominantly employed CUDA, our first-of-its-kind implementation for community detection is cross-platform, accommodating both AMD and NVIDIA GPUs.

Sattar, Naw Safrin↗

Coherency-Aware Learning Control of Inverter-Dominated Grids: A Distributed Risk-Constrained Approach

Here, this letter investigates the importance of integrating the coherency knowledge for designing controllers to dampen sustained oscillations in wide-area power networks with significant penetration of inverter-interfaced resources. Coherency is a fundamental property of power systems, where time-scale separation in frequency dynamics leads to clustered behavior among generators of different groups. Large-scale penetration of inverter-driven low inertia resources replacing conventional synchronous generators (SGs) can lead to perturbation in the coherent partitioning; hence, integrating such information is of utmost importance for oscillation control designs. We present the coherency-aware design of a distributed output feedback-based reinforcement learning method that additionally incorporates risk constraints to capture the uncertainties related to net-load fluctuations. The use of domain-aware coherency information has produced improved training and oscillation performance than the coherency-agnostic control design, hence proving to be effective in controller design. Finally, we validated the proposed method with numerical experiments on the benchmark IEEE 68-bus test system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The Connection between Model Performance on the CCMVal Transport Diagnostics and Simulated Sensitivity of Ozone to Chlorine Change

The chemistry climate models that contributed simulations for past and future ozone evolution to the 2010 Scientific Assessment of Ozone Depletion were subject to extensive evaluation by the SPARC (Stratospheric Processes and their Role in Climate) CCMVal (Chemistry-Climate Model Validation) activity. The sensitivity of ozone to changes in composition and climate varies among the models, but the relationship between these variations and the model evaluations of CCMVal is not obvious. We have learned that the transport evaluation can be used to interpret the comparisons between observed and simulated columns of chlorine reservoirs, hydrochloric acid (HCl) and chlorine nitrate (ClONO2); these comparisons were part of the CCMVal evaluation of chemistry. The simulations with best performance on the transport diagnostics most faithfully reproduce the evolution and seasonal variation of the chlorine reservoirs as observed at NDACC (Network for Detection of Atmospheric Composition Change) stations (NyAlesund 78.9N, Kiruna 67.8N, Harestua 60.2N, Jungfraujoch 46.6N, Toronto 43.6N, Kitt Peak 31.9N, Izana 28.3N, Mauna Loa 19.5N, Lauder 45S and Arrival Heights 77.8S). In the simulations, the HCl in the lower stratosphere depends on total inorganic chlorine (Cly) and partitioning between HCl and ClON02. Total inorganic chlorine depends on the fractional release of chlorine from source gases, and ratio of ClON02 to HCl is inversely dependent on methane and varies quadratically with ozone. Simulated HCl from various models may agree with observations even though Cly is in error, partitioning is in error, or both. Simulated ozone sensitivity to chlorine is shown to be greater for models that produce larger values of chlorine nitrate for background chlorine levels, and vice versa. Comparisons with the NDACC data show why the models with 'best' transport have similar sensitivity to chlorine change. The realistic evolution of the simulated HCl and ClONO2 columns suggests realistic levels of Cly in the lower atmosphere. In addition, the wide range values for the sensitivity of ozone to chlorine obtained from the CCMVal simulations is explained by the wide range in lower atmospheric columns of ClONO2 and the concomitant wide range of levels for chlorine monoxide.

Douglass, Anne↗

Processing Particle Data Flows with SmartNICs

Many distributed applications implement complex data flows and need a flexible mechanism for routing data between producers and consumers. Recent advances in programmable network interface cards, or SmartNICs, represent an opportunity to offload data-flow tasks into the network fabric, thereby freeing the hosts to perform other work. System architects in this space face multiple questions about the best way to leverage SmartNICs as processing elements in data flows. In this paper, we advocate the use of Apache Arrow as a foundation for implementing data-flow tasks on SmartNICs. We report on our experiences adapting a partitioning algorithm for particle data to Apache Arrow and measure the on-card processing performance for the BlueField-2 SmartNIC. Our experiments confirm that the BlueField-2’s (de)compression hardware can have a significant impact on in-transit workflows where data must be unpacked, processed, and repacked.

97 MATHEMATICS AND COMPUTING↗

Automatic cataloguing and characterization of Earth science data using SE-trees

In the future, NASA's Earth Observing System (EOS) platforms will produce enormous amounts of remote sensing image data that will be stored in the EOS Data Information System. For the past several years, the Intelligent Data Management group at Goddard's Information Science and Technology Office has been researching techniques for automatically cataloguing and characterizing image data (ADCC) from EOS into a distributed database. At the core of the approach, scientists will be able to retrieve data based upon the contents of the imagery. The ability to automatically classify imagery is key to the success of contents-based search. We report results from experiments applying a novel machine learning framework, based on Set-Enumeration (SE) trees, to the ADCC domain. We experiment with two images: one taken from the Blackhills region in South Dakota; and the other from the Washington DC area. In a classical machine learning experimentation approach, an image's pixels are randomly partitioned into training (i.e. including ground truth or survey data) and testing sets. The prediction model is built using the pixels in the training set, and its performance is estimated using the testing set. With the first Blackhills image, we perform various experiments achieving an accuracy level of 83.2 percent, compared to 72.7 percent using a Back Propagation Neural Network (BPNN) and 65.3 percent using a Gaussain Maximum Likelihood Classifier (GMLC). However, with the Washington DC image, we were only able to achieve 71.4 percent, compared with 67.7 percent reported for the BPNN model and 62.3 percent for the GMLC.

Rymon, Ron↗

Model Exploration of an Information-Based Healthcare Intervention Using Parallelization and Active Learning

This paper describes the application of a large-scale active learning method to characterize the parameter space of a computational agent-based model developed to investigate the impact of CommunityRx, a clinical information-based health intervention that provides patients with personalized information about local community resources to meet basic and self-care needs. Additionally, the diffusion of information about community resources and their use is modeled via networked interactions and their subsequent effect on agents' use of community resources across an urban population. A random forest model is iteratively fitted to model evaluations to characterize the model parameter space with respect to observed empirical data. We demonstrate the feasibility of using high-performance computing and active learning model exploration techniques to characterize large parameter spaces; by partitioning the parameter space into potentially viable and non-viable regions, we rule out regions of space where simulation output is implausible to observed empirical data. We argue that such methods are necessary to enable model exploration in complex computational models that incorporate increasingly available micro-level behavior data. We provide public access to the model and high-performance computing experimentation code.

97 MATHEMATICS AND COMPUTING↗

Localization of proteins involved in the biogenesis and repair of the photosynthetic apparatus to thylakoid subdomains in Arabidopsis

Abstract Thylakoid membranes in chloroplasts and cyanobacteria harbor the multisubunit protein complexes that catalyze the light reactions of photosynthesis. In plant chloroplasts, the thylakoid membrane system comprises a highly organized network with several subcompartments that differ in composition and morphology: grana stacks, unstacked stromal lamellae, and grana margins at the interface between stacked and unstacked regions. The localization of components of the photosynthetic apparatus among these subcompartments has been well characterized. However, less is known about the localization of proteins involved in the biogenesis and repair of the photosynthetic apparatus, the partitioning of proteins between two recently resolved components of the traditional margin fraction (refined margins and curvature), and the effects of light on these features. In this study, we analyzed the partitioning of numerous thylakoid biogenesis and repair factors among grana, curvature, refined margin, and stromal lamellae fractions of Arabidopsis thylakoid membranes, comparing the results from illuminated and dark‐adapted plants. Several proteins previously shown to localize to a margin fraction partitioned in varying ways among the resolved curvature and refined margin fractions. For example, the ALB3 insertase and FtsH protease involved in photosystem II (PSII) repair were concentrated in the refined margin fraction, whereas TAT translocon subunits and proteins involved in early steps in photosystem assembly were concentrated in the curvature fraction. By contrast, two photosystem assembly factors that facilitate late assembly steps were depleted from the curvature fraction. The enrichment of the PSII subunit OE23/PsbP in the curvature fraction set it apart from other PSII subunits, supporting the previous conjecture that OE23/PsbP assists in PSII biogenesis and/or repair. The PSII assembly factor PAM68 partitioned differently among thylakoid fractions from dark‐adapted plants and illuminated plants and was the only analyzed protein to convincingly do so. These results demonstrate an unanticipated spatial heterogeneity of photosystem biogenesis and repair functions in thylakoid membranes and reveal the curvature fraction to be a focal point of early photosystem biogenesis.

Chotewutmontri, Prakitchai↗

Solubilities of nitrogen and noble gases in basalt melt

Nitrogen and noble gases are important tracers in geochemistry and chosmochemistry. Compared to noble gases, however, physicochemical properties of nitrogen, such as solubility in melt or melt/silicate partition, are not well known. Solubility of nitrogen in basalt melt depends on redox condition of the atmosphere. For example, solubility of nitrogen in E chondrite melt under reducing conditions is as high as 2 mol percent at 1500 C, suggesting that nitrogen is chemically dissolved in silicate melts, i.e., being dissolved as free anions or replacing oxygen sites in silicate network. However, the solubility and the dissolution mechanism of nitrogen under oxidizing conditions are not well investigated. To obtain nitrogen solubility in silicate melts under various redox conditions and to understand its mechanism, we are conducting experiments by using (15)N(15)N-labeled nitrogen gas. This makes it easy to distinguish dissolved nitrogen from later contamination of atmospheric nitrogen, and hence enables us to measure the nitrogen solubility accurately. As a preliminary experiment, we have measured solubility of nitrogen in basalt melt under the atmospheric oxygen pressure.

Miyazaki, A.↗

Aggregate data‐driven dynamic modeling of active distribution networks with DERs for voltage stability studies

Abstract Electric distribution networks increasingly host distributed energy resources based on power electronic converter (PEC) toward active distribution networks (ADN). Despite advances in computational capabilities, electromagnetic transient models are limited in scalability because of their reliance on exact data about the distribution system and each of its components. Similarly, the use of the DER_A model, which is intended to examine the combined dynamic behavior of many DERs, is limited by the difficulty in parameterization. There is a need for improved dynamic models of DERs for use in large power system simulations for stability analysis. This paper proposes an aggregate model‐free, data‐driven approach for deriving a dynamic partitioned model (DPM) of ADNs. Detailed residential distribution feeders were first developed, including PEC‐based DERs and composite load models (CMLDs), from which the aggregated DPM was derived. The performance was evaluated through various case studies and validated against the detailed ADN model and state‐of‐the‐art DER_A model with CMLD. The data‐driven DPM achieved a of over 90%, accurately representing the aggregated dynamic behavior of ADNs. Furthermore, the DPM significantly accelerated the simulation process with a computational speedup of 68 times compared to the detailed ADN and a 3.5 times speedup compared to the DER_A CMLD model.

42 ENGINEERING↗

Method of up-front load balancing for local memory parallel processors

In a parallel processing computer system with multiple processing units and shared memory, a method is disclosed for uniformly balancing the aggregate computational load in, and utilizing minimal memory by, a network having identical computations to be executed at each connection therein. Read-only and read-write memory are subdivided into a plurality of process sets, which function like artificial processing units. Said plurality of process sets is iteratively merged and reduced to the number of processing units without exceeding the balance load. Said merger is based upon the value of a partition threshold, which is a measure of the memory utilization. The turnaround time and memory savings of the instant method are functions of the number of processing units available and the number of partitions into which the memory is subdivided. Typical results of the preferred embodiment yielded memory savings of from sixty to seventy five percent.

Baffes, Paul Thomas↗