Search NASA⌕ Search

SEARCH · Search NASA

Results for “UNIFI”

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 73 records · Page 4

A Unified Wireless Charger, On-Board Charger, and Auxiliary Power Module for Electric Vehicle Charging Systems

This paper proposes a unified electric vehicle (EV) charging architecture that integrates wireless power transfer (WPT), an on-board charger (OBC), and an auxiliary power module (APM) within a single architecture. By sharing a multi-functional magnetic structure and active switch bridges, the proposed topology eliminates additional transformers and converter stages, reducing hardware complexity and improving power density. A multipurpose magnetic design achieves magnetic decoupling among the WPT, OBC, and APM functions while maintaining the required coupling for each mode. Through electrical reconfiguration, the WPT operates as an LCC-S converter, whereas the OBC and APM operate as dual-active-bridge (DAB) converters. The system supports multiple operating modes, including simultaneous high-voltage and lowvoltage battery charging. Finite-element and circuit simulations verify the magnetic characteristics and system operation, demonstrating the feasibility of the proposed unified architecture for EV charging applications.

Jo, Cheolhui [ORNL] (ORCID:0000000322692434)↗

Modeling and ZVS Operation of the Isolated Modular Multilevel DC–DC Converter With a Unified Trapezoidal Wave Modulation

Here, this article introduces a unified trapezoidal wave (UTW) modulation scheme for the isolated modular multilevel dc–dc (IM2dc) converter, which consolidates multiple existing modulation strategies for the IM2dc converter, including the quasi-square wave (QSW) modulation, trapezoidal wave modulation, and sinusoidal wave modulation, into a unified framework. Furthermore, this article introduces the harmonic state-space (HSS) equations to model the IM2dc converter based on the UTW modulation method. The HSS model operates in the frequency domain, enabling it to circumvent the complexities associated with time-domain analysis and seamlessly integrate with the UTW modulation. This article proceeds to analyze the real and reactive power transfer characteristics of the IM2dc converter, as well as the power factor, considering the influence of multiple modulation parameters. Subsequently, it delves into the examination of zero voltage switching (ZVS) conditions for the IM2dc converter based on the UTW modulation and the HSS model. The complete ZVS boundaries of the IM2dc converter, taking various voltage ratios into account, are derived. This article also illustrates the effects of including harmonic orders in the modeling process, modulation parameters, and internal harmonic ripples on the ZVS boundaries. Finally, experimental validation of the analyses is conducted on a down-scaled prototype.

42 ENGINEERING↗

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↗

Traversing large graphs on GPUs with unified memory

Due to the limited capacity of GPU memory, the majority of prior work on graph applications on GPUs has been restricted to graphs of modest sizes that fit in memory. Recent hardware and software advances make it possible to address much larger host memory transparently as a part of a feature known as unified virtual memory. While accessing host memory over an interconnect is understandably slower, the problem space has not been sufficiently explored in the context of a challenging workload with low computational intensity and an irregular data access pattern such as graph traversal. We analyse the performance of breadth first search (BFS) for several large graphs in the context of unified memory and identify the key factors that contribute to slowdowns. Next, we propose a lightweight offline graph reordering algorithm, HALO (Harmonic Locality Ordering), that can be used as a pre-processing step for static graphs. HALO yields speedups of 1.5x-1.9x over baseline in subsequent traversals. Our method specifically aims to cover large directed real world graphs in addition to undirected graphs whereas prior methods only account for the latter. Additionally, we demonstrate ties between the locality ordering problem and graph compression and show that prior methods from graph compression such as recursive graph bisection can be suitably adapted to this problem.

Gera, Prasun↗

Towards a Unified theory of Fractional and Nonlocal Vector Calculus

Nonlocal and fractional-order models capture effects that classical partial differential equations cannot describe; for this reason, they are suitable for a broad class of engineering and scientific applications that feature multiscale or anomalous behavior. This has driven a desire for a vector calculus that includes nonlocal and fractional gradient, divergence and Laplacian type operators, as well as tools such as Green’s identities, to model subsurface transport, turbulence, and conservation laws. In the literature, several independent definitions and theories of nonlocal and fractional vector calculus have been put forward. Some have been studied rigorously and in depth, while others have been introduced ad-hoc for specific applications. The goal of this work is to provide foundations for a unified vector calculus by (1) consolidating fractional vector calculus as a special case of nonlocal vector calculus, (2) relating unweighted and weighted Laplacian operators by introducing an equivalence kernel, and (3) proving a form of Green’s identity to unify the corresponding variational frameworks for the resulting nonlocal volume-constrained problems. Here, the proposed framework goes beyond the analysis of nonlocal equations by supporting new model discovery, establishing theory and interpretation for a broad class of operators, and providing useful analogues of standard tools from the classical vector calculus.

97 MATHEMATICS AND COMPUTING↗

A Unified Theory of Fractional Nonlocal and Weighted Nonlocal Vector Calculus

Nonlocal and fractional-order models capture effects that classical partial differential equations cannot describe; for this reason, they are suitable for a broad class of engineering and scientific applications that feature multiscale or anomalous behavior. This has driven a desire for a vector calculus that includes nonlocal and fractional gradient, divergence and Laplacian type operators, as well as tools such as Green's identities, to model subsurface transport, turbulence, and conservation laws. In the literature, several independent definitions and theories of nonlocal and fractional vector calculus have been put forward. Some have been studied rigorously and in depth, while others have been introduced ad-hoc for specific applications. The goal of this work is to provide foundations for a unified vector calculus by (1) consolidating fractional vector calculus as a special case of nonlocal vector calculus, (2) relating unweighted and weighted Laplacian operators by introducing an equivalence kernel, and (3) proving a form of Green's identity to unify the corresponding variational frameworks for the resulting nonlocal volume-constrained problems. The proposed framework goes beyond the analysis of nonlocal equations by supporting new model discovery, establishing theory and interpretation for a broad class of operators, and providing useful analogues of standard tools from the classical vector calculus.

97 MATHEMATICS AND COMPUTING↗

A new era of observationally-infused E3SM: GANs for unifying imagery archives

This paper presents an idea to develop a “Rosetta Stone” for unifying observations from various satellite or remote sensors into a common format that would vastly advance our ability to exploit existing datasets for improving predictability within Earth System Models (ESMs). While the applications of such a unified archive are broad, we believe it will be a critical step toward ushering in a new generation of ESMs that are richly informed, guided by, and validated by extensive observational data. With the vast quantity of both remotely-sensed and in-situ data streams available and coming online, new approaches are needed that can harmonize and thus fully exploit these expensive datasets. While we present the broader idea, we point to examples of applications that impact the water cycle and its representation in ESMs.

58 GEOSCIENCES↗

Unified Memory: GPGPU-Sim/UVM Smart Integration

CPU/GPU heterogeneous compute platforms are an ubiquitous element in computing and a programming model specified for this heterogeneous computing model is important for both performance and programmability. A programming model that exposes the shared, unified, address space between the heterogeneous units is a necessary step in this direction as it removes the burden of explicit data movement from the programmer while maintaining performance. GPU vendors, such as AMD and NVIDIA, have released software-managed runtimes that can provide programmers the illusion of unified CPU and GPU memory by automatically migrating data in and out of the GPU memory. However, this runtime support is not included in GPGPU-Sim, a commonly used framework that models the features of a modern graphics processor that are relevant to non-graphics applications. UVM Smart was developed, which extended GPGPU-Sim 3.x to in- corporate the modeling of on-demand pageing and data migration through the runtime. This report discusses the integration of UVM Smart and GPGPU-Sim 4.0 and the modifications to improve simulation performance and accuracy.

97 MATHEMATICS AND COMPUTING↗

UNIFI Specifications for GFM IBRs (V3) and Transitioning to an IEEE Standard [Slides]

This presentation describes version 3 of the grid-forming (GFM) specifications for inverter-based resources developed by the UNIFI (Uniform Interoperability for Grid-Forming Inverters) Consortium. It summarizes the requirements for GFM inverters, the four categories of GFM capability, and the tests designed to assess GFM capability. The tests including time-domain tests similar to those in use by some industry entities and frequency-domain tests that are largely new. This presentation also describes ongoing efforts to use the UNIFI GFM specifications as the starting point for a new IEEE standard called IEEE P2800.1.

14 SOLAR ENERGY↗

Unifying and benchmarking state-of-the-art quantum error mitigation techniques

Error mitigation is an essential component of achieving a practical quantum advantage in the near term, and a number of different approaches have been proposed. In this work, we recognize that many state-of-the-art error mitigation methods share a common feature: they are data-driven, employing classical data obtained from runs of different quantum circuits. For example, Zero-noise extrapolation (ZNE) uses variable noise data and Clifford-data regression (CDR) uses data from near-Clifford circuits. We show that Virtual Distillation (VD) can be viewed in a similar manner by considering classical data produced from different numbers of state preparations. Observing this fact allows us to unify these three methods under a general data-driven error mitigation framework that we call UNIfied Technique for Error mitigation with Data (UNITED). In certain situations, we find that our UNITED method can outperform the individual methods (i.e., the whole is better than the individual parts). Specifically, we employ a realistic noise model obtained from a trapped ion quantum computer to benchmark UNITED, as well as other state-of-the-art methods, in mitigating observables produced from random quantum circuits and the Quantum Alternating Operator Ansatz (QAOA) applied to Max-Cut problems with various numbers of qubits, circuit depths and total numbers of shots. We find that the performance of different techniques depends strongly on shot budgets, with more powerful methods requiring more shots for optimal performance. For our largest considered shot budget (10 10 ), we find that UNITED gives the most accurate mitigation. Hence, our work represents a benchmarking of current error mitigation methods and provides a guide for the regimes when certain methods are most useful.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Space shuttle GN and C equation document no. 21: Shuttle unified navigation filter

The space shuttle navigation equations are presented in a form for a single unified navigation filter used in each mission phase. The document serves as a single reference for the navigation equations replacing each of the individual mission phase navigation documents previously published. The fundamental characteristics of the navigation filter are described. The features of the unified formulation of the filter are analyzed.

Muller, E. S., Jr.↗

A unified method for analyzing mission reliability for fault tolerant computer systems.

For fault-tolerant computer systems consisting of multiple classes of modules, a unified method for analyzing mission reliability is proposed and evaluated. The analysis proceeds by generalizing the notions of standby and N modular redundancy into a concept called hybrid-degraded redundancy. The probabilistic evaluation of the unified redundancy concept is then developed to yield, for a given modular class, the joint distribution of success and the number of nonfailed modules from that class, at special times. With this information, a Markov chain analysis gives the reliability of an entire sequence of phases (mission profile).

Bricker, J. L.↗

Shuttle unified navigation filter, revision 1

Equations designed to meet the navigation requirements of the separate shuttle mission phases are presented in a series of reports entitled, Space Shuttle GN and C Equation Document. The development of these equations is based on performance studies carried out for each particular mission phase. Although navigation equations have been documented separately for each mission phase, a single unified navigation filter design is embodied in these separate designs. The purpose of this document is to present the shuttle navigation equations in a form in which they would most likely be coded-as the single unified navigation filter used in each mission phase. This document will then serve as a single general reference for the navigation equations replacing each of the individual mission phase navigation documents (which may still be used as a description of a particular navigation phase).

Muller, E. S., Jr.↗

An analysis of the unified and scalar additivity theories of spectral line broadening

The qualities of the unified and scalar theories proposed by various authors for describing the static and dynamic characteristics of a radiation perturber interaction are discussed. The regions of validity of these theories and the properties of the approximations applied by them are considered. New derivation procedures are proposed for the unified and scalar additivity theories of line broadening. These procedures do not require the use of an elaborate projection operator, of Green's function techniques in contrast to previous methods.

Smith, E. W.↗

The unified data system - A distributed processing network for control and data handling on a spacecraft

This paper presents the results obtained in a continuing investigation of real-time distributed processing systems which is being conducted at the Jet Propulsion Laboratory. A distributed processor architecture has been developed for control and data handling on a planetary spacecraft. This system, designated the Unified Data System, has been implemented in a feasibility breadboard. The following aspects of the Unified Data System are described: (1) standardized building block elements and their configuration into microprocessor modules, (2) a highly redundant bus structure which connects the various modules and facilitates intercommunications with minimal software support, (3) the structure of software within the individual modules and its coordination between modules, and (4) the mechanisms by which fault-tolerance can be implemented within the network. Through the attributes of multilevel standardization, simplicity, and flexibility, this system is expected to result in significant cost savings to future spacecraft missions.

Rennels, D. A.↗

Unified connected theory of few-body reaction mechanisms in N-body scattering theory

A unified treatment of different reaction mechanisms in nonrelativistic N-body scattering is presented. The theory is based on connected kernel integral equations that are expected to become compact for reasonable constraints on the potentials. The operators T/sub +-//sup ab/(A) are approximate transition operators that describe the scattering proceeding through an arbitrary reaction mechanism A. These operators are uniquely determined by a connected kernel equation and satisfy an optical theorem consistent with the choice of reaction mechanism. Connected kernel equations relating T/sub +-//sup ab/(A) to the full T/sub +-//sup ab/ allow correction of the approximate solutions for any ignored process to any order. This theory gives a unified treatment of all few-body reaction mechanisms with the same dynamic simplicity of a model calculation, but can include complicated reaction mechanisms involving overlapping configurations where it is difficult to formulate models.

Polyzou, W. N.↗

A unified analysis and design procedure for a standardized control module for dc-dc switching regulators

Three basic switching regulators: buck, boost, and buck/boost, employing a multi-loop control module (SCM) were characterized by a common small signal block diagram. Employing the unified model, regulator performances such as stability, audiosusceptibility, output impedance and step load transient are analyzed and key performance indexes are expressed in simple analytical forms. More importantly, the performance characteristics of all three regulators are shown to enjoy common properties due to the unique SCM control scheme which nullifies the positive zero and provides adaptive compensation to the moving poles of the boost and buck/boost converters. This allows a simple unified design procedure to be devised for selecting the key SCM control parameters for an arbitrarily given power stage configuration and parameter values, such that all regulator performance specifications can be met and optimized concurrently in a single design attempt.

Lee, F. C.↗

Technical writing practically unified through industry

General background details in the development of a university level technical writing program, based upon the writing tasks of the student's occupations, are summarized. Objectives and methods for unifying the courses of study with the needs of industry are discussed. Four academic course divisions, Industries Technologies, in which preparation and training are offered are: Animal, Horticulture, Agriculture, and Agricultural Business. Occupational competence is cited as the main goal for these programs in which technical writing is to be practically unified through industry. Course descriptions are also provided.

Houston, L. S.↗