SEARCH · Engineering Papers

Results for “intermediate representation”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Enabling Efficient Sparse Computations using Linear Algebra Aware Compilers

This project developed the LAPIS compiler framework, built on the Multilevel Intermediate Representation (MLIR), to optimize sparse linear algebra operations and support performance portability across diverse architectures. The main innovation of LAPIS is the Kokkos dialect, which allows for lowering codes from a high productivity language to different architectures in an elegant way. The dialect also allows the conversion of lower-level MLIR code to C++ Kokkos code, facilitating the integration of scientific machine learning (SciML) models into applications. To extend LAPIS for distributed memory architectures, a new partition dialect was created to manage the distribution of sparse tensors and express communication patterns for sparse linear algebra operations. This dialect also supports the distributed execution of operators and includes algorithmic optimizations to minimize communication to improve performance. The project also demonstrates that MLIR can enable effective linear algebra-level optimizations, improving performance on different GPUs for both sparse and dense linear algebra kernels. Key applications of LAPIS include sparse linear algebra and graph kernels, TenSQL, a relational database management solution built on GraphBLAS, and the development of subgraph isomorphism and monomorphism kernels, showcasing performance portability. In summary, the LAPIS framework supports productivity, performance, portability, and distributed memory execution, while also enabling linear algebra-level optimizations that are challenging in traditional programming languages, with successful applications ranging from simple sparse linear algebra to complex graph kernels.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1989

Perception for rugged terrain

A three-dimensional perception system for building a geometrical description of rugged terrain environments from range image data is presented with reference to the exploration of the rugged terrain of Mars. An intermediate representation consisting of an elevation map that includes an explicit representation of uncertainty and labeling of the occluded regions is proposed. The locus method used to convert range image to an elevation map is introduced, along with an uncertainty model based on this algorithm. Both the elevation map and the locus method are the basis of a terrain matching algorithm which does not assume any correspondences between range images. The two-stage algorithm consists of a feature-based matching algorithm to compute an initial transform and an iconic terrain matching algorithm to merge multiple range images into a uniform representation. Terrain modeling results on real range images of rugged terrain are presented. The algorithms considered are a fundamental part of the perception system for the Ambler, a legged locomotor.

Kweon, In SO↗

NASA NTRS2009

Model Based Analysis and Test Generation for Flight Software

We describe a framework for model-based analysis and test case generation in the context of a heterogeneous model-based development paradigm that uses and combines Math- Works and UML 2.0 models and the associated code generation tools. This paradigm poses novel challenges to analysis and test case generation that, to the best of our knowledge, have not been addressed before. The framework is based on a common intermediate representation for different modeling formalisms and leverages and extends model checking and symbolic execution tools for model analysis and test case generation, respectively. We discuss the application of our framework to software models for a NASA flight mission.

Pasareanu, Corina S.↗

DOE OSTI2025

ChemComp: Compiling and Computing with Chemical Reaction Networks

The exponential growth in computing demands driven by scientific computing, data analytics, and artificial intelligence is pushing conventional CMOS-based high-performance computing systems to their physical and energy efficiency limits. As we approach the era of post-exascale computing, disruptive approaches are necessary to overcome these barriers and achieve substantial gains in energy efficiency. Analog and hybrid digital-analog computing systems have emerged as promising alternatives, offering the potential for orders-of-magnitude improvements in efficiency. Among these, biochemical computing stands out as a novel paradigm capable of leveraging the natural efficiency of chemical reactions, which have shown promise in solving optimization problems by converging to steady states. By scaling up reaction networks or reaction vessel sizes, biochemical systems present an opportunity to meet the high-performance demands of modern computing tasks. Despite their promise, significant theoretical and practical challenges remain, particularly in formulating and mapping computational problems to chemical reaction networks (CRNs) and designing viable biochemical computing devices. This paper addresses these challenges by introducing new ideas to ChemComp, a compilation and emulation framework for chemical computation. This work describes the mechanisms through which solutions to ordinary differential equations (ODEs) that can be represented as CRN systems can be achieved. Furthermore, we explain the design principles of an ODE dialect implemented as a multi-level intermediate representation (MLIR) compiler extension that will be coupled with existing infrastructure. We demonstrate the potential of our framework through a case study emulating a simplified chemical reservoir computing device. This work establishes foundational tools and methodologies necessary to harness the computational power of chemistry, paving the way for the development of energy-efficient, high-performance computing systems tailored to contemporary and future computational needs.

Bohm Agostini, Nicolas↗

DOE OSTI2026

TRACE Input Modernization

This work presents a Tom’s Obvious Minimal Language (TOML)-based representation of input for the US Nuclear Regulatory Commission’s TRAC/RELAP Advanced Computational Engine (TRACE) thermal hydraulics code. Implemented using the Workbench Analysis Sequence Processor (WASP), the approach maps traditional TRACE input structures to a hierarchical format composed of named parameters, typed values, and native data collections. The resulting representation preserves TRACE’s existing modeling capabilities while providing a modern, structured interface for model development and management. WASP further extends TOML through a file import directive that supports modular model composition and reusable input organization. In addition, WASP provides extended array data entry convenience with various data repeat and interpolation capabilities. Examples of the new TOML syntax are provided for major TRACE input categories, including hydraulic components, heat structures, control systems, and trip logic. The TOML representation establishes a foundation for improved validation, tooling, automation, and model maintainability while remaining compatible with existing TRACE workflows. To facilitate migration to the TOML-based input format, the TRACE executable now supports conversion of native TRACE input into an intermediate JSON representation. A Python utility subsequently transforms the JSON data into an equivalent TOML model. Lastly, the TRACE executable now supports execution using TOML-formatted input.

Lefebvre, Robert A. [Oak Ridge National Laboratory↗

NASA NTRS1991

Acquisition, representation and rule generation for procedural knowledge

Current research into the design and continuing development of a system for the acquisition of procedural knowledge, its representation in useful forms, and proposed methods for automated C Language Integrated Production System (CLIPS) rule generation is discussed. The Task Analysis and Rule Generation Tool (TARGET) is intended to permit experts, individually or collectively, to visually describe and refine procedural tasks. The system is designed to represent the acquired knowledge in the form of graphical objects with the capacity for generating production rules in CLIPS. The generated rules can then be integrated into applications such as NASA's Intelligent Computer Aided Training (ICAT) architecture. Also described are proposed methods for use in translating the graphical and intermediate knowledge representations into CLIPS rules.

Ortiz, Chris↗

DOE OSTI2025

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗

DOE OSTI2024

cclib 2.0: An updated architecture for interoperable computational chemistry

Interoperability in computational chemistry is elusive, impeded by the independent development of software packages and idiosyncratic nature of their output files. The cclib library was introduced in 2006 as an attempt to improve this situation by providing a consistent interface to the results of various quantum chemistry programs. The shared API across programs enabled by cclib has allowed users to focus on results as opposed to output and to combine data from multiple programs or develop generic downstream tools. Initial development, however, did not anticipate the rapid progress of computational capabilities, novel methods, and new programs; nor did it foresee the growing need for customizability. Here, we recount this history and present cclib 2, focused on extensibility and modularity. We also introduce recent design pivots—the formalization of cclib’s intermediate data representation as a tree-based structure, a new combinator-based parser organization, and parsed chemical properties as extensible objects.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1974

Symbolic integration of a class of algebraic functions

An algorithm is presented for the symbolic integration of a class of algebraic functions. This class consists of functions made up of rational expressions of an integration variable x and square roots of polynomials, trigonometric and hyperbolic functions of x. The algorithm is shown to consist of the following components:(1) the reduction of input integrands to conical form; (2) intermediate internal representations of integrals; (3) classification of outputs; and (4) reduction and simplification of outputs to well-known functions.

Ng, E. W.↗

NASA NTRS1994

Integration for navigation on the UMASS mobile perception lab

Integration of real-time visual procedures for use on the Mobile Perception Lab (MPL) was presented. The MPL is an autonomous vehicle designed for testing visually guided behavior. Two critical areas of focus in the system design were data storage/exchange and process control. The Intermediate Symbolic Representation (ISR3) supported data storage and exchange, and the MPL script monitor provided process control. Resource allocation, inter-process communication, and real-time control are difficult problems which must be solved in order to construct strong autonomous systems.

Draper, Bruce↗

NASA NTRS1997

Micromechanical Modeling of Woven Metal Matrix Composites

This report presents the results of an extensive micromechanical modeling effort for woven metal matrix composites. The model is employed to predict the mechanical response of 8-harness (8H) satin weave carbon/copper (C/Cu) composites. Experimental mechanical results for this novel high thermal conductivity material were recently reported by Bednarcyk et al. along with preliminary model results. The micromechanics model developed herein is based on an embedded approach. A micromechanics model for the local (micro-scale) behavior of the woven composite, the original method of cells (Aboudi), is embedded in a global (macro-scale) micromechanics model (the three-dimensional generalized method of cells (GMC-3D) (Aboudi). This approach allows representation of true repeating unit cells for woven metal matrix composites via GMC-3D, and representation of local effects, such as matrix plasticity, yarn porosity, and imperfect fiber-matrix bonding. In addition, the equations of GMC-3D were reformulated to significantly reduce the number of unknown quantities that characterize the deformation fields at the microlevel in order to make possible the analysis of actual microstructures of woven composites. The resulting micromechanical model (WCGMC) provides an intermediate level of geometric representation, versatility, and computational efficiency with respect to previous analytical and numerical models for woven composites, but surpasses all previous modeling work by allowing the mechanical response of a woven metal matrix composite, with an elastoplastic matrix, to be examined for the first time. WCGMC is employed to examine the effects of composite microstructure, porosity, residual stresses, and imperfect fiber-matrix bonding on the predicted mechanical response of 8H satin C/Cu. The previously reported experimental results are summarized, and the model predictions are compared to monotonic and cyclic tensile and shear test data. By considering appropriate levels of porosity, residual stresses, and imperfect fiber-matrix debonding, reasonably good qualitative and quantitative correlation is achieved between model and experiment.

Bednarcyk, Brett A.↗

NASA NTRS1989

MHD intermediate shock discontinuities. I - Rankine-Hugoniot conditions

Recent numerical investigations have focused attention once more on the role of intermediate shocks in MHD. Four types of intermediate shock are identified using a graphical representation of the MHD Rankine-Hugoniot conditions. This same representation can be used to exhibit the close relationship of intermediate shocks to switch-on shocks and rotational discontinuities. The conditions under which intermediate discontinuities can be found are elucidated. The variations in velocity, pressure, entropy and magnetic-field jumps with upstream parameters in intermediate shocks are exhibited graphically. The evolutionary arguments traditionally advanced against intermediate shocks may fail because the equations of classical MHD are not strictly hyperbolic.

Kennel, C. F.↗

DOE OSTI2024

A realistic theory of E6 unification through novel intermediate symmetries

Abstract We propose a non-supersymmetric E 6 GUT with the scalar sector consisting of650⨁351′ ⨁27. Making use of the first representation for the initial symmetry breaking to an intermediate stage, and the latter two representations for second-stage breaking to the Standard Model and a realistic Yukawa sector, this theory represents the minimal E 6 GUT that proceeds through one of the intermediate stages that are novel compared to SU(5) or SO(10) GUT: trinification SU(3) C × SU(3) L × SU(3) R , SU(6) × SU(2) and flipped SO(10) × U(1). We analyze these possibilities under the choice of vacuum that preserves a ℤ 2 “spinorial parity”, which disentangles the chiral and vector-like fermions of E 6 and provides a dark matter candidate in the form of a (scalar) inert doublet. Three cases are shown to consistently unify under the extended survival hypothesis (with minimal fine-tuning): trinification symmetry SU(3) C × SU(3) L × SU(3) R with eitherLRorCRparity, and SU(6) CR × SU(2) L . Although the successful cases give a large range for proton lifetime estimates, all of them include regions consistent with current experimental bounds and within reach of forthcoming experiments. The scenario investigated in this paper essentially represents the unique (potentially) viable choice in the class of E 6 GUTs proceeding through a novel-symmetry intermediate stage, since non-minimal alternatives seem to be intrinsically non-perturbative.

Physics↗

DOE OSTI2025

A flavor of SO(10) unification with a spinor Higgs

We investigate Higgs Parity unification — a realization of SO(10) grand unification based on the Higgs Parity mechanism in which the Standard Model (SM) Higgs resides in a spinor representation. The theory has an intermediate left-right symmetric stage where the SU(2)R symmetry breaking scale is fixed by the vanishing of the SM Higgs quartic coupling. The strong CP problem is solved by parity. Gauge coupling unification successfully predicts αs(MZ) to within 1%. The spinor Higgs naturally leads to a seesaw origin for SM flavor observables. We identify a novel mechanism where large mixing of third generation fermions with additional heavy vector-like fermions accounts for the anarchical nature of the PMNS matrix and the lack of hierarchy in the neutrino mass spectrum, relative to the up-quarks. A fit to quark and lepton masses and mixings, with a minimal parameter set, predicts 1) A testable relation between the top quark mass and αs(MZ) which is about (1 – 2)σ from current best fit values, 2) The order of magnitude of the baryon asymmetry of the universe, via leptogenesis from second-generation right-handed neutrino decays. 3) The proton decay and the neutron EDM are likely observable in next generation experiments, and 4) A normal ordered neutrino mass spectrum where 0νββ decay and the mass of the lightest neutrino are out of reach of next generation experiments.

Baryo-and Leptogenesis↗

NASA NTRS1975

Dispersion forces at arbitrary distances

The formalism of Boehm and Yaris is used to evaluate explicitly the leading term of the London dispersion force between closed-shell atoms. Instead of using the usual multipole expansion, which breaks down at intermediate internuclear distances, an analytic representation of the Born amplitude together with a general angular momentum analysis is used. As a result, expressions are obtained which reduce to the usual dispersion forces at large distances and are finite at all distances.

Jacobi, N.↗

NASA NTRS1993

Frequency domain system identification methods - Matrix fraction description approach

This paper presents the use of matrix fraction descriptions for least-squares curve fitting of the frequency spectra to compute two matrix polynomials. The matrix polynomials are intermediate step to obtain a linearized representation of the experimental transfer function. Two approaches are presented: first, the matrix polynomials are identified using an estimated transfer function; second, the matrix polynomials are identified directly from the cross/auto spectra of the input and output signals. A set of Markov parameters are computed from the polynomials and subsequently realization theory is used to recover a minimum order state space model. Unevenly spaced frequency response functions may be used. Results from a simple numerical example and an experiment are discussed to highlight some of the important aspect of the algorithm.

Horta, Luca G.↗

NASA NTRS1983

Building an information model (with the help of PSL/PSA)

Problem Statement Language/Problem Statement Analyzer (PSL/PSA) applications, which were once a one-step process in which product system information was immediately translated into PSL statements, have in light of experience been shown to result in inconsistent representations. These shortcomings have prompted the development of an intermediate step, designated the Product System Information Model (PSIM), which provides a basis for the mutual understanding of customer terminology and the formal, conceptual representation of that product system in a PSA data base. The PSIM is initially captured as a paper diagram, followed by formal capture in the PSL/PSA data base.

Callender, E. D.↗

NASA NTRS1981

Effect of the size distribution on the thermal emission from cometary dust

The IR thermal emission from cometary dust is analyzed by two size distribution functions, Sekanina A and a modified Sekanina Miller distribution. The resulting thermal emission spectra are illustrated for heliocentric distances 0.15 to 1.6 AU. The Sekania A distribution does not predict the observed heliocentric variation in the flux ratio I (4.8 micron) I (3.5 micron) for bright comets. A size distribution intermediate between the two presented is a better representation of the dust in recently observed comets.

Hanner, M. S.↗