Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “graph clustering”

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

The Einstein soft X-ray survey of the Pleiades

The results of a 0.1-4.5-keV X-ray survey of a 2 x 2-deg area centered on the Pleiades open cluster, performed using the imaging proportional counter and high-resolution imager of the Einstein Observatory on four days in 1980-1981, are presented in extensive tables, graphs, maps, histograms, and finding charts and characterized. A total of 61 sources are detected, and 44 of these are identified with cluster members of spectral types B-M. Findings discussed include Lx/Lbol of 10 the -7th for early-type stars; F-star mean Lx like that of F stars in the Hyades and in the field (denying time evolution of Lx); mean G-star Lx = 3.7 x 10 to the 29th erg/sec; G-star activity decay more gradual than 1/sq rt t, with sharp fall for t greater than 1 Gyr; and no evidence for X-ray-emissivity/rotational-velocity correlation in a homogeneous sample of K dwarfs or a sample of K and M stars with established V sin i data.

Caillault, J.-P.↗

An In-Depth Analysis of the Chung-Lu Model

In the classic Erd}os R enyi random graph model [5] each edge is chosen with uniform probability and the degree distribution is binomial, limiting the number of graphs that can be modeled using the Erd}os R enyi framework [10]. The Chung-Lu model [1, 2, 3] is an extension of the Erd}os R enyi model that allows for more general degree distributions. The probability of each edge is no longer uniform and is a function of a user-supplied degree sequence, which by design is the expected degree sequence of the model. This property makes it an easy model to work with theoretically and since the Chung-Lu model is a special case of a random graph model with a given degree sequence, many of its properties are well known and have been studied extensively [2, 3, 13, 8, 9]. It is also an attractive null model for many real-world networks, particularly those with power-law degree distributions and it is sometimes used as a benchmark for comparison with other graph generators despite some of its limitations [12, 11]. We know for example, that the average clustering coe cient is too low relative to most real world networks. As well, measures of a nity are also too low relative to most real-world networks of interest. However, despite these limitations or perhaps because of them, the Chung-Lu model provides a basis for comparing new graph models.

97 MATHEMATICS AND COMPUTING↗

Necessary and Sufficient Conditions for Attitude Estimation in Fractionated Spacecraft Systems

This paper addresses the problem of attitude estimation in fractionated spacecraft clusters. Each module in the cluster may have either a star-tracker, a relative attitude sensor, or both. Using results in nonlinear ob- servability theory, we provide graph-theoretic sufficient conditions for the attitude of every module to be observable. In particular we show that the attitude of every module in the cluster can be observed if every module has either a star tracker with non-collinear stars, or there is a path through the sensing network from a module with a star tracker to the module without a star tracker, and each of the relative measurements along the path has either multiple non-collinear beacons or a single beacon that is not parallel to the rotation vector of the target module.

Blackmore, Lars↗

Cluster Strategy for Eco-Innovation at Manufacturing Enterprises

The environmental hazards of manufacturing are analyzed and the inadequacies of existing environmental protection measures are considered. A graph of the relationships between investment activity in eco-innovation and its outcome is proposed. The environmental impact of manufacturing enterprises may be reduced by more effective organization of innovation on the basis of clusters.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Brain Modulyzer: Interactive Visual Analysis of Functional Brain Connectivity

Here, we present Brain Modulyzer, an interactive visual exploration tool for functional magnetic resonance imaging (fMRI) brain scans, aimed at analyzing the correlation between different brain regions when resting or when performing mental tasks. Brain Modulyzer combines multiple coordinated views—such as heat maps, node link diagrams, and anatomical views—using brushing and linking to provide an anatomical context for brain connectivity data. Integrating methods from graph theory and analysis, e.g., community detection and derived graph measures, makes it possible to explore the modular and hierarchical organization of functional brain networks. Providing immediate feedback by displaying analysis results instantaneously while changing parameters gives neuroscientists a powerful means to comprehend complex brain structure more effectively and efficiently and supports forming hypotheses that can then be validated via statistical analysis. In order to demonstrate the utility of our tool, we also present two case studies—exploring progressive supranuclear palsy, as well as memory encoding and retrieval

59 BASIC BIOLOGICAL SCIENCES↗

PCS: A Productive Computational Science Platform

As modern supercomputers continue to be increasingly heterogeneous with diverse computational accelerators, software becomes a critical aspect necessary to fully exploit these accelerators while not increasing the effort and time required to make variable scientific discovery in the face of complicated programming environments introduced by these accelerators. This paper presents PCS, a productive computational science platform for cluster-scale heterogeneous computing. The PCS platform by design follows a basic principle that, multiple programming models in a unified programming environment, is essential to facilitate large-scale, accelerator-aware, heterogeneous computing for next- generation scientific applications. We propose a new scheme — Edge Neural Network — for managing regularity in large dataflow graphs using higher-order bulk synchronous operators, providing a foundation for formalizing computational models for cluster-wide dataflow programming of heterogeneous clusters.

36 MATERIALS SCIENCE↗

PCS: A Productive Computational Science Platform

As modern supercomputers continue to be increasingly heterogeneous with diverse computational accelerators, software becomes a critical aspect necessary to fully exploit these accelerators while not increasing the effort and time required to make variable scientific discovery in the face of complicated programming environments introduced by these accelerators. This paper presents PCS, a productive computational science platform for cluster-scale heterogeneous computing. The PCS platform by design follows a basic principle that, multiple programming models in a unified programming environment, is essential to facilitate large-scale, accelerator-aware, heterogeneous computing for next- generation scientific applications. We propose a new scheme - Edge Neural Network - for managing regularity in large dataflow graphs using higher-order bulk synchronous operators, providing a foundation for formalizing computational models for cluster-wide dataflow programming of heterogeneous clusters.

36 MATERIALS SCIENCE↗

PCS: A Productive Computational Science Platform

As modern supercomputers continue to be increasingly heterogeneous with diverse computational accelerators, software becomes a critical aspect necessary to fully exploit these accelerators while not increasing the effort and time required to make variable scientific discovery in the face of complicated programming environments introduced by these accelerators. This paper presents PCS, a productive computational science platform for cluster-scale heterogeneous computing. The PCS platform by design follows a basic principle that, multiple programming models in a unified programming environment, is essential to facilitate large-scale, accelerator-aware, heterogeneous computing for next-generation scientific applications. We propose a new scheme — Edge Neural Network — for managing regularity in large dataflow graphs using higher-order bulk synchronous operators, providing a foundation for formalizing computational models for cluster-wide dataflow programming of heterogeneous clusters.

Ojika, David↗

PDBsum additions

PDBsum, http://www.ebi.ac.uk/pdbsum, is a website providing numerous pictorial analyses of each entry in the Protein Data Bank. It portrays the structural features of all proteins, DNA and ligands in the entry, as well as depicting the interactions between them. The latest features, described here, include annotation of human protein sequences with their naturally occurring amino acid variants, dynamic graphs showing the relationships between related protein domain architectures, analyses of ligand binding clusters across different experimental determinations of the same protein, analyses of tunnels in proteins and new search options.

59 BASIC BIOLOGICAL SCIENCES↗

Normalized Cut Algorithm for Automated Assignment of Protein Domains

We present a novel computational method for automatic assignment of protein domains from structural data. At the core of our algorithm lies a recently proposed clustering technique that has been very successful for image-partitioning applications. This grap.,l-theory based clustering method uses the notion of a normalized cut to partition. an undirected graph into its strongly-connected components. Computer implementation of our method tested on the standard comparison set of proteins from the literature shows a high success rate (84%), better than most existing alternative In addition, several other features of our algorithm, such as reliance on few adjustable parameters, linear run-time with respect to the size of the protein and reduced complexity compared to other graph-theory based algorithms, would make it an attractive tool for structural biologists.

Samanta, M. P.↗

Distributed Computing Architecture for Image-Based Wavefront Sensing and 2 D FFTs

Image-based wavefront sensing (WFS) provides significant advantages over interferometric-based wavefi-ont sensors such as optical design simplicity and stability. However, the image-based approach is computational intensive, and therefore, specialized high-performance computing architectures are required in applications utilizing the image-based approach. The development and testing of these high-performance computing architectures are essential to such missions as James Webb Space Telescope (JWST), Terrestial Planet Finder-Coronagraph (TPF-C and CorSpec), and Spherical Primary Optical Telescope (SPOT). The development of these specialized computing architectures require numerous two-dimensional Fourier Transforms, which necessitate an all-to-all communication when applied on a distributed computational architecture. Several solutions for distributed computing are presented with an emphasis on a 64 Node cluster of DSPs, multiple DSP FPGAs, and an application of low-diameter graph theory. Timing results and performance analysis will be presented. The solutions offered could be applied to other all-to-all communication and scientifically computationally complex problems.

Smith, Jeffrey S.↗

The joint far-infrared-optical luminosity function for spiral galaxies and data for the Abell 400 and Cancer clusters

Visual and IRAS data for an optically selected sample of 183 late-type galaxies are compiled in tables and graphs and analyzed in detail to determine the joint FIR-optical luminosity function Psi from the FIR/blue luminosity ratio, r = L(FIR)/L(B). It is found that Psi can be approximated by a function of a single variable psi(r-prime), where r-prime is defined as r times L(B)/L(asterisk) exp -delta, with L(asterisk) a constant and delta = about 0.08. A lognormal curve peaking at r-prime = 0.35 and with dispersion of 0.28 is shown to give a good fit to psi(r-prime). From a lack of galaxies with very low r-prime in the present sample it is inferred that there are few spiral galaxies with low interstellar-dust abundances. Also included are data on the distribution function of r-prime for the more distant clusters Abell 400 and Cancer.

Corbelli, Edvige↗

Leveraging Topological Events in Tracking Graphs for Understanding Particle Diffusion

Abstract Single particle tracking (SPT) of fluorescent molecules provides significant insights into the diffusion and relative motion of tagged proteins and other structures of interest in biology. However, despite the latest advances in high‐resolution microscopy, individual particles are typically not distinguished from clusters of particles. This lack of resolution obscures potential evidence for how merging and splitting of particles affect their diffusion and any implications on the biological environment. The particle tracks are typically decomposed into individual segments at observed merge and split events, and analysis is performed without knowing the true count of particles in the resulting segments. Here, we address the challenges in analyzing particle tracks in the context of cancer biology. In particular, we study the tracks of KRAS protein, which is implicated in nearly 20% of all human cancers, and whose clustering and aggregation have been linked to the signaling pathway leading to uncontrolled cell growth. We present a new analysis approach for particle tracks by representing them as tracking graphs and using topological events – merging and splitting, to disambiguate the tracks. Using this analysis, we infer a lower bound on the count of particles as they cluster and create conditional distributions of diffusion speeds before and after merge and split events. Using thousands of time‐steps of simulated and in‐vitro SPT data, we demonstrate the efficacy of our method, as it offers the biologists a new, detailed look into the relationship between KRAS clustering and diffusion speeds.

McDonald, T.↗

Enhancing transfer learning in angle-resolved photoemission spectroscopy (ARPES) with spatially-aware representations via graph convolution

A recent application of machine learning has been to spatially-resolved angle-resolved photoemission spectroscopy (ARPES). Here we advance the state-of-the-art by applying representational learning to transform ARPES data into an embedding space of a pre-trained self-supervised learning model, thus enhancing the pipeline that improves the bandstructure classification and domain assignment/segmentation performance compared to a k-means clustering method. In the current iteration, the real-space information is entered into the domain assignment through the graph convolution method, which improves the transfer learning performance of the original self-supervised model. Lastly, an unsupervised automated tool is developed that incorporates these techniques to enable automatic domain assignment.

ARPES↗

Towards accurate prediction of configurational disorder properties in materials using graph neural networks

Abstract The prediction of configurational disorder properties, such as configurational entropy and order-disorder phase transition temperature, of compound materials relies on efficient and accurate evaluations of configurational energies. Previous cluster expansion methods are not applicable to configurationally-complex material systems, including those with atomic distortions and long-range orders. In this work, we propose to leverage the versatile expressive capabilities of graph neural networks (GNNs) for efficient evaluations of configurational energies and present a workflow combining attention-based GNNs and Monte Carlo simulations to calculate the disorder properties. Using the dataset of face-centered tetragonal gold copper without and with local atomic distortions as an example, we demonstrate that the proposed data-driven framework enables the prediction of phase transition temperatures close to experimental values. We also elucidate that the variance of the energy deviations among configurations controls the prediction accuracy of disorder properties and can be used as the target loss function when training and selecting the GNN models. The work serves as a fundamental step toward a data-driven paradigm for the accelerated design of configurationally-complex functional material systems.

Chemistry↗

High performance FPGA embedded system for machine learning based tracking and trigger in sPhenix and EIC

We present a comprehensive end-to-end pipeline to classify triggers versus background events in this paper. This pipeline makes online decisions to select signal data and enables the intelligent trigger system for efficient data collection in the Data Acquisition System (DAQ) of the upcoming sPHENIX and future EIC (Electron-Ion Collider) experiments. Starting from the coordinates of pixel hits that are lightened by passing particles in the detector, the pipeline applies three-stage of event processing (hits clustering, track reconstruction, and trigger detection) and labels all processed events with the binary tag of trigger versus background events. The pipeline consists of deterministic algorithms such as clustering pixels to reduce event size, tracking reconstruction to predict candidate edges, and advanced graph neural network-based models for recognizing the entire jet pattern. In particular, we apply the message-passing graph neural network to predict links between hits and reconstruct tracks and a hierarchical pooling algorithm (DiffPool) to make the graph-level trigger detection. We obtain an impressive performance (≥70% accuracy) for trigger detection with only 3200 neuron weights in the end-to-end pipeline. We deploy the end-to-end pipeline into a field-programmable gate array (FPGA) and accelerate the three stages with speedup factors of 1152, 280, and 21, respectively.

Instruments & Instrumentation↗

Trust based attachment

In social systems subject to indirect reciprocity, a positive reputation is key for increasing one’s likelihood of future positive interactions. The flow of gossip can amplify the impact of a person’s actions on their reputation depending on how widely it spreads across the social network, which leads to a percolation problem. To quantify this notion, we calculate the expected number of individuals, the “audience”, who find out about a particular interaction. For a potential donor, a larger audience constitutes higher reputational stakes, and thus a higher incentive, to perform “good” actions in line with current social norms. For a receiver, a larger audience therefore increases the trust that the partner will be cooperative. This idea can be used for an algorithm that generates social networks, which we call trust based attachment (TBA). TBA produces graphs that share crucial quantitative properties with real-world networks, such as high clustering, small-world behavior, and powerlaw degree distributions. We also show that TBA can be approximated by simple friend-of-friend routines based on triadic closure, which are known to be highly effective at generating realistic social network structures. Therefore, our work provides a new justification for triadic closure in social contexts based on notions of trust, gossip, and social information spread. These factors are thus identified as potential significant influences on how humans form social ties.

59 BASIC BIOLOGICAL SCIENCES↗

Intrinsic integrated UBVRI colors of Galactic globular clusters

Published observational data on 50 Galactic globular clusters, including spectral classifications, homogenized colors, and color excesses, are compiled in extensive tables, graphs, and diagrams and analyzed to determine the intrinsic-color/integrated-spectral-type relationship in the UBVRI system. These relationships are found to exhibit significant slopes, although the RI colors do not contribute substantially to the intrinsic-color determination. The values of a(B-V) for the northern and southern Galactic hemispheres are found to be 0.068 + or - 0.006 and 0.039 + or - 0.003 mag, respectively.

Reed, B. Cameron↗