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.

SourceResearch connectionFrom yearThrough year

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

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

NASA NTRS1989

Precedence relationship representations of mechanical assembly sequences

Two types of precedence relationship representations for mechanical assembly sequences are presented: precedence relationships between the establishment of one connection between two parts and the establishment of another connection, and precedence relationships between the establishment of one connection and states of the assembly process. Precedence relationship representations have the advantage of being very compact. The problem with these representations was how to guarantee their correctness and completeness. Two theorems are presented each of which leads to the generation of one type of precedence relationship representation guaranteeing its correctness and completeness for a class of assemblies.

Homendemello, L. S.↗

NASA NTRS1990

On-board ephemeris representation for Topex/Poseidon

The Topex/Poseidon satellite requires real-time on-board knowledge of the satellite and TDRS ephemeris for attitude determination and control and High-Gain Antenna (HGA) pointing. The ephemeris representation concept for the MMS (Multimission Modular Spacecraft) satellites has shown that compressing the predicted ephemeris in a Fourier Power Series (FPS) before uplinking in conjunction with the On-Board Computer (OBC) ephemeris reconstruction algorithms is an efficient technique for ephemeris representation. As an MMS-based satellite, Topex/Poseidon has inherited the Landsat ephemeris representation concept including a daily FPS upload. This paper presents the Topex/Poseidon concept, analysis, and results including the conclusion that the ephemeris representation duration could be extended to 10 days or more and convenient weekly uploading is adopted without an increase in OBC memory requirements.

Salama, Ahmed H.↗

NASA NTRS1994

A rapid-pressure correlation representation consistent with the Taylor-Proudman theorem materially-frame-indifferent in the 2D limit

A nonlinear representation for the rapid-pressure correlation appearing in the Reynolds stress equations, consistent with the Taylor-Proudman theorem, is presented. The representation insures that the modeled second-order equations are frame-invariant with respect to rotation when the flow is two-dimensional in planes perpendicular to the axis of rotation. The representation satisfies realizability in a new way: a special ansatz is used to obtain analytically, the values of coefficients valid away from the realizability limit: the model coefficients are functions of the state of the turbulence that are valid for all states of the mechanical turbulence attaining their constant limiting values only when the limit state is achieved. Utilization of all the mathematical constraints are not enough to specify all the coefficients in the model. The unspecified coefficients appear as free parameters which are used to insure that the representation is asymptotically consistent with the known equilibrium states of a homogeneous sheared turbulence. This is done by insuring that the modeled evolution equations have the same fixed points as those obtained from computer and laboratory experiments for the homogeneous shear. Results of computations of the homogeneous shear, with and without rotation, and with stabilizing and destabilizing curvature, are shown. Results are consistently better, in a wide class of flows which the model not been calibrated, than those obtained with other nonlinear models.

Ristorcelli, J. R.↗

NASA NTRS1990

Implementation of a frame-based representation in CLIPS

Knowledge representation is one of the major concerns in expert systems. The representation of domain-specific knowledge should agree with the nature of the domain entities and their use in the real world. For example, architectural applications deal with objects and entities such as spaces, walls, and windows. A natural way of representing these architectural entities is provided by frames. This research explores the potential of using the expert system shell CLIPS, developed by NASA, to implement a frame-based representation that can accommodate architectural knowledge. These frames are similar but quite different from the 'template' construct in version 4.3 of CLIPS. Templates support only the grouping of related information and the assignment of default values to template fields. In addition to these features frames provide other capabilities including definition of classes, inheritance between classes and subclasses, relation of objects of different classes with 'has-a', association of methods (demons) of different types (standard and user-defined) to fields (slots), and creation of new fields at run-time. This frame-based representation is implemented completely in CLIPS. No change to the source code is necessary.

Assal, Hisham↗

NASA NTRS2004

Improving Evolvability through Generative Representations

One of the main limitations of computer automated design systems is the representation used for encoding designs. Using computer programs as an analogy, representations can be thought of as having the properties of combination, control-flow and abstraction. Generative representations are those which have the ability to reuse elements in an encoding through either iteration, a form of control-flow, or abstraction. Here we argue that generative representations improve the evolvability of designs by capturing design dependencies in a way that makes them easier to change, and we support this with examples from two design substrates.

Hornby, Gregory S.↗

NASA NTRS2008

A Data Type for Efficient Representation of Other Data Types

A self-organizing, monomorphic data type denoted a sequence has been conceived to address certain concerns that arise in programming parallel computers. A sequence in the present sense can be regarded abstractly as a vector, set, bag, queue, or other construct. Heretofore, in programming a parallel computer, it has been necessary for the programmer to state explicitly, at the outset, what parts of the program and the underlying data structures must be represented in parallel form. Not only is this requirement not optimal from the perspective of implementation; it entails an additional requirement that the programmer have intimate understanding of the underlying parallel structure. The present sequence data type overcomes both the implementation and parallel structure obstacles. In so doing, the sequence data type provides unified means by which the programmer can represent a data structure for natural and automatic decomposition to a parallel computing architecture. Sequences exhibit the behavioral and structural characteristics of vectors, but the underlying representations are automatically synthesized from combinations of programmers advice and execution use metrics. Sequences can vary bidirectionally between sparseness and density, making them excellent choices for many kinds of algorithms. The novelty and benefit of this behavior lies in the fact that it can relieve programmers of the details of implementations. The creation of a sequence enables decoupling of a conceptual representation from an implementation. The underlying representation of a sequence is a hybrid of representations composed of vectors, linked lists, connected blocks, and hash tables. The internal structure of a sequence can automatically change from time to time on the basis of how it is being used. Those portions of a sequence where elements have not been added or removed can be as efficient as vectors. As elements are inserted and removed in a given portion, then different methods are utilized to provide both an access and memory strategy that is optimized for that portion and the use to which it is put.

James, Mark↗

NASA NTRS2011

Monthly Representations of Mid-Tropospheric Carbon Dioxide from the Atmospheric Infrared Sounder

The Atmospheric Infrared Sounder (AIRS) on NASA's Earth Observing System Aqua spacecraft was launched in May of 2002 and acquires hyperspectral infrared spectra used to generate a wide range of atmospheric products including temperature, water vapor, and trace gas species including carbon dioxide. Here we present monthly representations of global concentrations of mid-tropospheric carbon dioxide produced from 8 years of data obtained by AIRS between the years of 2003 and 2010. We define them as "representations" rather than "climatologies" to reflect that the files are produced over a relatively short time period and represent summaries of the Level 3 data. Finally, they have not yet been independently validated. The representations have a horizontal resolution of 2.0 deg x 2.5 deg (Latitude x Longitude) and faithfully reproduce the original 8 years of monthly L3 CO2 concentrations with a standard deviation of 1.48 ppm and less than 2% outliers. The representations are intended for use in studies of the global general circulation of CO2 and identification of anomalies in CO2 typically associated with atmospheric transport. The seasonal variability and trend found in the AIRS CO2 data are discussed.

Carbon Dioxide↗

NASA NTRS2022

Improved representation of agricultural land use and crop management for large-scale hydrological impact simulation in Africa using SWAT+

To date, most regional and global hydrological models either ignore the representation of cropland or consider crop cultivation in a simplistic way or in abstract terms without any management practices. Yet, the water balance of cultivated areas is strongly influenced by applied management practices (e.g. planting, irrigation, fertilization, and harvesting). The SWAT+ (Soil and Water Assessment Tool) model represents agricultural land by default in a generic way, where the start of the cropping season is driven by accumulated heat units. However, this approach does not work for tropical and subtropical regions such as sub-Saharan Africa, where crop growth dynamics are mainly controlled by rainfall rather than temperature. In this study, we present an approach on how to incorporate crop phenology using decision tables and global datasets of rainfed and irrigated croplands with the associated cropping calendar and fertilizer applications in a regional SWAT+ model for northeastern Africa. We evaluate the influence of the crop phenology representation on simulations of leaf area index (LAI) and evapotranspiration (ET) using LAI remote sensing data from Copernicus Global Land Service (CGLS) and WaPOR (Water Productivity through Open access of Remotely sensed derived data) ET data, respectively. Results show that a representation of crop phenology using global datasets leads to improved temporal patterns of LAI and ET simulations, especially for regions with a single cropping cycle. However, for regions with multiple cropping seasons, global phenology datasets need to be complemented with local data or remote sensing data to capture additional cropping seasons. In addition, the improvement of the cropping season also helps to improve soil erosion estimates, as the timing of crop cover controls erosion rates in the model. With more realistic growing seasons, soil erosion is largely reduced for most agricultural hydrologic response units (HRUs), which can be considered as a move towards substantial improvements over previous estimates. We conclude that regional and global hydrological models can benefit from improved representations of crop phenology and the associated management practices. Future work regarding the incorporation of multiple cropping seasons in global phenology data is needed to better represent cropping cycles in areas where they occur using regional to global hydrological models.

crop phenology↗

DOE OSTI2022

Conversion of Resonance Parameters Between Wigner-Eisenbud R-matrix and Transition Matrix Pole Representation

The goal of this research is to develop a numerical code for translation between the current standard, Wigner-Eisenbud R-matrix parameters and a novel pole-representation of cross sections. The method follows Ducru et al. and constructs the conversion between these parametric representations of the scattering and reaction data. This pole representation, which expresses cross sections as a sum of simple poles (and their attendant residues), is examined in the context of the advantages provided by this compact, computationally efficient representation. These advantages include the ability to doppler broaden cross sections on-the-fly as well as a lower memory footprint when generating cross sections, an attractive feature to those interested in parallel GPU based Monte Carlo. Some conversion methods between R-matrix parameters and S-matrix poles have relied on curve fitting techniques. It is unknown weather these numerical methods necessarily preserve certain underlying physics properties of the standard R-matrix cross section model (such as unitarity). The direct conversion studied here aim to preserve such properties. This knowledge is of interest for future work into the generation of resonance parameter sensitivities.

CLUTCH↗

DOE OSTI2023

System and method associated with expedient detection and reconstruction of cyber events in a compact scenario representation using provenance tags and customizable policy

A system associated with detecting a cyber-attack and reconstructing events associated with a cyber-attack campaign, is disclosed. The system performs various operations that include receiving an audit data stream associated with cyber events. The system identifies trustworthiness values in a portion of data associated with the cyber events and assigns provenance tags to the portion of the data based on the identified trustworthiness values. An initial visual representation is generated based on the assigned provenance tags to the portion of the data. The initial visual representation is condensed based on a backward traversal of the initial visual representation in identifying a shortest path from a suspect node to an entry point node. A scenario visual representation is generated that specifies nodes most relevant to the cyber events associated with the cyber-attack based on the identified shortest path.A corresponding method and computer-readable medium are also disclosed.

Source record↗

DOE OSTI2021

Compact representations of structured BFGS matrices

For general large-scale optimization problems compact representations exist in which recursive quasi-Newton update formulas are represented as compact matrix factorizations. For problems in which the objective function contains additional structure, recent structured quasi-Newton methods exploit available second-derivative information and approximate unavailable second derivatives. Here, this article develops the compact representations of two structured Broyden-Fletcher-Goldfarb-Shanno update formulas. The compact representations enable efficient limited memory and initialization strategies. Two limited memory line search algorithms are described for which extensive numerical results demonstrate the efficacy of the algorithms, including comparisons to IPOPT on large machine learning problems, and to L-BFGS on a real world large scale ptychographic imaging application.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Grassmannian Shape Representations for Aerodynamic Applications: Preprint

Airfoil shape design is a classical problem in engineering, science, and manufacturing. Our motivation is to combine principled physics-based considerations for the shape design problem with modern computational techniques informed by a data-driven approach. Traditional analyses of airfoil shapes emphasize a flow-based sensitivity to deformations which can be represented generally by affine transformations (rotation, scaling, shearing, shifting). We present a novel representation of shapes which decouples affine-style deformations from a rich set of data-driven deformations over a submanifold of the Grassmannian. The Grassmannian representation, informed by a database of physically relevant airfoils, offers (i) a rich set of novel 2D airfoil deformations not previously captured in the data, (ii) improved low-dimensional parameter domain for inferential statistics, and (iii) consistent 3D blade representation and perturbation over a sequence of nominal shapes.

blade representation↗

DOE OSTI2022

Grassmannian Shape Representations for Aerodynamic Applications

blade representation↗

DOE OSTI2021

Insights on the continuous representations of piecewise-smooth nonlinear systems: limits of applicability and effectiveness

Dynamical systems subject to intermittent contact are often modeled with piecewise-smooth contact forces. However, the discontinuous nature of the contact can cause inaccuracies in numerical results or failure in numerical solvers. Representing the piecewise contact force with a continuous and smooth function can mitigate these problems, but not all continuous representations may be appropriate for this use. Here, five representations used by previous researchers (polynomial, rational polynomial, hyperbolic tangent, arctangent, and logarithm-arctangent functions) are studied to determine which ones most accurately capture nonlinear behaviors including super- and subharmonic resonances, multiple solutions, and chaos. The test case is a single-DOF forced Duffing oscillator with freeplay nonlinearity, solved using direct time integration. This work intends to expand on past studies by determining the limits of applicability for each representation and what numerical problems may occur.

42 ENGINEERING↗

DOE OSTI2021

A series representation of the discrete fractional Laplace operator of arbitrary order

Although fractional powers of non-negative operators have received much attention in recent years, there is still little known about their behavior if real-valued exponents are greater than one. In this article, we define and study the discrete fractional Laplace operator of arbitrary real-valued positive order. Here a series representation of the discrete fractional Laplace operator for positive non-integer powers is developed. Its convergence to a series representation of a known case of positive integer powers is proven as the power tends to the integer value. Furthermore, we show that the new representation for arbitrary real-valued positive powers of the discrete Laplace operator is consistent with existing theoretical results.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Generalized Circuit Representation for a Synchronous Machine

In this letter, a generalized circuit representation for a synchronous machine is presented. This circuit represents voltage and current relationship and can be used for dynamic and harmonic analysis. A distinct feature of the circuit is the use of Laplace transform variable s , which simplifies both calculus and frame conversion. Two derivation approaches are presented. Here, the first approach starts from a steady-state circuit representation, while the second approach starts from the dq-frame dynamic model of a synchronous generator. Both arrive at the same representation.

42 ENGINEERING↗

DOE OSTI2023

Representations of Materials for Machine Learning

High-throughput data generation methods and machine learning (ML) algorithms have given rise to a new era of computational materials science by learning the relations between composition, structure, and properties and by exploiting such relations for design. However, to build these connections, materials data must be translated into a numerical form, called a representation, that can be processed by an ML model. Data sets in materials science vary in format (ranging from images to spectra), size, and fidelity. Predictive models vary in scope and properties of interest. Here, we review context-dependent strategies for constructing representations that enable the use of materials as inputs or outputs for ML models. Furthermore, we discuss how modern ML techniques can learn representations from data and transfer chemical and physical information between tasks. Finally, we outline high-impact questions that have not been fully resolved and thus require further investigation.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Identifying intragenic functional modules of genomic variations associated with cancer phenotypes by learning representation of association networks

Background Genome-wide Association Studies (GWAS) aims to uncover the link between genomic variation and phenotype. They have been actively applied in cancer biology to investigate associations between variations and cancer phenotypes, such as susceptibility to certain types of cancer and predisposed responsiveness to specific treatments. Since GWAS primarily focuses on finding associations between individual genomic variations and cancer phenotypes, there are limitations in understanding the mechanisms by which cancer phenotypes are cooperatively affected by more than one genomic variation. Results This paper proposes a network representation learning approach to learn associations among genomic variations using a prostate cancer cohort. The learned associations are encoded into representations that can be used to identify functional modules of genomic variations within genes associated with early- and late-onset prostate cancer. The proposed method was applied to a prostate cancer cohort provided by the Veterans Administration’s Million Veteran Program to identify candidates for functional modules associated with early-onset prostate cancer. The cohort included 33,159 prostate cancer patients, 3181 early-onset patients, and 29,978 late-onset patients. The reproducibility of the proposed approach clearly showed that the proposed approach can improve the model performance in terms of robustness. Conclusions To our knowledge, this is the first attempt to use a network representation learning approach to learn associations among genomic variations within genes. Associations learned in this way can lead to an understanding of the underlying mechanisms of how genomic variations cooperatively affect each cancer phenotype. This method can reveal unknown knowledge in the field of cancer biology and can be utilized to design more advanced cancer-targeted therapies.

60 APPLIED LIFE SCIENCES↗