Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ITERATIVE NETWORK”

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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

In-Field Testing of Components for Feedback and Control of the ITER Disruption Mitigation System

Here, the shattered pellet injection (SPI) method has been chosen as the disruption mitigation system (DMS) for ITER. To protect the device from plasma disruptions that cause damaging heat and electromagnetic loads, SPI is used to inject high-Z material into the plasma. The process of SPI utilizes cryogenic cooling to form solid pellets. Pellets are accelerated down a barrel and into an angled surface, causing the pellet to shatter prior to entering the tokamak chamber. For the DMS to function reliably, the 27 separate shattered pellet injectors planned for ITER must rely on many components to provide accurate feedback data and for control functions. Each component in the DMS is exposed to an elevated background magnetic field depending on its placement and proximity to the plasma chamber. A Helmholtz coil test stand that is operated at Oak Ridge National Laboratory was utilized to test the components in relevant background field levels to assess component performance. This paper details the test design and results for in-field component operation for a variety of components. This list includes the following components: two different network switches for camera connectivity, a VAT fast shutter valve intended to reduce the flow of SPI propellant gas into the torus, a solenoid control valve intended for use in the pellet formation process, pressure/vacuum switches to be used for feedback and control, a printed circuit board piezo pressure sensor to be used to measure breech pressure, and various relays for the high-voltage pulsed power supply used to drive the SPI propellant valve.

Disruption mitigation↗
DOE OSTI2023

Adjoint Waveform Tomography for Crustal and Upper Mantle Structure the Middle East and Southwest Asia for Improved Waveform Simulations Using Openly Available Broadband Data

We present a new model of radially anisotropic seismic wavespeeds for the crust and upper mantle of a broad region of the Middle East and Southwest Asia (MESWA) derived from adjoint waveform tomography. We inverted waveforms from 192 Global Centroid Moment Tensor earthquakes (MW 5.5-7.0) recorded by over 1000 openly available broadband seismic stations from permanent and temporary networks in the region. Spatial coverage of the available data is highly uneven due to earthquakes clustered along plate boundaries and sparse coverage of open seismic networks in the region. We considered three possible starting models: the SPiRaL global model (Simmons et al., 2021); MEC-1 (Kaviani et al., 2020); and CSEM2.0 (Noe et al., 2023). Because the SPiRaL model provides good fits to the observed waveforms measured by the time-bandwidth product of selected windows in several period bands, provides all the necessary parameters and covers the entire domain we used it for the starting model with the period band 50-100 seconds. Inversion iterations proceeded using time-frequency phase misfits in six stages and 54 total iterations reducing the minimum period to 30 seconds. Our final model, MESWA, provides improved waveform fits compared to the starting model for both the data used in the inversion and an independent validation data set of 66 events. Two metrics of waveform fit (the time-frequency phase misfit used in the optimization and normalized L2 misfit) were both reduced by nearly 60% for both data sets and MESWA provides significantly larger misfit reductions relative to the SPiRaL model than the MEC-1 or CSEM models. We also find that MESWA provides a larger time-bandwidth product of selected windows indicating that more information content of the observed waveforms is explained by MESWA than the other models. Our new model reveals tectonic features imaged by other studies and methods but in a new holistic model of shear and compressional wavespeeds (v S and v P , respectively) with anisotropy covering the crust and uppermost mantle of a larger domain. MESWA has smaller scale-length features and tends to sharpen some features relative to the SPiRaL starting model. Examples include: low crustal v S in the TurkishIranian Plateau, Zagros Mountains, Afghan Central Blocks and Sulaiman Fold Belt; low mantle vSfollowing divergent (Gulf of Aden, Red Sea) and transform (Dead Sea Fault) margins of the Arabian Plate; low and high v S in the mantle beneath the Arabian Shield and Platform, respectively. Low vS is imaged below Cenozoic volcanic centers of the Arabian Peninsula, the so-called Mecca-Madina-Nafud (MMN) Line. Positive anisotropy (v SH > v SV ) is inferred for asthenospheric depths across the region except where up/downwelling may influence fabric alignment (e.g. Afar, Red Sea, Arabian Shield). Elevated vS tracks Makran subduction under southeast Iran. MESWA resembles the SPiRaL model in its long-wavelength structure, but enhances shorter wavelengths features on the order of 200 km and smaller. The resulting model could be used for as a starting model for further improvements, say using waveforms from in-country seismic networks that are not openly available or smaller-scale studies targeting shorter period waveforms. The model also could be used for source characterization and moment tensor inversion to improve earthquake hazard studies and nuclear explosion monitoring.

58 GEOSCIENCES↗
DOE OSTI2024

A novel conditional generative model for efficient ensemble forecasts of state variables in large-scale geological carbon storage

Integrating monitoring data to efficiently update reservoir pressure and CO 2 plume distribution forecasts presents a significant challenge in geological carbon storage (GCS) applications. Inverse modeling techniques are commonly used to fuse observational data and refine reservoir model parameters, thereby improving state variable forecasts. However, these techniques often rely on linear or Gaussian assumptions, which can limit their effectiveness in accurately predicting state variables. Moreover, simulating large-scale three-dimensional (3D) GCS problems is computationally expensive, making iterative runs in inverse problems prohibitive. To address these challenges, we propose a conditional generative model utilizing the score-based diffusion method for real-time 3D pressure and saturation field distribution predictions. Our approach involves solving the score function with a mini-batch-based Monte Carlo estimator to generate labeled data. This data is subsequently employed to train a fully connected neural network, enabling it to learn the conditional sample generator within a supervised learning framework. This method enables the rapid generation of a large ensemble of predictions, facilitating comprehensive uncertainty quantification of state variables. Here we applied our method to forecast the dynamic 3D distributions of pressure and saturation fields over a 30-year injection period. The statistical assessment with low root mean square error (RMSE) values demonstrates that our method can accurately predict the spatiotemporal distributions of both pressure and saturation fields. Moreover, the developed conditional generative model shows high computational efficiency by generating 100 ensemble forecasts of 3D state variables in less than 10 min. The consistency between ensemble averages and ground truth values further illustrates the model’s capability to capture state variable dynamics during the CO 2 plume injection process. Notably, the ground truth values fall within the ensemble forecasts, indicating that our uncertainty quantification effectively captures variability and potential noise in the observations. Thus, the developed conditional generative model proves to be a more efficient, accurate, and practical tool for GCS applications, facilitating timely risk analysis and informed decision-making.

58 GEOSCIENCES↗
DOE OSTI2017

Massively parallel first-principles simulation of electron dynamics in materials

Here we present a highly scalable, parallel implementation of first-principles electron dynamics coupled with molecular dynamics (MD). By using optimized kernels, network topology aware communication, and by fully distributing all terms in the time-dependent Kohn–Sham equation, we demonstrate unprecedented time to solution for disordered aluminum systems of 2000 atoms (22,000 electrons) and 5400 atoms (59,400 electrons), with wall clock time as low as 7.5 s per MD time step. Despite a significant amount of non-local communication required in every iteration, we achieved excellent strong scaling and sustained performance on the Sequoia Blue Gene/Q supercomputer at LLNL. We obtained up to 59% of the theoretical sustained peak performance on 16,384 nodes and performance of 8.75 Petaflop/s (43% of theoretical peak) on the full 98,304 node machine (1,572,864 cores). Lastly, scalable explicit electron dynamics allows for the study of phenomena beyond the reach of standard first-principles MD, in particular, materials subject to strong or rapid perturbations, such as pulsed electromagnetic radiation, particle irradiation, or strong electric currents.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Overlapping Domain Coupling of Multidimensional and System Codes in NEAMS - Pronghorn and SAM

This report describes the implementation and testing of domain-overlapping coupling of the Pronghorn and SAM codes. Both Pronghorn and SAM are codes developed by the DOE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program for analysis of advanced nuclear reactors. Pronghorn focuses on analyzing multi-dimensional core flow conditions, while SAM focuses on analysis of the entire system including, among other components, piping, pumps, and heat exchangers. It is desirable for many advanced reactor thermal-hydraulics simulations to couple Pronghorn and SAM to obtain self-consistent solutions in the core and the system. The domain-overlapping coupling approach provides a robust and numerically efficient candidate for this coupling. We describe the algorithm for obtaining self-consistent solutions between a SAM network of flow channels and an overlapped multi-dimensional Pronghorn domain. The algorithm is tested for a variety of simple canonical test problems and a model of the Molten Salt Reactor Experiment (MSRE). Results demonstrate that the domain overlapping coupling approach provides consistent pressure, mass flow rate, enthalpy, and passive scalar distributions between Pronghorn and SAM and converges reliably and efficiently (at most 15 iterations, usually much less than 10) for the considered test problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The Astronomy Commons Platform: A Deployable Cloud-based Analysis Platform for Astronomy

Abstract We present a scalable, cloud-based science platform solution designed to enable next-to-the-data analyses of terabyte-scale astronomical tabular data sets. The presented platform is built on Amazon Web Services (over Kubernetes and S3 abstraction layers), utilizes Apache Spark and the Astronomy eXtensions for Spark for parallel data analysis and manipulation, and provides the familiar JupyterHub web-accessible front end for user access. We outline the architecture of the analysis platform, provide implementation details and rationale for (and against) technology choices, verify scalability through strong and weak scaling tests, and demonstrate usability through an example science analysis of data from the Zwicky Transient Facility’s 1Bn+ light-curve catalog. Furthermore, we show how this system enables an end user to iteratively build analyses (in Python) that transparently scale processing with no need for end-user interaction. The system is designed to be deployable by astronomers with moderate cloud engineering knowledge, or (ideally) IT groups. Over the past 3 yr, it has been utilized to build science platforms for the DiRAC Institute, the ZTF partnership, the LSST Solar System Science Collaboration, and the LSST Interdisciplinary Network for Collaboration and Computing, as well as for numerous short-term events (with over 100 simultaneous users). In a live demo instance, the deployment scripts, source code, and cost calculators are accessible. 4 4 http://hub.astronomycommons.org/

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2016

Transitioning Autonomous Systems Technology Research to a Flight Software Environment

NASA has developed methods and algorithms for autonomous spacecraft operations,including automated planning and scheduling, fault diagnostics and impact determination,procedure management and display. Making the transition from technology research tooperational flight software requires overcoming significant technical, programmatic andcultural challenges. Technology research is aimed at developing methods that performspecific functions correctly, but the resulting software may not be designed for flightprocessors with limited CPU, memory and network resources, and may not be easilyintegrated into spacecraft flight software. Our objective in the Autonomous Systems andOperations Project is to make significant strides toward the transformation from technologyto operational use. Our focus was twofold: maturing research grade autonomy software intoa flight software environment using broadly accepted languages and tools; and integratingautonomy applications with each other and with representative systems and their data andcommand interfaces. For a target flight software environment, we chose Core FlightSoftware, developed by Goddard Space Flight Center as a common operating systemindependent framework. Our hardware integration environment was provided by theIntegrated Power and Avionics Systems (iPAS) Lab at Johnson Space Center, in whichvarious subsystem development has been conducted to address engineering challenges forthe vehicles and systems required for long-duration missions into the solar system. The iPASand its network of connected facilities provides realistic subsystem hardware or simulationsof spacecraft power, life support, guidance, navigation and control, and command and datahandling subsystems. Interfaces between autonomy applications and the subsystems beingassessed and controlled were developed, assessed and refined. The hardware and softwareenvironment using CFS and the iPAS facility has proven to be a highly flexible and realisticenvironment in which to rapidly integrate applications in an iterative, low cost setting. Usingthe integration environment we have developed, we will turn our focus to performance andsizing analysis to determine the computational requirements for full-scale deployment ofautonomy technology. Scalability of reasoners and the spacecraft models upon which theyoperate, and robustness across the full range of spacecraft conditions and environments willbe explored and improved. We are making significant contributions to the future programsthat will build the spacecraft that will take humans beyond the Earth-Moon system, in whichprogram Systems Engineers will be able to accurately and confidently design in accurate,robust and mature autonomous operations systems.

Flight Software↗
DOE OSTI2026

Computationally efficient Bayesian estimation of graphical networks for omics data

Graphical networks are useful, widely-used modeling approaches to represent complex biological processes with biological measurements generated by platforms such as mass spectrometry. Bayesian analyses of graphical networks for omics data have several advantages over their frequentist counterparts, such as the inclusion of prior knowledge in the estimation of models. However, Bayesian approaches to date have only been feasible for data with a couple hundred biomolecules due to prohibitive computational time, but omics data often contains tens of thousands of biomolecules. Here, we present and illustrate a more computationally efficient approach named BPlane (Bayesian PseudoLikelihood-based Algorithm for Network Estimation) to extend Bayesian modeling capabilities for larger-sized datasets, such as most untargeted proteomics data. Via simulation, we demonstrate that BPlane produces substantial computational savings over a current state-of-the-art Bayesian algorithm while maintaining competitive edge detection accuracy. On a SARS-CoV2 proteomics data with 7000 proteins, the competing algorithm takes three times as long to complete the first iteration as BPlane takes to converge after over 100 iterations.

EM algorithm↗
DOE OSTI2025

wa-hls4ml and lui-gnn: A benchmark and GNN-based surrogate model for hls4ml resource and latency estimation

As machine learning (ML) increasingly serves as a tool for addressing real-time challenges in scientific applications, the development of advanced tooling has significantly reduced the time required to iterate on various designs. These advancements have solved major obstacles, but also exposed new challenges. For example, processes that were not previously considered bottlenecks, such as model synthesis, are now becoming limiting factors in the rapid iteration of designs. To reduce these emerging constraints, multiple efforts are being launched toward designing an ML-based surrogate model that estimates resource usage of synthesized accelerator architectures. This model would reduce the design iteration time, especially when designing within a set of given hardware constraints. This approach shows considerable potential, but as it stands, the effort is early and would benefit from coordination and standardization to assist future work as it emerges. We introduce wa-hls4ml, a benchmark for ML accelerator resource and latency estimation, and its corresponding initial dataset of more than 100,000 fully connected neural networks, all synthesized using hls4ml and targeting Xilinx FPGAs. In addition to the resource utilization and latency data provided, the dataset includes generated artifacts and log files for many of the synthesized neural networks, in order to support future research in ML-based code generation. The benchmark evaluates the performance of resource and latency predictors against several common ML model architectures, primarily originating from scientific domains, as exemplar models, as well as the average performance across a subset of the dataset. We measure the performance of a given predictor model through multiple metrics, including $R^2$ score and SMAPE on regression tasks, as well as inference time to further characterize the estimator under test. Additionally, we introduce the latency/utilization inference graph neural network (lui-gnn), a surrogate model that uses a graph neural network to represent input architectures in the form of a directed graph. This graph representation allows for a diverse set of model architectures to all be effectively handled by a surrogate model. We present the architecture and performance of the model, as evaluated by the new proposed benchmark, including SMAPE, $R^2$ score, and inference times, and find that lui-gnn generally predicts latency and utilization for the 75\% quantile within several percent of the synthesized resources on the synthetic test dataset, indicating that this approach of estimating resource and latency via a surrogate models has promise and warrants further research.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Machine learning guided selection of broad-spectrum epitope-specific functional antibodies for "Disease X"

Our project established and demonstrated a transfer learning framework that enables prediction of antibody–antigen interactions across related viruses. The approach focused on three major activities: 1. Conserved region and epitope identification – We compared viral protein structures and sequences to identify shared receptor-binding domains and neutralizing epitope regions across variants and related viruses. These conserved features formed the foundation for discovering broadly functional antibodies. 2. Machine learning model development – We built neural network–based models that integrate epitope features with antibody sequence information. Instead of relying solely on structural or physical properties, the models learned transferable patterns that describe antibody binding potential across different viral families. 3. Transfer learning and validation – Using SARS-CoV-2 and Ebola as source systems, we successfully transferred learned epitope features to predict antibody interactions for SARS CoV-1 and Marburg virus. Iterative cycles of dataset generation, retraining, and evaluation improved generalization and predictive power, ensuring the framework can adapt to new threats.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2011

Data Farming and Defense Applications

.Data farm,ing uses simulation modeling, high performance computing, experimental design and analysis to examine questions of interest with large possibility spaces. This methodology allows for the examination of whole landscapes of potential outcomes and provides the capability of executing enough experiments so that outliers might be captured and examined for insights. It can be used to conduct sensitivity studies, to support validation and verification of models, to iteratively optimize outputs using heuristic search and discovery, and as an aid to decision-makers in understanding complex relationships of factors. In this paper we describe efforts at the Naval Postgraduate School in developing these new and emerging tools. We also discuss data farming in the context of application to questions inherent in military decision-making. The particular application we illustrate here is social network modeling to support the countering of improvised explosive devices.

Horne, Gary↗
DOE OSTI2022

Scale-invariant machine-learning model accelerates the discovery of quaternary chalcogenides with ultralow lattice thermal conductivity

We design an advanced machine-learning (ML) model based on crystal graph convolutional neural network that is insensitive to volumes (i.e., scale) of the input crystal structures to discover novel quaternary chalcogenides, AMM'Q 3 (A/M/M' = alkali, alkaline earth, post-transition metals, lanthanides, and Q = chalcogens). These compounds are shown to possess ultralow lattice thermal conductivity (κ l ), a desired requirement for thermal-barrier coatings and thermoelectrics. Upon screening the thermodynamic stability of ~1 million compounds using the ML model iteratively and performing density-functional theory (DFT) calculations for a small fraction of compounds, we discover 99 compounds that are validated to be stable in DFT. Taking several DFT-stable compounds, we calculate their κ l using Peierls–Boltzmann transport equation, which reveals ultralow κ l (<2 Wm -1 K -1 at room temperature) due to their soft elasticity and strong phonon anharmonicity. Our work demonstrates the high efficiency of scale-invariant ML model in predicting novel compounds and presents experimental-research opportunities with these new compounds.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Reinforcement Learning of Structured Stabilizing Control for Linear Systems With Unknown State Matrix

This paper delves into designing feedback control gains for a continuous-time linear quadratic regulator (LQR) problem that is constrained to certain predefined structure with unknown state matrix. We bring forth the ideas from reinforcement learning (RL) in conjunction with sufficient stability and performance guarantees in order to design these structured gains using the trajectory measurements of states and controls. Here we first formulate a model-based framework using dynamic programming (DP) to embed the structural constraint to the LQR gain computation in the continuous-time setting, and then subsequently, formulate a policy iteration RL algorithm that can alleviate the requirement of known state matrix in conjunction with maintaining the feedback gain structure. The design enables a distributed learning control design which is necessary for many large-scale cyber-physical systems. Theoretical guarantees are provided for stability and convergence of the structured reinforcement learning (SRL) algorithm. We validate our theoretical results with numerical simulations on a multi-agent networked linear time-invariant (LTI) dynamic system.

42 ENGINEERING↗
NASA NTRS1992

A decomposition method for optimization of large-system reliability

This paper considers a decomposition approach for optimization of the reliability of a large system with a general network structure. A 3-level methodology is developed for optimal allocation of available resources among subsystems in order to ensure maximization of system-reliability. The decentralized nature of this methodology greatly reduces the complexity of the large problem and facilitates seeking the optimal solution. Two examples show that the complexity of a large system can be greatly reduced by solving several smaller-dimensional sub-problems iteratively. Sub-problems whose dimensions are small can be efficiently solved by any existing nonlinear programming method. Another important feature of this approach is the possible simplification of the objective function during the solution. This leads in some cases to an analytic solution for the lower-level optimization problems in a 3-level decomposition solution.

Li, Duan↗
NASA NTRSDate not supplied

Supporting Exploration Missions by Enabling Exploration Mission System Software

Future exploration missions will consist of a multitude of data sources, systems, and operators collaborating to complete mission objectives. Presently, NASA is instantiating the contractual mechanisms, such as the xEVAS and HLS contracts, to produce these mission assets. Architectural planning is also underway to establish the networking protocols and infrastructure to digitally create and connect mission elements, such as LunaNET. However, without new horizontally integrated data systems, these advancements will be limited in their ability to get mission data appropriately integrated into the plan, train, fly, explore workflow of the operations workforce. Here we describe several mission system software development efforts underway that are designed to support human spaceflight missions. We describe the current iterations of a suite of tools to support EVA procedure authoring and execution, for both ISS and Artemis missions, as well as a software solution to establish and interact with mission context and data products. These tools have been developed iteratively and continue to be tested in several NASA facilities such as the Neutral Buoyancy Lab (NBL), Artemis field testing, and in present-day International Space Station (ISS) operations on orbit. Our solutions demonstrate how software development can be aligned with ongoing operations development activities to discover the features that best support future human spaceflight missions.

EVA Mission System Software↗
DOE OSTI2022

Hierarchical Distributed Optimal Power Flow of HV and MV Distribution Networks With Continuous and Discrete Devices

With large-scale distributed photovoltaics (PVs) being integrated into distribution networks (DNs), coordinated optimal power flow (OPF) of high voltage (HV) and medium voltage (MV) DNs should be investigated to optimally dispatch the distributed PVs and other network devices. Here, this paper presents a hierarchical distributed OPF method for HV and MV DNs with on-load tap changers, reactive power compensators, feeder switches and distributed PVs. A hierarchical master-slave control architecture is applied to implement coordinated OPF of two-layer DNs. The HV master problem and MV subproblems are transformed into mixed-integer convex problems respectively with second order cone programming and LinDistFlow approximation. Since there is no efficient distributed algorithm to solve such OPF models with integer subproblems, a novel distributed algorithm is proposed in this paper to efficiently solve the hierarchical coordinated OPF model with integer subproblems in a distributed manner. In the proposed algorithm, the coordinated OPF model is solved in a branch-and-bound framework, where in each branch node generalized Benders decomposition (GBD) algorithm is applied to decompose the coordinated OPF model into a master problem and relaxed subproblems and solves them iteratively to get optimal solution. The GBD optimal and feasible cutting planes generated in a branch node are proved to be valid for its descendants. Moreover, three acceleration techniques are introduced into the proposed algorithm to improve computational efficiency. Finally, the effectiveness and accuracy of the proposed method are verified via simulation tests in Jinzhai DNs of China.

42 ENGINEERING↗
DOE OSTI2016

Addressing numerical challenges in introducing a reactive transport code into a land surface model: a biogeochemical modeling proof-of-concept with CLM–PFLOTRAN 1.0

Abstract. We explore coupling to a configurable subsurface reactive transport code as a flexible and extensible approach to biogeochemistry in land surface models. A reaction network with the Community Land Model carbon–nitrogen (CLM-CN) decomposition, nitrification, denitrification, and plant uptake is used as an example. We implement the reactions in the open-source PFLOTRAN (massively parallel subsurface flow and reactive transport) code and couple it with the CLM. To make the rate formulae designed for use in explicit time stepping in CLMs compatible with the implicit time stepping used in PFLOTRAN, the Monod substrate rate-limiting function with a residual concentration is used to represent the limitation of nitrogen availability on plant uptake and immobilization. We demonstrate that CLM–PFLOTRAN predictions (without invoking PFLOTRAN transport) are consistent with CLM4.5 for Arctic, temperate, and tropical sites.Switching from explicit to implicit method increases rigor but introduces numerical challenges. Care needs to be taken to use scaling, clipping, or log transformation to avoid negative concentrations during the Newton iterations. With a tight relative update tolerance (STOL) to avoid false convergence, an accurate solution can be achieved with about 50 % more computing time than CLM in point mode site simulations using either the scaling or clipping methods. The log transformation method takes 60–100 % more computing time than CLM. The computing time increases slightly for clipping and scaling; it increases substantially for log transformation for half saturation decrease from 10-3 to 10-9 mol m-3, which normally results in decreasing nitrogen concentrations. The frequent occurrence of very low concentrations (e.g. below nanomolar) can increase the computing time for clipping or scaling by about 20 %, double for log transformation. Overall, the log transformation method is accurate and robust, and the clipping and scaling methods are efficient. When the reaction network is highly nonlinear or the half saturation or residual concentration is very low, the allowable time-step cuts may need to be increased for robustness for the log transformation method, or STOL may need to be tightened for the clipping and scaling methods to avoid false convergence.As some biogeochemical processes (e.g., methane and nitrous oxide reactions) involve very low half saturation and thresholds, this work provides insights for addressing nonphysical negativity issues and facilitates the representation of a mechanistic biogeochemical description in Earth system models to reduce climate prediction uncertainty.

58 GEOSCIENCES↗
DOE OSTI2014

Grappolo

Community detection has become a fundamental operation in numerous graph-theoretic applications. It is used to reveal natural divisions that exist within real world networks without imposing prior size or cardinality constraints on the set of communities. Despite its potential for application, there is only limited support for community detection on large-scale parallel computers, largely owing to the irregular and inherently sequential nature of the underlying heuristics. In this paper, we present parallelization heuristics for fast community detection using the Louvain method as the serial template. The Louvain method is an iterative heuristic for modularity optimization. Originally developed by Blondel et al. in 2008, the method has become increasingly popular owing to its ability to detect high modularity community partitions in a fast and memory-efficient manner. However, the method is also inherently sequential, thereby limiting its scalability. Here, we observe certain key properties of this method that present challenges for its parallelization, and consequently propose heuristics that are designed to break the sequential barrier. For evaluation purposes, we implemented our heuristics using OpenMP multithreading, and tested them over real world graphs derived from multiple application domains (e.g., internet, citation, biological). Compared to the serial Louvain implementation, our parallel implementation is able to produce community outputs with a higher modularity for most of the inputs tested, in comparable number of iterations, while providing real speedups of up to 8x using 32 threads. In addition, our parallel implementation was able to exhibit weak scaling properties on up to 32 threads.

Halappanavar, Mahantesh↗