Search NASA⌕ Search

SEARCH · Search NASA

Results for “Machine”

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 739 records · Page 41

Dynamic task allocation for a man-machine symbiotic system

This report presents a methodological approach to the dynamic allocation of tasks in a man-machine symbiotic system in the context of dexterous manipulation and teleoperation. This report addresses a symbiotic system containing two symbiotic partners which work toward controlling a single manipulator arm for the execution of a series of sequential manipulation tasks. It is proposed that an automated task allocator use knowledge about the constraints/criteria of the problem, the available resources, the tasks to be performed, and the environment to dynamically allocate task recommendations for the man and the machine. The presentation of the methodology includes discussions concerning the interaction of the knowledge areas, the flow of control, the necessary communication links, and the replanning of the task allocation. Examples of task allocation are presented to illustrate the results of this methodolgy.

Parker, L. E.↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Crowley, Kay↗

Implementing nested conditional statements in SIMD machines

Single instruction, multiple data (SIMD) computers consist of a very large number of processors executing a common sequence of instructions. Maintaining the full speedup potential of such machines is most sensitive to conditional execution in their programs, regions of code where some processing elements (PEs) perform no useful work. Techniques are presented for efficiently implementing nested conditional statements, specifically if and case statements, in SIMD machines, while adding minimal specialized hardware.

Middleton, David↗

Effect of milling machine roughness and wing dihedral on the supersonic aerodynamic characteristics of a highly swept wing

An experimental investigation was conducted to assess the effect of surface finish on the longitudinal and lateral aerodynamic characteristics of a highly-swept wing at supersonic speeds. A study of the effects of wing dihedral was also made. Included in the tests were four wing models: three models having 22.5 degrees of outboard dihedral, identical except for surface finish, and a zero-dihedral, smooth model of the same planform for reference. Of the three dihedral models, two were taken directly from the milling machine without smoothing: one having a maximum scallop height of 0.002 inches and the other a maximum scallop height of 0.005 inches. The third dihedral model was handfinished to a smooth surface. Tests were conducted in Test Section 1 of the Unitary Plan Wind Tunnel at NASA-Langley over a range of Mach numbers from 1.8 to 2.8, a range of angle of attack from -5 to 8 degrees, and at a Reynolds numbers per foot of 2 x 10(6). Selected data were also taken at a Reynolds number per foot of 6 x 10(6). Drag coefficient increases, with corresponding lift-drag ratio decreases were the primary aerodynamic effects attributed to increased surface roughness due to milling machine grooves. These drag and lift-drag ratio increments due to roughness increased as Reynolds number increased.

Darden, Christine M.↗

Kanerva's sparse distributed memory: An associative memory algorithm well-suited to the Connection Machine

The advent of the Connection Machine profoundly changes the world of supercomputers. The highly nontraditional architecture makes possible the exploration of algorithms that were impractical for standard Von Neumann architectures. Sparse distributed memory (SDM) is an example of such an algorithm. Sparse distributed memory is a particularly simple and elegant formulation for an associative memory. The foundations for sparse distributed memory are described, and some simple examples of using the memory are presented. The relationship of sparse distributed memory to three important computational systems is shown: random-access memory, neural networks, and the cerebellum of the brain. Finally, the implementation of the algorithm for sparse distributed memory on the Connection Machine is discussed.

Rogers, David↗

Man-machine interface issues in space telerobotics: A JPL research and development program

Technology issues related to the use of robots as man-extension or telerobot systems in space are discussed and exemplified. General considerations are presentd on control and information problems in space teleoperation and on the characteristics of Earth orbital teleoperation. The JPL R and D work in the area of man-machine interface devices and techniques for sensing and computer-based control is briefly summarized. The thrust of this R and D effort is to render space teleoperation efficient and safe through the use of devices and techniques which will permit integrated and task-level (intelligent) two-way control communication between human operator and telerobot machine in Earth orbit. Specific control and information display devices and techniques are discussed and exemplified with development results obtained at JPL in recent years.

Bejczy, A. K.↗

Use of maximum entropy method with parallel processing machine

The maximum entropy method (MEM) and balanced correlation method were used to reconstruct the images of low-intensity X-ray objects obtained experimentally by means of a uniformly redundant array coded aperture system. The reconstructed images from MEM are clearly superior. However, the MEM algorithm is computationally more time-consuming because of its iterative nature. On the other hand, both the inherently two-dimensional character of images and the iterative computations of MEM suggest the use of parallel processing machines. Accordingly, computations were carried out on the massively parallel processor at Goddard Space Flight Center as well as on the serial processing machine VAX 8600, and the results are compared.

Yin, Lo I.↗

Aeromechanics and man-machine integration technology opportunities for rotorcraft of the 1990s and beyond

Programs related to rotorcraft aeromechanics and man-machine integration are discussed which will support advanced army rotorcraft design. In aeromechanics, recent advances in computational fluid dynamics will be used to characterize the complex unsteady flowfields of rotorcraft, and a second-generation comprehensive helicopter analysis system will be used along with models of aerodynamics, engines, and control systems to study the structural dynamics of rotor/body configurations. The man-machine integration program includes the development of advanced cockpit design technology and the evaluation of cockpit and mission equipment concepts in a real-time full-combat environment.

Kerr, Andrew W.↗

A fatigue study of electrical discharge machine (EDM) strain-gage balance materials

A fatigue study was undertaken to determine how much electrical-discharge-machine (EDM) processing affected the fatigue life of balance materials: EDM and regular milling-machine (MM) samples were compared. Simulation of a typical balance stress configuration was devised for the fatigue testing in order to obtain results more closely related to balance situations. The fatigue testing of the EDM and MM specimens has indicated that the EDM technique does indeed reduce the fatigue life of 15-5PH steel, the first balance material tested. This conclusion was based on comparisons of the specimen fatigue lives with theoretical and manufacturer's data. Hence the EDM surface effects are detrimental to the fatigue life of this balance material.

Rhew, Ray D.↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Saltz, Joel↗

Reliability analysis in intelligent machines

Given an explicit task to be executed, an intelligent machine must be able to find the probability of success, or reliability, of alternative control and sensing strategies. By using concepts for information theory and reliability theory, new techniques for finding the reliability corresponding to alternative subsets of control and sensing strategies are proposed such that a desired set of specifications can be satisfied. The analysis is straightforward, provided that a set of Gaussian random state variables is available. An example problem illustrates the technique, and general reliability results are presented for visual servoing with a computed torque-control algorithm. Moreover, the example illustrates the principle of increasing precision with decreasing intelligence at the execution level of an intelligent machine.

Mcinroy, John E.↗

Electrical-Discharge Machining With Additional Axis

Proposed electrical-discharge-machining (EDM) apparatus uses moveable vertical wire as electrode. Wire positionable horizontally along one axis as it slides vertically past workpiece. Workpiece indexed in rotation about horizontal axis. Because of symmetry of parts, process used to make two such parts at a time by defining boundary between them. Advantages: cost of material reduced, imparts less residual stress to workpiece, and less time spent machining each part when parts produced in such symmetrical pairs.

Malinzak, Roger M.↗

One- and two-dimensional Stirling machine simulation using experimentally generated flow turbulence models

Investigations of one- and two-dimensional (1- or 2-D) simulations of Stirling machines centered around experimental data generated by the U. of Minnesota Mechanical Engineering Test Rig (METR) are covered. This rig was used to investigate oscillating flows about a zero mean with emphasis on laminar/turbulent flow transitions in tubes. The Space Power Demonstrator Engine (SPDE) and in particular, its heater, were the subjects of the simulations. The heater was treated as a 1- or 2-D entity in an otherwise 1-D system. The 2-D flow effects impacted the transient flow predictions in the heater itself but did not have a major impact on overall system performance. Information propagation effects may be a significant issue in the simulation (if not the performance) of high-frequency, high-pressure Stirling machines. This was investigated further by comparing a simulation against an experimentally validated analytic solution for the fluid dynamics of a transmission line. The applicability of the pressure-linking algorithm for compressible flows may be limited by characteristic number (defined as flow path information traverses per cycle); this warrants further study. Lastly the METR was simulated in 1- and 2-D. A two-parameter k-w foldback function turbulence model was developed and tested against a limited set of METR experimental data.

Goldberg, Louis F.↗

Bonner Durchmusterung (Argelander 1859-1862): Documentation for the machine-readable version

The machine-readable version of the catalog, as it is currently being distributed from the Astronomical Data Center, is described. The entire Bonner Durchmusterung (BD) was computerized through the collaborative efforts of the Centre de Donnees Astronomiques de Strasbourg, l'Observatoire de Nice, and the Astronomical Data Center at the NASA/Goddard Space Flight Center. All corrigenda published in the original BD volumes were incorporated into the machine file, along with changes published following the 1903 edition. In addition, stars indicated to be missing in published lists and verified by various techniques are flagged so that they can be omitted from computer plotted charts if desired. Stars deleted in the various errata lists were similarly flagged, while those with revised data are flagged and listed in a separate table.

Warren, Wayne H., Jr.↗

A search for ultraviolet-excess objects (Kondo, Noguchi, and Maehara 1984): Documentation for the machine-readable version

A list of 1186 ultraviolet-excess objects (designated KUV) was compiled as a result of a search conducted with the 105-cm Schmidt telescope of the Kiso station of the Tokyo Astronomical Observatory. This document describes the machine readable version of the KUV survey list and presents a sample listing showing the logical records as they are recorded in the machine readable catalog. The KUV data include equatorial coordinates, magnitudes, color indices, and identifications for previously cataloged objects.

Warren, Wayne H., Jr.↗

A catalog of selected compact radio sources for the construction of an extragalactic radio/optical reference frame (Argue et al. 1984): Documentation for the machine-readable version

This document describes the machine readable version of the Selected Compact Radio Source Catalog as it is currently being distributed from the international network of astronomical data centers. It is intended to enable users to read and process the computerized catalog. The catalog contains 233 strong, compact extragalactic radio sources having identified optical counterparts. The machine version contains the same data as the published catalog and includes source identifications, equatorial positions at J2000.0 and their mean errors, object classifications, visual magnitudes, redshift, 5-GHz flux densities, and comments.

Source record↗

An assessment of the connection machine

The CM-2 is an example of a connection machine. The strengths and problems of this implementation are considered as well as important issues in the architecture and programming environment of connection machines in general. These are contrasted to the same issues in Multiple Instruction/Multiple Data (MIMD) microprocessors and multicomputers.

Schreiber, Robert↗

Sequence-invariant state machines

A synthesis method and an MOS VLSI architecture are presented to realize sequential circuits that have the ability to implement any state machine having N states and m inputs, regardless of the actual sequence specified in the flow table. The design method utilizes binary tree structured (BTS) logic to implement regular and dense circuits. The desired state sequence can be hardwired with power supply connections or can be dynamically reallocated if stored in a register. This allows programmable VLSI controllers to be designed with a compact size and performance approaching that of dedicated logic. Results of ICV implementations are reported and an example sequence-invariant state machine is contrasted with implementations based on traditional methods.

Whitaker, Sterling R.↗