Search NASA⌕ Search

SEARCH · Search NASA

Results for “automatic scheme selection”

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 19 records

Automatic selection of dynamic data partitioning schemes for distributed memory multicomputers

For distributed memory multicomputers such as the Intel Paragon, the IBM SP-2, the NCUBE/2, and the Thinking Machines CM-5, the quality of the data partitioning for a given application is crucial to obtaining high performance. This task has traditionally been the user's responsibility, but in recent years much effort has been directed to automating the selection of data partitioning schemes. Several researchers have proposed systems that are able to produce data distributions that remain in effect for the entire execution of an application. For complex programs, however, such static data distributions may be insufficient to obtain acceptable performance. The selection of distributions that dynamically change over the course of a program's execution adds another dimension to the data partitioning problem. In this paper, we present a technique that can be used to automatically determine which partitionings are most beneficial over specific sections of a program while taking into account the added overhead of performing redistribution. This system is being built as part of the PARADIGM (PARAllelizing compiler for DIstributed memory General-purpose Multicomputers) project at the University of Illinois. The complete system will provide a fully automated means to parallelize programs written in a serial programming model obtaining high performance on a wide range of distributed-memory multicomputers.

Palermo, Daniel J.↗

Ground Communication Facility (GCF) upgrade task for Deep Space Network

The GCF upgrade task for NASA's Deep Space Network (DSN) is described. The DSN is a multimission telecommunications and radiometric data facility used to support space science, exploration, and applications by communicating with spacecraft and observing other radio sources. The GCF upgrade task is a six-year project designed to increase the data rate throughout capacity from 280 kbps to 2.272 Mbps from each tracking area to JPL, and 224 kbps from JPL to each tracking area. This would be accomplished by using a selective automatic repeat request error correction scheme in all throughput data.

Hung, Chaw-Kwei↗

Performance analysis of an optimal file transfer protocol for integrated mobile satellite services

A file-transfer protocol based on the selective-repeat automatic-retransmission-request (ARQ) scheme has been developed for the Mobile Satellite Experiment (MSAT-X). In this protocol, each file is divided into packets, which are error-detected and acknowledge individually. A file can be transferred in either the open- or closed-end connection. In the open-end connection, the file is transmitted continuously according to the selective-repeat scheme until all packets are positively acknowledged; in the closed-end connection, each retransmission will initiate its own connection request. The relationship between the packet size and the average end-to-end delay in the mobile fading environment is investigated. The communications channel uses trellis-coded modulation with symbol interleaving, packet replication, and error detection. The packet error performance in such a channel is evaluated by simulation, and the optimal packet size for various operating conditions is derived, using the simulated results. It is shown that for a symbol-energy-to-noise ratio of 12 dB, each file should be divided into packets of length between 256 bits and 512 bits (excluding the overhead) to minimize the average end-to-end delay.

Wang, Charles C.↗

Experimental and simulation study results of an Adaptive Video Guidance System /AVGS/

Studies relating to stellar-body exploration programs have pointed out the need for an adaptive guidance scheme capable of providing automatic real-time guidance and site selection capability. For the case of a planetary lander, without such guidance, targeting is limited to what are believed to be generally benign areas in order to ensure a reasonable landing-success probability. Typically, the Mars Viking Lander will be jeopardized by obstacles exceeding 22 centimers in diameter. The benefits of on-board navigation and real-time selection of a landing site and obstacle avoidance have been demonstrated by the Apollo lunar landings, in which man performed the surface sensing and steering functions. Therefore, an Adaptive Video Guidance System (AVGS) has been developed, bread-boarded, and flown on a six-degree-of-freedom simulator.

Schappell, R. T.↗

Multichannel temperature controller for hot air solar house

This paper describes an electronic controller that is optimized to operate a hot air solar system. Thermal information is obtained from copper constantan thermocouples and a wall-type thermostat. The signals from the thermocouples are processed through a single amplifier using a multiplexing scheme. The multiplexing reduces the component count and automatically calibrates the thermocouple amplifier. The processed signals connect to some simple logic that selects one of the four operating modes. This simple, inexpensive, and reliable scheme is well suited to control hot air solar systems.

Currie, J. R.↗

Visualization and Quantification of Rotor Tip Vortices in Helicopter Flows

Helicopter aeromechanics encompasses a highly vortical flow field. The vortices generated at each blade tip contain unsteady, complex, three-dimensional structures, which interact with each other, other blades, the fuselage and various components of the helicopter. It is crucial to understand vortex kinematics and their subsequent dynamic evolution. Much research has been devoted to the understanding of helicopter vortex dynamics, including a number of experimental studies.1-6 In May 2010 Particle Image Velocimetry (PIV) measurements of a full-scale UH-60A rotor were acquired in the National Full-Scale Aerodynamics Complex (NFAC) 40- by 80-Foot Wind Tunnel.1 These measurements were taken at a plane just downstream of the advancing blade in the vicinity of the blade tip—the so-called PIV plane. The resulting PIV data were then processed using an ensemble-average approach to create graphical representations of the vortical wake velocity and vorticity fields, which, in turn, have enhanced the understanding of rotorcraft vortical wake flow field physics and have provided a more detailed validation of vortical wake computer simulations.7 A common approach used to analyze flow field features is to compute and plot color contour maps of various scalar quantities such as pressure, velocity magnitude and vorticity magnitude. For example, the color map of the vorticity magnitude is typically used to determine vortical flow structure. With this approach the vortex core may appear larger or smaller, depending on the contour levels that are selected. Thus, the resulting visualization is sensitive to user-specified contour levels. For vortex core radius measurements, it is more accurate to calculate the vortex core radius using the cross-flow velocity profile across the vortex core. The task of extracting the cross-flow velocity profile can be time consuming with existing tools since the user needs to manually select the core center then specify sampling points along the profile axis. The task becomes even more challenging when the associated grid system uses AMR (Adaptive Mesh Refinement) where the profile axis could span multiple grid blocks. There are a number of existing techniques for profiling of vortex core attributes;8-9 however, these techniques are not fully automatic in that the user still needs to select the vortex core center to compute the cross-flow velocity profile. The present study introduces a new color map scheme that is based on the vortex core radius, which is fully automatic and does not require user intervention. Analysis and visualization of blade tip vortices on the PIV plane using the proposed new color map scheme are described in Section II. The new approach is evaluated using two case studies, which are described in Section III. The paper ends with a summary in Section IV.

Quantification↗

Recent developments in shock-capturing schemes

The development of the shock capturing methodology is reviewed, paying special attention to the increasing nonlinearity in its design and its relation to interpolation. It is well-known that higher-order approximations to a discontinuous function generate spurious oscillations near the discontinuity (Gibbs phenomenon). Unlike standard finite-difference methods which use a fixed stencil, modern shock capturing schemes use an adaptive stencil which is selected according to the local smoothness of the solution. Near discontinuities this technique automatically switches to one-sided approximations, thus avoiding the use of discontinuous data which brings about spurious oscillations.

Harten, Ami↗

RENDEZVOUS AND DOCKING TECHNIQUES

To implement the primary space mission of this decade – manned lunar exploration -- the operational assistance of rendezvous and docking is being considered as an alternative to possible problems in obtaining a boost vehicle capable of direct flight. This paper concentrates on the mechanization of the rendezvous and docking phase of such a lunar mission. As indicated in previous papers, rendezvous can take place in either an earth or lunar orbit (or on the lunar surface); it can involve the mating of stages, transfer of fuel, or the return of a shuttle to a “mother” ship; direct ascent or parking orbits can be used; the orbits can be circular or more general ellipses; finally, either or both of the spacecraft can participate in the rendezvous maneuvers. Since there is no intent here to discuss the pros and cons of each approach or to cover all possible mission profiles, guidance schemes and hardware configurations, one particular profile has been selected to display the significant features of most rendezvous missions. In many respects, rendezvous is less difficult than aircraft interception since the target is friendly and there is no severe time constraint. The latter feature allows considerable freedom of design especially with the great versatility of a human in the loop. This remains true even for a purely automatic mode. Perhaps the largest design problem concerns the selection of the mission to be implemented followed by the optimization or systems engineering of a mechanization from the multitude of possible schemes and techniques. A most important factor in the optimization is that of reliability and the redundancy, alternate or backup modes, etc., associated with the approach. While a primary system can be rather easily mechanized with modest equipment requirements, reliability considerations will result in additional hardware, tighter specifications and more safety factors (e. g., propellant margin). This is a very complex area and will only briefly be mentioned in the following discussion.

Rendezvous↗

A scheme for fault tolerance in earth sensors

A system is presented that uses dual-redundant earth sensors to measure pitch and roll errors of a three-axis stabilized spacecraft, with provision for (1) autonomously detecting and identifying a faulty earth sensor, and (2) automatically selecting the outputs of the fault-free sensor for closed-loop attitude control, before failures cause major problems. A brief description is given of the system, and various failure modes of earth sensors and their effects are discussed. Novel techniques and algorithms for automatic fault detection, identification, and reconfiguration (FDIR) of dual-redundant earth sensors are developed. The algorithms are validated through computer simulations, and the results are presented. The proposed scheme can easily be implemented without much penalty on hardware, power consumption, and processing time.

Murugesan, S.↗

ELAS: A general-purpose computer program for the equilibrium problems of linear structures. Volume 2: Documentation of the program

A general purpose digital computer program for the in-core solution of linear equilibrium problems of structural mechanics is documented. The program requires minimum input for the description of the problem. The solution is obtained by means of the displacement method and the finite element technique. Almost any geometry and structure may be handled because of the availability of linear, triangular, quadrilateral, tetrahedral, hexahedral, conical, triangular torus, and quadrilateral torus elements. The assumption of piecewise linear deflection distribution insures monotonic convergence of the deflections from the stiffer side with decreasing mesh size. The stresses are provided by the best-fit strain tensors in the least squares at the mesh points where the deflections are given. The selection of local coordinate systems whenever necessary is automatic. The core memory is used by means of dynamic memory allocation, an optional mesh-point relabelling scheme and imposition of the boundary conditions during the assembly time.

Utku, S.↗

Adaptive-Sweep Algorithm for Spacecraft Carrier Acquisition and Tracking: System Analysis and Implementation

This paper presents an adaptive-sweep algorithm that can be used in conjunction with a Phased-Lock Loop to acquire and track the carrier of a Binary Phase-shift Keying signal with residual carrier. This algorithm is useful in proximity links where no Doppler pre-compensation is available at the transmitter, and allows the receiver to acquire the incoming carrier even if the experienced Doppler shift is several orders of magnitude larger than the PLL bandwidth. Other applications for this algorithm include Multiple Uplink per Antenna at the Deep Space Network, and generation of observables (Doppler shift, Doppler rate, range rate) for in-situ navigation purposes. This paper enhances a previously presented adaptive-sweep algorithm and its performance analysis in two fronts. First, the algorithm now uses the direction function to automatically estimate the required frequency jump to achieve PLL lock. This enables a fully adaptive-sweep scheme in which system implementer does not need to manually select thresholds. On the other hand, we study the system performance in the presence of Additive White Gaussian Noise and derive necessary conditions for the system to operate at low signal-to-noise conditions. This allows us to create design rules that specify all parameters of the algorithm given a set of system-level requirements. To test the performance of the proposed algorithm, we implement it in GNU Radio, an open-source Software-Defined Radio that interfaces with several commercial radio peripherals. We use this implementation to demonstrate carrier lock and quantify system performance under different noise conditions. We also test the algorithm using open-loop recordings of two downlinks between the Lunar Reconnaissance Orbiter and the Deep Space Network. We show that even after large frequency jumps (tens of kHz), the proposed system is able to rapidly reacquire the carrier and continue operation.

Divsalar, Dariush↗

Toward Automatic Verification of Goal-Oriented Flow Simulations

We demonstrate the power of adaptive mesh refinement with adjoint-based error estimates in verification of simulations governed by the steady Euler equations. The flow equations are discretized using a finite volume scheme on a Cartesian mesh with cut cells at the wall boundaries. The discretization error in selected simulation outputs is estimated using the method of adjoint-weighted residuals. Practical aspects of the implementation are emphasized, particularly in the formulation of the refinement criterion and the mesh adaptation strategy. Following a thorough code verification example, we demonstrate simulation verification of two- and three-dimensional problems. These involve an airfoil performance database, a pressure signature of a body in supersonic flow and a launch abort with strong jet interactions. The results show reliable estimates and automatic control of discretization error in all simulations at an affordable computational cost. Moreover, the approach remains effective even when theoretical assumptions, e.g., steady-state and solution smoothness, are relaxed.

Simulations↗

Visual task analysis /VISTA/

Computer system VISTA, automatically plots selective PERT networks in order to develop accurate, standardized scheduling documentation as an essential element to project planning. This automation of plotting networks generates standardized networks due to a priority scheme adopted for calculating paths between events.

Burkes, T.↗

Microprogram scheme for automatic recovery from computer error

Microprogram scheme enables computer to recover from failure in one of its two central processing units during time duration of instruction in which failure occurs. Microprogram advantages include - /1/ built-in interpretive capability, /2/ selection of processing interrupts by priority, and /3/ economical use of bootstrap sequence.

Battin, R. A.↗

A Proposal to Develop Interactive Classification Technology

Research for the first year was oriented towards: 1) the design of an interactive classification tool (ICT); and 2) the development of an appropriate theory of inference for use in ICT technology. The general objective was to develop a theory of classification that could accommodate a diverse array of objects, including events and their constituent objects. Throughout this report, the term "object" is to be interpreted in a broad sense to cover any kind of object, including living beings, non-living physical things, events, even ideas and concepts. The idea was to produce a theory that could serve as the uniting fabric of a base technology capable of being implemented in a variety of automated systems. The decision was made to employ two technologies under development by the principal investigator, namely, SMS (Symbolic Manipulation System) and SL (Symbolic Language) [see debessonet, 1991, for detailed descriptions of SMS and SL]. The plan was to enhance and modify these technologies for use in an ICT environment. As a means of giving focus and direction to the proposed research, the investigators decided to design an interactive, classificatory tool for use in building accessible knowledge bases for selected domains. Accordingly, the proposed research was divisible into tasks that included: 1) the design of technology for classifying domain objects and for building knowledge bases from the results automatically; 2) the development of a scheme of inference capable of drawing upon previously processed classificatory schemes and knowledge bases; and 3) the design of a query/ search module for accessing the knowledge bases built by the inclusive system. The interactive tool for classifying domain objects was to be designed initially for textual corpora with a view to having the technology eventually be used in robots to build sentential knowledge bases that would be supported by inference engines specially designed for the natural or man-made environments in which the robots would be called upon to operate.

deBessonet, Cary↗

Application of a novel multi-stage signal parameter estimator to high dynamic GPS receivers

The performance of a novel multistage estimator when applied to the estimation of the position, velocity, and acceleration of high dynamic Global Positioning System (GPS) receivers is discussed. For the present application, a two-stage specialization of the more general estimation scheme is considered, wherein the first-stage algorithm is selected to be a modified least-squares algorithm operating upon the differential signal model and referred to as differential least-squares (DLS) and the second stage is simply an extended Kalman filter (EKF). In terms of the threshold on received carrier power-to-noise power spectral density ratio (CNR), when compared to the single-stage EKF algorithm, the DLS-EKF algorithm is about 1.5-2.0 dB better in terms of threshold and outperforms the crossproduct AFC (automatic frequency control) loop by 2-5 dB. For the case when data modulation is present, the proposed scheme provides an improvement of about 6 dB in terms of CNR compared to an earlier approximate MLE (maximum likelihood estimation) scheme. There are also very significant improvements in terms of other performance measures.

Kumar, R.↗

Fast modal extraction in NASTRAN via the FEER computer program

A new eigensolution routine, FEER (Fast Eigensolution Extraction Routine), used in conjunction with NASTRAN at Israel Aircraft Industries is described. The FEER program is based on an automatic matrix reduction scheme whereby the lower modes of structures with many degrees of freedom can be accurately extracted from a tridiagonal eigenvalue problem whose size is of the same order of magnitude as the number of required modes. The process is effected without arbitrary lumping of masses at selected node points or selection of nodes to be retained in the analysis set. The results of computational efficiency studies are presented, showing major arithmetic operation counts and actual computer run times of FEER as compared to other methods of eigenvalue extraction, including those available in the NASTRAN READ module. It is concluded that the tridiagonal reduction method used in FEER would serve as a valuable addition to NASTRAN for highly increased efficiency in obtaining structural vibration modes.

Newman, M. B.↗

Eigenvalue extraction in NASTRAN by the tridiagonal reduction (FEER) method: Real eigenvalue analysis

The development of the tridiagonal reduction method and its implementation in NASTRAN are described for real eigenvalue analysis as typified by structural vibration and buckling problems. This method is an automatic matrix reduction scheme whereby the eigensolutions in the neighborhood of a specified point in the eigenspectrum can be accurately extracted from a tridiagonal eigenvalue problem whose order is much lower than that of the full problem. The process is effected without orbitrary lumping of masses or other physical quantities at selected node points and thus avoids one of the basic weaknesses of other techniques.

Newman, M.↗