SEARCH · Engineering Papers

Results for “algorithm development”

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 433 records · Page 24

All sources NASA NTRS DOE OSTI

NASA NTRS2003

Estimating Uncertainty in GPCP and TRMM Multi-Satellite Precipitation Estimates

One of the high-priority problems in satellite precipitation estimation is developing algorithms for estimating the errors in precipitation retrievals by individual sensors and subsequent multi-satellite combinations. Classically, we distinguish between "random" and "bias" errors, which do and do not, respectively average to zero over a "big enough" time/space sample. The current operational GPCP and TRMM multi-satellite algorithms are nearly unique in estimating random error for the monthly precipitation estimates from individual sensor systems (including gauge), following Huffman, and then making multi-sensor combinations. No routinely operational global precipitation produces estimates of bias error. Subsequently, a similar scheme has been followed to provide random error estimates for the Multi-satellite Precipitation Analysis (MPA) being computed in real time and after real time for TRMM. The Huffman algorithm for random error is briefly reviewed, including a discussion of the limitations imposed on the algorithm by standard monthly precipitation data sets. Starting from a very simple theoretical treatment of the histogram of precipitation samples in a month, an equation is developed that depends on the estimated average precipitation rate for the month, the number of samples in the month, and two constants. The constants are set separately for each source of precipitation estimate (such as "raingauge") by calibration at selected ground sites. We discuss recent work validating the random error estimates to highlight the successes and limitations of this first-generation approach. We then consider what information is needed from the individual sensor algorithms to facilitate additional accuracy in the estimation of random errors across the time/space span of climate regimes which a global estimation system must handle. In addition, the thorny issue of estimating bias is raised. Finally, the role of error estimates (and the qualitative errors!) in creating combinations of precipitation estimates from different individual sensors is discussed. This issue is particularly important when fine scales in space and time are being considered, say the 0.25 x 0.25-deg 3-hourly estimates in the MPA.

Huffman, G. J.↗

NASA NTRS1991

Retrieval of atmospheric water vapor profiles using radiometric measurements at 183 and 90 GHz

The algorithm developed by Wilheim (1990) dealt with the retrieval of water-vapor profiles from microwave radiometric measurements, even in the presence of clouds. This algorithm was tested using radiometric measurements at frequencies near 90 and 183 GHz; the results show that the retrieved water-vapor profiles were in general agreement with those derived from radiosonde data. In particular, retrieval over both land and ocean surfaces generated clouds at locations that could be verified from satellite photographs. The algorithm did not perform well where there were surface fronts. These clouds possibly contained ice particles as well as precipitating snow, which the algorithm was not expected to handle.

Lutz, Robert↗

NASA NTRS1991

EOS Laser Atmosphere Wind Sounder (LAWS) investigation

The related activities of the contract are outlined for the first year. These include: (1) attend team member meetings; (2) support EOS Project with science related activities; (3) prepare and Execution Phase plan; and (4) support LAWS and EOSDIS related work. Attached to the report is an appendix, 'LAWS Algorithm Development and Evaluation Laboratory (LADEL)'. Also attached is a copy of a proposal to the NASA EOS for 'LAWS Sampling Strategies and Wind Computation Algorithms -- Storm-Top Divergence Studies. Volume I: Investigation and Technical Plan, Data Plan, Computer Facilities Plan, Management Plan.'

Emmitt, George D.↗

NASA NTRS1992

How is WFPC flat field made

An algorithm developed by the WFPC IDT to generate flat fields from Earth streak exposures is now implemented in STSDAS. We explain in detail how this algorithm works and possible deficiencies. We also present two associated tools which can be used to modify the flat field obtained from the standard procedure.

Hsu, J.-C.↗

NASA NTRS1996

Homotopy Solutions of Kepler's Equations

Kepler's Equation is solved using an integrative algorithm developed using homotropy theory. The solution approach is applicable to both elliptic and hyperbolic forms of Kepler's Equation. The results from the proposed algorithm compare quite favorably with those from existing iterative schemes.

Fitz-Coy, Norman↗

NASA NTRS2000

Quantifying Void Ratio in Granular Materials Using Voronoi Tessellation

Voronoi technique was used to calculate the local void ratio distribution of granular materials. It was implemented in an application-oriented image processing and analysis algorithm capable of extracting object edges, separating adjacent particles, obtaining the centroid of each particle, generating Voronoi polygons, and calculating the local void ratio. Details of the algorithm capabilities and features are presented. Verification calculations included performing manual digitization of synthetic images using Oda's method and Voronoi polygon system. The developed algorithm yielded very accurate measurements of the local void ratio distribution. Voronoi tessellation has the advantage, compared to Oda's method, of offering a well-defined polygon generation criterion that can be implemented in an algorithm to automatically calculate local void ratio of particulate materials.

Alshibli, Khalid A.↗

NASA NTRS2011

Advanced Fiber Optic-Based Sensing Technology for Unmanned Aircraft Systems

This presentation provides an overview of fiber optic sensing technology development activities performed at NASA Dryden in support of Unmanned Aircraft Systems. Examples of current and previous work are presented in the following categories: algorithm development, system development, instrumentation installation, ground R&D, and flight testing. Examples of current research and development activities are provided.

Richards, Lance↗

DOE OSTI2024

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2003

Development of an Output-based Adaptive Method for Multi-Dimensional Euler and Navier-Stokes Simulations

The use of computational simulations in the prediction of complex aerodynamic flows is becoming increasingly prevalent in the design process within the aerospace industry. Continuing advancements in both computing technology and algorithmic development are ultimately leading to attempts at simulating ever-larger, more complex problems. However, by increasing the reliance on computational simulations in the design cycle, we must also increase the accuracy of these simulations in order to maintain or improve the reliability arid safety of the resulting aircraft. At the same time, large-scale computational simulations must be made more affordable so that their potential benefits can be fully realized within the design cycle. Thus, a continuing need exists for increasing the accuracy and efficiency of computational algorithms such that computational fluid dynamics can become a viable tool in the design of more reliable, safer aircraft. The objective of this research was the development of an error estimation and grid adaptive strategy for reducing simulation errors in integral outputs (functionals) such as lift or drag from from multi-dimensional Euler and Navier-Stokes simulations. In this final report, we summarize our work during this grant.

Darmofal, David L.↗

DOE OSTI2025

SITCOMTN-154: Initial studies of photometric redshifts with LSSTComCam from DP1

This technote holds reports based on the first analyses of the Data Preview 1 (DP1) data by the Science Unit for photometric redshifts. Although photometric redshifts are not an official DP1 data product, the "Photo-z Science Unit" generated photo-z estimates for every galaxy in DP1 using the available multi-band imaging on a best-effort basis. This work included developing training and test datasets by matching DP1 data to high-quality reference redshifts obtained with spectroscopy, Grism data, and multi-band photometry. The Science Unit used the RAIL software package to make photometric redshift estimates using eight different algorithms, developed simple scientific performance metrics, used those metrics to explore how the performance of the algorithms varied with configuration changes, derived more optimized configurations of the algorithms and tested the performance of those configurations. This work, the resulting data products and expected data distribution mechanism are all described there.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS2009

Motion Cueing Algorithm Modification for Improved Turbulence Simulation

Atmospheric turbulence cueing produced by flight simulator motion systems has been less than satisfactory because the turbulence profiles have been attenuated by the motion cueing algorithms. Cardullo and Ellor initially addressed this problem by directly porting the turbulence model output to the motion system. Reid and Robinson addressed the problem by employing a parallel aircraft model, which is only stimulated by the turbulence inputs and adding a filter specially designed to pass the higher turbulence frequencies. There have been advances in motion cueing algorithm development at the Man-Machine Systems Laboratory, at SUNY Binghamton. In particular, the system used to generate turbulence cues has been studied. The Reid approach, implemented by Telban and Cardullo, was employed to augment the optimal motion cueing algorithm installed at the NASA LaRC Simulation Laboratory, driving the Visual Motion Simulator. In this implementation, the output of the primary flight channel was added to the output of the turbulence channel and then sent through a non-linear cueing filter. The cueing filter is an adaptive filter; therefore, it is not desirable for the output of the turbulence channel to be augmented by this type of filter. The likelihood of the signal becoming divergent was also an issue in this design. After testing on-site it became apparent that the architecture of the turbulence algorithm was generating unacceptable cues. As mentioned above, this cueing algorithm comprised a filter that was designed to operate at low bandwidth. Therefore, the turbulence was also filtered, augmenting the cues generated by the model. If any filtering is to be done to the turbulence, it will utilize a filter with a much higher bandwidth, above the frequencies produced by the aircraft response to turbulence. The authors have developed an implementation wherein only the signal from the primary flight channel passes through the nonlinear cueing filter. This paper discusses three new algorithms. Testing shows that the new methods provide the pilot with a more realistic sensation of turbulence; the cues are not attenuated by algorithm. Results of offline testing show the credibility of the models. Offline test verification was based primarily on the evaluation of the power spectral density of the outputs and the time response.

Ercole, Anthony V.↗

DOE OSTI2020

Chemistry on Quantum Computers with Virtual Quantum Subspace Expansion

Several novel methods for performing calculations relevant to quantum chemistry on quantum computers have been proposed but not yet explored experimentally. Virtual quantum subspace expansion is one such algorithm developed for modeling complex molecules using their full orbital space and without the need for additional quantum resources. Here, we implement this method on the IBM Q platform and calculate the potential energy curves of the hydrogen and lithium dimers using only two qubits and simple classical post-processing. A comparable level of accuracy would require twenty qubits with previous approaches. We also develop an approach to minimize the impact of experimental noise on the stability of a generalized eigenvalue problem that is a crucial component of the algorithm. Our results demonstrate that virtual quantum subspace expansion works well in practice.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly

One of the most computationally intensive tasks in computational biology is de novo genome assembly, the decoding of the sequence of an unknown genome from redundant and erroneous short sequences. A common assembly paradigm identifies overlapping sequences, simplifies their layout, and creates consensus. Despite many algorithms developed in the literature, the efficient assembly of large genomes is still an open problem. In this work, we introduce new distributed-memory parallel algorithms for overlap detection and layout simplification steps of de novo genome assembly, and implement them in the diBELLA 2D pipeline. Our distributed memory algorithms for both overlap detection and layout simplification are based on linear-algebra operations over semirings using 2D distributed sparse matrices. Our layout step consists of performing a transitive reduction from the overlap graph to a string graph. We provide a detailed communication analysis of the main stages of our new algorithms. diBELLA 2D achieves near linear scaling with over 80% parallel efficiency for the human genome, reducing the runtime for overlap detection by 1.2-1.3× for the human genome and 1.5-1.9× for C.elegans compared to the state-of-the-art. Our transitive reduction algorithm outperforms an existing distributed-memory implementation by 10.5-13.3× for the human genome and 18-29× for the C. elegans. Our work paves the way for efficient de novo assembly of large genomes using long reads in distributed memory.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS1989

Upwind-biased, point-implicit relaxation strategies for viscous, hypersonic flows

An upwind-biased point-implicit relaxation algorithm for obtaining the numerical solution to the governing equations for three-dimensional viscous hypersonic flows in chemical and thermal nonequilibrium is described. Details of the algorithm development, in the context of an 11-species two-temperature reacting gas model, are emphasized. Because of the point-implicit relaxation strategy, the algorithm remains stable at large Courant numbers without the necessity of solving large block-tridiagonal systems. Predictions for the hypersonic flow of air in chemical and thermal nonequilibrium (velocity = 8917 m/s, altitude = 78 km) over the Aeroassist Flight Experiment configuration, obtained on a multidomain grid, are discussed.

Gnoffo, Peter A.↗

NASA NTRS1993

Determination of the mass properties of a manipulator

Space applications for telerobotics requires a manipulator that is robust to the large payload variations that occur in a zero-g environment. One approach to provide the required performance for this large payload variation is to provide inertial decoupling to the controller. The equations to generate the required joint torques can be obtained in several manners but the independent parameters required to perform the calculations are difficult to obtain. This presentation consists of an overview of the inertial decoupling control system and discusses how to reduce the inertial parameter set to a minimum and obtain the required parameter set to a minimum and obtain the required parameter vector using sensed joint positions and torques. In addition, as telerobotic technology becomes more prevalent in the space environments the ability to emulate the effect of zero-g in a one-g environment is critical in learning how to perform tasks in space. To emulate the zero-g environment it is necessary to remove the effect of gravity on the manipulator by determining the feedforward joint torques. A subset of the algorithm developed to obtain the decoupling parameters is used to obtain the gravity offload parameters. These parameters are used to eliminate the effect of gravity. The algorithm is validated on Martin Marietta/NASA Langley's, 7 Degrees-Of-Freedom (DOF) Flight Telerobotic Servicer Hydraulic Manipulator Test Bed. A video portraying actual results of the algorithm is provided.

Goldenberg, Stewart↗

NASA NTRS2001

Improving Simulated Annealing by Replacing Its Variables with Game-Theoretic Utility Maximizers

The game-theory field of Collective INtelligence (COIN) concerns the design of computer-based players engaged in a non-cooperative game so that as those players pursue their self-interests, a pre-specified global goal for the collective computational system is achieved as a side-effect. Previous implementations of COIN algorithms have outperformed conventional techniques by up to several orders of magnitude, on domains ranging from telecommunications control to optimization in congestion problems. Recent mathematical developments have revealed that these previously developed algorithms were based on only two of the three factors determining performance. Consideration of only the third factor would instead lead to conventional optimization techniques like simulated annealing that have little to do with non-cooperative games. In this paper we present an algorithm based on all three terms at once. This algorithm can be viewed as a way to modify simulated annealing by recasting it as a non-cooperative game, with each variable replaced by a player. This recasting allows us to leverage the intelligent behavior of the individual players to substantially improve the exploration step of the simulated annealing. Experiments are presented demonstrating that this recasting significantly improves simulated annealing for a model of an economic process run over an underlying small-worlds topology. Furthermore, these experiments reveal novel small-worlds phenomena, and highlight the shortcomings of conventional mechanism design in bounded rationality domains.

Wolpert, David H.↗

NASA NTRS2004

Processing Spacecraft Data Without Confusion

Producing multiple versions of the same data product for the same time frame with the same remotely sensed inputs can be a recipe for disaster. Yet, amidst the commotion of satellite launch and early operations (LEO), such data processing is needed. After LEO, the situation gets worse. Processing newly arriving data ("forward processing") is augmented with reprocessing and algorithm development, comparison, evaluation, and testing -- often happening all at the same time. The problem can be analyzed in three main parts -- maintaining multiple versions of algorithms and data so that end-product users are not overwhelmed,allocating computer resources efficiently, and simplifying production operations so that va st amounts of data can be processed with minimal staff and fewer errors. OMIDAPS provides a framework for execution of algorithms that transform lower level data acquired by OMI on NASA's Aura satellite into higher level science data products. In contrast to traditional science data processing systems, we address all parts of the problem with an innovative approach allowing multiple data processing to run within a single physical system. The data products, imports, exports, and execution planning are all segregated into distinct "ArchiveSets." This paper describes reasons for multiple concurrent productions on a typical satellite data processing project using OMI as an example. It describes the virtual data processing system concept and its advantages over separate physical processing strings. It explores the specific implementation of the virtual systems within OMIDAPS and discusses some of the implications of our approach and describes how virtual processing is used to accomplish the overall mission of OMI data processing.

Tilmes, Curt↗

NASA NTRS2011

Verification of Small Hole Theory for Application to Wire Chaffing Resulting in Shield Faults

Our work is focused upon developing methods for wire chafe fault detection through the use of reflectometry to assess shield integrity. When shielded electrical aircraft wiring first begins to chafe typically the resulting evidence is small hole(s) in the shielding. We are focused upon developing algorithms and the signal processing necessary to first detect these small holes prior to incurring damage to the inner conductors. Our approach has been to develop a first principles physics model combined with probabilistic inference, and to verify this model with laboratory experiments as well as through simulation. Previously we have presented the electromagnetic small-hole theory and how it might be applied to coaxial cable. In this presentation, we present our efforts to verify this theoretical approach with high-fidelity electromagnetic simulations (COMSOL). Laboratory observations are used to parameterize the computationally efficient theoretical model with probabilistic inference resulting in quantification of hole size and location. Our efforts in characterizing faults in coaxial cable are subsequently leading to fault detection in shielded twisted pair as well as analysis of intermittent faulty connectors using similar techniques.

Schuet, Stefan R.↗