Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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 325 records · Page 18

Comprehension and retrieval of failure cases in airborne observatories

This paper describes research dealing with the computational problem of analyzing and repairing failures of electronic and mechanical systems of telescopes in NASA's airborne observatories, such as KAO (Kuiper Airborne Observatory) and SOFIA (Stratospheric Observatory for Infrared Astronomy). The research has resulted in the development of an experimental system that acquires knowledge of failure analysis from input text, and answers questions regarding failure detection and correction. The system's design builds upon previous work on text comprehension and question answering, including: knowledge representation for conceptual analysis of failure descriptions, strategies for mapping natural language into conceptual representations, case-based reasoning strategies for memory organization and indexing, and strategies for memory search and retrieval. These techniques have been combined into a model that accounts for: (a) how to build a knowledge base of system failures and repair procedures from descriptions that appear in telescope-operators' logbooks and FMEA (failure modes and effects analysis) manuals; and (b) how to use that knowledge base to search and retrieve answers to questions about causes and effects of failures, as well as diagnosis and repair procedures. This model has been implemented in FANSYS (Failure ANalysis SYStem), a prototype text comprehension and question answering program for failure analysis.

Alvarado, Sergio J.↗

Dataflow Design Tool: User's Manual

The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.

Jones, Robert L., III↗

The Effect of Micro-Gravity on in vitro Calcification

The experiment focuses on mineral deposition or calcification of cartilage. The experiments were used to compare the mineral formed in the microgravity of space with that formed on earth. Results of these experiments were anticipated to provide direct insight into how calcification in cartridge and bone may be controlled in space. In the C-2 experiment (STS 66), we found that mineralization started later in the cartridges (both on the ground and in hypo-gravity) than in plastic, and that mineralization appeared to be retarded in hypo-gravity. The flight experiments also showed that the cells differentiated normally, but more slowly than the ground controls, and that the matrix produced was not different from that made on the ground. The purpose of the C-5 experiment was to confirm these findings. The C-5 experiment was flown on STS-72. Because of a computer problem, cells received no gases and no nutrition. The C-7 was flown on STS-77. Ground controls were repeated a week later, however, because there was a problem with the temperature control during the flight, the concurrent ground controls were performed at a different temperature. Despite these problems, the results of the C-2 experiment were confirmed. The cells in the flight cultures did not mature, formed few cartilage nodules, and showed no evidence of mineral deposition up to a culture age of 28 days. Ground controls showed the presence of mineral (based on chemical, spectroscopic, and histochemical analyses) by 21 days. The mineral in these cultures was analogous to that found in calcifying cartilage of young chicks.

Boskey↗

Some Continuum Aspects of Data Assimilation

A long-sought goal in data assimilation is to build more fully the time dimension into the data assimilation process. Truly four-dimensional data assimilation requires evolving second-moment information, namely the estimation error covariance, along with the state estimate itself. The continuum evolution equations for the estimation error covariance constitute a system of partial differential equations in six space dimensions, forced by a model error covariance and by the observations themselves. The high dimensionality of this system poses a difficult computational problem. Numerous methods have been proposed for approximate, discrete solution of this system of equations. Four-dimensional variational schemes solve these equations indirectly, while schemes based on Kalman filtering solve the equations more directly, usually on a small subspace of the full six-dimensional space. In both cases, most proposed solution methods are not derived from the continuum covariance evolution equations themselves. Instead, most methods simply inherit the discretization used for evolving the state estimate, either in the form of a discrete tangent linear model or, in the case of ensemble schemes, in the form of a fully nonlinear discrete model. In this lecture we show that solutions of the continuum covariance evolution equations possess simple properties that are not readily satisfied upon discretization of the equations. we give numerical examples illustrating that "inherited" discretizations sometimes fail to produce meaningfully accurate solutions. Finally, we suggest alternative discretization methods that may yield more faithful approximate solutions of the continuum problem.

Cohn, Stephen E.↗

Arcade: A Web-Java Based Framework for Distributed Computing

Distributed heterogeneous environments are being increasingly used to execute a variety of large size simulations and computational problems. We are developing Arcade, a web-based environment to design, execute, monitor, and control distributed applications. These targeted applications consist of independent heterogeneous modules which can be executed on a distributed heterogeneous environment. In this paper we describe the overall design of the system and discuss the prototype implementation of the core functionalities required to support such a framework.

Chen, Zhikai↗

STS-100 Flight Day 10 Highlights

On this tenth day of the STS-100 mission, the computer problems that delayed tests on the Canadian robotic arm are discussed between the Atlantis and Mission Ground Control. The Canadian robotic arm is seen after it lifts Spacelab from the pallet on Atlantis and moves to meet the Space Shuttle's robotic arm as it 'hands over' Spacelab to the smaller robotic arm. The Canadian robotic arm with Spacelab are seen against a backdrop of Earth as the Space Shuttle and International Space Station pass to the northeast of Australia.

Source record↗

Data Reduction Methods Applied to the Fastrac Engine

The Fastrac rocket engine is currently being developed for the X-34 technology demonstrator vehicle. The engine performance model must be calibrated to support accurate performance prediction. Data reduction is the process of estimating hardware characteristics from available test data, and is essential for effective performance model calibration and prediction. A new data reduction procedure was developed, implemented, and tested using data from Fastrac engine tests. The procedure selects hardware and test measurements to use in the reduction process based on examination of the model influence matrix condition number. Predicted hardware characteristics are recovered from the solution of a quadratic programming problem. Computational tests indicate that the new procedure provides a significant improvement in test data reduction capability. Enhancements include improved test data utilization and time history data reduction capability. The new method is generically applicable to other systems.

Santi, L. Michael↗

An Exact Dual Adjoint Solution Method for Turbulent Flows on Unstructured Grids

An algorithm for solving the discrete adjoint system based on an unstructured-grid discretization of the Navier-Stokes equations is presented. The method is constructed such that an adjoint solution exactly dual to a direct differentiation approach is recovered at each time step, yielding a convergence rate which is asymptotically equivalent to that of the primal system. The new approach is implemented within a three-dimensional unstructured-grid framework and results are presented for inviscid, laminar, and turbulent flows. Improvements to the baseline solution algorithm, such as line-implicit relaxation and a tight coupling of the turbulence model, are also presented. By storing nearest-neighbor terms in the residual computation, the dual scheme is computationally efficient, while requiring twice the memory of the flow solution. The scheme is expected to have a broad impact on computational problems related to design optimization as well as error estimation and grid adaptation efforts.

Nielsen, Eric J.↗

Performance of a Heterogeneous Grid Partitioner for N-body Applications

An important characteristic of distributed grids is that they allow geographically separated multicomputers to be tied together in a transparent virtual environment to solve large-scale computational problems. However, many of these applications require effective runtime load balancing for the resulting solutions to be viable. Recently, we developed a latency tolerant partitioner, called MinEX, specifically for use in distributed grid environments. This paper compares the performance of MinEX to that of METIS, a popular multilevel family of partitioners, using simulated heterogeneous grid configurations. A solver for the classical N-body problem is implemented to provide a framework for the comparisons. Experimental results show that MinEX provides superior quality partitions while being competitive to METIS in speed of execution.

Harvey, Daniel J.↗

Adjoint-Based Algorithms for Adaptation and Design Optimizations on Unstructured Grids

Schemes based on discrete adjoint algorithms present several exciting opportunities for significantly advancing the current state of the art in computational fluid dynamics. Such methods provide an extremely efficient means for obtaining discretely consistent sensitivity information for hundreds of design variables, opening the door to rigorous, automated design optimization of complex aerospace configuration using the Navier-Stokes equation. Moreover, the discrete adjoint formulation provides a mathematically rigorous foundation for mesh adaptation and systematic reduction of spatial discretization error. Error estimates are also an inherent by-product of an adjoint-based approach, valuable information that is virtually non-existent in today's large-scale CFD simulations. An overview of the adjoint-based algorithm work at NASA Langley Research Center is presented, with examples demonstrating the potential impact on complex computational problems related to design optimization as well as mesh adaptation.

Nielsen, Eric J.↗

Structure Detection of Nonlinear Aeroelastic Systems with Application to Aeroelastic Flight Test Data

This viewgraph presentation reviews the applicability of NARMAX structure detection to aeroelastic systems. In conclusion, the simulation results demonstrate bootstrap approach for structure computation of aircraft structural stiffness provided a high rate of true model selection: 1. T-test and stepwise regression methods had difficulty providing accurate results 2. Work contributes to understanding of the use of structure detection for modelling and identification of aerospace systems. 3. Limitation of model complexity that can be studied with these structure computation techniques 4. Result of the large number of candidate terms, for a given model order, and the data length required to guarantee convergence 5. Another approach to structure computation problem uses a least absolute shrinkage and selection operator (LASSO)

Kukreja, Sunil L.↗

Telescience Support Center Data System Software

The Telescience Support Center (TSC) team has developed a databasedriven, increment-specific Data Require - ment Document (DRD) generation tool that automates much of the work required for generating and formatting the DRD. It creates a database to load the required changes to configure the TSC data system, thus eliminating a substantial amount of labor in database entry and formatting. The TSC database contains the TSC systems configuration, along with the experimental data, in which human physiological data must be de-commutated in real time. The data for each experiment also must be cataloged and archived for future retrieval. TSC software provides tools and resources for ground operation and data distribution to remote users consisting of PIs (principal investigators), bio-medical engineers, scientists, engineers, payload specialists, and computer scientists. Operations support is provided for computer systems access, detailed networking, and mathematical and computational problems of the International Space Station telemetry data. User training is provided for on-site staff and biomedical researchers and other remote personnel in the usage of the space-bound services via the Internet, which enables significant resource savings for the physical facility along with the time savings versus traveling to NASA sites. The software used in support of the TSC could easily be adapted to other Control Center applications. This would include not only other NASA payload monitoring facilities, but also other types of control activities, such as monitoring and control of the electric grid, chemical, or nuclear plant processes, air traffic control, and the like.

Rahman, Hasan↗

Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks

Portfolio methods support the combination of different algorithms and heuristics, including stochastic local search (SLS) heuristics, and have been identified as a promising approach to solve computationally hard problems. While successful in experiments, theoretical foundations and analytical results for portfolio-based SLS heuristics are less developed. This article aims to improve the understanding of the role of portfolios of heuristics in SLS. We emphasize the problem of computing most probable explanations (MPEs) in Bayesian networks (BNs). Algorithmically, we discuss a portfolio-based SLS algorithm for MPE computation, Stochastic Greedy Search (SGS). SGS supports the integration of different initialization operators (or initialization heuristics) and different search operators (greedy and noisy heuristics), thereby enabling new analytical and experimental results. Analytically, we introduce a novel Markov chain model tailored to portfolio-based SLS algorithms including SGS, thereby enabling us to analytically form expected hitting time results that explain empirical run time results. For a specific BN, we show the benefit of using a homogenous initialization portfolio. To further illustrate the portfolio approach, we consider novel additive search heuristics for handling determinism in the form of zero entries in conditional probability tables in BNs. Our additive approach adds rather than multiplies probabilities when computing the utility of an explanation. We motivate the additive measure by studying the dramatic impact of zero entries in conditional probability tables on the number of zero-probability explanations, which again complicates the search process. We consider the relationship between MAXSAT and MPE, and show that additive utility (or gain) is a generalization, to the probabilistic setting, of MAXSAT utility (or gain) used in the celebrated GSAT and WalkSAT algorithms and their descendants. Utilizing our Markov chain framework, we show that expected hitting time is a rational function - i.e. a ratio of two polynomials - of the probability of applying an additive search operator. Experimentally, we report on synthetically generated BNs as well as BNs from applications, and compare SGSs performance to that of Hugin, which performs BN inference by compilation to and propagation in clique trees. On synthetic networks, SGS speeds up computation by approximately two orders of magnitude compared to Hugin. In application networks, our approach is highly competitive in Bayesian networks with a high degree of determinism. In addition to showing that stochastic local search can be competitive with clique tree clustering, our empirical results provide an improved understanding of the circumstances under which portfolio-based SLS outperforms clique tree clustering and vice versa.

Mengshoel, Ole J.↗

Framework Resources Multiply Computing Power

As an early proponent of grid computing, Ames Research Center awarded Small Business Innovation Research (SBIR) funding to 3DGeo Development Inc., of Santa Clara, California, (now FusionGeo Inc., of The Woodlands, Texas) to demonstrate a virtual computer environment that linked geographically dispersed computer systems over the Internet to help solve large computational problems. By adding to an existing product, FusionGeo enabled access to resources for calculation- or data-intensive applications whenever and wherever they were needed. Commercially available as Accelerated Imaging and Modeling, the product is used by oil companies and seismic service companies, which require large processing and data storage capacities.

Source record↗

Towards Simulating a Realistic Planetary Seismic Wavefield: The Contribution of the Megaregolith and Low-Velocity Waveguides

Lunar seismograms are distinctly different from their terrestrial counterparts. The Apollo lunar seismometers recorded moonquakes without distinct P- or S-wave arrivals; instead waves arrive as a diffuse coda that decays over several hours making the identification of body waves difficult. The unusual character of the lunar seismic wavefield is generally tied to properties of the megaregolith: it consists of highly fractured and broken crustal rock, the result of extensive bombardment of the Moon. The megaregolith extends several kilometers into the lunar crust, possibly into the mantle in some regions, and is covered by a thin coating of fine-scale dust. These materials possess very low seismic velocities that strongly scatter the seismic wavefield at high frequencies. Directly modeling the effects of the megaregolith to simulate an accurate lunar seismic wavefield is a challenging computational problem, owing to the inherent 3-D nature of the problem and the high frequencies (greater than 1 Hz) required. Here we focus on modeling the long duration code, studying the effects of the low velocities found in the megaregolith. We produce synthetic seismograms using 1-D slowness integration methodologies, GEMINI and reflectivity, and a 3-D Cartesian finite difference code, Wave Propagation Program, to study the effect of thin layers of low velocity on the surface of a planet. These codes allow us generate seismograms with dominant frequencies of approximately 1 Hz. For background lunar seismic structure we explore several models, including the recent model of Weber et al., Science, 2011. We also investigate variations in megaregolithic thickness, velocity, attenuation, and seismogram frequency content. Our results are compared to the Apollo seismic dataset, using both a cross correlation technique and integrated envelope approach to investigate coda decay. We find our new high frequency results strongly support the hypothesis that the long duration of the lunar seismic codes is generated by the presence of the low velocity megaregolith, and that the diffuse arrivals are a combination of scattered energy and multiple reverberations within this layer. The 3-D modeling indicates the extreme surface topography of the Moon adds only a small contribution to scattering effects, though local geology may play a larger role. We also study the effects of the megaregolith on core reflected and converted phases and other body waves. Our analysis indicates detection of core interacting arrivals with a polarization filter technique is robust and lends the possibility of detecting other body waves from the Moon.

Schmerr, Nicholas C.↗

Model Predictions and Observed Performance of JWST's Cryogenic Position Metrology System

The James Webb Space Telescope cryogenic testing requires measurement systems that both obtain a very high degree of accuracy and can function in that environment. Close-range photogrammetry was identified as meeting those criteria. Testing the capability of a close-range photogrammetric system prior to its existence is a challenging problem. Computer simulation was chosen over building a scaled mock-up to allow for increased flexibility in testing various configurations. Extensive validation work was done to ensure that the actual as-built system meet accuracy and repeatability requirements. The simulated image data predicted the uncertainty in measurement to be within specification and this prediction was borne out experimentally. Uncertainty at all levels was verified experimentally to be less than 0.1 millimeters.

Lunt, Sharon R.↗

Model Predictions and Observed Performance of JWST's Cryogenic Position Metrology System

The James Webb Space Telescope cryogenic testing requires measurement systems that both obtain a very high degree of accuracy and can function in that environment. Close-range photogrammetry was identified as meeting those criteria. Testing the capability of a close-range photogrammetric system prior to its existence is a challenging problem. Computer simulation was chosen over building a scaled mock-up to allow for increased flexibility in testing various configurations. Extensive validation work was done to ensure that the actual as-built system meet accuracy and repeatability requirements. The simulated image data predicted the uncertainty in measurement to be within specification and this prediction was borne out experimentally. Uncertainty at all levels was verified experimentally to be less than 0.1 millimeters.

Lunt, Sharon R.↗