Search NASA⌕ Search

SEARCH · Search NASA

Results for “knowledge graphs”

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 181 records · Page 10

Computing Information Value from RDF Graph Properties

Information value has been implicitly utilized and mostly non-subjectively computed in information retrieval (IR) systems. We explicitly define and compute the value of an information piece as a function of two parameters, the first is the potential semantic impact the target information can subjectively have on its recipient's world-knowledge, and the second parameter is trust in the information source. We model these two parameters as properties of RDF graphs. Two graphs are constructed, a target graph representing the semantics of the target body of information and a context graph representing the context of the consumer of that information. We compute information value subjectively as a function of both potential change to the context graph (impact) and the overlap between the two graphs (trust). Graph change is computed as a graph edit distance measuring the dissimilarity between the context graph before and after the learning of the target graph. A particular application of this subjective information valuation is in the construction of a personalized ranking component in Web search engines. Based on our method, we construct a Web re-ranking system that personalizes the information experience for the information-consumer.

99 GENERAL AND MISCELLANEOUS↗

Spatio-Temporal Denoising Graph Autoencoders with Data Augmentation for Missing Photovoltaic Data Imputation

The integration of the global Photovoltaic (PV) market with real time data-loggers has enabled large scale PV data analytical pipelines for power forecasting and long-term reliability assessment of PV fleets. Nevertheless, the performance of PV data analysis heavily depends on the quality of PV timeseries data. This paper proposes a novel Spatio-Temporal Denoising Graph Autoencoder (STD-GAE) framework to impute missing PV Power Data. STDGAE exploits temporal correlation, spatial coherence, and value dependencies from domain knowledge to recover missing data. It is empowered by two modules. (1) To cope with sparse yet various scenarios of missing data, STD-GAE incorporates a domain-knowledge aware data augmentation module that creates plausible variations of missing data patterns. This generalizes STD-GAE to robust imputation over different seasons and environment. (2) STD-GAE nontrivially integrates spatiotemporal graph convolution layers (to recover local missing data by observed “neighboring” PV plants) and denoising autoencoder (to recover corrupted data from augmented counterpart) to improve the accuracy of imputation accuracy at PV fleet level. We have evaluated our proposed model on two realworld PV datasets. Experimental results show that STD-GAE can achieve a gain of 43.14% in imputation accuracy and remains less sensitive to missing rate, different seasons, and missing scenarios, compared with state-of-the-art data imputation methods such as MIDA and LRTC-TNN.

Fan, Yangxin↗

Thought Leaders during Crises in Massive Social Networks

The vast amount of social media data that can be gathered from the internet coupled with workflows that utilize both commodity systems and massively parallel supercomputers, such as the Cray XMT, open new vistas for research to support health, defense, and national security. Computer technology now enables the analysis of graph structures containing more than 4 billion vertices joined by 34 billion edges along with metrics and massively parallel algorithms that exhibit near-linear scalability according to number of processors. The challenge lies in making this massive data and analysis comprehensible to an analyst and end-users that require actionable knowledge to carry out their duties. Simply stated, we have developed language and content agnostic techniques to reduce large graphs built from vast media corpora into forms people can understand. Specifically, our tools and metrics act as a survey tool to identify thought leaders' -- those members that lead or reflect the thoughts and opinions of an online community, independent of the source language.

97 MATHEMATICS AND COMPUTING↗

Prediction of carbon nanostructure mechanical properties and the role of defects using machine learning

Graphene-based nanostructures hold immense potential as strong and lightweight materials, however, their mechanical properties such as modulus and strength are difficult to fully exploit due to challenges in atomic-scale engineering. This study presents a database of over 2,000 pristine and defective nanoscale CNT bundles and other graphitic assemblies, inspired by microscopy, with associated stress–strain curves from reactive molecular dynamics (MD) simulations using the reactive INTERFACE force field (IFF-R). These 3D structures, containing up to 80,000 atoms, enable detailed analyses of structure-stiffness-failure relationships. By leveraging the database and physics- and chemistry-informed machine learning (ML), accurate predictions of elastic moduli and tensile strength are demonstrated at speeds 1,000 to 10,000 times faster than efficient MD simulations. Hierarchical Graph Neural Networks with Spatial Information (HS-GNNs) are introduced, which integrate chemistry knowledge. HS-GNNs as well as extreme gradient boosted trees (XGBoost) achieve forecasts of mechanical properties of arbitrary carbon nanostructures with only 3 to 6% mean relative error. The reliability equals experimental accuracy and is up to 20 times higher than other ML methods. Predictions maintain 8 to 18% accuracy for large CNT bundles, CNT junctions, and carbon fiber cross-sections outside the training distribution. The physics- and chemistry-informed HS-GNN works remarkably well for data outside the training range while XGBoost works well with limited training data inside the training range. The carbon nanostructure database is designed for integration with multimodal experimental and simulation data, scalable beyond 100 nm size, and extendable to chemically similar compounds and broader property ranges. The ML approaches have potential for applications in structural materials, nanoelectronics, and carbon-based catalysts.

Winetrout, Jordan J.↗

PANTHER. Pattern ANalytics To support High-performance Exploitation and Reasoning.

Sandia has approached the analysis of big datasets with an integrated methodology that uses computer science, image processing, and human factors to exploit critical patterns and relationships in large datasets despite the variety and rapidity of information. The work is part of a three-year LDRD Grand Challenge called PANTHER (Pattern ANalytics To support High-performance Exploitation and Reasoning). To maximize data analysis capability, Sandia pursued scientific advances across three key technical domains: (1) geospatial-temporal feature extraction via image segmentation and classification; (2) geospatial-temporal analysis capabilities tailored to identify and process new signatures more efficiently; and (3) domain- relevant models of human perception and cognition informing the design of analytic systems. Our integrated results include advances in geographical information systems (GIS) in which we discover activity patterns in noisy, spatial-temporal datasets using geospatial-temporal semantic graphs. We employed computational geometry and machine learning to allow us to extract and predict spatial-temporal patterns and outliers from large aircraft and maritime trajectory datasets. We automatically extracted static and ephemeral features from real, noisy synthetic aperture radar imagery for ingestion into a geospatial-temporal semantic graph. We worked with analysts and investigated analytic workflows to (1) determine how experiential knowledge evolves and is deployed in high-demand, high-throughput visual search workflows, and (2) better understand visual search performance and attention. Through PANTHER, Sandia's fundamental rethinking of key aspects of geospatial data analysis permits the extraction of much richer information from large amounts of data. The project results enable analysts to examine mountains of historical and current data that would otherwise go untouched, while also gaining meaningful, measurable, and defensible insights into overlooked relationships and patterns. The capability is directly relevant to the nation's nonproliferation remote-sensing activities and has broad national security applications for military and intelligence- gathering organizations.

58 GEOSCIENCES↗

The Effect of the Prior and the Experimental Design on the Inference of the Precision Matrix in Gaussian Chain Graph Models

Here, we investigate whether (and how) experimental design could aid in the estimation of the precision matrix in a Gaussian chain graph model, especially the interplay between the design, the effect of the experiment and prior knowledge about the effect. Estimation of the precision matrix is a fundamental task to infer biological graphical structures like microbial networks. We compare the marginal posterior precision of the precision matrix under four priors: flat, conjugate Normal-Wishart, Normal-MGIG and a general independent. Under the flat and conjugate priors, the Laplace-approximated posterior precision is not a function of the design matrix rendering useless any efforts to find an optimal experimental design to infer the precision matrix. In contrast, the Normal-MGIG and general independent priors do allow for the search of optimal experimental designs, yet there is a sharp upper bound on the information that can be extracted from a given experiment. We confirm our theoretical findings via a simulation study comparing (i) the KL divergence between prior and posterior and (ii) the Stein’s loss difference of MAPs between random and no experiment. Our findings provide practical advice for domain scientists conducting experiments to better infer the precision matrix as a representation of a biological network.

54 ENVIRONMENTAL SCIENCES↗

A Collaboration Website for Muon Catalyzed Fusion and Muon Beam Production

This research initiative establishes a dynamic online platform geared towards supporting the burgeoning Muon Catalyzed Fusion collaboration, focusing on the concurrent development of particle accelerators and transport beamlines for muon beams. The central feature of this endeavor is the creation of a multifaceted website comprising both public facing and private sections to cater to diverse user needs. The public segment is meticulously designed to serve as an educational hub, featuring information pages targeted at the general public alongside private pages exclusively accessible to collaboration members. These pages will host an array of multimedia elements, ranging from images and text animations to video lectures, covering an extensive spectrum of topics integral to the science of Muon Catalyzed Fusion. Encompassing areas such as Acceleration, Applications, Instrumentation, Beamline Design, and beam dynamics design codes, the educational content aims to make complex scientific concepts more accessible to a broader audience. Ensuring seamless accessibility across various devices and operating systems, the website incorporates integration with collaborative tools such as Google Docs for document collaboration, GitHub for code repository management, and WordPress for blogging with interactive commenting features. The bifurcation between public and private sections is a strategic approach to maintaining transparency while safeguarding proprietary research and works in progress. The public pages are strategically crafted to disseminate information, showcasing the latest endeavors and achievements within the NK Labs collaboration, including lectures, published papers, and regular blog posts open to public comments. On the other hand, the private section provides collaboration members with a secure space to share unpublished or nonpublic research, fostering collaborative efforts through integrated Google Docs and Python Plotty for shared graphing work. In essence, this ambitious project endeavors to bridge the gap between complex scientific knowledge and public understanding, enhance collaboration among researchers, and serve as a dynamic and inclusive platform for sharing and advancing the state-of-the-art in Muon Catalyzed Fusion and Accelerators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bayesian chain graph models to characterize microbe-environment dynamics

Microbiome data require statistical models that can simultaneously decode microbes' reaction to the environment and interactions among microbes. While a multiresponse linear regression model seems like a straight-forward solution, we argue that treating it as a graphical model is problematic given that the regression coefficient matrix does not encode the conditional dependence structure between response and predictor nodes. This observation is especially important in biological settings when we have prior knowledge on the edges from specific experimental interventions that can only be properly encoded under a conditional dependence model. Here, we propose a chain graph model with two sets of nodes (predictors and responses) whose solution yields a graph with edges that indeed represent conditional dependence, thus agreeing with the experimenter's intuition on the average behavior of nodes under treatment. The solution to our model is sparse via the Bayesian linear regression (LASSO). In addition, we propose an adaptive extension so that different shrinkages can be applied to different edges to incorporate edge-specific prior knowledge. Our model is computationally inexpensive through an efficient Gibbs sampling algorithm and can account for binary, counting, and compositional responses via an appropriate hierarchical structure. We test the performance of our model in a variety of simulated datasets, thereby showing superior performance to state-of-the-art approaches. We further apply our model to human gut and soil microbial compositional datasets, and we highlight that CG-LASSO can estimate biologically meaningful network structures in the data.

compositional data↗

Effective Gaps Are Not Effective: Quasipolynomial Classical Simulation of Obstructed Stoquastic Hamiltonians

All known examples suggesting an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (StoqAQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric subspaces. The symmetries produce large effective eigenvalue gaps, which in turn make adiabatic computation efficient. We present a classical algorithm to subexponentially sample from an effective subspace of any k -local stoquastic Hamiltonian H , without a priori knowledge of its symmetries (or near symmetries). Our algorithm maps any k -local Hamiltonian to a graph G = ( V , E ) with | V | = O (poly (n)) , where n is the number of qubits. Given the well-known result of Babai [Graph isomorphism in quasipolynomial time, in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (2016), pp. 684–697], we exploit graph isomorphism to study the automorphisms of G and arrive at an algorithm quasipolynomial in | V | for producing samples from effective subspace eigenstates of H . Our results rule out exponential separations between StoqAQC and classical computation that arise from hidden symmetries in k -local Hamiltonians. Our graph representation of H is not limited to stoquastic Hamiltonians and may rule out corresponding obstructions in nonstoquastic cases, or be useful in studying additional properties of k -local Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scaling Irregular Applications through Data Aggregation and Software Multithreading

Bioinformatics, data analytics, semantic databases, knowledge discovery are emerging high performance application areas that exploit dynamic, linked data structures such as graphs, unbalanced trees or unstructured grids. These data structures usually are very large, requiring significantly more memory than available on single shared memory systems. Additionally, these data structures are difficult to partition on distributed memory systems. They also present poor spatial and temporal locality, thus generating unpredictable memory and network accesses. The Partitioned Global Address Space (PGAS) programming model seems suitable for these applications, because it allows using a shared memory abstraction across distributed-memory clusters. However, current PGAS languages and libraries are built to target regular remote data accesses and block transfers. Furthermore, they usually rely on the Single Program Multiple Data (SPMD) parallel control model, which is not well suited to the fine grained, dynamic and unbalanced parallelism of irregular applications. In this paper we present {\bf GMT} (Global Memory and Threading library), a custom runtime library that enables efficient execution of irregular applications on commodity clusters. GMT integrates a PGAS data substrate with simple fork/join parallelism and provides automatic load balancing on a per node basis. It implements multi-level aggregation and lightweight multithreading to maximize memory and network bandwidth with fine-grained data accesses and tolerate long data access latencies. A key innovation in the GMT runtime is its thread specialization (workers, helpers and communication threads) that realize the overall functionality. We compare our approach with other PGAS models, such as UPC running using GASNet, and hand-optimized MPI code on a set of typical large-scale irregular applications, demonstrating speedups of an order of magnitude.

Aggregation↗

Sensor Network Demonstration for In Situ Decommissioning - 13332

Florida International University's (FIU's) Applied Research Center is currently supporting the Department of Energy's (DOE) Environmental Management Office of D and D and Facility Engineering program. FIU is supporting DOE's initiative to improve safety, reduce technical risks, and limit uncertainty within D and D operations by identifying technologies suitable to meet specific facility D and D requirements, assessing the readiness of those technologies for field deployment, and conducting feasibility studies and large scale demonstrations of promising technologies. During FY11, FIU collaborated with Savannah River National Laboratory in the development of an experimental test site for the demonstration of multiple sensor systems for potential use in the in situ decommissioning process. In situ decommissioning is a process in which the above ground portion of a facility is dismantled and removed, and the underground portion is filled with a cementious material such as grout. In such a scenario, the question remains on how to effectively monitor the structural health of the grout (cracking, flexing, and sinking), as well as track possible migration of contaminants within and out of the grouted monolith. The right types of sensors can aid personnel in better understanding the conditions within the entombed structure. Without sensors embedded in and around the monolith, it will be very difficult to estimate structural integrity and contaminant transport. Yet, to fully utilize the appropriate sensors and the provided data, their performance and reliability must be evaluated outside a laboratory setting. To this end, a large scale experimental setup and demonstration was conducted at FIU. In order to evaluate a large suite of sensor systems, FIU personnel designed and purchased a pre-cast concrete open-top cube, which served as a mock-up of an in situ DOE decommissioned facility. The inside of the cube measures 10 ft x 10 ft x 8 ft. In order to ensure that the individual sensors would be immobilized during the grout pouring activities, a set of nine sensor racks were designed. The 270 sensors provided by Idaho National Laboratory (INL), Mississippi State University (MSU), University of Houston (UH), and University of South Carolina (USC) were secured to these racks based on predetermined locations. Once sensor racks were installed inside the test cube, connected and debugged, approximately 32 cubic yards of special grout material was used to entomb the sensors. MSU provided and demonstrated four types of fiber loop ring-down (FLR) sensors for detection of water, temperature, cracks, and movement of fluids. INL provided and demonstrated time differenced 3D electrical resistivity tomography (ERT), advanced tensiometers for moisture content, and thermocouples for temperature measurements. University of Houston provided smart aggregate (SA) sensors, which detect crack severity and water presence. An additional UH sensor system demonstrated was a Fiber Bragg Grating (FBG) fiber optic system measuring strain, presence of water, and temperature. USC provided a system which measured acoustic emissions during cracking, as well as temperature and pH sensors. All systems were connected to a Sensor Remote Access System (SRAS) data networking and collection system designed, developed and provided by FIU. The purpose of SRAS was to collect and allow download of the raw sensor data from all the sensor system, as well as allow upload of the processed data and any analysis reports and graphs. All this information was made available to the research teams via the Deactivation and Decommissioning Knowledge Management and Information Tool (D and D KM-IT). As a current research effort, FIU is performing an energy analysis, and transferring several sensor systems to a Photovoltaic (PV) System to continuously monitor energy consumption parameters and overall power demands. Also, One final component of this research is focusing on developing an integrated data network to capture, log and analyze sensor system data in near real time from a single interface. FIU personnel and DOE Fellows monitored the progress and condition of the sensors for a period of six months. During this time, the sensors recorded data pertaining to strain, compression, temperature, crack detection, moisture presence, fluid mobility, shock resistance, monolith movement, and electrical resistivity. In addition, FIU regularly observed the curing process of the grout and documented the cube condition via the nine racks of sensors. The sensors held up throughout the curing process, withstood the natural elements for six months, and monitored the integrity of the grout. The large scale experiment and demonstration conducted at FIU was the first of its kind to demonstrate the feasibility of state of the art sensors for in situ decommissioning applications. These efforts successfully measured the durability, performance, and precision of the sensors in question as well as monitored and recorded the curing process of the selected grout material under natural environmental conditions. The current energy analysis work is resulting in data on the constraints placed by some of the sensor systems on a power network that requires high reliability and low losses. In addition, a sensor system demonstration has determined that it is feasible to develop an integrated data network where data can be accessed in near real-time from all systems, thereby allowing for larger-scale integrated system testing to be performed. Information collected during the execution of this research project will aid decision makers in the identification of sensors to be used in nuclear facilities selected for in situ decommissioning. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Global and adaptive K-nearest neighbor graphs in a spectral target detector based on Schroedinger Eigenmaps

The Schroedinger Eigenmaps (SE) embedding has been previously introduced and applied to spectral target detection problems in hyperspectral imagery (HSI). The proposed SEbased detection approach combines the spectral and spatial connectivity of target-like pixels into the Schroedinger operator by using a “knowledge propagation” scheme. Likewise, it has been noted the impact that the local data structure modeling has over the SE-based detector. This local data structure is modeled by using an adjacency graph, i.e, set of vertices and edges, that in most of the applications is a k nearest neighbor (knn) graph. In this paper, the impact of k in the graph-building process is analyzed and assessed from a target detection point of view. Here, two ways to estimate the parameter k in the graph construction are considered and their assessment is performed by using two HSI data sets and the Receiver Optimal Curve (ROC) as a detection performance metric

97 MATHEMATICS AND COMPUTING↗

Graph identification of proteins in tomograms ( GRIP‐Tomo )

Abstract In this study, we present a method of pattern mining based on network theory that enables the identification of protein structures or complexes from synthetic volume densities, without the knowledge of predefined templates or human biases for refinement. We hypothesized that the topological connectivity of protein structures is invariant, and they are distinctive for the purpose of protein identification from distorted data presented in volume densities. Three‐dimensional densities of a protein or a complex from simulated tomographic volumes were transformed into mathematical graphs as observables. We systematically introduced data distortion or defects such as missing fullness of data, the tumbling effect, and the missing wedge effect into the simulated volumes, and varied the distance cutoffs in pixels to capture the varying connectivity between the density cluster centroids in the presence of defects. A similarity score between the graphs from the simulated volumes and the graphs transformed from the physical protein structures in point data was calculated by comparing their network theory order parameters including node degrees, betweenness centrality, and graph densities. By capturing the essential topological features defining the heterogeneous morphologies of a network, we were able to accurately identify proteins and homo‐multimeric complexes from 10 topologically distinctive samples without realistic noise added. Our approach empowers future developments of tomogram processing by providing pattern mining with interpretability, to enable the classification of single‐domain protein native topologies as well as distinct single‐domain proteins from multimeric complexes within noisy volumes.

59 BASIC BIOLOGICAL SCIENCES↗

Spatial–spectral Schroedinger embedding for target detection in hyperspectral imagery

In this work, the Schroedinger eigenmaps (SE) algorithm using spatial and spectral information has been applied to supervised classification of hyperspectral imagery (HSI). We have previously introduced the use of SE in spectral target detection problems. The original SE-based target detector was built on the spectral information encoded in the Laplacian and Schroedinger operators. The original SE-based detector is extended such that spatial connectivity of target-like pixels is explored and encoded into the Schroedinger operator using a “knowledge propagation” scheme. The modified SE-based detector is applied to two HSI data sets that share similar target materials. Receiver operating characteristic curves and rates of detection and false alarm at object level are used as quantitative metrics to assess the detector. In addition, the Schroedinger embedding performance in target detection is compared against the performances of principal component embedding and the Laplacian embedding. Finally, results show that the SE-based detector with spatial–spectral features outperforms the other considered approaches.

36 MATERIALS SCIENCE↗

A new, analytic, non-perturbative, gauge-invariant formulation of realistic QCD

This Formulation [1], [2], [3] is New, in the sense that it is less than 3 years old. But it could have been done decades ago, since the input information existed, but was overlooked. It is Analytic in the sense that physically-reasonable approximations can be estimated with paper and pencil; and exact amplitudes can be calculated as Meijer G-functions of various orders. It is Non-Perturbative in the sense that sums over all possible gluon exchanges between any pair of quarks and/or antiquarks, including cubic and quartic gluon interactions, are exactly performed. These multiple gluon exchanges combine into 'Gluon Bundles' (GBs), as sums over Feynman graphs with finite numbers of exchanged gluons are replaced by {sup B}undle Graphs{sup .} In effect, gluons disappear from the formalism, and GBs remain as the effective carrier of all interactions between quark lines. A simple re-arrangement of the Schwinger/Symanzik functional solution for the Generating Functional of QCD - a rearrangement possible in QCD but not in QED - produces a formal statement of Gauge-Invariance, even though the formulation contains gauge-dependent gluon propagators. After the non-perturbative sums produce GBs, one sees explicit cancelation of all gauge-dependent gluon propagators; gauge-invariance is achieved as gauge-independence. A new insight into Realistic QCD appears in the non-perturbative domain, because quarks do not have individual asymptotic states; they are always asymptotically bound, and their transverse coordinates cannot, in principle, be measured exactly. 'Transverse Imprecision' is introduced into the basic Lagrangian, and quark-binding potentials for the construction of mesons and nucleons can then be defined and evaluated. And the greatest surprise of all: A new, non-perturbative property appears, called Effective Locality, with the result that all functional integrals reduce to (a few) sets of ordinary integrals, easy to estimate approximately, or calculate on a desk-top computer. A fantastic simplification{exclamation_point} With the aid of the above techniques, this presentation will describe each of the above paragraphs, with explicit descriptions of gauge-invariance, of the summation of all relevant Feynman graphs, of quark-binding into hadrons, and of nucleon-nucleon binding to form a deuteron. To our knowledge, the latter calculation is the first analytic example of Nuclear Physics obtained directly from basic QCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An Adaptive Memory Interface Controller for Improving Bandwidth Utilization of Hybrid and Reconfigurable Systems

Emerging applications such as data mining, bioinformatics, knowledge discovery, social network analysis are irregular. They use data structures based on pointers or linked lists, such as graphs, unbalanced trees or unstructures grids, which generates unpredictable memory accesses. These data structures usually are large, but difficult to partition. These applications mostly are memory bandwidth bounded and have high synchronization intensity. However, they also have large amounts of inherent dynamic parallelism, because they potentially perform a task for each one of the element they are exploring. Several efforts are looking at accelerating these applications on hybrid architectures, which integrate general purpose processors with reconfigurable devices. Some solutions, which demonstrated significant speedups, include custom-hand tuned accelerators or even full processor architectures on the reconfigurable logic. In this paper we present an approach for the automatic synthesis of accelerators from C, targeted at irregular applications. In contrast to typical High Level Synthesis paradigms, which construct a centralized Finite State Machine, our approach generates dynamically scheduled hardware components. While parallelism exploitation in typical HLS-generated accelerators is usually bound within a single execution flow, our solution allows concurrently running multiple execution flow, thus also exploiting the coarser grain task parallelism of irregular applications. Our approach supports multiple, multi-ported and distributed memories, and atomic memory operations. Its main objective is parallelizing as many memory operations as possible, independently from their execution time, to maximize the memory bandwidth utilization. This significantly differs from current HLS flows, which usually consider a single memory port and require precise scheduling of memory operations. A key innovation of our approach is the generation of a memory interface controller, which dynamically maps concurrent memory accesses to multiple ports. We present a case study on a typical irregular kernel, Graph Breadth First search (BFS), exploring different tradeoffs in terms of parallelism and number of memories.

BFS↗

A Scalable Parallel Hypergraph Generator (HyGen)

Graphs are extensively used to model real-world complex systems. An edge in a graph can model pairwise relationships. However, multiway relationships (connections between three or more vertices) are common in many complex systems such as cellular process, image segmentation, and circuit design. A graph edge cannot model multiway relationships. A hypergraph, which can connect more than two vertices, is thus a better option to model multiway relationships. A large-scale hypergraph analysis has the potential to find useful insights from a complex system and assist in knowledge discovery. Currently a limited number of hypergraphs exists that are representative of real-world datasets. Moreover, real-world hypergraph datasets are small in size and inadequate to incorporate future needs. A graph generator that can produce large-scale synthetic hypergraphs can solve the above mentioned problems. In this paper, we present a scalable parallel hypergraph generator (HyGen) based on the Message Passing Interface (MPI) standard. To generate hypergraphs, HyGen takes the following parameter values as inputs: i) number of vertices, ii) number of hyperedges, iii) number of clusters, iv) vertex distribution, v) hyperedge distribution, vi) local cluster cardinality, and vii) global cluster cardinality. We have demonstrated that HyGen can generate hypergraphs of various sizes in a scalable fashion. HyGen takes approximately four minutes to generate a hypergraph with 4.8 million vertices, 1.6 million hyperedges, and 800 clusters using 1,024 processes on a leadership class computing platform. Our strong and weak scaling experiments on supercomputers demonstrate that HyGen can quickly create large-scale hypergraphs in a parallel manner, thus providing a useful capability for hypergraph analysis.

Hasan, S M Shamimul↗

Graph reinforcement learning for exploring model spaces beyond the standard model

We present a methodology for performing scans of beyond the standard model (BSM) parameter spaces with reinforcement learning. We identify a novel procedure using graph neural networks that is capable of exploring spaces of models without the user specifying a fixed particle content, allowing broad classes of BSM models to be explored—in theory, the technique is applicable to nearly any model space with a prespecified gauge group. We provide a generic procedure by which a suitable graph grammar can be developed for any BSM model that features user-specified symmetry groups and a finite number of different possible particle species, the use of which is applicable to a variety of machine learning tasks over the actions of BSM theories beyond our particular reinforcement learning use case. As a proof of concept, we construct the graph grammar for theories with vectorlike leptons that may or may not be charged under a dark U ( 1 ) group, inspired by portal matter extensions of the sub-GeV vector portal/kinetic mixing simplified dark matter models. We then use this graph grammar to create a reinforcement learning environment tasked with creating models with these vectorlike leptons that are consistent with a list of a variety of precision observables. The reinforcement learning agent succeeds in developing models that can address the observed muon anomalous magnetic moment discrepancy while remaining consistent with flavor violation and electroweak precision observables, including both constructions that have previously been studied as well as new models that have not, to our knowledge, previously been identified. By inspecting the resulting ensembles of models that the agent produces and experimenting with different configurations for our reinforcement learning environment and graph grammar, we also infer various lessons about the development of these environments that can be transferable to reinforcement learning scans of more complicated model spaces and comment on future directions for the development of this technique into a more mature tool. Published by the American Physical Society 2025

Wojcik, George N.↗