Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer Operations and Hardware”

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,603 records · Page 89

Automated Activation and Deactivation of a System Under Test

The MPLM Automated Activation/Deactivation application (MPLM means Multi-Purpose Logistic Module) was created with a three-fold purpose in mind: 1. To reduce the possibility of human error in issuing commands to, or interpreting telemetry from, the MPLM power, computer, and environmental control systems; 2. To reduce the amount of test time required for the repetitive activation/deactivation processes; and 3. To reduce the number of on-console personnel required for activation/ deactivation. All of these have been demonstrated with the release of the software. While some degree of automated end-item commanding had previously been performed for space-station hardware in the test environment, none approached the functionality and flexibility of this application. For MPLM activation, it provides mouse-click selection of the hardware complement to be activated, activates the desired hardware and verifies proper feedbacks, and alerts the user when telemetry indicates an error condition or manual intervention is required. For MPLM deactivation, the product senses which end items are active and deactivates them in the proper sequence. For historical purposes, an on-line log is maintained of commands issued and telemetry points monitored. The benefits of the MPLM Automated Activation/ Deactivation application were demonstrated with its first use in December 2002, when it flawlessly performed MPLM activation in 8 minutes (versus as much as 2.4 hours for previous manual activations), and performed MPLM deactivation in 3 minutes (versus 66 minutes for previous manual deactivations). The number of test team members required has dropped from eight to four, and in actuality the software can be operated by a sole (knowledgeable) system engineer.

Poff, Mark A.↗

Developments in Atmosphere Revitalization Modeling and Simulation

"NASA's Advanced Exploration Systems (AES) program is pioneering new approaches for rapidly developing prototype systems, demonstrating key capabilities, and validating operational concepts for future human missions beyond Earth orbit" (NASA 2012). These forays beyond the confines of earth's gravity will place unprecedented demands on launch systems. They must not only blast out of earth's gravity well as during the Apollo moon missions, but also launch the supplies needed to sustain a crew over longer periods for exploration missions beyond earth's moon. Thus all spacecraft systems, including those for the separation of metabolic carbon dioxide and water from a crewed vehicle, must be minimized with respect to mass, power, and volume. Emphasis is also placed on system robustness both to minimize replacement parts and ensure crew safety when a quick return to earth is not possible. Current efforts are focused on improving the current state-of-the-art systems utilizing fixed beds of sorbent pellets by evaluating structured sorbents, seeking more robust pelletized sorbents, and examining alternate bed configurations to improve system efficiency and reliability. These development efforts combine testing of sub-scale systems and multi-physics computer simulations to evaluate candidate approaches, select the best performing options, and optimize the configuration of the selected approach, which is then implemented in a full-scale integrated atmosphere revitalization test. This paper describes the development of atmosphere revitalization models and simulations. A companion paper discusses the hardware design and sorbent screening and characterization effort in support of the Atmosphere Revitalization Recovery and Environmental Monitoring (ARREM) project within the AES program.

Knox, James C.↗

A practical approach to determine minimal quantum gate durations using amplitude-bounded quantum controls

Here, we present an iterative scheme to estimate the minimal duration in which a quantum gate can be realized while satisfying hardware constraints on the control pulse amplitudes. The scheme performs a sequence of unconstrained numerical optimal control cycles that each minimize the gate fidelity for a given gate duration alongside an additional penalty term for the control pulse amplitudes. After each cycle, the gate duration is adjusted based on the inverse of the resulting maximum control pulse amplitudes by re-scaling the dynamics to a new duration where control pulses satisfy the amplitude constraints. Those scaled controls then serve as an initial guess for the next unconstrained optimal control cycle, using the adjusted gate duration. We provide multiple numerical examples that each demonstrate fast convergence of the scheme toward a gate duration that is close to the quantum speed limit, given the control pulse amplitude bound. The proposed technique is agnostic to the underlying system and control Hamiltonian models, as well as the target unitary gate operation, making the time-scaling iteration an easy to implement and practically useful scheme for reducing the durations of quantum gate operations.

97 MATHEMATICS AND COMPUTING↗

Noninvasive Diagnosis of Coronary Artery Disease Using 12-Lead High-Frequency Electrocardiograms

A noninvasive, sensitive method of diagnosing certain pathological conditions of the human heart involves computational processing of digitized electrocardiographic (ECG) signals acquired from a patient at all 12 conventional ECG electrode positions. In the processing, attention is focused on low-amplitude, high-frequency components of those portions of the ECG signals known in the art as QRS complexes. The unique contribution of this method lies in the utilization of signal features and combinations of signal features from various combinations of electrode positions, not reported previously, that have been found to be helpful in diagnosing coronary artery disease and such related pathological conditions as myocardial ischemia, myocardial infarction, and congestive heart failure. The electronic hardware and software used to acquire the QRS complexes and perform some preliminary analyses of their high-frequency components were summarized in Real-Time, High-Frequency QRS Electrocardiograph (MSC- 23154), NASA Tech Briefs, Vol. 27, No. 7 (July 2003), pp. 26-28. To recapitulate, signals from standard electrocardiograph electrodes are preamplified, then digitized at a sampling rate of 1,000 Hz, then analyzed by the software that detects R waves and QRS complexes and analyzes them from several perspectives. The software includes provisions for averaging signals over multiple beats and for special-purpose nonrecursive digital filters with specific low- and high-frequency cutoffs. These filters, applied to the averaged signal, effect a band-pass operation in the frequency range from 150 to 250 Hz. The output of the bandpass filter is the desired high-frequency QRS signal. Further processing is then performed in real time to obtain the beat-to-beat root mean square (RMS) voltage amplitude of the filtered signal, certain variations of the RMS voltage, and such standard measures as the heart rate and R-R interval at any given time. A key signal feature analyzed in the present method is the presence versus the absence of reduced-amplitude zones (RAZs). In terms that must be simplified for the sake of brevity, an RAZ comprises several cycles of a high-frequency QRS signal during which the amplitude of the high-frequency oscillation in a portion of the signal is abnormally low (see figure). A given signal sample exhibiting an interval of reduced amplitude may or may not be classified as an RAZ, depending on quantitative criteria regarding peaks and troughs within the reduced-amplitude portion of the high-frequency QRS signal. This analysis is performed in all 12 leads in real time.

Schlegel, Todd T.↗

MetaStrider: Architectures for Scalable Memory-centric Reduction of Sparse Data Streams

Reduction is an operation performed on the values of two or more key-value pairs that share the same key. Reduction of sparse data streams finds application in a wide variety of domains such as data and graph analytics, cybersecurity, machine learning, and HPC applications. However, these applications exhibit low locality of reference, rendering traditional architectures and data representations inefficient. This article presents MetaStrider, a significant algorithmic and architectural enhancement to the state-of-the-art, SuperStrider. Furthermore, these enhancements enable a variety of parallel, memory-centric architectures that we propose, resulting in demonstrated performance that scales near-linearly with available memory-level parallelism.

97 MATHEMATICS AND COMPUTING↗

UPC++ as_eager Working Group Draft, Revision 2020.6.2

This draft proposes an extension for a new future-based completion variant that can be more effectively streamlined for RMA and atomic access operations that happen to be satisfied at runtime using purely node-local resources. Many such operations are most efficiently performed synchronously using load/store instructions on shared-memory mappings, where the actual access may only require a few CPU instructions. In such cases we believe it’s critical to minimize the overheads imposed by the UPC++ runtime and completion queues, in order to enable efficient operation on hierarchical node hardware using shared-memory bypass. The new upcxx::{source,operation}_cx::as_eager_future() completion variant accomplishes this goal by relaxing the current restriction that future-returning access operations must return a non-ready future whose completion is deferred until a subsequent explicit invocation of user-level progress. This relaxation allows access operations that are completed synchronously to instead return a ready future, thereby avoiding most or all of the runtime costs associated with deferment of future completion and subsequent mandatory entry into the progress engine. We additionally propose to make this new as_eager_future() completion variant the new default completion for communication operations that currently default to returning a future. This should encourage use of the streamlined variant, and may provide performance improvements to some codes without source changes. A mechanism is proposed to restore the legacy behavior on-demand for codes that might happen to rely on deferred completion for correctness. Finally, we propose a new as_eager_promise() completion variant that extends analogous improvements to promise-based completion, and corresponding changes to the default behavior of as_promise().

97 MATHEMATICS AND COMPUTING↗

Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers

We reformulate the continuous-space Schrödinger equation in terms of spin Hamiltonians. For the kinetic energy operator, the critical concept facilitating the reduction in model complexity is the idea of position encoding. A binary encoding of position produces a spin-1/2 Heisenberg-like model and yields exponential improvement in space complexity when compared to classical computing. Encoding with a binary reflected Gray code (BRGC), and a Hamming-distance-2 Gray code (H2GC) reduces the model complexity down to the 𝑋⁢𝑍 and transverse Ising model, respectively. For 𝐴 qubits BRGC yields 2 𝐴 positions and is reduced to its 2-local form with O⁡(𝐴) ancillary qubits. H2GC yields 2 𝐴/2+1 positions with O⁡(𝐴 2 ) three-local penalty terms. We also identify the bijective mapping between diagonal unitaries and the Walsh series, producing the mapping of any real potential to a series of 𝑘 -local Ising models through the fast Walsh transform. Finally, in a finite volume, we provide some numerical evidence to support the claim that the total time needed for adiabatic evolution is protected by the infrared cutoff of the system. As a result, initial state preparation from a free-field wave function to an interacting system is expected to exhibit polynomial time complexity with volume and constant scaling with respect to lattice discretization for all encodings. For H2GC, if the evolution starts with the transverse Hamiltonian due to hardware restrictions, then penalties are dynamically introduced such that the low-lying spectrum reproduces the energy levels of the Laplacian. The adiabatic evolution of the penalty Hamiltonian is therefore sensitive to the ultraviolet scale. It is expected to exhibit polynomial time complexity with lattice discretization, or exponential time complexity with respect to the number of qubits given a fixed volume.

97 MATHEMATICS AND COMPUTING↗

Lion Cub: Minimizing Communication Overhead in Distributed Lion

Communication overhead is a key challenge in distributed deep learning, especially on slower Ethernet intercon nects, and given current hardware trends, communication is likely to become a major bottleneck. While gradient compression techniques have been explored for SGD and Adam, the Lion optimizer has the distinct advantage that its update vectors are the output of a sign operation, enabling straightforward quantization. However, simply compressing updates for communication and using techniques like majority voting fails to lead to end-to-end speedups due to inefficient communication algorithms and reduced convergence. We analyze three factors critical to distributed learning with Lion: optimizing communication methods, identifying effective quantization methods, and assessing the necessity of momentum synchronization. Our findings show that quantization techniques adapted to Lion and selective momentum synchronization can significantly reduce communication costs while maintaining convergence. We combine these into Lion Cub, which enables up to 5x speedups in end-to-end training compared to Lion. This highlights Lion’s potential as a communication-efficient solution for distributed training.

97 MATHEMATICS AND COMPUTING↗

A domain wall-magnetic tunnel junction artificial synapse with notched geometry for accurate and efficient training of deep neural networks

Inspired by the parallelism and efficiency of the brain, several candidates for artificial synapse devices have been developed for neuromorphic computing, yet a nonlinear and asymmetric synaptic response curve precludes their use for backpropagation, the foundation of modern supervised learning. Spintronic devices—which benefit from high endurance, low power consumption, low latency, and CMOS compatibility—are a promising technology for memory, and domain-wall magnetic tunnel junction (DW-MTJ) devices have been shown to implement synaptic functions such as long-term potentiation and spike-timing dependent plasticity. In this work, we propose a notched DW-MTJ synapse as a candidate for supervised learning. Using micromagnetic simulations at room temperature, we show that notched synapses ensure the non-volatility of the synaptic weight and allow for highly linear, symmetric, and reproducible weight updates using either spin transfer torque (STT) or spin–orbit torque (SOT) mechanisms of DW propagation. We use lookup tables constructed from micromagnetics simulations to model the training of neural networks built with DW-MTJ synapses on both the MNIST and Fashion-MNIST image classification tasks. Accounting for thermal noise and realistic process variations, the DW-MTJ devices achieve classification accuracy close to ideal floating-point updates using both STT and SOT devices at room temperature and at 400 K. Our work establishes the basis for a magnetic artificial synapse that can eventually lead to hardware neural networks with fully spintronic matrix operations implementing machine learning.

42 ENGINEERING↗

Enabling Dedicated, Affordable Space Access Through Aggressive Technology Maturation

A recent explosion in nano-sat, small-sat, and university class payloads has been driven by low cost electronics and sensors, wide component availability, as well as low cost, miniature computational capability and open source code. Increasing numbers of these very small spacecraft are being launched as secondary payloads, dramatically decreasing costs, and allowing greater access to operations and experimentation using actual space flight systems. While manifesting as a secondary payload provides inexpensive rides to orbit, these arrangements also have certain limitations. Small, secondary payloads are typically included with very limited payload accommodations, supported on a non interference basis (to the prime payload), and are delivered to orbital conditions driven by the primary launch customer. Integration of propulsion systems or other hazardous capabilities will further complicate secondary launch arrangements, and accommodation requirements. The National Aeronautics and Space Administration's Marshall Space Flight Center has begun work on the development of small, low cost launch system concepts that could provide dedicated, affordable launch alternatives to small, risk tolerant university type payloads and spacecraft. These efforts include development of small propulsion systems and highly optimized structural efficiency, utilizing modern advanced manufacturing techniques. This paper outlines the plans and accomplishments of these efforts and investigates opportunities for truly revolutionary reductions in launch and operations costs. Both evolution of existing sounding rocket systems to orbital delivery, and the development of clean sheet, optimized small launch systems are addressed. A launch vehicle at the scale and price point which allows developers to take reasonable risks with new propulsion and avionics hardware solutions does not exist today. Establishing this service provides a ride through the proverbial "valley of death" that lies between demonstration in laboratory and flight environments. This effort will provide the framework to mature both on-orbit and earth-to-orbit avionics and propulsion technologies while also providing dedicated, affordable access to LEO for cubesat class payloads.

Jones, Jonathan↗

Computational modeling of magnetically actuated propellant orientation

Unlike terrestrial applications where gravity positions liquid at the 'bottom' of the tank, the location of liquid propellant in spacecraft tanks is uncertain unless specific actions are taken or special features are built into the tank. Some mission events require knowledge of liquid position prior to a particular action: liquid must be positioned over the tank outlet prior to starting the main engines and must be moved away from the tank vent before vapor can be released overboard to reduce pressure. It may also be desirable to positively position liquid to improve propulsion system performance: moving liquid away from the tank walls will dramatically decrease the rate of heat transfer to the propellant, suppressing the boil-off rate, thereby reducing overall mission propellant requirements. The process of moving propellant to a desired position is referred to as propellant orientation or reorientation. Several techniques have been developed to positively position propellant in spacecraft tanks and each technique imposes additional requirements on vehicle design. Propulsive reorientation relies on small auxiliary thrusters to accelerate the tank. The inertia of the liquid causes it to collect in the aft-end of the tank if the acceleration is forward. This technique requires that additional thrusters be added to the vehicle, that additional propellant be carried in the vehicle, and that an additional operational maneuver be executed. Another technique uses Liquid Acquisition Devices (LAD's) to positively position propellants. These devices rely on surface tension to hold the liquid within special geometries (i.e. vanes, wire-mesh channels, start-baskets). While avoiding some of the penalties of propulsive orientation, this technique requires the addition of complicated hardware inside the propellant tank and performance for long duration missions is uncertain. The subject of the present research is an alternate technique for positively positioning liquid within spacecraft propellant tanks: magnetic fields.

Hochstein, John I.↗

Quantum Technologies for UAS (QTech)

Recent advances in small Unmanned Aerial System (sUAS) technologies lower the barriers for use by both private and commercial entities. However, these advances are also likely to lead to greater vehicle densities, a more heterogenous mix of vehicles and equipment and greater levels of vehicle autonomy, which can increase the chance for communications disruptions. For the safe and secure operation of these vehicles, it is essential to have a robust communications network. This work is focused on harnessing the power of quantum technologies to enable this robust communications network by: (1) utilizing quantum optimization algorithms to design robust network with routing redundancy that can respond adaptively to dynamically changing real-time environment and disruptions, (2) utilize quantum optimization algorithms resource allocation for detection, localization, and tracking of mobile communication disruption agents and (3) utilize quantum key distribution (QKD) to execute secure key sharing in anti-jamming protocols for secure radio frequency (RF) communication. Efforts to map these quantum optimization algorithms to commercially available quantum annealers and soon to be available general-purpose gate-model quantum hardware architectures will be reviewed, and plans for testing the solutions to these algorithms through indoor sUAS flight tests will be discussed. Lastly, efforts to miniaturize and practically deploy Quantum Key Distribution (QKD) hardware, which could ultimately be used to securely exchange encryption keys, in sUAS networks will be reviewed.

Quantum Computing↗

TEMPI: An Interposed MPI Library with Canonical Representation of MPI Datatypes [Poster]

TEMPI provides a transparent non-contiguous data-handling layer compatible with various MPIs. MPI Datatypes are a powerful abstraction for allowing an MPI implementation to operate on non-contiguous data. CUDA-aware MPI implementations must also manage transfer of such data between the host system and GPU. The non-unique and recursive nature of MPI datatypes mean that providing fast GPU handling is a challenge. The same noncontiguous pattern may be described in a variety of ways, all of which should be treated equivalently by an implementation. This work introduces a novel technique to do this for strided datatypes. Methods for transferring non-contiguous data between the CPU and GPU depends on the properties of the data layout. This work shows that a simple performance model can accurately select the fastest method. Unfortunately, the combination of MPI software and system hardware available may not provide sufficient performance. The contributions of this work are deployed on OLCF Summit through an interposer library which does not require privileged access to the system to use

97 MATHEMATICS AND COMPUTING↗

A propagation-based fault detection and discrimination method and the optimization of sensor deployment

Industrial processes can be affected by faults having a serious impact on operation when not promptly detected and diagnosed. Here in this paper, a propagation-based fault detection and discrimination(PFDD) method is proposed to develop a strategy for fault diagnosis while in the design phase of a system. The PFDD method constructs the system model using the Integrated System Fault Analysis(ISFA) technique. Based on the system model, the propagation of hardware and software faults are simulated qualitatively. Given the results of the simulation, the process by which a fault propagates can be characterized using the qualitative features of system variables including the deviation of the system variables from their expected values, the variation of the system variables over time, and the order in which each variable is influenced during the propagation of the fault. The strategy by which a fault can be detected and discriminated is defined using those features. The PFDD method supports the detection and discrimination of faults in both steady states and transient states. Based on the PFDD method, the optimization of sensor deployment in a system is discussed. A brute force algorithm is developed to examine the system’s capability at diagnosing faults and the cost of sensor deployment for all possible configurations of sensors. The optimal sensor deployment strategy can be derived accordingly. However, the brute force method is only applicable to small-scale systems due to its high computational cost. A genetic algorithm is used to optimize sensor deployment in large-scale systems. The PFDD and sensor deployment optimization methods are applied to the Experimental Breeder Reactor II (EBR-II) for verification.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Computer-Based Tools for Evaluating Graphical User Interfaces

The user interface is the component of a software system that connects two very complex system: humans and computers. Each of these two systems impose certain requirements on the final product. The user is the judge of the usability and utility of the system; the computer software and hardware are the tools with which the interface is constructed. Mistakes are sometimes made in designing and developing user interfaces because the designers and developers have limited knowledge about human performance (e.g., problem solving, decision making, planning, and reasoning). Even those trained in user interface design make mistakes because they are unable to address all of the known requirements and constraints on design. Evaluation of the user inter-face is therefore a critical phase of the user interface development process. Evaluation should not be considered the final phase of design; but it should be part of an iterative design cycle with the output of evaluation being feed back into design. The goal of this research was to develop a set of computer-based tools for objectively evaluating graphical user interfaces. The research was organized into three phases. The first phase resulted in the development of an embedded evaluation tool which evaluates the usability of a graphical user interface based on a user's performance. An expert system to assist in the design and evaluation of user interfaces based upon rules and guidelines was developed during the second phase. During the final phase of the research an automatic layout tool to be used in the initial design of graphical inter- faces was developed. The research was coordinated with NASA Marshall Space Flight Center's Mission Operations Laboratory's efforts in developing onboard payload display specifications for the Space Station.

Moore, Loretta A.↗

Towards Accurate Application Characterization for Exascale (APEX)

Sandia National Laboratories has been engaged in hardware and software codesign activities for a number of years, indeed, it might be argued that prototyping of clusters as far back as the CPLANT machines and many large capability resources including ASCI Red and RedStorm were examples of codesigned solutions. As the research supporting our codesign activities has moved closer to investigating on-node runtime behavior a nature hunger has grown for detailed analysis of both hardware and algorithm performance from the perspective of low-level operations. The Application Characterization for Exascale (APEX) LDRD was a project conceived of addressing some of these concerns. Primarily the research was to intended to focus on generating accurate and reproducible low-level performance metrics using tools that could scale to production-class code bases. Along side this research was an advocacy and analysis role associated with evaluating tools for production use, working with leading industry vendors to develop and refine solutions required by our code teams and to directly engage with production code developers to form a context for the application analysis and a bridge to the research community within Sandia. On each of these accounts significant progress has been made, particularly, as this report will cover, in the low-level analysis of operations for important classes of algorithms. This report summarizes the development of a collection of tools under the APEX research program and leaves to other SAND and L2 milestone reports the description of codesign progress with Sandia’s production users/developers.

97 MATHEMATICS AND COMPUTING↗

SD-WAN Evaluation Criteria for a Defense Information Systems Network Expeditionary Customer Edge

The Defense Information Systems Agency (DISA) has identified a service provision gap midway between the capacity and capability of a Defense Information Systems Network (DISN) transport Edge Points of Presence (POP) and U.S. Department of Defense (DoD) Enterprise Classified Travel Kit (DECTK). Some deployed force 100-user Tactical Operations Centers are in field locations far removed from the DISN transport core, in challenging environmental conditions with limitations on space, weight, power, and cooling for network equipment. As part of a multi-phase project, Pacific Northwest National Laboratory (PNNL) will gather and analyze requirements, design, develop, prototype, and test a miniaturized and ruggedized DISN Customer Edge POP scaled to support approximately 100 users in a field Tactical Operations Center. An Expeditionary Customer Edge (ECE) will be more suitable for field deployment than a DISN transport Edge POP, using ruggedized hardware and network function virtualization (NFV) to operate in challenging field environmental conditions, plus reduce weight, power, and cooling requirements. A key enabling technology for ECE is Software Defined Wide Area Networking (SD-WAN). This document provides: • A brief overview of SD-WAN use cases and how they apply to ECE • How SD-WAN technology compares to existing networks like DISN that use Optical Transport Networking (OTN) and Multiprotocol Label Switching (MPLS) • SD-WAN functional requirements relevant to ECE • A description of an ECE Virtual Prototype, including simulated wide area network paths and a DISN-representative implementation of MPLS, in Cisco Modeling Labs • Detailed network flow walkthroughs • Evaluation criteria based on ECE-relevant SD-WAN functional requirements Finally, an appendix provides an informal evaluation of Speedify—a commercial retail Virtual Private Network service—against the ECE SD-WAN evaluation criteria.

42 ENGINEERING↗

Emergency Flight Control of a Twin-Jet Commercial Aircraft using Manual Throttle Manipulation

The Department of Homeland Security (DHS) created the PCAR (Propulsion-Controlled Aircraft Recovery) project in 2005 to mitigate the ManPADS (man-portable air defense systems) threat to the commercial aircraft fleet with near-term, low-cost proven technology. Such an attack could potentially cause a major FCS (flight control system) malfunction or other critical system failure onboard the aircraft, despite the extreme reliability of current systems. For the situations in which nominal flight controls are lost or degraded, engine thrust may be the only remaining means for emergency flight control [ref 1]. A computer-controlled thrust system, known as propulsion-controlled aircraft (PCA), was developed in the mid 1990s with NASA, McDonnell Douglas and Honeywell. PCA's major accomplishment was a demonstration of an automatic landing capability using only engine thrust [ref 11. Despite these promising results, no production aircraft have been equipped with a PCA system, due primarily to the modifications required for implementation. A minimally invasive option is TOC (throttles-only control), which uses the same control principles as PCA, but requires absolutely no hardware, software or other aircraft modifications. TOC is pure piloting technique, and has historically been utilized several times by flight crews, both military and civilian, in emergency situations stemming from a loss of conventional control. Since the 1990s, engineers at NASA Dryden Flight Research Center (DFRC) have studied TOC, in both simulation and flight, for emergency flight control with test pilots in numerous configurations. In general, it was shown that TOC was effective on certain aircraft for making a survivable landing. DHS sponsored both NASA Dryden Flight Research Center (Edwards, CA) and United Airlines (Denver, Colorado) to conduct a flight and simulation study of the TOC characteristics of a twin-jet commercial transport, and assess the ability of a crew to control an aircraft down to a survivable runway landing using TOC. The PCAR project objective was a set of pilot procedures for operation of a specific aircraft without hydraulics that (a) have been validated in both simulation and flight by relevant personnel, and (b) mesh well with existing commercial operations, maintenance, and training at a minimum cost. As a result of this study, a procedure has been developed to assist a crew in making a survivable landing using TOC. In a simulation environment, line pilots with little or no previous TOC experience performed survivable runway landings after a few practice TOC approaches. In-flight evaluations put line pilots in a simulated emergency situation where TOC was used to recover the aircraft, maneuver to a landing site, and perform an approach down to 200 feet AGL. The results of this research, including pilot observations, procedure comments, recommendations, future work and lessons learned, will he discussed. Flight data and video footage of TOC approaches may also be shown.

Cole, Jennifer H.↗