Search NASA⌕ Search

SEARCH · Search NASA

Results for “connected components”

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 37 records · Page 2

Sequence optimizations in a high-performance computing environment

Embodiments are directed to techniques to determine dataflow graph instructions comprising one or more pick/switch instruction pairs and generate a reverse static single assignment graph based on the dataflow graph instructions, the reverse static single assignment graph comprising strongly connected components, each of the strongly connected components associated with at least one of the one or more pick/switch instruction pairs. Embodiments also include traversing the reverse static single assignment graph depth-first, and replace pick/switch instructions associated with strongly connected components having configuration values with compound instructions.

97 MATHEMATICS AND COMPUTING↗

On chemical distances and shape theorems in percolation models with long-range correlations

In this paper, we provide general conditions on a one parameter family of random infinite subsets of Z{sup d} to contain a unique infinite connected component for which the chemical distances are comparable to the Euclidean distance. In addition, we show that these conditions also imply a shape theorem for the corresponding infinite connected component. By verifying these conditions for specific models, we obtain novel results about the structure of the infinite connected component of the vacant set of random interlacements and the level sets of the Gaussian free field. As a byproduct, we obtain alternative proofs to the corresponding results for random interlacements in the work of Cerný and Popov [“On the internal distance in the interlacement set,” Electron. J. Probab. 17(29), 1–25 (2012)], and while our main interest is in percolation models with long-range correlations, we also recover results in the spirit of the work of Antal and Pisztora [“On the chemical distance for supercritical Bernoulli percolation,” Ann Probab. 24(2), 1036–1048 (1996)] for Bernoulli percolation. Finally, as a corollary, we derive new results about the (chemical) diameter of the largest connected component in the complement of the trace of the random walk on the torus.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis

Label Propagation is not only a well-known machine learning algorithm for classification but also an effective method for discovering communities and connected components in networks. We propose a new Direction-optimizing Label Propagation Algorithm (DOLPA) framework that enhances the performance of the standard Label Propagation Algorithm (LPA), increases its scalability, and extends its versatility and application scope. As a central feature, the DOLPA framework relies on the use of frontiers and alternates between label push and label pull operations to attain high performance. It is formulated in such a way that the same basic algorithm can be used for finding communities or connected components in graphs by only changing the objective function used. Additionally, DOLPA has parameters for tuning the processing order of vertices in a graph to reduce the number of edges visited and improve the quality of solution obtained. We present the design and implementation of the enhanced algorithm as well as our shared-memory parallelization of it using OpenMP. We also present an extensive experimental evaluation of our implementations using the LFR benchmark and real-world networks drawn from various domains. Compared with an implementation of LPA for community detection available in a widely used network analysis software, we achieve at most five times the F-Score while maintaining similar runtime for graphs with overlapping communities. We also compare DOLPA against an implementation of the Louvain method for community detection using the same LFR-graphs and show that DOLPA achieves about three times the F-Score at just 10% of the runtime. For connected component decomposition, our algorithm achieves orders of magnitude speedups over the basic LP-based algorithm on large-diameter graphs, up to 13.2× speedup over the Shiloach-Vishkin algorithm, and up to 1.6× speedup over Afforest on an Intel Xeon processor using 40 threads.

97 MATHEMATICS AND COMPUTING↗

Feature Extraction and Selection From the Perspective of Explosive Detection

Features are extractable measurements from a sample image summarizing the information content in an image and in the process providing an essential tool in image understanding. In particular, they are useful for image classification into pre-defined classes or grouping a set of image samples (also called clustering) into clusters with similar within-cluster characteristics as defined by such features. At the lowest level, features may be the intensity levels of a pixel in an image. The intensity levels of the pixels in an image may be derived from a variety of sources. For example, it can be the temperature measurement (using an infra-red camera) of the area representing the pixel or the X-ray attenuation in a given volume element of a 3-d image or it may even represent the dielectric differential in a given volume element obtained from an MIR image. At a higher level, geometric descriptors of objects of interest in a scene may also be considered as features in the image. Examples of such features are: area, perimeter, aspect ratio and other shape features, or topological features like the number of connected components, the Euler number (the number of connected components less the number of 'holes'), etc. Occupying an intermediate level in the feature hierarchy are texture features which are typically derived from a group of pixels often in a suitably defined neighborhood of a pixel. These texture features are useful not only in classification but also in the segmentation of an image into different objects/regions of interest. At the present state of our investigation, we are engaged in the task of finding a set of features associated with an object under inspection ( typically a piece of luggage or a brief case) that will enable us to detect and characterize an explosive inside, when present. Our tool of inspection is an X-Ray device with provisions for computed tomography (CT) that generate one or more (depending on the number of energy levels used) digitized 3-dimensional attenuation images with a voxel resolution of the order of one quarter of a milimeter. In the task of feature extraction and subsequent selection of an appropriate subset thereof, several important factors need to be considered. Foremost among them are: (1) Definition of the sampling unit from which the features will be extracted for the purpose of detection/ identification of the explosives. (2) The choice of features ( given the sampling unit) to be extracted that can be used to signal the existence / identity of the explosive. (3) Robustness of the computed features under different inspection conditions. To attain robustness, invariance under the transformations of translation, scaling, rotation and change of orientation is highly desirable. (4) The computational costs in the process of feature extraction, selection and their use in explosive detection/ identification In the search for extractable features, we have done a thorough literature survey with the above factors in mind and come out with a list of features that could possibly help us in meeting our objective. We are assuming that features will be based on sampling units that are single CT slices of the target. This may however change when appropriate modifications should be made to the feature extraction process. We indicate below some of the major types of features in 2- or 3-dimensional images that have been used in the literature on application of pattern recognition (PR) techniques in image understanding and are possibly pertinent to our study. In the following paragraph, we briefly indicate the motivation that guided us in the choice of these features, and identify the nature of the constraints. The principal feature types derivable from an image will be discussed in section 2. Once the features are extracted, one must select a subset of this feature set that will retain the most useful information and remove any redundant and irrelevant information that may have a detrimental effect on the classifier performance. This is discussed in section 3. Section 4 provides a brief summary.

42 ENGINEERING↗

An instability of hyperbolic space under the Yang-Mills flow

We consider the Yang-Mills flow on hyperbolic 3-space. The gauge connection is constructed from the frame-field and (not necessarily compatible) spin connection components. The fixed points of this flow include zero Yang-Mills curvature configurations, for which the spin connection has zero torsion and the associated Riemannian geometry is one of constant curvature. We analytically solve the linearized flow equations for a large class of perturbations to the fixed point corresponding to hyperbolic 3-space. These can be expressed as a linear superposition of distinct modes, some of which are exponentially growing along the flow. The growing modes imply the divergence of the (gauge invariant) perturbative torsion for a wide class of initial data, indicating an instability of the background geometry that we confirm with numeric simulations in the partially compactified case. There are stable modes with zero torsion, but all the unstable modes are torsion-full. This leads us to speculate that the instability is induced by the torsion degrees of freedom present in the Yang-Mills flow.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Radioactive Decay Computation with a Graph Approach for Solving a Linear Dynamic System

ABSTRACT: This article gives two graph-based algorithms for radioactive decay computation. The first algorithm identifies the connected components of the graph induced from the given radioactive decay dynamics to reduce the size of the problem. The solutions are derived over the precalculated connected components, respectively and independently. The second algorithm utilizes acyclic structure of radioactive decay dynamics. The algorithm evaluates the reachable vertices of the induced system graph from the initially activated vertices and finds the minimal set of starting vertices populating the entire reachable vertices. Then, the decay calculations are performed over the reachable vertices from the identified minimal starting vertices, respectively, with the partitioned initial value over the reachable vertices. A formal argument is given to show that the proposed graph inspired divide and conquer calculation methods perform the intended radioactive decay calculation. Empirical efforts comparing the proposed radioactive decay calculation algorithms are presented.

42 ENGINEERING↗

Arrangements of codimension-one submanifolds

We study the number f of connected components in the complement to a finite set (arrangement) of closed submanifolds of codimension 1 in a closed manifold M. In the case of arrangements of closed geodesics on an isohedral tetrahedron, we find all possible values for the number fof connected components. We prove that the set of numbers that cannot be realized by the number f of an arrangement of n {>=} 71 projective planes in the three-dimensional real projective space is contained in the similar known set of numbers that are not realizable by arrangements of n lines on the projective plane. For Riemannian surfaces M we express the number f via a regular neighbourhood of a union of immersed circles and the multiplicities of their intersection points. For m-dimensional Lobachevskii space we find the set of all possible numbers f for hyperplane arrangements. Bibliography: 18 titles.

97 MATHEMATICS AND COMPUTING↗

Graph processing platforms at scale: practices and experiences

Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution, connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.

Lim, Seung-Hwan↗

GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1

Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.

Simmhan, Yogesh↗

TripleGraph

RDF triplestores are great tools for online graph analytic processing (i.e., graph pattern query processing), but they do not provide graph mining capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.). The software title “TripleGraph” is a graph analysis toolkit, which uses an RDF triplestore as its backend for creating, manipulating, mining, and programming with large scale property graphs. It allows users to run various graph mining algorithms easily. User can import edgelist-formatted (homogeneous graph) or JSON-formatted graph (property graph) into the RDF triplestore using the provided tool and perform various analysis such as (1) Node/edge retrieval and manipulation, (2) Pathfinding between two given nodes, (3) Running graph mining algorithms (PageRank/Personalized PageRank, Single Source Shortest Path/Multi-Source Shortest Path, Connected Component, Node Eccentricity, Peer Pressure Clustering). It supports standard graph data format and works with a standard SPARQL endpoint like Jena Fuseki. It allows users to perform online graph analytic processing and graph mining on the same platform (a triplestore).

Sangkeun, MattLee↗

Dynamic Disruption Resilience in Intermodal Transport Networks: Integrating Flow Weighting and Centrality Measures

Resilient intermodal freight networks are vital for sustaining supply chains amid increasing threats from natural hazards and cyberattacks. Transportation resilience has been widely studied; understanding how random and targeted disruptions affect structural connectivity and functional performance remains a key challenge. To address this, this study evaluates the robustness of the US intermodal freight network, which consists of rail and water modes, using a simulation-based framework that integrates graph-theoretic metrics with flow-weighted centrality measures. Disruption scenarios are examined, including random failures as well as targeted node and edge removals based on static and dynamically updated degree and betweenness centrality. To reflect more realistic conditions, flow-weighted degree centralities (WDC) and partial node degradation are considered. Two resilience indicators are used: (1) the size of the giant connected component to measure structural connectivity; and (2) flow-weighted network efficiency (NE) to assess freight mobility under disruption. The results show that progressively degrading nodes ranked by WDC to 60% of their original functionality causes a sharper decline in normalized NE, for up to approximately 45 affected nodes, than complete failure (100% loss of functionality) applied to nodes targeted by weighted betweenness centrality or selected at random. This highlights how partial degradation of high-tonnage hubs can produce disproportionately large functional losses. The findings emphasize the need for resilience strategies that go beyond network topology to incorporate freight flow dynamics.

42 ENGINEERING↗

MAGIS-100 Experiment Installation in Shaft

This poster shows the experiment and access system as it will be installed in the MINOS shaft, along with important connecting components such as the atom sources and connection nodes.

Kowalkowski, James B. [Fermilab]↗

A two-level Markov random field for road network extraction and its application with optical, SAR, and multitemporal data

This article introduces a method for road network extraction from satellite images. The proposed approach covers a new fusion method (using data from multiple sources) and a new Markov random field (MRF) defined on connected components along with a multilevel application (two-level MRF). Our method allows the detection of roads with different characteristics and decreases by around 30% the size of the used graph model. Results for synthetic aperture radar (SAR) images and optical images obtained using the TerraSAR-X and Quickbird sensors, respectively, are presented demonstrating the improvement brought by the proposed approach. In a second part, an analysis of different types of data fusion combining optical/radar images, radar/radar images, and multitemporal SAR (TerraSAR-X and COSMO-SkyMed) images is described. Overall, the qualitative and quantitative results show that the fusion approach improves considerably the results of the road network extraction.

47 OTHER INSTRUMENTATION↗

Solar thermophotovoltaics: reshaping the solar spectrum

There has been increasing interest in utilizing solar thermophotovoltaics (STPV) to convert sunlight into electricity, given their potential to exceed the Shockley-Queisser limit. Encouragingly, there have also been several recent demonstrations of improved system-level efficiency as high as 6.2%. Here, we review prior work in the field, with particular emphasis on the role of several key principles in their experimental operation, performance, and reliability. In particular, for the problem of designing selective solar absorbers, we consider the trade-off between solar absorption and thermal losses, particularly radiative and convective mechanisms. For the selective thermal emitters, we consider the tradeoff between emission at critical wavelengths and parasitic losses. Then for the thermophotovoltaic (TPV) diodes, we consider the trade-off between increasing the potential short-circuit current, and maintaining a reasonable opencircuit voltage. This treatment parallels the historic development of the field, but also connects early insights with recent developments in adjacent fields.With these various components connecting in multiple ways, a system-level end-to-end modeling approach is necessary for a comprehensive understanding and appropriate improvement of STPV systems. Our approach will ultimately allow researchers to design STPV systems capable of exceeding recently demonstrated efficiency values.

14 SOLAR ENERGY↗

Graph-component approach to defect identification in large atomistic simulations

In this work, the graph-theoretical concept of connected components is employed to extract the evolution of defect configurations in a polycrystalline aluminum structure containing ~8.3 million atoms. This graph-component approach is applied to reveal details of defect formation, transport, and transformation in the polycrystalline Al under large shear deformation. Building upon standard nearest neighbor analysis, graph theory and associated tools are used to reduce the multi-million-atom system into discrete component subgraphs that represent distinct structural defects. This method allows the automated identification, characterization, and tracking of defective regions within large volumes of data representing atomic-scale processes. Such analysis elucidates relationships between external stimuli, such as strain, and defect distributions, which have a large influence on material properties. The Graph Analytics for Large Atomistic Simulations (GALAS) codebase that implements this analysis, together with user guidance, is openly available at https://github.com/pnnl/galas.

36 MATERIALS SCIENCE↗

Ultra-scale Visualization Climate Data Analysis Tools (UV-CDAT)

For the past three years, a large analysis and visualization effort—funded by the Department of Energy’s Office of Biological and Environmental Research (BER), the National Aeronautics and Space Administration (NASA), and the National Oceanic and Atmospheric Administration (NOAA)—has brought together a wide variety of industry-standard scientific computing libraries and applications to create Ultra-scale Visualization Climate Data Analysis Tools (UV-CDAT) to serve the global climate simulation and observational research communities. To support interactive analysis and visualization, all components connect through a provenance application–programming interface to capture meaningful history and workflow. Components can be loosely coupled into the framework for fast integration or tightly coupled for greater system functionality and communication with other components. The overarching goal of UV-CDAT is to provide a new paradigm for access to and analysis of massive, distributed scientific data collections by leveraging distributed data architectures located throughout the world. The UV-CDAT framework addresses challenges in analysis and visualization and incorporates new opportunities, including parallelism for better efficiency, higher speed, and more accurate scientific inferences. Today, it provides more than 600 users access to more analysis and visualization products than any other single source.

54 ENVIRONMENTAL SCIENCES↗

Automated aortic calcium scoring on low-dose chest computed tomography

Purpose: Thoracic computed tomography (CT) scans provide information about cardiovascular risk status. These scans are non-ECG synchronized, thus precise quantification of coronary calcifications is difficult. Aortic calcium scoring is less sensitive to cardiac motion, so it is an alternative to coronary calcium scoring as an indicator of cardiovascular risk. The authors developed and evaluated a computer-aided system for automatic detection and quantification of aortic calcifications in low-dose noncontrast-enhanced chest CT. Methods: The system was trained and tested on scans from participants of a lung cancer screening trial. A total of 433 low-dose, non-ECG-synchronized, noncontrast-enhanced 16 detector row examinations of the chest was randomly divided into 340 training and 93 test data sets. A first observer manually identified aortic calcifications on training and test scans. A second observer did the same on the test scans only. First, a multiatlas-based segmentation method was developed to delineate the aorta. Segmented volume was thresholded and potential calcifications (candidate objects) were extracted by three-dimensional connected component labeling. Due to image resolution and noise, in rare cases extracted candidate objects were connected to the spine. They were separated into a part outside and parts inside the aorta, and only the latter was further analyzed. All candidate objects were represented by 63 features describing their size, position, and texture. Subsequently, a two-stage classification with a selection of features and k-nearest neighbor classifiers was performed. Based on the detected aortic calcifications, total calcium volume score was determined for each subject. Results: The computer system correctly detected, on the average, 945 mm{sup 3} out of 965 mm{sup 3} (97.9%) calcified plaque volume in the aorta with an average of 64 mm{sup 3} of false positive volume per scan. Spearman rank correlation coefficient was {rho}=0.960 between the system and the first observer compared to {rho}=0.961 between the two observers. Conclusions: Automatic calcium scoring in the aorta thus appears feasible with good correlation between manual and automatic scoring.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

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↗