Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “annotations”

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 451 records · Page 25

Automatic Data Distribution for CFD Applications on Structured Grids

Development of HPF versions of NPB and ARC3D showed that HPF has potential to be a high level language for parallelization of CFD applications. The use of HPF requires an intimate knowledge of the applications and a detailed analysis of data affinity, data movement and data granularity. Since HPF hides data movement from the user even with this knowledge it is easy to overlook pieces of the code causing low performance of the application. In order to simplify and accelerate the task of developing HPF versions of existing CFD applications we have designed and partially implemented ADAPT (Automatic Data Distribution and Placement Tool). The ADAPT analyzes a CFD application working on a single structured grid and generates HPF TEMPLATE, (RE)DISTRIBUTION, ALIGNMENT and INDEPENDENT directives. The directives can be generated on the nest level, subroutine level, application level or inter application level. ADAPT is designed to annotate existing CFD FORTRAN application performing computations on single or multiple grids. On each grid the application can considered as a sequence of operators each applied to a set of variables defined in a particular grid domain. The operators can be classified as implicit, having data dependences, and explicit, without data dependences. In order to parallelize an explicit operator it is sufficient to create a template for the domain of the operator, align arrays used in the operator with the template, distribute the template, and declare the loops over the distributed dimensions as INDEPENDENT. In order to parallelize an implicit operator, the distribution of the operator's domain should be consistent with the operator's dependences. Any dependence between sections distributed on different processors would preclude parallelization if compiler does not have an ability to pipeline computations. If a data distribution is "orthogonal" to the dependences of an implicit operator then the loop which implements the operator can be declared as INDEPENDENT.

Frumkin, Michael↗

AutoBayes/CC: Combining Program Synthesis with Automatic Code Certification: System Description

Code certification is a lightweight approach to formally demonstrate software quality. It concentrates on aspects of software quality that can be defined and formalized via properties, e.g., operator safety or memory safety. Its basic idea is to require code producers to provide formal proofs that their code satisfies these quality properties. The proofs serve as certificates which can be checked independently, by the code consumer or by certification authorities, e.g., the FAA. It is the idea underlying such approaches as proof-carrying code [6]. Code certification can be viewed as a more practical version of traditional Hoare-style program verification. The properties to be verified are fairly simple and regular so that it is often possible to use an automated theorem prover to automatically discharge all emerging proof obligations. Usually, however, the programmer must still splice auxiliary annotations (e.g., loop invariants) into the program to facilitate the proofs. For complex properties or larger programs this quickly becomes the limiting factor for the applicability of current certification approaches.

Whalen, Michael↗

Two Paths from the Same Place: Task Driven and Human Centered Evolution of a Group Information Surface

This is the tale of two different implementations of a collaborative information tool, that started from the same design source. The Blueboard, developed at IBM Research, is a tool for groups to use in exchanging information in a lightweight, informal collaborative way. It began as a large display surface for walk-by use in a corporate setting and has evolved in response to task demands and user needs. At NASA, the MERBoard is being designed to support surface operations for the upcoming Mars Exploration Rover Missions. The MERBoard is a tool that was inspired by the Blueboard design, extending this design to support the collaboration requirements for viewing, annotating, linking and distributing information for the science and engineering teams that will operate two rovers on the surface of Mars. The ways in which each group transformed the system reflects not only technical requirements, but also the needs of users in each setting and embedding of the system within the larger socio-technical environment. Lessons about how task requirements, information flow requirements and work practice drive the evolution of a system are illustrated.

Russell, Daniel M.↗

Aspects, Wrappers and Events

This viewgraph presentation provides information on Object Infrastructure Framework (OIF), an Aspect-Oriented Programming (AOP) system. The presentation begins with an introduction to the difficulties and requirements of distributed computing, including functional and non-functional requirements (ilities). The architecture of Distributed Object Technology includes stubs, proxies for implementation objects, and skeletons, proxies for client applications. The key OIF ideas (injecting behavior, annotated communications, thread contexts, and pragma) are discussed. OIF is an AOP mechanism; AOP is centered on: 1) Separate expression of crosscutting concerns; 2) Mechanisms to weave the separate expressions into a unified system. AOP is software engineering technology for separately expressing systematic properties while nevertheless producing running systems that embody these properties.

Filman, Robert E.↗

The Thiamin Pyrophosphate-Motif

Using databases the authors have identified a common thiamin pyrophosphate (TPP)-motif in the family of functionally diverse TPP-dependent enzymes. This common motif consists of multimeric organization of subunits and two catalytic centers. Each catalytic center (PP:PYR) is formed at the interface of the PP-domain binding the magnesium ion, pyrophosphate and amhopyrimidine ring of TPP, and the PYR-domain binding the aminopyrimidine ring of that cofactor. A pair of these catalytic centers constitutes the catalytic core (PP:PYR)(sub 2) within these enzymes. Analysis of the structural elements of this catalytic core reveals novel definition of the common amino acid sequences, which are GXPhiX(sub 4)(G)PhiXXGQ and GDGX(sub 25-30)NN in the PP-domain, and the EX(sub 4)(G)PhiXXGPhi in the PYR-domain, where Phi corresponds to a hydrophobic amino acid. This TPP-motif provides a novel tool for annotation of TPP-dependent enzymes useful in advancing functional proteomics.

Dominiak, P.↗

The Thiamin Pyrophosphate-Motif

Using databases the authors have identified a common thiamin pyrophosphate (TPP)-motif in the family of functionally diverse TPP-dependent enzymes. This common motif consists of multimeric organization of subunits, two catalytic centers, common amino acid sequence, and specific contacts to provide a flip-flop, or alternate site, mechanism of action. Each catalytic center [PP:PYR] is formed at the interface of the PP-domain binding the magnesium ion, pyrophosphate and aminopyrimidine ring of TPP, and the PYR-domain binding the aminopyrimidine ring of that cofactor. A pair of these catalytic centers constitutes the catalytic core [PP:PYR]* within these enzymes. Analysis of the structural elements of this catalytic core reveals novel definition of the common amino acid sequences, which are GX@&(G)@XXGQ, and GDGX25-30 within the PP- domain, and the E&(G)@XXG@ within the PYR-domain, where Q, corresponds to a hydrophobic amino acid. This TPP-motif provides a novel tool for annotation of TPP-dependent enzymes useful in advancing functional proteomics.

Dominiak, Paulina M.↗

Development of Ground Reference GIS for Assessing Land Cover Maps of Northeast Yellowstone National Park

GIS technology and ground reference data often play vital roles in assessing land cover maps derived from remotely sensed data. This poster illustrates these roles, using results from a study done in Northeast Yellowstone National Park. This area holds many forest, range, and wetland cover types of interest to park managers. Several recent studies have focused on this locale, including the NASA Earth Observations Commercial Applications Program (EOCAP) hyperspectral project performed by Yellowstone Ecosystems Studies (YES) on riparian and in-stream habitat mapping. This poster regards a spin-off to the EOCAP project in which YES and NASA's Earth Science Applications Directorate explored the potential for synergistic use of hyperspecral, synthetic aperture radar, and multiband thermal imagery in mapping land cover types. The project included development of a ground reference GIS for site-specific data needed to evaluate maps from remotely sensed imagery. Field survey data included reflectance of plant communities, native and exotic plant species, and forest health conditions. Researchers also collected GPS points, annotated aerial photographs, and took hand held photographs of reference sites. The use of ESRI, ERDAS, and ENVI software enabled reference data entry into a GIS for comparision to georeferenced imagery and thematic maps. The GIS-based ground reference data layers supported development and assessment of multiple maps from remotely sensed data sets acquired over the study area.

Spruce, Joe↗

[Columbia Sensor Diagrams]

A two dimensional graphical event sequence of the time history of relevant sensor information located in the left wing and wheel well areas of the Space Shuttle Columbia Orbiter is presented. Information contained in this graphical event sequence include: 1) Sensor location on orbiter and its associated wire bindle in X-Y plane; 2) Wire bundle routing; 3) Description of each anomalous sensor event; 4) Time annotation by (a) GMT, (b) time relative to LOS, (c) time history bar, and (d) ground track; and 5) Graphical display of temperature rise (based on delta temperature from point it is determined to be anomalous).

Source record↗

Match-bounded String Rewriting Systems

We introduce a new class of automated proof methods for the termination of rewriting systems on strings. The basis of all these methods is to show that rewriting preserves regular languages. To this end, letters are annotated with natural numbers, called match heights. If the minimal height of all positions in a redex is h+1 then every position in the reduct will get height h+1. In a match-bounded system, match heights are globally bounded. Using recent results on deleting systems, we prove that rewriting by a match-bounded system preserves regular languages. Hence it is decidable whether a given rewriting system has a given match bound. We also provide a sufficient criterion for the abence of a match-bound. The problem of existence of a match-bound is still open. Match-boundedness for all strings can be used as an automated criterion for termination, for match-bounded systems are terminating. This criterion can be strengthened by requiring match-boundedness only for a restricted set of strings, for instance the set of right hand sides of forward closures.

Geser, Alfons↗

Corpus-Based Optimization of Language Models Derived from Unification Grammars

We describe a technique which makes it feasible to improve the performance of a language model derived from a manually constructed unification grammar, using low-quality untranscribed speech data and a minimum of human annotation. The method is on a medium-vocabulary spoken language command and control task.

Rayner, Manny↗

Verification of Java Programs using Symbolic Execution and Invariant Generation

Software verification is recognized as an important and difficult problem. We present a norel framework, based on symbolic execution, for the automated verification of software. The framework uses annotations in the form of method specifications an3 loop invariants. We present a novel iterative technique that uses invariant strengthening and approximation for discovering these loop invariants automatically. The technique handles different types of data (e.g. boolean and numeric constraints, dynamically allocated structures and arrays) and it allows for checking universally quantified formulas. Our framework is built on top of the Java PathFinder model checking toolset and it was used for the verification of several non-trivial Java programs.

Pasareanu, Corina↗

Simple Math is Enough: Two Examples of Inferring Functional Associations from Genomic Data

Non-random features in the genomic data are usually biologically meaningful. The key is to choose the feature well. Having a p-value based score prioritizes the findings. If two proteins share a unusually large number of common interaction partners, they tend to be involved in the same biological process. We used this finding to predict the functions of 81 un-annotated proteins in yeast.

Liang, Shoudan↗

MSFC Space Station Program Commonly Used Acronyms and Abbreviations Listing

The Marshall Space Flight Center maintains an active history program to assure that the foundation of the Center's history is captured and preserved for current and future generations. As part of that overall effort, the Center began a project in 1987 to capture historical information and documentation on the Marshall Center's roles regarding Space Shuttle and Space Station. This document is MSFC Space Station Program Commonly Used Acronyms and Abbreviations Listing. It contains acronyms and abbreviations used in Space Station documentation and in the Historian Annotated Bibliography of Space Station Program. The information may be used by the researcher as a reference tool.

Gates, Thomas G.↗

SemanticOrganizer Brings Teams Together

SemanticOrganizer enables researchers in different locations to share, search for, and integrate data. Its customizable semantic links offer fast access to interrelated information. This knowledge management and information integration tool also supports real-time instrument data collection and collaborative image annotation.

Laufenberg, Lawrence↗

Realtime Knowledge Management (RKM): From an International Space Station (ISS) Point of View

We are developing automated methods to provide realtime access to spacecraft domain knowledge relevant a spacecraft's current operational state. The method is based upon analyzing state-transition signatures in the telemetry stream. A key insight is that documentation relevant to a specific failure mode or operational state is related to the structure and function of spacecraft systems. This means that diagnostic dependency and state models can provide a roadmap for effective documentation navigation and presentation. Diagnostic models consume the telemetry and derive a high-level state description of the spacecraft. Each potential spacecraft state description is matched against the predictions of models that were developed from information found in the pages and sections in the relevant International Space Station (ISS) documentation and reference materials. By annotating each model fragment with the domain knowledge sources from which it was derived we can develop a system that automatically selects those documents representing the domain knowledge encapsulated by the models that compute the current spacecraft state. In this manner, when the spacecraft state changes, the relevant documentation context and presentation will also change.

Robinson, Peter I.↗

Building a Propulsion Experiment Project Management Environment

What do you get when you cross rocket scientists with computer geeks? It is an interactive, distributed computing web of tools and services providing a more productive environment for propulsion research and development. The Rocket Engine Advancement Program 2 (REAP2) project involves researchers at several institutions collaborating on propulsion experiments and modeling. In an effort to facilitate these collaborations among researchers at different locations and with different specializations, researchers at the Information Technology and Systems Center,' University of Alabama in Huntsville, are creating a prototype web-based interactive information system in support of propulsion research. This system, to be based on experience gained in creating similar systems for NASA Earth science field experiment campaigns such as the Convection and Moisture Experiments (CAMEX), will assist in the planning and analysis of model and experiment results across REAP2 participants. The initial version of the Propulsion Experiment Project Management Environment (PExPM) consists of a controlled-access web portal facilitating the drafting and sharing of working documents and publications. Interactive tools for building and searching an annotated bibliography of publications related to REAP2 research topics have been created to help organize and maintain the results of literature searches. Also work is underway, with some initial prototypes in place, for interactive project management tools allowing project managers to schedule experiment activities, track status and report on results. This paper describes current successes, plans, and expected challenges for this project.

Keiser, Ken↗

Do-It-Yourself: A Special Library's Approach to Creating Dynamic Web Pages Using Commercial Off-The-Shelf Applications

Many librarians may feel that dynamic Web pages are out of their reach, financially and technically. Yet we are reminded in library and Web design literature that static home pages are a thing of the past. This paper describes how librarians at the Institute for Defense Analyses (IDA) library developed a database-driven, dynamic intranet site using commercial off-the-shelf applications. Administrative issues include surveying a library users group for interest and needs evaluation; outlining metadata elements; and, committing resources from managing time to populate the database and training in Microsoft FrontPage and Web-to-database design. Technical issues covered include Microsoft Access database fundamentals, lessons learned in the Web-to-database process (including setting up Database Source Names (DSNs), redesigning queries to accommodate the Web interface, and understanding Access 97 query language vs. Standard Query Language (SQL)). This paper also offers tips on editing Active Server Pages (ASP) scripting to create desired results. A how-to annotated resource list closes out the paper.

Relational databases↗

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds

Annotating a letter by a number, one can record information about its history during a reduction. A string rewriting system is called match-bounded if there is a global upper bound to these numbers. In earlier papers we established match-boundedness as a strong sufficient criterion for both termination and preservation of regular languages. We show now that the string rewriting system whose inverse (left and right hand sides exchanged) is match-bounded, also have exceptional properties, but slightly different ones. Inverse match-bounded systems effectively preserve context-free languages; their sets of normalized strings and their sets of immortal strings are effectively regular. These sets of strings can be used to decide the normalization, the termination and the uniform termination problems of inverse match-bounded systems. We also show that the termination problem is decidable in linear time, and that a certain strong reachability problem is deciable, thus solving two open problems of McNaughton's.

Butler, Ricky↗