Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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.

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

At least 37 records · Page 2

When Does Changing Representation Improve Problem-Solving Performance?

The aim of changing representation is the improvement of problem-solving efficiency. For the most widely studied family of methods of change of representation it is shown that the value of a single parameter, called the expulsion factor, is critical in determining (1) whether the change of representation will improve or degrade problem-solving efficiency and (2) whether the solutions produced using the change of representation will or will not be exponentially longer than the shortest solution. A method of computing the expansion factor for a given change of representation is sketched in general and described in detail for homomorphic changes of representation. The results are illustrated with homomorphic decompositions of the Towers of Hanoi problem.

Holte, Robert↗

An XML Representation for Crew Procedures

NASA ensures safe operation of complex systems through the use of formally-documented procedures, which encode the operational knowledge of the system as derived from system experts. Crew members use procedure documentation on the ground for training purposes and on-board space shuttle and space station to guide their activities. Investigators at JSC are developing a new representation for procedures that is content-based (as opposed to display-based). Instead of specifying how a procedure should look on the printed page, the content-based representation will identify the components of a procedure and (more importantly) how the components are related (e.g., how the activities within a procedure are sequenced; what resources need to be available for each activity). This approach will allow different sets of rules to be created for displaying procedures on a computer screen, on a hand-held personal digital assistant (PDA), verbally, or on a printed page, and will also allow intelligent reasoning processes to automatically interpret and use procedure definitions. During his NASA fellowship, Dr. Simpson examined how various industries represent procedures (also called business processes or workflows), in areas such as manufacturing, accounting, shipping, or customer service. A useful method for designing and evaluating workflow representation languages is by determining their ability to encode various workflow patterns, which depict abstract relationships between the components of a procedure removed from the context of a specific procedure or industry. Investigators have used this type of analysis to evaluate how well-suited existing workflow representation languages are for various industries based on the workflow patterns that commonly arise across industry-specific procedures. Based on this type of analysis, it is already clear that existing workflow representations capture discrete flow of control (i.e., when one activity should start and stop based on when other activities start and stop), but do not capture the flow of data, materials, resources or priorities. Existing workflow representation languages are also limited to representing sequences of discrete activities, and cannot encode procedures involving continuous flow of information or materials between activities.

Simpson, Richard C.↗

LieART 2.0 – A Mathematica application for Lie Algebras and Representation Theory

In this paper, we present LieART 2.0 which contains substantial extensions to the Mathematica application LieART (Lie Algebras and Representation Theory) for computations frequently encountered in Lie algebras and representation theory, such as tensor product decomposition and subalgebra branching of irreducible representations. The basic procedure is unchanged—it computes root systems of Lie algebras, weight systems and several other properties of irreducible representations, but new features and procedures have been included to allow the extensions to be seamless. The new version of LieART continues to be user friendly. New extended tables of properties, tensor products and branching rules of irreducible representations are included in the supplementary material for use without Mathematica software. LieART 2.0 now includes the branching rules to special subalgebras for all classical and exceptional Lie algebras up to and including rank 15.

97 MATHEMATICS AND COMPUTING↗

Quantum Algorithms for Representation-Theoretic Multiplicities

Kostka, Littlewood-Richardson, Plethysm, and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory, geometric complexity, and algebraic combinatorics. We give quantum algorithms for computing these coefficients whenever the ratio of dimensions of the representations is polynomial. We show that there is an efficient classical algorithm for computing the Kostka numbers under this restriction and conjecture the existence of an analogous algorithm for the Littlewood-Richardson coefficients. We argue why such classical algorithm does not straightforwardly work for the Plethysm and Kronecker coefficients and conjecture that our quantum algorithms lead to superpolynomial speedups. The conjecture about Kronecker coefficients was disproved by Panova [Polynomial time classical versus quantum algorithms for representation theoretic multiplicities, arXiv:2502.20253] with a classical algorithm which, if optimal, points to a 𝒪⁡(𝑛 4+2⁢𝑘 ) vs $\tilde{Ω}$⁡(𝑛 4⁢𝑘 2 +1 ) polynomial gap in quantum vs classical computational complexity for an integer parameter 𝑘.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enhancing occupant behavior representation for interoperability between building information modeling and building energy modeling

Building Performance Simulation (BPS) has been adopted as an essential tool for designing, operating, and retrofitting buildings to optimize energy efficiency throughout the building life cycle. The Green Building XML (gbXML) schema facilitates seamless data exchange between Building Information Modeling (BIM) and Building Energy Modeling (BEM) software tools. However, limited occupant behavior (OB) representation in BIM often leads to inconsistent and inaccurate energy simulation in BEM software. This paper presents 154 systematic enhancements to the existing occupant behavior XML (obXML) schema v1.3.4, initially developed for standardizing OB representation for BEM, to address existing limitations and improve interoperability with BIM models. The enhancements encompass improved integration with BIM models through extended building representations and system operations, expanded support for advanced OB models with additional environmental parameters and mathematical capabilities, and implementation of a standardized model documentation framework. To facilitate seamless data transformation between gbXML and obXML schemas, we developed a publicly available gb-obXML Schema Converter. Three case studies demonstrate the enhanced schema’s capabilities: representation of building information using a two-story office building model, documentation of a window operation behavior model, and validation of the schema converter’s functionality. The enhanced obXML schema v1.4 enables sophisticated modeling of occupant-building interactions while maintaining consistency with industry-standard BIM schemas. The standardized documentation framework facilitates reproducibility and knowledge sharing in the OB research community, while the schema converter automates the integration of building information into OB simulation workflows. These enhancements establish a foundation for more accurate building performance simulation by supporting sophisticated representation of occupant behavior within the BIM-to-BEM simulation workflows.

Chung, Jihoon↗

Importance of Engineered and Learned Molecular Representations in Predicting Organic Reactivity, Selectivity, and Chemical Properties

Machine-readable chemical structure representations are foundational in all attempts to harness machine learning for the prediction of reactivities, selectivities, and chemical properties directly from molecular structure. The featurization of discrete chemical structures into a continuous vector space is a critical phase undertaken before model selection, and the development of new ways to quantitatively encode molecules is an active area of research. Here, we highlight the application and suitability of different representations, from expert-guided “engineered” descriptors to automatically “learned” features, in different prediction tasks relevant to organic and organometallic chemistry, where differing amounts of training data are available. These tasks include statistical models of stereo- and enantioselectivity, thermochemistry, and kinetics developed using experimental and quantum chemical data. The use of expert-guided molecular descriptors provides an opportunity to incorporate chemical knowledge, domain expertise, and physical constraints into statistical modeling. In applications to stereoselective organic and organometallic catalysis, where data sets may be relatively small and 3D-geometries and conformations play an important role, mechanistically informed features can be used successfully to obtain predictive statistical models that are also chemically interpretable. We provide an overview of several recent applications of this approach to obtain quantitative models for reactivity and selectivity, where topological descriptors, quantum mechanical calculations of electronic and steric properties, along with conformational ensembles, all feature as essential ingredients of the molecular representations used. Alternatively, more flexible, general-purpose molecular representations such as attributed molecular graphs can be used with machine learning approaches to learn the complex relationship between a structure and prediction target. This approach has the potential to out-perform more traditional representation methods such as “hand-crafted” molecular descriptors, particularly as data set sizes grow. One area where this is particularly relevant is in the use of large sets of quantum mechanical data to train quantitative structure–property relationships. A general approach toward curating useful data sets and training highly accurate graph neural network models is discussed in the context of organic bond dissociation enthalpies, where this strategy outperforms regression using precomputed descriptors. Finally, we describe how graph neural network predictions can be incorporated into mechanistically informed statistical models of chemical reactivity and selectivity. Once trained, this approach avoids the expensive computational overhead associated with quantum mechanical calculations, while maintaining chemical interpretability. We illustrate examples for which fast predictions of bond dissociation enthalpy and of the identities of radicals formed through cleavage of a molecule’s weakest bond are used in simple physical models of site-selectivity and reactivity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Invariant Molecular Representations for Heterogeneous Catalysis

Catalyst screening is a critical step in the discovery and development of heterogeneous catalysts, which are vital for a wide range of chemical processes. In recent years, computational catalyst screening, primarily through density functional theory (DFT), has gained significant attention as a method for identifying promising catalysts. However, the computation of adsorption energies for all likely chemical intermediates present in complex surface chemistries is computationally intensive and costly due to the expensive nature of these calculations and the intrinsic idiosyncrasies of the methods or data sets used. This study introduces a novel machine learning (ML) method to learn adsorption energies from multiple DFT functionals by using invariant molecular representations (IMRs). To do this, we first extract molecular fingerprints for the reaction intermediates and later use a Siamese-neural-network-based training strategy to learn invariant molecular representations or the IMR across all available functionals. Our Siamese network-based representations demonstrate superior performance in predicting adsorption energies compared with other molecular representations. Notably, when considering mean absolute values of adsorption energies as 0.43 eV (PBE-D3), 0.46 eV (BEEF-vdW), 0.81 eV (RPBE), and 0.37 eV (scan+rVV10), our IMR method has achieved the lowest mean absolute errors (MAEs) of 0.18 0.10, 0.16, and 0.18 eV, respectively. These results emphasize the superior predictive capacity of our Siamese network-based representations. The empirical findings in this study illuminate the efficacy, robustness, and dependability of our proposed ML paradigm in predicting adsorption energies, specifically for propane dehydrogenation on a platinum catalyst surface.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Determining the N -Representability of a Reduced Density Matrix via Unitary Evolution and Stochastic Sampling

The N-representability problem consists in determining whether, for a given p-body matrix, there exists at least one N-body density matrix from which the p-body matrix can be obtained by contraction, that is, if the given matrix is a p-body reduced density matrix (p-RDM). The knowledge of all necessary and sufficient conditions for a p-body matrix to be N-representable allows the constrained minimization of a many-body Hamiltonian expectation value with respect to the p-body density matrix and, thus, the determination of its exact ground state. However, the number of constraints that complete the N-representability conditions grows exponentially with system size, and hence, the procedure quickly becomes intractable for practical applications. This work introduces a hybrid quantum-stochastic algorithm to effectively replace the N-representability conditions. The algorithm consists of applying to an initial N-body density matrix a sequence of unitary evolution operators constructed from a stochastic process that successively approaches the reduced state of the density matrix on a p-body subsystem, represented by a p-RDM, to a target p-body matrix, potentially a p-RDM. The generators of the evolution operators follow the well-known adaptive derivative-assembled pseudo-Trotter method (ADAPT), while the stochastic component is implemented by using a simulated annealing process. The resulting algorithm is independent of any underlying Hamiltonian, and it can be used to decide whether a given p-body matrix is N-representable, establishing a criterion to determine its quality and correcting it. We apply the proposed hybrid ADAPT algorithm to alleged reduced density matrices from a quantum chemistry electronic Hamiltonian, from the reduced Bardeen–Cooper–Schrieffer model with constant pairing, and from the Heisenberg XXZ spin model. In all cases, the proposed method behaves as expected for 1-RDMs and 2-RDMs, evolving the initial matrices toward different targets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Advancing molecular machine learning representations with stereoelectronics-infused molecular graphs

Molecular representation is a critical element in our understanding of the physical world and the foundation for modern molecular machine learning. Previous molecular machine learning models have used strings, fingerprints, global features and simple molecular graphs that are inherently information-sparse representations. However, as the complexity of prediction tasks increases, the molecular representation needs to encode higher fidelity information. This work introduces a new approach to infusing quantum-chemical-rich information into molecular graphs via stereoelectronic effects, enhancing expressivity and interpretability. Learning to predict the stereoelectronics-infused representation with a tailored double graph neural network workflow enables its application to any downstream molecular machine learning task without expensive quantum-chemical calculations. We show that the explicit addition of stereoelectronic information substantially improves the performance of message-passing two-dimensional machine learning models for molecular property prediction. We show that the learned representations trained on small molecules can accurately extrapolate to much larger molecular structures, yielding chemical insight into orbital interactions for previously intractable systems, such as entire proteins, opening new avenues of molecular design. Finally, we have developed a web application (simg.cheme.cmu.edu) where users can rapidly explore stereoelectronic information for their own molecular systems.

Boiko, Daniil A↗

Windowed multipole representation of R -matrix cross sections

Nuclear cross sections are basic inputs to any nuclear computation. Campaigns of experiments are fitted with the parametric R-matrix model of quantum nuclear interactions, and the resulting cross sections are documented—both pointwise and as resonance parameters (with uncertainties)—in standard evaluated nuclear data libraries (ENDF, JEFF, BROND, JENDL, CENDL, TENDL): these constitute our common knowledge of fundamental low-energy nuclear cross sections. In the past decade, a collaborative effort has been deployed to establish a new nuclear cross-section library format—the Windowed Multipole Library—with the goal of considerably reducing the computational cost of cross-section calculations in nuclear transport simulations. This work lays the theoretical foundations underpinning these efforts. From general R-matrix scattering theory, we derive the windowed multipole representation of nuclear cross sections. Though physically and mathematically equivalent to R-matrix cross sections, the windowed multipole representation is particularly well suited for subsequent temperature treatment of angle-integrated cross sections, in particular Doppler broadening, which is the averaging of cross sections over the thermal motion of the target atoms. Doppler broadening is of critical importance in neutron transport applications, as it ensures the stability of many nuclear reactors (negative thermal reactivity). Yet, Doppler broadening of nuclear cross sections has been a considerable bottleneck for nuclear transport computations, often requiring memory-costly pretabulations. We show that the windowed multipole representation can perform accurate Doppler broadening analytically (up to the first reaction threshold), from which we derive cross-section temperature derivatives to any order—all computable on the fly (without precalculations stored in memory). Furthermore, we here establish a way of converting the R-matrix resonance parameters uncertainty (covariance matrices) into windowed multipole parameters uncertainty. We show that generating stochastic nuclear cross sections by sampling from the resulting windowed multipole covariance matrix can reproduce the cross-section uncertainty in the original nuclear data file. The windowed multipole representation is therefore a novel nuclear physics formalism able to generate Doppler broadened stochastic nuclear cross sections on the fly, unlocking breakthrough computational gains for nuclear computations. Through this foundational paper, we hope to make the windowed multipole representation accessible, reproducible, and usable for the nuclear physics community, as well as provide the theoretical basis for future research on expanding its capabilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Numerical and Visual Representations of Uncertainty Lead to Different Patterns of Decision Making

Although visualizations are a useful tool for helping people to understand information, they can also have unintended effects on human cognition. This is especially true for uncertain information, which is difficult for people to understand. Prior work has found that different methods of visualizing uncertain information can produce different patterns of decision making from users. However, uncertainty can also be represented via text or numerical information, and few studies have systematically compared these types of representations to visualizations of uncertainty. We present two experiments that compared visual representations of risk (icon arrays) to numerical representations (natural frequencies) in a wildfire evacuation task. Like prior studies, we found that different types of visual cues led to different patterns of decision making. In addition, our comparison of visual and numerical representations of risk found that people were more likely to evacuate when they saw visualizations than when they saw numerical representations. These experiments reinforce the idea that design choices are not neutral: seemingly minor differences in how information is represented can have important impacts on human risk perception and decision making.

97 MATHEMATICS AND COMPUTING↗

Improving and testing machine learning methods for benchmarking soil carbon dynamics representation of land surface models

Representation of soil organic carbon (SOC) dynamics in Earth system models (ESMs) is a key source of uncertainty in predicting carbon climate feedbacks. The magnitude of this uncertainty can be reduced by accurate representation of environmental controllers of SOC stocks in ESMs. In this study, we used data of environmental factors, field SOC observations, ESM projections and machine learning approaches to identify dominant environmental controllers of SOC stocks and derive functional relationships between environmental factors and SOC stocks. Our derived functional relationships predicted SOC stocks with similar accuracy as the machine learning approach. We used the derived relationships to benchmark the coupled model intercomparison project phase six ESM representation of SOC stocks. We found divergent environmental control representation in ESMs in comparison to field observations. Representation of SOC in ESMs can be improved by including additional environmental factors and representing their functional relationships with SOC consistent with observations.

54 ENVIRONMENTAL SCIENCES↗

On the Representation of Hyporheic Exchange in Models for Reactive Transport in Stream and River Corridors

Efforts to include more detailed representations of biogeochemical processes in basin-scale water quality simulation tools face the challenge of how to tractably represent mass exchange between the flowing channels of streams and rivers and biogeochemical hotspots in the hyporheic zones. Multiscale models that use relatively coarse representations of the channel network with subgrid models for mass exchange and reactions in the hyporheic zone have started to emerge to address that challenge. Two such multiscale models are considered here, one based on a stochastic Lagrangian travel time representation of advective pumping and one on multirate diffusive exchange. The two models are formally equivalent to well-established integrodifferential representations for transport of non-reacting tracers in steady stream flow, which have been very successful in reproducing stream tracer tests. Despite that equivalence, the two models are based on very different model structures and produce significantly different results in reactive transport. In a simple denitrification example, denitrification is two to three times greater for the advection-based model because the multirate diffusive model has direct connections between the stream channel and transient storage zones and an assumption of mixing in the transient storage zones that prevent oxygen levels from dropping to the point where denitrification can progress uninhibited. By contrast, the advection-based model produces distinct redox zonation, allowing for denitrification to proceed uninhibited on part of the hyporheic flowpaths. These results demonstrate that conservative tracer tests alone are inadequate for constraining representation of mass transfer in models for reactive transport in streams and rivers.

54 ENVIRONMENTAL SCIENCES↗

Representations of the language recognition problem for a theorem prover

Two representations of the language recognition problem for a theorem prover in first order logic are presented and contrasted. One of the representations is based on the familiar method of generating sentential forms of the language, and the other is based on the Cocke parsing algorithm. An augmented theorem prover is described which permits recognition of recursive languages. The state-transformation method developed by Cordell Green to construct problem solutions in resolution-based systems can be used to obtain the parse tree. In particular, the end-order traversal of the parse tree is derived in one of the representations. An inference system, termed the cycle inference system, is defined which makes it possible for the theorem prover to model the method on which the representation is based. The general applicability of the cycle inference system to state space problems is discussed. Given an unsatisfiable set S, where each clause has at most one positive literal, it is shown that there exists an input proof. The clauses for the two representations satisfy these conditions, as do many state space problems.

Minker, J.↗

Volumetric representation for object model acquisition

This paper describes a volumetric representation that has been specified for use in a system that derives object models from a sequence of images with viewpoint specifications. This volumetric representation is an enumerative structure referred to here as a volume segment representation. The model acquisition system was designed to form an initial object approximation, then refine that approximation as subsequent information is obtained. The refinement process requires a readily modifiable object representation, while the overall goal of the system demands a representation descriptive of surface detail. The volume segment structure provides both of those capabilities.

Martin, W. N.↗

A Unified Representation Scheme for Solid Geometric Objects Using B-splines (extended Abstract)

A geometric representation scheme called the B-spline cylinder, which consists of interpolation between pairs of uniform periodic cubic B-spline curves is discussed. This approach carries a number of interesting implications. For one, a single relatively simple database schema can be used to represent a reasonably large class of objects, since the spline representation is flexible enough to allow a large domain of representable objects at very little cost in data complexity. The model is thus very storage-efficient. A second feature of such a system is that it reduces to one the number of routines which the system must support to perform a given operation on objects. Third, the scheme enables easy conversion to and from other representations. The formal definition of the cylinder entity is given. In the geometric properties of the entity are explored and several operations on such objects are defined. Some general purpose criteria for evaluating any geometric representation scheme are introduced and the B-spline cylinder scheme according to these criteria is evaluated.

Bahler, D.↗

C.A.D. representation of ternary and quaternary phase diagrams

This work is concerned with the utilization of C.A.D. solid-modeling software for the computer representation of three-dimensional phase diagrams. The work was undertaken in two parts. First, the C.A.D. software (I-DEAS, by Structural Dynamics Research Corp.) was integrated with a variety of auxiliary Fortran 77 and I-DEAS language programs which were written specifically for the purpose of phase diagram representation. The capabilities of the resulting suite of software for three-dimensional phase diagram representation were developed and illustrated by the construction, display and manipulation of solid-model phase diagrams for a hypothetical quaternary eutectic system. The results of this work are discussed in some detail in the attached publication ('Solid-modeling: a C.A.D. Alternative for Three-dimensional Phase Diagram Representation'). Such a technique is of general applicability, having utility in both research and education. Secondly, using the C.A.D. technique, data from the literature (gleaned from some 70 separate publications), which represent experimentally determined phase boundaries, were combined to form solid-model representations of the CMS2-M2S-S ternary space diagram and the CMS2-CAS2-M2S-S quaternary liquidus projection (where C=CaO, M=MgO, A=Al2O3, and S=SiO2). These diagrams were utilized in a concurrent study of solidification in the CMAS system.

Delao, James D.↗

A Knowledge-Based Representation Scheme for Environmental Science Models

One of the primary methods available for studying environmental phenomena is the construction and analysis of computational models. We have been studying how artificial intelligence techniques can be applied to assist in the development and use of environmental science models within the context of NASA-sponsored activities. We have identified several high-utility areas as potential targets for research and development: model development; data visualization, analysis, and interpretation; model publishing and reuse, training and education; and framing, posing, and answering questions. Central to progress on any of the above areas is a representation for environmental models that contains a great deal more information than is present in a traditional software implementation. In particular, a traditional software implementation is devoid of any semantic information that connects the code with the environmental context that forms the background for the modeling activity. Before we can build AI systems to assist in model development and usage, we must develop a representation for environmental models that adequately describes a model's semantics and explicitly represents the relationship between the code and the modeling task at hand. We have developed one such representation in conjunction with our work on the SIGMA (Scientists' Intelligent Graphical Modeling Assistant) environment. The key feature of the representation is that it provides a semantic grounding for the symbols in a set of modeling equations by linking those symbols to an explicit representation of the underlying environmental scenario.

Keller, Richard M.↗