Search NASA⌕ Search

SEARCH · Search NASA

Results for “Embeddings”

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 613 records · Page 34

In-situ 4D visualization and analysis of temperature-driven creep in an oil shale propped fracture

Here, the proppant embedment due to creep in shales is a known issue affecting the useable lifetime of wells in unconventional oil and gas recovery. One of the factors influencing creep is the presence of organics, whose properties can be very sensitive to temperature. In this work we investigated for the first time the role of temperature-induced creep increase in proppant embedment in an organics-rich Green River oil shale sample via in-situ synchrotron X-ray micro-computed tomography. We observed that temperatures as low as 75 °C already induce fast creep, with a fracture aperture closing rate of 13 μm/h and a loss of fracture conductivity rate of 8.7%/h, due only to proppant embedment, in the measured interval at the first heating stage. Local displacement data analysis provided evidence for markedly plastic deformation around the proppant-shale contacts, in contrast with the brittle proppant embedment observed on more cemented and less organics-rich shales at room temperature. The results highlight how the problem of temperature-dependent mechanical behavior might be more important than previously thought, in shales with a high content in organics, and that in-situ micro-imaging techniques can play a key role in understanding the underlying mechanisms, contributing to solve creep-related problems associated with hydraulic fracturing in complex scenarios.

02 PETROLEUM↗

Importance of charge self-consistency in first-principles description of strongly correlated systems

First-principles approaches have been successful in solving many-body Hamiltonians for real materials to an extent when correlations are weak or moderate. As the electronic correlations become stronger often embedding methods based on first-principles approaches are used to better treat the correlations by solving a suitably chosen many-body Hamiltonian with a higher level theory. The success of such embedding theories, often referred to as second-principles, is commonly measured by the quality of self-energy Σ which is either a function of energy or momentum or both. However, Σ should, in principle, also modify the electronic eigenfunctions and thus change the real space charge distribution. While such practices are not prevalent, some works that use embedding techniques do take into account these effects. In such cases, choice of partitioning, of the parameters defining the correlated Hamiltonian, of double-counting corrections, and the adequacy of low-level Hamiltonian hosting the correlated subspace hinder a systematic and unambiguous understanding of such effects. Further, for a large variety of correlated systems, strong correlations are largely confined to the charge sector. Then an adequate nonlocal low-order theory is important, and the high-order local correlations embedding contributes become redundant. Here we study the impact of charge self-consistency within two example cases, TiSe 2 and CrBr 3 , and show how real space charge re-distribution due to correlation effects taken into account within a first-principles Green’s function-based many-body perturbative approach is key in driving qualitative changes to the final electronic structure of these materials.

36 MATERIALS SCIENCE↗

Uncovering interpretable relationships in high-dimensional scientific data through function preserving projections

Abstract In many fields of science and engineering, we frequently encounter experiments or simulations datasets that describe the behavior of complex systems and uncovering human interpretable patterns between their inputs and outputs via exploratory data analysis is essential for building intuition and facilitating discovery. Often, we resort to 2D embeddings for examining these high-dimensional relationships (e.g. dimensionality reduction). However, most existing embedding methods treat the dimensions as coordinates for samples in a high-dimensional space, which fail to capture the potential functional relationships, and the few methods that do take function into consideration either only focus on linear patterns or produce non-linear embeddings that are hard to interpret. To address these challenges, we proposed function preserving projections (FPP), which construct 2D linear embeddings optimized to reveal interpretable yet potentially non-linear patterns between the domain and the range of a high-dimensional function. The intuition here is that humans are good at understanding potentially non-linear patterns in 2D but unable to interpret non-linear mapping from high-dimensional space to 2D. Therefore, we should restrict the projection to linear but not the pattern we are seeking. Using FPP on real-world datasets, one can obtain fundamentally new insights about high-dimensional relationships in extremely large datasets that could not be processed with existing dimension reduction methods.

97 MATHEMATICS AND COMPUTING↗

Hickson-like compact groups inhabiting different environments

ABSTRACT Although compact groups (CGs) of galaxies have been envisioned as isolated extremely dense structures in the Universe, it is accepted today that many of them could be not as isolated as thought. In this work, we study Hickson-like CGs identified in the Sloan Digital Sky Survey Data Release 16 to analyse these systems and their galaxies when embedded in different cosmological structures. To achieve this goal, we identify several cosmological structures where CGs can reside: nodes of filaments, loose groups, filaments, and cosmic voids. Our results indicate that 45 per cent of CGs do not reside in any of these structures, i.e. they can be considered non-embedded or isolated systems. Most of the embedded CGs are found inhabiting loose groups and nodes, while there are almost no CGs residing well inside cosmic voids. Some physical properties of CGs vary depending on the environment they inhabit. CGs in nodes show the largest velocity dispersions, the brightest absolute magnitude of the first-ranked galaxy, and the smallest crossing times, while the opposite occurs in non-embedded CGs. When comparing galaxies in all the environments and galaxies in CGs, CGs show the highest fractions of red/early-type galaxy members in most of the absolute magnitudes ranges. The variation between galaxies in CGs inhabiting one or another environment is not as significant as the differences caused by belonging or not to a CG. Our results suggest a plausible scenario for galaxy evolution in CGs in which both large-scale and local environments play essential roles.

Astronomy & Astrophysics↗

Efficient graph representation framework for chemical molecule similarity tasks

Graph data has emerged in numerous scientific domains and machine learning techniques have been widely used for analysis and learning of diverse data for prediction and decision. Machine learning techniques can readily address complex problems by leveraging their structural information. But graphs cannot be directly used for existing machine learning algorithms unless encoded as vectors. The problem of efficient representation of graphs is a substantial challenge in graph machine learning. In this paper, we propose a novel two-stage framework for the representation of chemical molecule graphs based on the strengths of Graph Isomorphism Networks (GINs) and Siamese autoencoders. In the first stage, the GIN model is constructed and trained using the structural information of chemical molecule graphs. Node attributes, edge attributes, and edge indices are used as input data, while graph attributes are used as labels. The GIN model effectively captures the structural characteristics of graphs and can accurately predict graph attributes, i.e., molecular properties. It also generates Graph Embeddings, represented as vectors that encode the structural information of graphs. In the second stage, Graph Embedding vectors are further optimized for downstream similarity tasks while preserving the graph structural information. The Siamese autoencoder is constructed and trained, which reduces the dimensionality of the Graph Embedding vectors, while maximizing the preservation of structural information in the original high-dimensional vectors. The resulting low-dimensional Graph Embeddings can be effectively utilized for tasks such as approximate nearest neighbor search. The experimental results demonstrate the effectiveness of our proposed framework in accurately predicting graph similarity.

Ma, Jiaji↗

Same Data, Different Audiences: Using Personas to Scope a Supercomputing Job Queue Visualization

Domain-specific visualizations sometimes focus on narrow, albeit important, tasks for one group of users. This focus limits the utility of a visualization to other groups working with the same data. While tasks elicited from other groups can present a design pitfall if not disambiguated, they also present a design opportunity—namely, the development of visualizations that support multiple groups. This development choice presents a trade-off of broadening the scope but limiting support for the more narrow tasks of any one group, which in some cases can enhance the overall utility of the visualization. We investigate this scenario through a design study where we develop Guidepost, a notebook-embedded visualization of data that helps scientists assess compute wait times, machine learning researchers understand prediction accuracy, and system maintainers analyze usage trends. We adapt the use of personas for visualization design from existing literature in the HCI and design domains, applying them to categorize tasks based on their uniqueness across stakeholder personas. Under this model, tasks shared between all groups should be supported by interactive visualizations and tasks unique to each group can be deferred to scripting with notebook-embedded visualization design. We evaluate our visualization through real-world case studies and a task-focused evaluation with nine participants. We observe that together, Guidepost's visual encodings, interactions, and export capabilities support the tasks of our differing personas.

97 MATHEMATICS AND COMPUTING↗

Knowledge Oriented Graph Unified Transformer (KOGUT) v0.1

KOGUT — Knowledge Oriented Graph Unified Transformer KOGUT implements the Relational Graph Transformer (RelGT) architecture for knowledge graph link prediction in biological domains, with a primary focus on microbial growth media prediction. While the original RelGT (arXiv:2505.10960) targets relational tables, time series, and multi-table databases, KOGUT adapts this architecture for heterogeneous biological knowledge graphs, providing first-in-class AI predictive models for microbial cultivation. Key Adaptations Beyond Original RelGT: - Knowledge Graph Focus: Applied to biological KGs with semantic node types (taxa, chemicals, media, phenotypes, environments) versus generic relational database tables, trained on the KG-Microbe knowledge graph (1.3M entities, 2.9M edges, 24 relation types). - Multimodal Node Encoding: Integrates node labels, categories, descriptions, and synonyms from KG metadata through learned embedding layers—adapting relational column features to graph node attributes with textual semantics. - Extended K-Hop Subgraph Strategy: Optimized neighborhood sampling (3-hop default, configurable up to 200 nodes) tuned for sparse biological networks, building on the original local-global attention framework with biological relation preservation. - Biolink Predicate Preservation: Type-specific transformations for 24 biological edge semantics (occurs_in, consumes, produces, has_phenotype, subclass_of) beyond standard relational foreign keys, enabling multi-relation link prediction. - Inductive Learning Support: Enables zero-shot predictions for novel taxa through feature-based embeddings (temperature, oxygen requirements, gram stain, cell shape), extending the original transductive relational benchmark scope to uncultured microorganisms. CheapSOTA Performance Optimizations (This Distribution): - VQ-EMA Centroid Attention: Vector quantization with exponential moving average for improved global context modeling (+5-10% MRR improvement). - HDF5 Precomputed Data Loading: One-time preprocessing of k-hop subgraphs to eliminate redundant graph traversals (2-5× training speedup). - Distributed Data Parallel Training: Multi-GPU support for scaling to larger knowledge graphs (tested on 4× NVIDIA A100 GPUs at NERSC Perlmutter). - Mixed Precision Training: Automatic mixed precision (AMP) for memory efficiency and faster training. Advantages Over Standard Knowledge Graph Embedding Models: Combines RelGT's proven multi-element tokenization (features, type, hop, structure) with graph-native biological representations, enabling interpretable link prediction across heterogeneous entities that standard embedding models (TransE, RotatE, ComplEx) and table-based transformers cannot directly model. Achieves near-perfect performance on microbial growth media prediction (MRR: 0.9966, Precision@1: 0.9932, Hit@10: 1.0000) while maintaining explainability through attention-based reasoning over biological pathways. Training Data: - KG-Microbe merged knowledge graph: 1,379,337 nodes, 2,960,472 edges - 24 biological relation types including taxonomic hierarchies, metabolic interactions, phenotype associations, and environmental relationships - Primary prediction task: Growth media suitability for microbial taxa (biolink:occurs_in, 50K edges) - Multi-relation capability: Predicts links for any of the 24 relation types, including chemical consumption/production, phenotype associations, and taxonomic classification Citation: Original RelGT Architecture: Dwivedi et al., "Relational Graph Transformer", arXiv:2505.10960, 2025 KOGUT Implementation: Knowledge Oriented Graph Unified Transformer for Microbial Growth Media Prediction Developed at Lawrence Berkeley National Laboratory (LBNL) Trained on NERSC Perlmutter supercomputer

Joachimiak, Marcin [Lawrence Berkeley National Lab↗

New trends in photonic switching and optical networking architectures for data centers and computing systems [Invited]

The rapid increases in data traffic coupled with user preferences are driving the data center and computing system service providers to offer energy-efficient, intelligent, flexible, cost-effective, high-capacity, and low-latency data services without added complexity to the users. Disaggregated heterogeneous reconfigurable computing systems realized by photonic switching and interconnects can enhance throughput and energy efficiency for artificial intelligence/machine learning (AI/ML) workloads, especially when aided by the AI/ML-enhanced control plane. Photonic switching and new optical networking architectures are expected to solve many of these challenging problems. This paper discusses new trends in photonic switching and optical network architectures for future data centers and computing systems summarized as follows: (1) flat reconfigurable disaggregated computing enabled by high-radix photonic switching and interconnects in data centers; (2) chiplet-based computing architectures empowered by embedded photonics toward heterogeneous reconfigurable computing; (3) nanosecond-scale photonic switching in data centers and computing systems; (4) AI/ML in self-driving, application-aware, and situation-aware data centers; (5) the emergence of flexible networking for cloud computing, edge computing, and split computing, as well as flexible networking for 5G/6G RF-optical networks; and (6) the deployment of embedded co-designed silicon photonics being considered for future data centers.

Yoo, S. J. Ben (ORCID:0000000274201871)↗

Development of self-sensing materials for extreme environments based on metamaterial concept and additive manufacturing

Structural health monitoring of an engineered component in a harsh environment is critical for multiple DOE missions including nuclear fuel cycle, subsurface energy production/storage, and energy conversion. Supported by a seeding Laboratory Directed Research & Development (LDRD) project, we have explored a new concept for structural health monitoring by introducing a self-sensing capability into structural components. The concept is based on two recent technological advances: metamaterials and additive manufacturing. A self-sensing capability can be engineered by embedding a metastructure, for example, a sheet of electromagnetic resonators, either metallic or dielectric, into a material component. This embedment can now be realized using 3-D printing. The precise geometry of the embedded metastructure determines how the material interacts with an incident electromagnetic wave. Any change in the structure of the material (e.g., straining, degradation, etc.) would inevitably perturbate the embedded metastructures or metasurface array and therefore alter the electromagnetic response of the material, thus resulting in a frequency shift of a reflection spectrum that can be detected passively and remotely. This new sensing approach eliminates complicated environmental shielding, in-situ power supply, and wire routing that are generally required by the existing active-circuit-based sensors. The work documented in this report has preliminarily demonstrated the feasibility of the proposed concept. The work has established the needed simulation tools and experimental capabilities for future studies.

36 MATERIALS SCIENCE↗

The Influence of Disk Composition on the Evolution of Stars in the Disks of Active Galactic Nuclei

Abstract Disks of gas accreting onto supermassive black holes, powering active galactic nuclei (AGN), can capture stars from nuclear star clusters or form stars in situ via gravitational instability. The density and thermal conditions of these disks can result in rapid accretion onto embedded stars, dramatically altering their evolution in comparison to stars in the interstellar medium. Theoretical models predict that, when subjected to sufficiently rapid accretion, fresh gas replenishes hydrogen in the cores of these stars as quickly as it is burned into helium, reaching a quasi-steady state. Such massive, long-lived (“immortal”) stars may be capable of dramatically enriching AGN disks with helium, and would increase the helium abundance in AGN broad-line regions relative to that in the corresponding narrow-line regions and hosts. We investigate how the helium abundance of AGN disks alters the evolution of stars embedded therein. We find, in agreement with analytical arguments, that stars at a given mass are more luminous at higher helium mass fractions, and so undergo more radiation-driven mass loss. We further find that embedded stars tend to be less massive in disks with higher helium mass fractions, and that immortal stars are less common in such disks. Thus, disk composition can alter the rates of electromagnetic and gravitational wave transients as well as further chemical enrichment by embedded stars.

79 ASTRONOMY AND ASTROPHYSICS↗

Selecting the independent coordinates of manifolds with large aspect ratios

Many manifold embedding algorithms fail apparently when the data manifold has a large aspect ratio (such as a long, thin strip). Here, we formulate success and failure in terms of finding a smooth embedding, showing also that the problem is pervasive and more complex than previously recognized. Mathematically, success is possible under very broad conditions, provided that embedding is done by carefully selected eigenfunctions of the Laplace-Beltrami operator Δ. Hence, we propose a bicriterial Independent Eigencoordinate Selection (IES) algorithm that selects smooth embeddings with few eigenvectors. The algorithm is grounded in theory, has low computational overhead, and is successful on synthetic and large real data.

Meila, Marina↗

Multimodal Data Representation with Deep Learning for Extracting Cancer Characteristics from Clinical Text

This paper presents a multimodal data representation to improve the performance of deep learning models for extracting cancer key characteristics from unstructured text in pathology reports. Specifically, in addition to using the text as the input to deep learning models, we use concept unique identifiers (CUIs) as another source of information to the models. We analyze the performance of different text and CUI data representations, including word embeddings and bag of embeddings (BOE), with a convolutional neural network (CNN) and a fully connected multilayer perceptron neural network (MLP-NN). The high level document embeddings from text and CUI inputs are combined by concatenating them and then applying a classifier. The model is used for extracting cancer subsite and histology from pathology reports. These two classification tasks have a large number of labels, i.e. 317 for subsite and 556 for histology, with extreme class imbalance. We compare the performance of the developed DL models across the two tasks based on micro- and macro-F1 scores. The evaluation shows that a multi-channel DL model that utilizes text represented by word embeddings and CUIs represented by BOE outperforms other DL models. Also, this approach significantly improves the model performance on low prevalence classes.

Alawad, Mohammed↗

Sub-electrode microlens array for organic light emitting devices

Substrates are disclosed that include an embedded or partially-embedded microlens array. Devices are disclosed that include an OLED disposed over a substrate having an embedded or partially embedded micro lens array. Devices as disclosed herein redirect up to 100% of the light that otherwise would be confined in organic and electrode layers toward the substrate and thus provide improved light extraction and device efficiency.

Forrest, Stephen R.↗

DNA-PAINT Imaging with Hydrogel Imprinting and Clearing

Hydrogel-embedding is a versatile technique in fluorescence microscopy, offering stabilization, optical clearing, and the physical expansion of biological specimens. DNA-PAINT is a super-resolution microscopy approach based on the diffusion and transient binding of fluorescently labeled oligos, but its feasibility in hydrogels has not yet been explored. In this study, we demonstrate that polyacrylamide hydrogels support sufficient diffusion for effective DNA-PAINT imaging. Using acrydite-anchored oligonucleotides imprinted from patterned DNA origami nanostructures and microtubule filaments in fixed cells, we find that hydrogel embedding preserves docking strand positioning at the nanoscale. Sample clearing via protease treatment had minor structural effects on the microtubule structure and enhanced diffusion and accessibility to hydrogel-imprinted docking strands. Our work demonstrates promising potential for diffusion and binding-based fluorescence imaging applications in hydrogel-embedded samples.

DNA origami↗

Enhancing the Carbon Monoxide Oxidation Performance through Surface Defect Enrichment of Ceria-Based Supports for Platinum Catalyst

Effective synthesis and application of single-atom catalysts on supports lacking enough defects remain a significant challenge in environmental catalysis. Herein, we present a universal defect-enrichment strategy to increase the surface defects of CeO 2 -based supports through H 2 reduction pretreatment. The Pt catalysts supported by defective CeO 2 -based supports, including CeO 2 , CeZrO x , and CeO 2 /Al 2 O 3 (CA), exhibit much higher Pt dispersion and CO oxidation activity upon reduction activation compared to their counterpart catalysts without defect enrichment. Specifically, Pt is present as embedded single atoms on the CA support with enriched surface defects (CA-HD) based on which the highly active catalyst showing embedded Pt clusters (Pt C ) with the bottom layer of Pt atoms substituting the Ce cations in the CeO 2 surface lattice can be obtained through reduction activation. Embedded PtC can better facilitate CO adsorption and promote O 2 activation at Pt C –CeO 2 interfaces, thereby contributing to the superior low-temperature CO oxidation activity of the Pt/CA-HD catalyst after activation.

36 MATERIALS SCIENCE↗

Faster Johnson–Lindenstrauss transforms via Kronecker products

The Kronecker product is an important matrix operation with a wide range of applications in signal processing, graph theory, quantum computing and deep learning. In this work, we introduce a generalization of the fast Johnson–Lindenstrauss projection for embedding vectors with Kronecker product structure, the Kronecker fast Johnson–Lindenstrauss transform (KFJLT). The KFJLT reduces the embedding cost by an exponential factor of the standard fast Johnson–Lindenstrauss transform’s cost when applied to vectors with Kronecker structure, by avoiding explicitly forming the full Kronecker products. Here, we prove that this computational gain comes with only a small price in embedding power: consider a finite set of $p$ points in a tensor product of $d$ constituent Euclidean spaces $\bigotimes _{k=d}^{1}{\mathbb{R}}^{n_k}$, and let $N = \prod _{k=1}^{d}n_k$. With high probability, a random KFJLT matrix of dimension $m \times N$ embeds the set of points up to multiplicative distortion $(1\pm \varepsilon )$ provided $m \gtrsim \varepsilon ^{-2} \, \log ^{2d - 1} (p) \, \log N$. We conclude by describing a direct application of the KFJLT to the efficient solution of large-scale Kronecker-structured least squares problems for fitting the CP tensor decomposition.

Kronecker structure↗

GrAMME: Semisupervised Learning Using Multilayered Graph Attention Models

Modern data analysis pipelines are becoming increasingly complex due to the presence of multiview information sources. While graphs are effective in modeling complex relationships, in many scenarios, a single graph is rarely sufficient to succinctly represent all interactions, and hence, multilayered graphs have become popular. Though this leads to richer representations, extending solutions from the single-graph case is not straightforward. Consequently, there is a strong need for novel solutions to solve classical problems, such as node classification, in the multilayered case. In this article, we consider the problem of semisupervised learning with multilayered graphs. Though deep network embeddings, e.g., DeepWalk, are widely adopted for community discovery, we argue that feature learning with random node attributes, using graph neural networks, can be more effective. To this end, we propose to use attention models for effective feature learning and develop two novel architectures, GrAMME-SG and GrAMME-Fusion, that exploit the interlayer dependences for building multilayered graph embeddings. Using empirical studies on several benchmark data sets, we evaluate the proposed approaches and demonstrate significant performance improvements in comparison with the state-of-the-art network embedding strategies. The results also show that using simple random features is an effective choice, even in cases where explicit node attributes are not available.

97 MATHEMATICS AND COMPUTING↗