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 181 records · Page 10

Genetic algorithms for adaptive real-time control in space systems

Genetic Algorithms that are used for learning as one way to control the combinational explosion associated with the generation of new rules are discussed. The Genetic Algorithm approach tends to work best when it can be applied to a domain independent knowledge representation. Applications to real time control in space systems are discussed.

Vanderzijp, J.↗

A study of trends and techniques for space base electronics

A sputtering system was developed to deposit aluminum and aluminum alloys by the dc sputtering technique. This system is designed for a high level of cleanliness and for monitoring the deposition parameters during film preparation. This system is now ready for studying the deposition and annealing parameters upon double-level metal preparation. A technique recently applied for semiconductor analysis, the finite element method, was studied for use in the computer modeling of two dimensional MOS transistor structures. It was concluded that the method has not been sufficiently well developed for confident use at this time. An algorithm was developed for confident use at this time. An algorithm was developed for implementing a computer study which is based upon the finite difference method. The program which was developed was modified and used to calculate redistribution data for boron and phosphorous which had been predeposited by ion implantation with range and straggle conditions. Data were generated for 111 oriented SOS films with redistribution in N2, dry O2 and steam ambients.

Trotter, J. D.↗

An optimal modification of a Kalman filter for time scales

The Kalman filter in question, which was implemented in the time scale algorithm TA(NIST), produces time scales with poor short-term stability. A simple modification of the error covariance matrix allows the filter to produce time scales with good stability at all averaging times, as verified by simulations of clock ensembles.

time scale Kalman filter↗

On-Orbit Prospective Echocardiography on International Space Station

A number of echocardiographic research projects and experiments have been flown on almost every space vehicle since 1970, but validation of standard methods and the determination of Space Normal cardiac function has not been reported to date. Advanced Diagnostics in Microgravity (ADUM) -remote guided echocardiographic technique provides a novel and effective approach to on-board assessment of cardiac physiology and structure using a just-in-time training algorithm and real-time remote guidance aboard the International Space Station (ISS). The validation of remotely guided echocardiographic techniques provides the procedures and protocols to perform scientific and clinical echocardiography on the ISS and the Moon. The objectives of this study were: 1.To confirm the ability of non-physician astronaut/cosmonaut crewmembers to perform clinically relevant remotely guided echocardiography using the Human Research Facility on board the ISS. 2.To compare the preflight, postflight and in-flight echocardiographic parameters commonly used in clinical medicine.

Hamilton, Douglas R.↗

A globally convergent matrix-free algorithm for implicit time-marching schemes arising in finite element analysis in fluids

A solution procedure for solving nonlinear time-marching problems is presented. The nonsymmetric systems of equations arising from a Newton-type linearization of these time-marching problems are solved using an iterative strategy based on the generalized minimal residual (GMRES) algorithm. Matrix-free techniques leading to reduction in storage are presented. Incorporation of a linesearch algorithm in the Newton-GMRES scheme is discussed. An automatic time-increment control strategy is developed to increase the stability of the time-marching process. High-speed flow computations demonstrate the effectiveness of these algorithms.

Johan, Zdenek↗

Description and performance analysis of a generalized optimal algorithm for aerobraking guidance

A practical real-time guidance algorithm has been developed for aerobraking vehicles which nearly minimizes the maximum heating rate, the maximum structural loads, and the post-aeropass delta V requirement for orbit insertion. The algorithm is general and reusable in the sense that a minimum of assumptions are made, thus greatly reducing the number of parameters that must be determined prior to a given mission. A particularly interesting feature is that in-plane guidance performance is tuned by adjusting one mission-dependent, the bank margin; similarly, the out-of-plane guidance performance is tuned by adjusting a plane controller time constant. Other features of the algorithm are simplicity, efficiency and ease of use. The trimmed vehicle with bank angle modulation as the method of trajectory control. Performance of this guidance algorithm is examined by its use in an aerobraking testbed program. The performance inquiry extends to a wide range of entry speeds covering a number of potential mission applications. Favorable results have been obtained with a minimum of development effort, and directions for improvement of performance are indicated.

Evans, Steven W.↗

A generalized reusable guidance algorithm for optimal aerobraking

A practical real-time guidance algorithm was developed for guiding aerobraking vehicles in such a way that the maximum heating rate, the maximum structural loads, and the post-aeropass delta-V requirements (for post-aeropass orbit insertion) are all minimized. The algorithm is general and reusable in the sense that a minimum of assumptions are made, thus minimizing the number of gains and mission-dependent parameters that must be laboriously determined prior to a particular mission. A particularly interesting feature is that inplane guidance performance is tuned by simply adjusting one mission-dependent parameter, the bank margin; similarly, the out-of-plane guidance performance is turned by simply adjusting a plane controller time constant. Other objectives in the algorithm development are simplicity, efficiency, and ease of use. The algorithm is developed for, but not necessarily restricted to, a single pass mission and a trimmed vehicle with a bank angle modulation as the method of trajectory control. Guidance performance is demonstrated via results obtained using this algorithm integrated into an aerobraking test-bed program. Comparisons are made with numerical results from a version of the aerobraking guidance algorithm that was to be flown onboard NASA's aeroassist flight experiment (AFE) vehicle. Promising results are obtained with a minimum of development effort.

Dukeman, G. A.↗

Compact representation and long-time extrapolation of real-time data for quantum systems using the ESPRIT algorithm

Representing real-time data as a sum of complex exponentials provides a compact form that enables both denoising and extrapolation. As a fully data-driven method, the Estimation of Signal Parameters via Rotational Invariance Techniques (ESPRIT) algorithm is agnostic to the underlying physical equations, making it broadly applicable to various observables and experimental or numerical setups. In this work, we consider applications of the ESPRIT algorithm primarily to extend real-time dynamical data from simulations of quantum systems. We evaluate ESPRIT's performance in the presence of noise and compare it to other extrapolation methods. We demonstrate its ability to extract information from short-time dynamics to reliably predict long-time behavior and determine the minimum time interval required for accurate results. We discuss how this insight can be leveraged in numerical methods that propagate quantum systems in time, and we show how ESPRIT can predict infinite-time values of dynamical observables, offering a purely data-driven approach to characterizing quantum phases.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Refinement and evaluation of helicopter real-time self-adaptive active vibration controller algorithms

A Real-Time Self-Adaptive (RTSA) active vibration controller was used as the framework in developing a computer program for a generic controller that can be used to alleviate helicopter vibration. Based upon on-line identification of system parameters, the generic controller minimizes vibration in the fuselage by closed-loop implementation of higher harmonic control in the main rotor system. The new generic controller incorporates a set of improved algorithms that gives the capability to readily define many different configurations by selecting one of three different controller types (deterministic, cautious, and dual), one of two linear system models (local and global), and one or more of several methods of applying limits on control inputs (external and/or internal limits on higher harmonic pitch amplitude and rate). A helicopter rotor simulation analysis was used to evaluate the algorithms associated with the alternative controller types as applied to the four-bladed H-34 rotor mounted on the NASA Ames Rotor Test Apparatus (RTA) which represents the fuselage. After proper tuning all three controllers provide more effective vibration reduction and converge more quickly and smoothly with smaller control inputs than the initial RTSA controller (deterministic with external pitch-rate limiting). It is demonstrated that internal limiting of the control inputs a significantly improves the overall performance of the deterministic controller.

Davis, M. W.↗

Some statistical performance characteristics of the 'ITD' modal identification algorithm

Performance characteristics of the Ibrahim time-domain algorithms are examined on a statistical basis. The method uses multiple free-response measurements from a test structure directly in the time domain, and displays varying accuracy, with the strongly excited modes identified most accurately and the weakly excited modes least accurately. Sets of computer-generated free-response functions for a simple 1-mode model are used to study the identification performance for several basic changes in the modal characteristics of the data, the user-selectable analysis constants, and the level of superimposed noise. Results indicate the existence of a direct and often linear effect of noise on the scatter of identified parameters, and good identification is maintained at the 1% noise level down to the point in frequency when only 1/4-cycle of data is analyzed.

Pappa, R. S.↗

Evaluation of shoulder integrity in space: first report of musculoskeletal US on the International Space Station

Investigative procedures were approved by Henry Ford Human Investigation Committee and NASA Johnson Space Center Committee for Protection of Human Subjects. Informed consent was obtained. Authors evaluated ability of nonphysician crewmember to obtain diagnostic-quality musculoskeletal ultrasonographic (US) data of the shoulder by following a just-in-time training algorithm and using real-time remote guidance aboard the International Space Station (ISS). ISS Expedition-9 crewmembers attended a 2.5-hour didactic and hands-on US training session 4 months before launch. Aboard the ISS, they completed a 1-hour computer-based Onboard Proficiency Enhancement program 7 days before examination. Crewmembers did not receive specific training in shoulder anatomy or shoulder US techniques. Evaluation of astronaut shoulder integrity was done by using a Human Research Facility US system. Crew used special positioning techniques for subject and operator to facilitate US in microgravity environment. Common anatomic reference points aided initial probe placement. Real-time US video of shoulder was transmitted to remote experienced sonologists in Telescience Center at Johnson Space Center. Probe manipulation and equipment adjustments were guided with verbal commands from remote sonologists to astronaut operators to complete rotator cuff evaluation. Comprehensive US of crewmember's shoulder included transverse and longitudinal images of biceps and supraspinatus tendons and articular cartilage surface. Total examination time required to guide astronaut operator to acquire necessary images was approximately 15 minutes. Multiple arm and probe positions were used to acquire dynamic video images that were of excellent quality to allow evaluation of shoulder integrity. Postsession download and analysis of high-fidelity US images collected onboard demonstrated additional anatomic detail that could be used to exclude subtle injury. Musculoskeletal US can be performed in space by minimally trained operators by using remote guidance. This technique can be used to evaluate shoulder integrity in symptomatic crewmembers after strenuous extravehicular activities or to monitor microgravity-associated changes in musculoskeletal anatomy. Just-in-time training, combined with remote experienced physician guidance, may provide a useful approach to complex medical tasks performed by nonexperienced personnel in a variety of remote settings, including current and future space programs. (c) RSNA, 2004.

Space Flight/education↗

Time Synchronization and Distribution Mechanisms for Space Networks

This work discusses research on the problems of synchronizing and distributing time information between spacecraft based on the Network Time Protocol (NTP), where NTP is a standard time synchronization protocol widely used in the terrestrial network. The Proximity-1 Space Link Interleaved Time Synchronization (PITS) Protocol was designed and developed for synchronizing spacecraft that are in proximity where proximity is less than 100,000 km distant. A particular application is synchronization between a Mars orbiter and rover. Lunar scenarios as well as outer-planet deep space mother-ship-probe missions may also apply. Spacecraft with more accurate time information functions as a time-server, and the other spacecraft functions as a time-client. PITS can be easily integrated and adaptable to the CCSDS Proximity-1 Space Link Protocol with minor modifications. In particular, PITS can take advantage of the timestamping strategy that underlying link layer functionality provides for accurate time offset calculation. The PITS algorithm achieves time synchronization with eight consecutive space network time packet exchanges between two spacecraft. PITS can detect and avoid possible errors from receiving duplicate and out-of-order packets by comparing with the current state variables and timestamps. Further, PITS is able to detect error events and autonomously recover from unexpected events that can possibly occur during the time synchronization and distribution process. This capability achieves an additional level of protocol protection on top of CRC or Error Correction Codes. PITS is a lightweight and efficient protocol, eliminating the needs for explicit frame sequence number and long buffer storage. The PITS protocol is capable of providing time synchronization and distribution services for a more general domain where multiple entities need to achieve time synchronization using a single point-to-point link.

Woo, Simon S.↗

Timing formulas for dissection algorithms on vector computers

The use of the finite element and finite difference methods often leads to the problem of solving large, sparse, positive definite systems of linear equations. MACSYMA plays a major role in the generation of formulas representing the time required for execution of the dissection algorithms. The use of MACSYMA in the generation of those formulas is described.

Poole, W. G., Jr.↗

On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays

A new very large scale integration (VLSI) design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous article is replaced by a time domain algorithm through a detailed comparison of their VLSI implementations. A new architecture that implements the time domain algorithm permits efficient pipeline processing with reduced circuitry. Erasure correction capability is also incorporated with little additional complexity. By using a multiplexing technique, a new implementation of Euclid's algorithm maintains the throughput rate with less circuitry. Such improvements result in both enhanced capability and significant reduction in silicon area.

Shao, H. M.↗

On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays

A new very large scale integration (VLSI) design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous article is replaced by a time domain algorithm through a detailed comparison of their VLSI implementations. A new architecture that implements the time domain algorithm permits efficient pipeline processing with reduced circuitry. Erasure correction capability is also incorporated with little additional complexity. By using multiplexing technique, a new implementation of Euclid's algorithm maintains the throughput rate with less circuitry. Such improvements result in both enhanced capability and significant reduction in silicon area.

Shao, Howard M.↗

Remaining Flying Time Prediction Implementing Battery Prognostics Framework for Electric UAV's

In this paper the problem of building trust in the online safety prediction of an fixed wing small electric unmanned aerial vehicles (e-UAV) for remaining flying time is addressed. A series of flight tests are described to verify the performance of the remaining flying time prediction algorithm. The estimate of remaining flying time is used to activate an alarm when the predicted remaining time falls below a threshold of two minutes. This updates the pilot to transition to the landing sequence of the flight profile. A second alarm is activated when the battery state of charge (SOC) falls below a specified safety limit threshold. This SOC threshold is the point at which the battery energy reserve would no longer safely support enough aborted landing attempts. During the test flights, the motor system is operated with the same predefined timed airspeed profile for each test. To test the robustness of the developed prediction algorithm, partial tests were performed with and remaining were performed without a simulated power train fault. To simulate a partial power train fault in the e-UAV the pilot engages a resistor bank at a specified time during the test flight. The flying time prediction system is agnostic of the pilot's activation of the fault and must adapt to the vehicle's state. The time at which the limit threshold on battery SOC is reached, it is then used to measure the accuracy of the remaining flying time predictions. This is demonstrated through comparing results from two battery models being developed. Accuracy requirements for the alarms are considered and the results discussed.

Kulkarni, Chetan↗

Applying queueing theory to evaluate wait-time-savings of triage algorithms

Abstract In the past decade, artificial intelligence (AI) algorithms have made promising impacts in many areas of healthcare. One application is AI-enabled prioritization software known as computer-aided triage and notification (CADt). This type of software as a medical device is intended to prioritize reviews of radiological images with time-sensitive findings, thus shortening the waiting time for patients with these findings. While many CADt devices have been deployed into clinical workflows and have been shown to improve patient treatment and clinical outcomes, quantitative methods to evaluate the wait-time-savings from their deployment are not yet available. In this paper, we apply queueing theory methods to evaluate the wait-time-savings of a CADt by calculating the average waiting time per patient image without and with a CADt device being deployed. We study two workflow models with one or multiple radiologists (servers) for a range of AI diagnostic performances, radiologist’s reading rates, and patient image (customer) arrival rates. To evaluate the time-saving performance of a CADt, we use the difference in the mean waiting time between the diseased patient images in the with-CADt scenario and that in the without-CADt scenario as our performance metric. As part of this effort, we have developed and also share a software tool to simulate the radiology workflow around medical image interpretation, to verify theoretical results, and to provide confidence intervals for the performance metric we defined. We show quantitatively that a CADt triage device is more effective in a busy, short-staffed reading setting, which is consistent with our clinical intuition and simulation results. Although this work is motivated by the need for evaluating CADt devices, the evaluation methodology presented in this paper can be applied to assess the time-saving performance of other types of algorithms that prioritize a subset of customers based on binary outputs.

Thompson, Yee Lam Elim (ORCID:0000000196537707)↗

Decomposition Algorithm for Global Reachability on a Time-Varying Graph

A decomposition algorithm has been developed for global reachability analysis on a space-time grid. By exploiting the upper block-triangular structure, the planning problem is decomposed into smaller subproblems, which is much more scalable than the original approach. Recent studies have proposed the use of a hot-air (Montgolfier) balloon for possible exploration of Titan and Venus because these bodies have thick haze or cloud layers that limit the science return from an orbiter, and the atmospheres would provide enough buoyancy for balloons. One of the important questions that needs to be addressed is what surface locations the balloon can reach from an initial location, and how long it would take. This is referred to as the global reachability problem, where the paths from starting locations to all possible target locations must be computed. The balloon could be driven with its own actuation, but its actuation capability is fairly limited. It would be more efficient to take advantage of the wind field and ride the wind that is much stronger than what the actuator could produce. It is possible to pose the path planning problem as a graph search problem on a directed graph by discretizing the spacetime world and the vehicle actuation. The decomposition algorithm provides reachability analysis of a time-varying graph. Because the balloon only moves in the positive direction in time, the adjacency matrix of the graph can be represented with an upper block-triangular matrix, and this upper block-triangular structure can be exploited to decompose a large graph search problem. The new approach consumes a much smaller amount of memory, which also helps speed up the overall computation when the computing resource has a limited physical memory compared to the problem size.

Kuwata, Yoshiaki↗