Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONNECT algorithm”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

ConnectIt: a framework for static and incremental parallel graph connectivity algorithms

Connected components is a fundamental kernel in graph applications. The fastest existing multicore algorithms for solving graph connectivity are based on some form of edge sampling and/or linking and compressing trees. However, many combinations of these design choices have been left unexplored. In this paper, we design the ConnectIt framework, which provides different sampling strategies as well as various tree linking and compression schemes. ConnectIt enables us to obtain several hundred new variants of connectivity algorithms, most of which extend to computing spanning forest. In addition to static graphs, we also extend ConnectIt to support mixes of insertions and connectivity queries in the concurrent setting. We present an experimental evaluation of ConnectIt on a 72-core machine, which we believe is the most comprehensive evaluation of parallel connectivity algorithms to date. Compared to a collection of state-of-the-art static multicore algorithms, we obtain an average speedup of 12.4x (2.36x average speedup over the fastest existing implementation for each graph). Using ConnectIt, we are able to compute connectivity on the largest publicly-available graph (with over 3.5 billion vertices and 128 billion edges) in under 10 seconds using a 72-core machine, providing a 3.1x speedup over the fastest existing connectivity result for this graph, in any computational setting. For our incremental algorithms, we show that our algorithms can ingest graph updates at up to several billion edges per second. To guide the user in selecting the best variants in ConnectIt for different situations, we provide a detailed analysis of the different strategies. Finally, we show how the techniques in ConnectIt can be used to speed up two important graph applications: approximate minimum spanning forest and SCAN clustering.

Computer Science↗
DOE OSTI2021

Application of remote sensing precipitation data and the $\mathrm{CONNECT}$ algorithm to investigate spatiotemporal variations of heavy precipitation: Case study of major floods across Iran (Spring 2019)

In recent years, the number of floods following unprecedented rainfall events have increased in Iran during early spring (March 21st to April 20th, referred to in Iran as the month of “Farvadin”). While numerous studies have addressed changes in climate extremes and precipitation trends at different temporal scales from daily to annual across the country, analyses of short-duration and heavy precipitation, especially during recent years, are rarely considered. Furthermore, most studies investigate the variations in extremes and total precipitation using a limited number of synoptic weather stations across Iran. Here this study assesses the variations in heavy precipitation (precipitation with intensities greater than or equal to 3 mm/3 h) at 0.04° spatial and 3-hourly temporal resolution during the month of Farvardin. In addition, the effect of atmospheric river conditions over Iran and their possible link to intensifying heavy precipitation is explored. For this purpose, the CONNected-objECT (CONNECT) algorithm is applied on a precipitation dataset, Precipitation Estimation from Remotely Sensed Information Using Artificial Neural Networks-Cloud Classification System (PERSIANN-CCS), and an Integrated Water Vapor Transport (IVT) dataset from the NASA Modern-Era Retrospective Analysis for Research and Applications Version-2 (MERRA-2). The results suggest that the increase in the number of floods in recent years is related to the increase in the intensity and volume of heavy precipitation events, although the frequency and duration of heavy precipitation events have not changed significantly. Furthermore, the results show that atmospheric river conditions over the country are present during the same window as each year’s most extreme events. It is found that 8 out of 13 of the largest ARs over Iran come from moisture plumes with pathways over the African and Red Sea.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Examination of Global Midlatitude Atmospheric River Lifecycles Using an Object-Oriented Methodology

Tracking atmospheric rivers (ARs) across their lifecycles is a field of recent interest with a multitude of emerging methodologies. The CONNected-objECT (CONNECT) algorithm is adapted for the tracking of global midlatitude AR lifecycles and associated precipitation by implementing a seeded region growing segmentation algorithm, creating the AR-CONNECT algorithm. To facilitate the permissiveness of the methodology, AR-CONNECT is without hard-coded geometric criteria yet is still shown to extract synoptic-scale elongated objects >99.99% of the time. One of the consequences of the methodology is the ability to occasionally track atmospheric water vapor anomalies before evolving into AR geometries, effectively tracking AR genesis further back than other studies. With the aid of subdaily satellite-derived rain data, we investigate the climatology, trends, and patterns of AR lifecycles from 1983–2016 and compare with other AR tracking studies. We find that AR frequency, genesis, and terminus locations are in generally good agreement with other AR tracking methodologies, though with key differences, and that AR frequencies in each hemisphere are determined by the number of AR hotspots. Furthermore, we uncover evidence that certain AR characteristics, such as frequency, areal extent, and duration, show evidence of increasing trends. Midlatitude precipitation uncovered by AR-CONNECT shows contributions up to 50% over land and 65% over the ocean. Trend analysis of AR precipitation shows an increase in precipitation associated with ARs propagated by the Southern Jet Stream and ARs that traverse over the Sahara Desert, among others, but is determined not to be a driver of changes in global precipitation.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Parallel algorithms for finding connected components using linear algebra

Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computation. This paper presents a class of parallel connected-component algorithms designed using linear-algebraic primitives. These algorithms are based on a PRAM algorithm by Shiloach and Vishkin and can be designed using standard GraphBLAS operations. Here, we demonstrate two algorithms of this class, one named LACC for Linear Algebraic Connected Components, and the other named FastSV which can be regarded as LACC’s simplification. With the support of the highly-scalable Combinatorial BLAS library, LACC and FastSV outperform the previous state-of-the-art algorithm by a factor of up to 12x for small to medium scale graphs. For large graphs with more than 50B edges, LACC and FastSV scale to 4K nodes (262K cores) of a Cray XC40 supercomputer and outperform previous algorithms by a significant margin. This remarkable performance is accomplished by (1) exploiting sparsity that was not present in the original PRAM algorithm formulation, (2) using high-performance primitives of Combinatorial BLAS, and (3) identifying hot spots and optimizing them away by exploiting algorithmic insights.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Towards a more general understanding of the algorithmic utility of recurrent connections

Lateral and recurrent connections are ubiquitous in biological neural circuits. Yet while the strong computational abilities of feedforward networks have been extensively studied, our understanding of the role and advantages of recurrent computations that might explain their prevalence remains an important open challenge. Foundational studies by Minsky and Roelfsema argued that computations that require propagation of global information for local computation to take place would particularly benefit from the sequential, parallel nature of processing in recurrent networks. Such “tag propagation” algorithms perform repeated, local propagation of information and were originally introduced in the context of detecting connectedness, a task that is challenging for feedforward networks. Here, we advance the understanding of the utility of lateral and recurrent computation by first performing a large-scale empirical study of neural architectures for the computation of connectedness to explore feedforward solutions more fully and establish robustly the importance of recurrent architectures. In addition, we highlight a tradeoff between computation time and performance and construct hybrid feedforward/recurrent models that perform well even in the presence of varying computational time limitations. We then generalize tag propagation architectures to propagating multiple interacting tags and demonstrate that these are efficient computational substrates for more general computations of connectedness by introducing and solving an abstracted biologically inspired decision-making task. Our work thus clarifies and expands the set of computational tasks that can be solved efficiently by recurrent computation, yielding hypotheses for structure in population activity that may be present in such tasks.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Developing IEEE Std 2800-Compliant Algorithms for Transmission-Connected Inverter-Based Resources

This study addresses the compliance of Inverter-based Resources (IBRs) with IEEE Standard 2800, a leading standard that defines interconnection and interoperability requirements for IBRs integrated into transmission systems. Focusing on abnormal grid scenarios, the research evaluates the specific demands on IBRs, proposing a controller development framework for abnormal grid conditions. This framework caters to maintaining ride-through operation in line with IEEE Std 2800, alongside managing currents during voltage ride-through scenarios. The effectiveness of this proposed controller frame-work is rigorously validated through case studies, employing a MATLAB/Simulink model of an IBR to test its performance under diverse grid fault conditions, ensuring the IBRs' alignment with standard requirements and their robust performance in enhancing grid reliability.

IEEE Std 2800↗
DOE OSTI2024

Developing IEEE Std 2800-Compliant Algorithms for Transmission-Connected Inverter-Based Resources: Preprint

This study addresses the compliance of Inverter-based Resources (IBRs) with the IEEE Std 2800, a leading standard that defines interconnection and interoperability requirements for IBRs integrated into transmission systems. Focusing on abnormal grid scenarios, the research evaluates the specific demands on IBRs, proposing a comprehensive controller development framework. This framework caters to maintaining ride-trhough operation or implementing strategic disconnections in line with IEEE Std 2800, alongside managing currents during voltage ride-through scenarios. The effectiveness of this proposed controller framework is rigorously validated through case studies, employing a MATLAB/Simulink model of an IBR to test its performance under diverse grid fault conditions, ensuring the IBRs' alignment with standard requirements and their robust performance in enhancing grid reliability.

IEEE Std 2800↗
DOE OSTI2024

Developing IEEE Std 2800-Compliant Algorithms for Transmission-Connected Inverter-Based Resources

This study addresses the compliance of Inverter-based Resources (IBRs) with IEEE Standard 2800, a leading standard that defines interconnection and interoperability requirements for IBRs integrated into transmission systems. Focusing on abnormal grid scenarios, the research evaluates the specific demands on IBRs, proposing a controller development framework for abnormal grid conditions. This framework caters to maintaining ride-through operation in line with IEEE Std 2800, alongside managing currents during voltage ride-through scenarios. The effectiveness of this proposed controller framework is rigorously validated through case studies, employing a MATLAB/Simulink model of an IBR to test its performance under diverse grid fault conditions, ensuring the IBRs' alignment with standard requirements and their robust performance in enhancing grid reliability.

grid↗
DOE OSTI2024

An Innovative Energy Management System for Microgrids with Multiple Grid-Forming Inverters

As increasingly more grid-forming (GFM) inverter-based resources replace traditional fossil-fueled synchronous generators as the GFM sources in microgrids, the existing microgrid energy management systems (EMS) need to be updated to control and coordinate multiple GFM inverters that consider system control objectives under different microgrid connection states.For each state, we formulate an optimization problem and apply a real-time feedback-based control algorithm; altogether, the control algorithms seamlessly connect the states into a generic microgrid EMS that controls the nodal voltages and frequencies, becomes a virtual power plant (VPP) when connected to the main grid, and coordinates power sharing responsibility among GFM sources when islanded. We showcase the EMS on a real-world simulation of a microgrid under the different states to demonstrate its operational effectiveness.

energy management system↗
DOE OSTI2024

An Innovative Energy Management System for Microgrids with Multiple Grid-Forming Inverters

As increasingly more grid-forming (GFM) inverter-based resources replace traditional fossil-fueled synchronous generators as the GFM sources in microgrids, the existing microgrid energy management systems (EMS) need to be updated to control and coordinate multiple GFM inverters that consider system control objectives under different microgrid connection states. For each state, we formulate an optimization problem and apply a real-time feedback-based control algorithm; altogether, the control algorithms seamlessly connect the states into a generic microgrid EMS that controls the nodal voltages and frequencies, becomes a virtual power plant (VPP) when connected to the main grid, and coordinates power sharing responsibility among GFM sources when islanded. We showcase the EMS on a real-world simulation of a microgrid under the different states to demonstrate its operational effectiveness.

energy management systems↗
DOE OSTI2024

An Innovative Energy Management System for Microgrids with Multiple Grid-Forming Inverters: Preprint

As more and more grid-forming (GFM) inverter-based resources replace traditional fossil-fueled synchronous generators as the GFM sources in microgrids, the existing microgrid energy management systems (EMSs) need to be updated to control and coordinate multiple GFM inverters that consider system control objectives under different microgrid connection states. For each state, we formulate an optimization problem and apply a real-time feedback-based control algorithm; all together, the control algorithms seamlessly connect the states into a generic EMS. We showcase the EMS on a real-world simulation of a microgrid under the different states to demonstrate its operational effectiveness.

energy management system↗
DOE OSTI2021

Teeport: Break the Wall Between the Optimization Algorithms and Problems

Optimization algorithms/techniques such as genetic algorithm, particle swarm optimization, and Gaussian process have been widely used in the accelerator field to tackle complex design/online optimization problems. However, connecting the algorithm with the optimization problem can be difficult, as the algorithms and the problems may be implemented in different languages, or they may require specific resources. We introduce an optimization platform named Teeport that is developed to address the above issues. This real-time communication-based platform is designed to minimize the effort of integrating the algorithms and problems. Once integrated, the users are granted a rich feature set, such as monitoring, controlling, and benchmarking. Some real-life applications of the platform are also discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Session Introduction: Graph Representations and Algorithms in Biomedicine

Connectivity is a fundamental property of biological systems: on the cellular level, proteins interact with each other to form protein-protein interaction networks (PPIs); on the organism level, neurons are arranged in a network; and on a community-level, species can have complex relationships with one another that drive the development and balance of an ecosystem. Graphs, representations of systems consisting of entities as vertices and their connections as edges, are a useful structure to characterize many such systems. Such models can be used to understand biological systems that naturally have a network structure, including PPIs, biological neurons, and ecosystems. In today’s information age, graph representations and algorithms (often in combination with machine learning techniques) are used to organize massive amounts of related data, much of which may be heterogeneous or unstructured, and identify patterns that represent novel biological insights. PSB’s 2023 session “Graph Representations and algorithms in Biomedicine,” encompasses modern developments in graph theory and its applications to various fields of biomedicine. This session includes a wide range of research - knowledge graphs built from text-mined health data, heterogeneous networks using multi-omic databases, and graphs refined to represent uncertainty or improve memory usage.

Chrisman, Brianna S.↗
DOE OSTI2021

Identifying and tracking bubbles and drops in simulations: A toolbox for obtaining sizes, lineages, and breakup and coalescence statistics

Knowledge of bubble and drop size distributions in two-phase flows is important for characterizing a wide range of phenomena, including combustor ignition, sonar communication, and cloud formation. The physical mechanisms driving the background flow also drive the time evolution of these distributions. Accurate and robust identification and tracking algorithms for the dispersed phase are necessary to reliably measure this evolution and thereby quantify the underlying mechanisms in interface-resolving flow simulations. The identification of individual bubbles and drops traditionally relies on an algorithm used to identify connected regions. This traditional algorithm can be sensitive to the presence of spurious structures. A cost-effective refinement is proposed to maximize volume accuracy while minimizing the identification of spurious bubbles and drops. An accurate identification scheme is crucial for distinguishing bubble and drop pairs with large size ratios. The identified bubbles and drops need to be tracked in time to obtain breakup and coalescence statistics that characterize the evolution of the size distribution, including breakup and coalescence frequencies, and the probability distributions of parent and child bubble and drop sizes. An algorithm based on mass conservation is proposed to construct bubble and drop lineages using simulation snapshots that are not necessarily from consecutive time steps. These lineages are then used to detect breakup and coalescence events, and obtain the desired statistics. Accurate identification of large-size-ratio bubble and drop pairs enables accurate detection of breakup and coalescence events over a large size range. Accurate detection of successive breakup and coalescence events requires that the snapshot interval be an order of magnitude smaller than the characteristic breakup and coalescence times to capture these successive events while minimizing the identification of repeated confounding events. Together, these algorithms serve as a toolbox for detailed analysis of two-phase simulations, and enable insights into the mechanisms behind bubble and drop formation and evolution in flows of practical importance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

RTDP: Streaming Readout Real-Time Development and Testing Platform

The Thomas Jefferson National Accelerator Facility (JLab) has created and is currently working on various tools to facilitate streaming readout (SRO) for upcoming experiments. These include reconstruction frameworks with support for Artificial Intelligence/Machine Learning, distributed High Throughput Computing (HTC), and heterogeneous computing which all contribute significantly to swift data processing and analysis. Designing SRO systems that combine such components for new experiments would benefit from a platform that would combine both simulation and execution components for simulation, testing, and validation before large investments are made. The Real-Time Development Platform (RTDP) is being developed as part of an LDRD funded project at JLab. RTDP aims to establish a seamless connection between algorithms, facilitating the seamless processing of data from SRO to analysis, as well as enabling the execution of these algorithms in various configurations on compute and data centers. Individual software components simulating specific hardware can be replaced with actual hardware when it is available.

Gyurjyan, Vardan↗
DOE OSTI2024

Quantifying air quality co-benefits to industrial decarbonization: the local Air Emissions Tracking Atlas

Many decarbonization technologies have the added co-benefit of reducing short-lived climate pollutants, such as particulate matter (PM), nitrogen oxides (NO x ), and sulfur dioxide (SO 2 ), creating a unique opportunity for identifying strategies that promote both climate change solutions and opportunities for air quality improvement. However, stakeholders and decision-makers may struggle to quantify how these co-benefits will impact public health for the communities most affected by industrial air pollution. To address this problem, the LOCal Air Emissions Tracking Atlas (LOCAETA) fills a data availability and analysis gap by providing estimated air quality benefits from industrial decarbonization options, such as carbon capture and storage (CCS). These co-benefits are calculated using an algorithm that connects disparate datasets that separately report greenhouse gas emissions and other pollutants at U.S. industrial facilities. Version 1.0 of LOCAETA displays the estimated primary PM 2.5 emission reduction co-benefits from additional pretreatment equipment for CCS on industrial and power facilities across the state of Louisiana, as well as the potential for VOC and NH 3 generation. The emission reductions are presented in the tool alongside facility pollutant emissions information and relevant air quality, environmental, demographic, and public health datasets, such as air toxics cancer risk, satellite and in situ pollutant measurements, and population vulnerability metrics. LOCAETA enables regulators, policymakers, environmental justice communities, and industrial and commercial users to compare and contrast quantifiable public health benefits due to air quality impacts from various climate change mitigation strategies using a free and publicly-available tool. Additional pollutant reductions can be calculated using the same methodology and will be available in future versions of the tool.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Simulating Catalysis with Realistic Pellet Geometries Using Mesoflow: A Case Study of Catalytic Propane Dehydrogenation

We present a case study of catalytic propane dehydrogenation with our open-source multiphysics solver, Mesoflow. The solver was developed to simulate reactive flow coupled to heterogeneous catalytic reactions and deactivation in the context of complex, mesoscale geometry. The method leverages cartesian block-structured adaptive mesh refinement to capture realistic catalyst microstructural features acquired directly from X-ray computed tomography data. A kinetic model for propane dehydrogenation and catalyst deactivation was developed based on temporal analysis of products (TAP) reactor experiments. The TAP reactor experiments allow for precise characterization of intrinsic kinetic reaction steps which are implemented into Mesoflow simulations to model the spatial and temporal evolution of reactants, products, and catalyst active sites. The short-term and long-term deactivation behavior is studied by using XCT data collected from fresh and aged catalyst pellets, which exhibit different microstructural features. This study employs time-splitting algorithms to connect disparate reaction and flow timescales, enabling the simulations to achieve realistic deactivation timescales on the order of minutes while the flow time-scales for small particles (100 microns) are several milliseconds. We also introduce a flexible automated python script that writes the necessary files to construct a Mesoflow simulation from user-created chemical mechanisms. We will also introduce a few new features that are added to Mesoflow such as higher order schemes, implicit chemistry integrators and the ability to run on AMD and NVIDIA graphics-processing-units.

AMReX↗