Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Application Abstraction”

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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
NASA NTRS2011

Graph Theory Roots of Spatial Operators for Kinematics and Dynamics

Spatial operators have been used to analyze the dynamics of robotic multibody systems and to develop novel computational dynamics algorithms. Mass matrix factorization, inversion, diagonalization, and linearization are among several new insights obtained using such operators. While initially developed for serial rigid body manipulators, the spatial operators and the related mathematical analysis have been shown to extend very broadly including to tree and closed topology systems, to systems with flexible joints, links, etc. This work uses concepts from graph theory to explore the mathematical foundations of spatial operators. The goal is to study and characterize the properties of the spatial operators at an abstract level so that they can be applied to a broader range of dynamics problems. The rich mathematical properties of the kinematics and dynamics of robotic multibody systems has been an area of strong research interest for several decades. These properties are important to understand the inherent physical behavior of systems, for stability and control analysis, for the development of computational algorithms, and for model development of faithful models. Recurring patterns in spatial operators leads one to ask the more abstract question about the properties and characteristics of spatial operators that make them so broadly applicable. The idea is to step back from the specific application systems, and understand more deeply the generic requirements and properties of spatial operators, so that the insights and techniques are readily available across different kinematics and dynamics problems. In this work, techniques from graph theory were used to explore the abstract basis for the spatial operators. The close relationship between the mathematical properties of adjacency matrices for graphs and those of spatial operators and their kernels were established. The connections hold across very basic requirements on the system topology, the nature of the component bodies, the indexing schemes, etc. The relationship of the underlying structure is intimately connected with efficient, recursive computational algorithms. The results provide the foundational groundwork for a much broader look at the key problems in kinematics and dynamics. The properties of general graphs and trees of nodes and edge were examined, as well as the properties of adjacency matrices that are used to describe graph connectivity. The nilpotency property of such matrices for directed trees was reviewed, and the adjacency matrices were generalized to the notion of block weighted adjacency matrices that support block matrix elements. This leads us to the development of the notion of Spatial Kernel Operator SKO kernels. These kernels provide the basis for the development of SKO resolvent operators.

Jain, Abhinandan↗
NASA NTRS1971

Heat pipe technology: A bibliography with abstracts

The annual supplement on heat pipe technology for 1971 is presented. The document contains 101 references with abstracts and 47 patents. The subjects discussed are: (1) heat pipe applications, (2) heat pipe theory, (3) design, development, and fabrication of heat pipes, (4) testing and operation, (5) subject and author index, and (6) heat pipe related patents.

Source record↗
NASA NTRS1992

Space life sciences perspectives for Space Station Freedom

It is now generally acknowledged that the life science discipline will be the primary beneficiary of Space Station Freedom. The unique facility will permit advances in understanding the consequences of long duration exposure to weightlessness and evaluation of the effectiveness of countermeasures. It will also provide an unprecedented opportunity for basic gravitational biology, on plants and animals as well as human subjects. The major advantages of SSF are the long duration exposure and the availability of sufficient crew to serve as subjects and operators. In order to fully benefit from the SSF, life sciences will need both sufficient crew time and communication abilities. Unlike many physical science experiments, the life science investigations are largely exploratory, and frequently bring unexpected results and opportunities for study of newly discovered phenomena. They are typically crew-time intensive, and require a high degree of specialized training to be able to react in real time to various unexpected problems or potentially exciting findings. Because of the long duration tours and the large number of experiments, it will be more difficult than with Spacelab to maintain astronaut proficiency on all experiments. This places more of a burden on adequate communication and data links to the ground, and suggests the use of AI expert system technology to assist in astronaut management of the experiment. Typical life science experiments, including those flown on Spacelab Life Sciences 1, will be described from the point of view of the demands on the astronaut. A new expert system, 'PI in a Box,' will be introduced for SLS-2, and its applicability to other SSF experiments discussed. (This paper consists on an abstract and ten viewgraphs.)

Young, Laurence R.↗
NASA NTRS1986

Some design constraints required for the use of generic software in embedded systems: Packages which manage abstract dynamic structures without the need for garbage collection

The embedded systems running real-time applications, for which Ada was designed, require their own mechanisms for the management of dynamically allocated storage. There is a need for packages which manage their own internalo structures to control their deallocation as well, due to the performance implications of garbage collection by the KAPSE. This places a requirement upon the design of generic packages which manage generically structured private types built-up from application-defined input types. These kinds of generic packages should figure greatly in the development of lower-level software such as operating systems, schedulers, controllers, and device driver; and will manage structures such as queues, stacks, link-lists, files, and binary multary (hierarchical) trees. Controlled to prevent inadvertent de-designation of dynamic elements, which is implicit in the assignment operation A study was made of the use of limited private type, in solving the problems of controlling the accumulation of anonymous, detached objects in running systems. The use of deallocator prodecures for run-down of application-defined input types during deallocation operations during satellites.

Johnson, Charles S.↗
NASA NTRS2005

Reusable and Extensible High Level Data Distributions

This paper presents a reusable design of a data distribution framework for data parallel high performance applications. We are implementing the design in the context of the Chapel high productivity programming language. Distributions in Chapel are a means to express locality in systems composed of large numbers of processor and memory components connected by a network. Since distributions have a great effect on,the performance of applications, it is important that the distribution strategy can be chosen by a user. At the same time, high productivity concerns require that the user is shielded from error-prone, tedious details such as communication and synchronization. We propose an approach to distributions that enables the user to refine a language-provided distribution type and adjust it to optimize the performance of the application. Additionally, we conceal from the user low-level communication and synchronization details to increase productivity. To emphasize the generality of our distribution machinery, we present its abstract design in the form of a design pattern, which is independent of a concrete implementation. To illustrate the applicability of our distribution framework design, we outline the implementation of data distributions in terms of the Chapel language.

patterns↗
NASA NTRS2004

Impact of Operating Context on the Use of Structure in Air Traffic Controller Cognitive Processes

This paper investigates the influence of structure on air traffic controllers cognitive processes in the TRACON, En Route, and Oceanic environments. Radar data and voice command analyses were conducted to support hypotheses generated through observations and interviews conducted at the various facilities. Three general types of structure-based abstractions (standard flows, groupings, and critical points) have been identified as being used in each context, though the details of their application varied in accordance with the constraints of the particular operational environment. Projection emerged as a key cognitive process aided by the structure-based abstractions, and there appears to be a significant difference between how time-based versus spatial-based projection is performed by controllers. It is recommended that consideration be given to the value provided by the structure-based abstractions to the controller as well as to maintain consistency between the type (time or spatial) of information support provided to the controller.

Davison, Hayley J.↗
NASA NTRS2004

Software for Checking Statecharts

HiVy is a software tool set that enables verification through model checking of designs represented as finite-state machines or statecharts. HiVy provides automated translation of (1) statecharts created by use of the MathWorks Stateflow program to (2) Promela, the input language of the Spin model checker, which can then be used to verify, or trace logical errors in, distributed software systems. HiVy can operate directly on Stateflow models, or its abstract syntax of hierarchical sequential automata (HSA) can be used independently as an intermediate format for translation to Promela. In a typical design application, HiVy parses and reformats Stateflow model file data using the programs SfParse and sf2hsa, respectively. If the parsing effort is successful, an abstract syntax tree is delivered into a file named with the extension .hsa. If the design comprises several model files, they may be merged into one .hsa file before translation into Promela. Stateflow scope is preserved, and name clashes are avoided in the merge process. The HiVy program hsa2pr translates the model from the intermediate HSA format into Promela. Additionally, HiVy provides through translation a list of all statechart model propositions that are the means for formalizing linear temporal logic (LTL) properties about the model for Spin verification.

Pingree, Paula↗