Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “implementation”

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,261 records · Page 70

Novel techniques for data decomposition and load balancing for parallel processing of vision systems: Implementation and evaluation using a motion estimation system

Computer vision systems employ a sequence of vision algorithms in which the output of an algorithm is the input of the next algorithm in the sequence. Algorithms that constitute such systems exhibit vastly different computational characteristics, and therefore, require different data decomposition techniques and efficient load balancing techniques for parallel implementation. However, since the input data for a task is produced as the output data of the previous task, this information can be exploited to perform knowledge based data decomposition and load balancing. Presented here are algorithms for a motion estimation system. The motion estimation is based on the point correspondence between the involved images which are a sequence of stereo image pairs. Researchers propose algorithms to obtain point correspondences by matching feature points among stereo image pairs at any two consecutive time instants. Furthermore, the proposed algorithms employ non-iterative procedures, which results in saving considerable amounts of computation time. The system consists of the following steps: (1) extraction of features; (2) stereo match of images in one time instant; (3) time match of images from consecutive time instants; (4) stereo match to compute final unambiguous points; and (5) computation of motion parameters.

Choudhary, Alok Nidhi↗

An implementation plan for priorities in solar-system space physics

The scientific objectives and implementation plans and priorities of the Space Science Board in areas of solar physics, heliospheric physics, magnetospheric physics, upper atmosphere physics, solar-terrestrial coupling, and comparative planetary studies are discussed and recommended programs are summarized. Accomplishments of Skylab, Solar Maximum Mission, Nimbus-7, and 11 other programs are highlighted. Detailed mission plans in areas of solar and heliospheric physics, plasma physics, and upper atmospheric physics are also described.

Krimigis, Stamatios M.↗

Determination of the implementation of the 3-axis attitude motion simulator digital position controller

The digital position controller implemented in the control computer of the 3-axis attitude motion simulator is mathematically reconstructed and documented, since the information supplied with the executable code of this controller was insufficient to make substantial modifications to it. Also developed were methodologies to introduce changes in the controller which do not require rewriting the software. Finally, recommendations are made on possible improvement to the control system performance.

Magana, Mario E.↗

Implementation of generalized optimality criteria in a multidisciplinary environment

A generalized optimality criterion method consisting of a dual problem solver combined with a compound scaling algorithm was implemented in the multidisciplinary design tool, ASTROS. This method enables, for the first time in a production design tool, the determination of a minimum weight design using thousands of independent structural design variables while simultaneously considering constraints on response quantities in several disciplines. Even for moderately large examples, the computational efficiency is improved significantly relative to the conventional approach.

Canfield, R. A.↗

Strategic implementation plan

The Life Science Division of the NASA Office of Space Science and Applications (OSSA) describes its plans for assuring the health, safety, and productivity of astronauts in space, and its plans for acquiring further fundamental scientific knowledge concerning space life sciences. This strategic implementation plan details OSSA's goals, objectives, and planned initiatives. The following areas of interest are identified: operational medicine; biomedical research; space biology; exobiology; biospheric research; controlled ecological life support; flight programs and advance technology development; the life sciences educational program; and earth benefits from space life sciences.

Source record↗

A few modeling and rendering techniques for computer graphics and their implementation on ultra hardware

Ultra network is a recently installed very high speed graphic hardware at NASA Langley Research Center. The Ultra Network interfaced to Voyager through its HSX channel is capable of transmitting up to 800 million bits of information per second. It is capable of displaying fifteen to twenty frames of precomputed images of size 1024 x 2368 with 24 bits of color information per pixel per second. Modeling and rendering techniques are being developed in computer graphics and implemented on Ultra hardware. A ray tracer is being developed for use at the Flight Software and Graphic branch. Changes were made to make the ray tracer compatible with Voyager.

Bidasaria, Hari↗

The implementation of the graphics of program EAGLE: A numerical grid generation code on NASA Langley SNS computer system

Program EAGLE (Eglin Arbitrary Geometry Implicit Euler) Numerical Grid Generation System is a composite (multi-block) algebraic or elliptic grid generation system designed to discretize the domain in and/or around any arbitrarily shaped three dimensional regions. This system combines a boundary conforming surface generation scheme and includes plotting routines designed to take full advantage of the DISSPLA Graphics Package (Version 9.0). Program EAGLE is written to compile and execute efficiently on any Cray machine with or without solid state disk (SSD) devices. Also, the code uses namelist inputs which are supported by all Cray machines using the FORTRAN compiler CFT77. The namelist inputs makes it easier for the user to understand the inputs and operation of Program EAGLE. EAGLE's numerical grid generator is constructed in the following form: main program, EGG (executive routine); subroutine SURFAC (surface generation routine); subroutine GRID (grid generation routine); and subroutine GRDPLOT (grid plotting routines). The EAGLE code was modified to use on the NASA-LaRC SNS computer (Cray 2S) system. During the modification a conversion program was developed for the output data of EAGLE's subroutine GRID to permit the data to be graphically displayed by IRIS workstations, using Plot3D. The code of program EAGLE was modified to make operational subroutine GRDPLOT (using DI-3000 Graphics Software Packages) on the NASA-LaRC SNS Computer System. How to implement graphically, the output data of subroutine GRID was determined on any NASA-LaRC graphics terminal that has access to the SNS Computer System DI-300 Graphics Software Packages. A Quick Reference User Guide was developed for the use of program EAGLE on the NASA-LaRC SNS Computer System. One or more application program(s) was illustrated using program EAGLE on the NASA LaRC SNS Computer System, with emphasis on graphics illustrations.

Houston, Johnny L.↗

Kinematically redundant arm formulations for coordinated multiple arm implementations

Although control laws for kinematically redundant robotic arms were presented as early as 1969, redundant arms have only recently become recognized as viable solutions to limitations inherent to kinematically sufficient arms. The advantages of run-time control optimization and arm reconfiguration are becoming increasingly attractive as the complexity and criticality of robotic systems continues to progress. A generalized control law for a spatial arm with 7 or more degrees of freedom (DOF) based on Whitney's resolved rate formulation is given. Results from a simulation implementation utilizing this control law are presented. Furthermore, results from a two arm simulation are presented to demonstrate the coordinated control of multiple arms using this formulation.

Robert W Bailey↗

Implementation of Sensor and Control Designs for Bioregenerative Systems

The goal of the Spring 1990 EGM 4001 Design class was to design, fabricate, and test sensors and control systems for a closed loop life support system (CLLSS). The designs investigated were to contribute to the development of NASA's Controlled Ecological Life Support System (CELSS) at Kennedy Space Center (KSC). Designs included a seed moisture content sensor, a porous medium wetness sensor, a plant health sensor, and a neural network control system. The seed group focused on the design and implementation of a sensor that could detect the moisture content of a seed batch. The porous medium wetness group concentrated on the development of a sensor to monitor the amount of nutrient solution within a porous plate incorporating either infrared reflectance or thermal conductance properties. The plant health group examined the possibility of remotely monitoring the health of the plants within the Biomass Production Chamber (BPC) using infrared reflectance properties. Finally, the neural network group concentrated on the ability to use parallel processing in order to control a robot arm and analyze the data from the health sensor to detect regions of a plant.

Rodriguez, Pedro R.↗

Analysis of Microstrip Lines with Alternative Implementation of Conductors and Superconductors

An analysis of microstrip line structures in which either the strip or the ground plane or both are made of a high Tc superconductor is presented. The effect of implementation of a superconductor to the strip and the ground plane is explained with the calculation of a conductor loss of the structure by the Phenomenological Loss Equivalence Method (PEM). The theoretical values are compared with the experimental results from a ring resonator which is made of a gold ground plane and a high Tc superconductor, YBa2Cu3O(7-x), strip.

Kong, K.-S.↗

Implementation and design of a teleoperation system based on a VMEBUS/68020 pipelined architecture

A pipelined control design and architecture for a force-feedback teleoperation system that is being implemented at the Jet Propulsion Laboratory and which will be integrated with the autonomous portion of the testbed to achieve share control is described. At the local site, the operator sees real-time force/torque displays and moves two 6-degree of freedom (dof) force-reflecting hand-controllers as his hands feel the contact force/torques generated at the remote site where the robots interact with the environment. He also uses a graphical user menu to monitor robot states and specify system options. The teleoperation software is written in the C language and runs on MC68020-based processor boards in the VME chassis, which utilizes a real-time operating system; the hardware is configured to realize a four-stage pipeline configuration. The environment is very flexible, such that the system can easily be configured as a stand-alone facility for performing independent research in human factors, force control, and time-delayed systems.

Lee, Thomas S.↗

Manufacturing implementation of off-line programming for the Space Shuttle Main Engines

An account is given of the efforts made to implement an off-line programming (OLP) system for a gas tungsten arc welding robot in actual manufacturing operations, namely those involved in the manufacture of the SSMEs. In conjunction with a real-time sensor control system, the OLP constitutes the Advanced Robotic Welding System, or 'AROWS'. OLP's task is to develop a robot-motion path without the initial use of the robot to 'teach' the characteristics of such motion; actual process parameters are recorded by OLP and correlated with the position along the weld.

Sliwinski, K. E.↗

Computer implementation of analysis and optimization procedures for control-structure interaction problems

Implementation aspects of control-structure interaction analysis and optimization by the staggered use of single-discipline analysis modules are discussed. The single-discipline modules include structural analysis, controller synthesis and optimization. The software modularity is maintained by employing a partitioned control-structure interaction analysis procedure, thus avoiding the need for embedding the single-discipline modules into a monolithic program. A software testbed has been constructed as a stand-alone analysis and optimization program and tested for its versatility and software modularity by applying it to the dynamic analysis and preliminary design of a prototype Earth Pointing Satellite. Experience with the in-core testbed program so far demonstrates that the testbed is efficient, preserves software modularity, and enables the analyst to choose a different set of algorithms, control strategies and design parameters via user software interfaces. Thus, the present software architecture is recommended for adoption by control-structure interaction analysts as a preliminary analysis and design tool.

Belvin, W. Keith↗

Neural network implementations of data association algorithms for sensor fusion

The paper is concerned with locating a time varying set of entities in a fixed field when the entities are sensed at discrete time instances. At a given time instant a collection of bivariate Gaussian sensor reports is produced, and these reports estimate the location of a subset of the entities present in the field. A database of reports is maintained, which ideally should contain one report for each entity sensed. Whenever a collection of sensor reports is received, the database must be updated to reflect the new information. This updating requires association processing between the database reports and the new sensor reports to determine which pairs of sensor and database reports correspond to the same entity. Algorithms for performing this association processing are presented. Neural network implementation of the algorithms, along with simulation results comparing the approaches are provided.

Brown, Donald E.↗

Load balancing and task decomposition techniques for parallel implementation of integrated vision systems algorithms

Several techniques are presented to perform static and dynamic load balancing schemes for integrated vision systems. These techniques are novel in the sense that they capture the computational requirements of a task by examining the data when they are produced. Furthermore, they can be applied to many integrated vision systems because many algorithms in different systems are either the same or have similar computational characteristics. These techniques are evaluated by applying them to the algorithms in a motion estimation system. It is shown that the performance gains when these techniques are used are significant and the overhead of using these techniques is minimal. The performance is evaluated by implementing the algorithms using the presented techniques on a hypercube multiprocessor system.

Choudhary, Alok N.↗

The mGA1.0: A common LISP implementation of a messy genetic algorithm

Genetic algorithms (GAs) are finding increased application in difficult search, optimization, and machine learning problems in science and engineering. Increasing demands are being placed on algorithm performance, and the remaining challenges of genetic algorithm theory and practice are becoming increasingly unavoidable. Perhaps the most difficult of these challenges is the so-called linkage problem. Messy GAs were created to overcome the linkage problem of simple genetic algorithms by combining variable-length strings, gene expression, messy operators, and a nonhomogeneous phasing of evolutionary processing. Results on a number of difficult deceptive test functions are encouraging with the mGA always finding global optima in a polynomial number of function evaluations. Theoretical and empirical studies are continuing, and a first version of a messy GA is ready for testing by others. A Common LISP implementation called mGA1.0 is documented and related to the basic principles and operators developed by Goldberg et. al. (1989, 1990). Although the code was prepared with care, it is not a general-purpose code, only a research version. Important data structures and global variations are described. Thereafter brief function descriptions are given, and sample input data are presented together with sample program output. A source listing with comments is also included.

Goldberg, David E.↗

Storage management in Ada. Three reports. Volume 1: Storage management in Ada as a risk to the development of reliable software. Volume 2: Relevant aspects of language. Volume 3: Requirements of the language versus manifestations of current implementations

The risk to the development of program reliability is derived from the use of a new language and from the potential use of new storage management techniques. With Ada and associated support software, there is a lack of established guidelines and procedures, drawn from experience and common usage, which assume reliable behavior. The risk is identified and clarified. In order to provide a framework for future consideration of dynamic storage management on Ada, a description of the relevant aspects of the language is presented in two sections: Program data sources, and declaration and allocation in Ada. Storage-management characteristics of the Ada language and storage-management characteristics of Ada implementations are differentiated. Terms that are used are defined in a narrow and precise sense. The storage-management implications of the Ada language are described. The storage-management options available to the Ada implementor and the implications of the implementor's choice for the Ada programmer are also described.

Auty, David↗

Model checking for linear temporal logic: An efficient implementation

This report provides evidence to support the claim that model checking for linear temporal logic (LTL) is practically efficient. Two implementations of a linear temporal logic model checker is described. One is based on transforming the model checking problem into a satisfiability problem; the other checks an LTL formula for a finite model by computing the cross-product of the finite state transition graph of the program with a structure containing all possible models for the property. An experiment was done with a set of mutual exclusion algorithms and tested safety and liveness under fairness for these algorithms.

Sherman, Rivi↗