Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 1,243 records · Page 69

An improved algorithm for determining neutral winds from the height of the F2 peak electron density

The algorithm of Miller et al. (1986) for determining neutral winds in the thermosphere from the height of the F2 peak electron density is modified, making it possible to reduce the amount of computation time by two thirds. The improved algorithm also provides a more accurate reproduction of h(m)F2 by an ionospheric model than does the original algorithm. The winds obtained from the new algorithm were found to agree well with both the optical and radar measurements conducted at Arecibo on August 17-18, 1982.

Richards, P. G.↗

A Fast-Time Study of Aircraft Reordering in Arrival Sequencing and Scheduling

In order to ensure that the safe capacity of the terminal area is not exceeded, Air Traffic Management ATM often places restrictions on arriving flights transitioning from en route airspace to terminal airspace. This restriction of arrival traffic is commonly referred to as arrival flow management, and includes techniques such as metering, vectoring, fix-load balancing, and the imposition of miles-in-trail separations. These restrictions are enacted without regard for the relative priority which airlines may be placing on individual flights based on factors such as crew criticality, passenger connectivity, critical turn times, gate availability, on-time performance, fuel status, or runway preference. The development of new arrival flow management techniques which take into consideration priorities expressed by air carriers will likely reduce the economic impact of ATM restrictions on the airlines and lead to increased airline economic efficiency by allowing airlines to have greater control over their individual arrival banks of aircraft. NASA and the Federal Aviation Administration (FAA) have designed and developed a suite of software decision support tools (DSTs) collectively known as the Center TRACON Automation System (CTAS). One of these tools, the Traffic Management Advisor (TMA) is currently being used at the Fort Worth Air Route Traffic Control Center to perform arrival flow management of traffic into the Dallas/Fort Worth airport (DFW). The TMA is a time-based strategic planning tool that assists Traffic Management Coordinators (TMCs) and En Route Air Traffic Controllers in efficiently balancing arrival demand with airport capacity. The primary algorithm in the TMA is a real-time scheduler which generates efficient landing sequences and landing times for arrivals within about 200 no a. from touchdown. This scheduler will sequence aircraft so that they arrive in a first- come - first-served (FCFS) order. While FCFS sequencing establishes a fair order based on estimated times of arrival, it does not take into account individual airline priorities among incoming flights. NASA is exploring the possibility of allowing airlines to express relative arrival priorities to air traffic management through the development of new CTAS scheduling algorithms which take into consideration airline arrival preferences. The accommodation of airline priorities in arrival sequencing and scheduling would under most circumstances result in a deviation from a "natural" or FCFS arrival order. As a First step toward developing airline influenced sequencing algorithms, an investigation was conducted to determine the feasibility of reordering arrival traffic from a strict FCFS sequence. A fast-time simulation has been developed which allows statistical evaluation of sequencing and scheduling algorithms for arrival traffic at the Dallas/Fort Worth Airport. In contrast to real-time simulation or field tests, which would require on the order of ninety minutes to examine a single traffic rush period, the fast-time simulation allows examination of multiple rush periods in a matter of seconds.

Carr, Greg↗

Numerical algorithm conjugating steady and transient, separated, compressible flow and a solid body having arbitrarily distributed heat sources

A numerical algorithm that is second-order accurate in time has been developed for the conjugated problem of a separated, compressible flow field and a conductive solid body. The full two-dimensional time-dependent Navier-Stokes equations are coupled with the time-dependent energy equation for the solid body and are solved simultaneously. using implicit algorithms. The energy equation for the solid body may include arbitrarily distributed heat sources. The algorithm has been exmined for the case of two-dimensional supersonic compression-corner interaction, with a heat source embedded in the wall in the vicinity of the separation bubble and the attached boundary layer. The effect of the heat source on the flow field is studied for steady and transient cases.

Degani, D.↗

Exploring Gigabyte Datasets in Real Time: Architectures, Interfaces and Time-Critical Design

Architectures and Interfaces: The implications of real-time interaction on software architecture design: decoupling of interaction/graphics and computation into asynchronous processes. The performance requirements of graphics and computation for interaction. Time management in such an architecture. Examples of how visualization algorithms must be modified for high performance. Brief survey of interaction techniques and design, including direct manipulation and manipulation via widgets. talk discusses how human factors considerations drove the design and implementation of the virtual wind tunnel. Time-Critical Design: A survey of time-critical techniques for both computation and rendering. Emphasis on the assignment of a time budget to both the overall visualization environment and to each individual visualization technique in the environment. The estimation of the benefit and cost of an individual technique. Examples of the modification of visualization algorithms to allow time-critical control.

Bryson, Steve↗

A vectorized, finite-volume, adaptive grid algorithm applied to planetary entry problems

An adaptive grid, finite-volume method has been applied to problems in planetary entry for computing complete flowfields. The adaption algorithm is implicit in nature and is keyed to resolve user specified gradients. The finite-volume algorithm is explicit, utilizing a maximum time step advancement at each grid point to accelerate convergence to the steady state. The present version of the code is for the laminar flow of a perfect gas. The role of the adaption algorithm in resolving various features of blunt body/wake flow for planetary entry conditions is emphasized.

Gnoffo, P. A.↗

Evaluation of GPS/UTC steering performance

The Global Positioning System (GPS) is required to maintain GPS time to Universal Coordinated Time (UTC) to an accuracy of one microsecond and broadcast to the user the offset between GPS and UTC to an accuracy of 100 nanoseconds (1 sigma). On 25 Jun. 1990, an automatic steering algorithm was implemented to control GPS time to synchronize it with UTC. The description of the steering laws and predicted performance results were presented at the 1989 Precise Time and Time Interval (PTTI) conference, while preliminary performance results were presented at the 1990 PTTI conference. The initial performance was not as predicted, resulting in an in-depth analysis of the observed performance and a more thorough sensitivity analysis. In addition, responses to anomalies were investigated. This paper will describe these analyses and results, and evaluate actual steering performance from Jun. 1990 to Nov. 1991. Although anomalies were observed during the initial phase of steering, recent experience is more in line with expectations.

W. A. Feess↗

Resource Selection Using Execution and Queue Wait Time Predictions

Computational grids provide users with many possible places to execute their applications. We wish to help users select where to run their applications by providing predictions of the execution times of applications on space shared parallel computers and predictions of when scheduling systems for such parallel computers will start applications. Our predictions are based on instance based learning techniques and simulations of scheduling algorithms. We find that our execution time prediction techniques have an average error of 37 percent of the execution times for trace data recorded from SGI Origins at NASA Ames Research Center and that this error is 67 percent lower than the error of user estimates. We also find that the error when predicting how long applications will wait in scheduling queues is 95 percent of mean queue wait times when using our execution time predictions and this is 57 percent lower than if we use user execution time estimates.

Warren, Smith↗

Resource Selection Using Execution and Queue Wait Time Predictions

Computational grids provide users with many possible places to execute their applications. We wish to help users select where to run their applications by providing predictions of the execution times of applications on space shared parallel computers and predictions of when scheduling systems for such parallel computers will start applications. Our predictions are based on instance based learning techniques and simulations of scheduling algorithms. We find that our execution time prediction techniques have an average error of 37 percent of the execution times for trace data recorded from SGI Origins at NASA Ames Research Center and that this error is 67 percent lower than the error of user estimates. We also find that the error when predicting how long applications will wait in scheduling queues is 95 percent of mean queue wait times when using our execution time predictions and this is 57 percent lower than if we use user execution time estimates.

Smith, Warren↗

Nowcasting Aircraft Icing Conditions in the Presence of Multilayered Clouds Using Meteorological Satellite Data

Cloud properties retrieved from satellite data are used to diagnose aircraft icing threat in single layer and multilayered ice-over-liquid clouds. The algorithms are being applied in real time to the Geostationary Operational Environmental Satellite (GOES) data over the CONUS with multilayer data available over the eastern CONUS. METEOSAT data are also used to retrieve icing conditions over western Europe. The icing algorithm s methodology and validation are discussed along with future enhancements and plans. The icing risk product is available in image and digital formats on NASA Langley s Cloud and Radiation Products web site, http://wwwangler. larc.nasa.gov.

Spangenberg, Douglas A.↗

Improving Adhesive Bondline Time of Flight Predictions During Autoclave Cure Utilizing Machine Learning

Composite materials are increasingly being used in aerospace applications due to their superior strength-to-weight ratio compared to commonly used metals. A current limitation to widespread adoption is the certification of adhesively bonded joints. One approach to improving adhesive bonding in composites is accurately measuring the thickness of adhesive bondlines in composite laminates. Precise bondline thickness control is essential for aerospace applications where adhesive layer thickness directly affects joint fracture properties and structural performance. This study focused on implementing machine learning techniques to determine the ultrasonic time of flight (directly correlated to thickness) in adhesive bondlines throughout autoclave cure cycles. A high-temperature (use up to 180°C) ultrasonic scanning system was deployed in an autoclave to provide time of flight data through composite panels. Three experiments were conducted on the curing of 305 mm × 305 mm unidirectional composite panels. In the first experiment, a piecewise function was fit for the temperature correction factor to account for changing autoclave temperatures. Due to deficiencies in the first calibration experiment, a second experiment was run, and the results were used to train a machine learning model. The revised experiment, in combination with the machine learning model, significantly increased the accuracy of the bondline time of flight predictions (~14% error reduced to <1%). Data was processed using the Regression Learner Application in MATLAB®, with a Support Vector Machine selected for the model. The result was a machine learning algorithm capable of reliably quantifying ultrasonic time of flight through adhesive bondlines. The third experiment provided independent test data for the machine learning model, demonstrating that the model produces accurate predictions from data beyond its training set.

Machine Learning↗

Real-Time "Garbage Collection" for List Processing

Two proposed algorithmic techniques for list processing enable immediate identification of computer memory cells having become inactive through disconnection from active cells, together with addition of these inactive cells to pool of reusable cells. These two "garbage collection" techniques reduce memory requirements of list processors or increase their speed or both. With both techniques, processing continuity maintained, enabling real-time processing.

Shuler, Robert L., Jr.↗

Algorithm for Fuel-Conservative Airplane Descents

Federal Aviation Administration implementing automated, time-based metering form of air-traffic control (ATC) with profile-descent procedures for arrivals into terminal area. Measures provide fuel savings by matching arrival of airplanes to airport acceptance rate through time-control computations and allowing pilot to descend at his discretion from cruise altitude to designated metering-fix altitude in idle-thrust clean configuration. Airborne descent algorithm developed compatible with time-based metering and profile-descent procedures and designed to improve accuracy of delivering airplane during fuel-efficient descent to metering fix at time designated by the ATC system.

Knox, C. E.↗

Health monitoring system for the SSME - Program overview

This paper considers the design of a health management system (HMS) program for enhancement of the safety of SSME operations during ground tests and space missions. The fault detection techniques based on time series, nonlinear regression, and clustering algorithms were developed and were demonstrated based on data from SSME ground test failures. The fault detection algorithms of the HMS system exhibited 100 percent detection of faults and an extremely low fault alarm rate, and were robust to sensor loss. A preliminary design of hardware architecture capable of supporting real-time operation of the HMS functions is described.

Hawman, Michael W.↗

Performance Analysis of A Dual Quaternion Guidance Algorithm Applicable During Lunar Approach With A Hazard Avoidance Maneuver

There is currently a need for advanced guidance and targeting algorithms that can provide real-time trajectories in the presence of state and vehicle constraints during powered descent. The Safe & Precise Landing Integrated Capabilities Evolution (SPLICE) program aims to mature Hazard Detection (HD) technology along with advanced navigation and guidance algorithms. This paper will report the overall performance of the SPLICE Dual Quaternion Guidance (DQG) algorithm which is a 6-Degree-of-Freedom (6-DOF) convex optimization-based guidance algorithm that can enforce multiple vehicle and state constraints required for Hazard Detection Lidar (HDL) scans during the approach phase. DQG was tested in a closed-loop lunar descent simulation with realistic HDL sensing constraints in a Monte Carlo assessment of 1000 dispersed runs.

Guidance↗

A ground track control algorithm for the Topographic Mapping Laser Altimeter (TMLA)

The results of an analysis of an algorithm that will provide autonomous onboard orbit control using orbits determined with Global Positioning System (GPS) data. The algorithm uses the GPS data to (1) compute the ground track error relative to a fixed longitude grid, and (2) determine the altitude adjustment required to correct the longitude error. A program was written on a personal computer (PC) to test the concept for numerous altitudes and values of solar flux using a simplified orbit model including only the J sub 2 zonal harmonic and simple orbit decay computations. The algorithm was then implemented in a precision orbit propagation program having a full range of perturbations. The analysis showed that, even with all perturbations (including actual time histories of solar flux variation), the algorithm could effectively control the spacecraft ground track and yield more than 99 percent Earth coverage in the time required to complete one coverage cycle on the fixed grid (220 to 230 days depending on altitude and overlap allowance).

Blaes, V.↗

Application of a pilot control strategy identification technique to a joint FAA/NASA ground-based simulation of head-up displays for CTOL aircraft

A technique for measuring a pilot's control strategy was developed, evaluated, and applied to a joint FAA-NASA ground-based simulation of two competing concepts of head-up displays for use in conventional takeoff and landing aircraft. The technique, called the Non-Intrusive Pilot Identification Program (NIPIP), estimates the pilot's input-output describing function and combined pilot-vehicle performance parameters such as crossover frequency and phase margin by using a time domain model of the pilot and a least-squares identification algorithm. NIPIP functions in realtime and uses a sliding time window to maintain freshness in the data; thus time-varying characteristics in the pilot's control strategy can be measured.

Jewell, W. F.↗

Operational Dynamic Configuration Analysis

Sectors may combine or split within areas of specialization in response to changing traffic patterns. This method of managing capacity and controller workload could be made more flexible by dynamically modifying sector boundaries. Much work has been done on methods for dynamically creating new sector boundaries [1-5]. Many assessments of dynamic configuration methods assume the current day baseline configuration remains fixed [6-7]. A challenging question is how to select a dynamic configuration baseline to assess potential benefits of proposed dynamic configuration concepts. Bloem used operational sector reconfigurations as a baseline [8]. The main difficulty is that operational reconfiguration data is noisy. Reconfigurations often occur frequently to accommodate staff training or breaks, or to complete a more complicated reconfiguration through a rapid sequence of simpler reconfigurations. Gupta quantified a few aspects of airspace boundary changes from this data [9]. Most of these metrics are unique to sector combining operations and not applicable to more flexible dynamic configuration concepts. To better understand what sort of reconfigurations are acceptable or beneficial, more configuration change metrics should be developed and their distribution in current practice should be computed. This paper proposes a method to select a simple sequence of configurations among operational configurations to serve as a dynamic configuration baseline for future dynamic configuration concept assessments. New configuration change metrics are applied to the operational data to establish current day thresholds for these metrics. These thresholds are then corroborated, refined, or dismissed based on airspace practitioner feedback. The dynamic configuration baseline selection method uses a k-means clustering algorithm to select the sequence of configurations and trigger times from a given day of operational sector combination data. The clustering algorithm selects a simplified schedule containing k configurations based on stability score of the sector combinations among the raw operational configurations. In addition, the number of the selected configurations is determined based on balance between accuracy and assessment complexity.

Lai, Chok Fung↗

Dynamic Adjustment of Simulation Parameters for Efficient Vehicle Prognostics

Model-based diagnostics and prognostics rely on state estimation and uncertainty management algorithms to produce useful information for system operators and maintainers. This information enables more informed operational decisions, condition-based maintenance, and overall mission safety assurance. Typically, uncertainty is associated with vehicle state-of-health estimation and prediction results because of modeling errors, internal or external sources of noise, and sensor inaccuracy. Probabilistic uncertainty management methods including Sequential Monte Carlo simulation are commonly used to reason about state-of-health estimates and predictions in the presence of these sources of uncertainty. However, such algorithms can be computationally expensive as they require a very large number of samples to obtain a sufficiently accurate quantification of the end of life probability distribution. As a result, highly mobile autonomous systems that leverage the prognostic results for mission-level replanning are often constrained in their processing capability because of these computationally expensive simulation approaches. Therefore, in this paper, we investigate algorithmic methods for dynamically adjusting simulation time step as well as number of samples to achieve highly efficient prognostic results while maintaining results accuracy. Results obtained from simulated flight experiments of an electric unmanned aerial vehicle are presented to verify the efficacy of such algorithms.

Prognostics↗