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 343 records · Page 19

Documentation for the machine-readable version of the Perth 75: A Catalogue of Positions of 2589 FK4 and FK4S Stars (Nikoloff and Hog 1982)

Detailed descriptions of the data and format of the machine-readable astronomical catalog are given. The machine version is identical in data content to the published edition, but minor modifications in the data format were made in order to effect uniformity with machine versions of other astronomical catalogs. Stellar motions and positions at epoch and equinox 1950.0 are reported.

Warren, W. H., Jr.↗

Rotating Drive for Electrical-Arc Machining

Rotating drive improves quality of holes made by electrical-arc machining. Mechanism (Uni-tek, rotary head, or equivalent) attached to electrical-arc system. Drive rotates electrode as though it were mechanical drill, while an arc disintegrates metal in workpiece, thereby creating hole. Rotating electrode method often used in electric-discharge machining. NASA innovation is application of technique to electrical-arc machining.

Fransen, C. D.↗

Hydraulic Fatigue-Testing Machine

Fatigue-testing machine applies fluctuating tension to number of specimens at same time. When sample breaks, machine continues to test remaining specimens. Series of tensile tests needed to determine fatigue properties of materials performed more rapidly than in conventional fatigue-testing machine.

Hodo, James D.↗

Automatic Inspection During Machining

In experimental manufacturing process, numerically-controlled machine tool temporarily converts into inspection machine by installing electronic touch probes and specially-developed numerical-control software. Software drives probes in paths to and on newly machined parts and collects data on dimensions of parts.

Ransom, Clyde L.↗

Holding Irregularly Shaped Parts For Machining

Part with complicated, irregular outside contours clamped for precise machining of internal passages with aid of simple method. Exterior of part cast in Rigidex, or equivalent epoxy. Forms wall to be clamped. Interior of part machined to finish of 125 microinches or finer. When machining finished, epoxy melted away by heating part to 200 degree F.

Hilton, Burt W.↗

Machining Thin-Walled Cylindrical Parts

Cylindrical walls only few thousandths of inch thick machined accurately and without tears or punctures with aid of beryllium copper mandrel. Chilled so it contracts, then inserted in cylinder. As comes to room temperature, mandrel expands and fits snugly inside cylinder. Will not allow part to slide and provides solid backup to prevent deflection when part machined by grinding wheel. When machining finished, cylinder-and-mandrel assembly inserted in dry ice, mandrel contracts and removed from part.

Cimbak, Joe↗

Machine vision for real time orbital operations

Machine vision for automation and robotic operation of Space Station era systems has the potential for increasing the efficiency of orbital servicing, repair, assembly and docking tasks. A machine vision research project is described in which a TV camera is used for inputing visual data to a computer so that image processing may be achieved for real time control of these orbital operations. A technique has resulted from this research which reduces computer memory requirements and greatly increases typical computational speed such that it has the potential for development into a real time orbital machine vision system. This technique is called AI BOSS (Analysis of Images by Box Scan and Syntax).

Vinz, Frank L.↗

Fabrication, evaluation, and performance of machined metal grazing incidence telescopes

The fabrication, evaluation, and performance of machined grazing incidence metal optics for applications ranging from telescopes with imaging of minutes of arc to those with imaging in the less-than-10-arcsec range are reviewed. Issues considered in the fabrication process include the choice of machining substrate, the choice of machine tool, the choice of method for removing tool marks, and the choice of a reflective surface. Means of evaluating the mirror performance include the FWHM and determination of noncircularity and surface roughness. Characteristics of previous and current grazing incidence metal mirrors are presented, with emphasis on the Einstein and Rosat optics.

Bowyer, Stuart↗

Characterization of robotics parallel algorithms and mapping onto a reconfigurable SIMD machine

The kinematics, dynamics, Jacobian, and their corresponding inverse computations are six essential problems in the control of robot manipulators. Efficient parallel algorithms for these computations are discussed and analyzed. Their characteristics are identified and a scheme on the mapping of these algorithms to a reconfigurable parallel architecture is presented. Based on the characteristics including type of parallelism, degree of parallelism, uniformity of the operations, fundamental operations, data dependencies, and communication requirement, it is shown that most of the algorithms for robotic computations possess highly regular properties and some common structures, especially the linear recursive structure. Moreover, they are well-suited to be implemented on a single-instruction-stream multiple-data-stream (SIMD) computer with reconfigurable interconnection network. The model of a reconfigurable dual network SIMD machine with internal direct feedback is introduced. A systematic procedure internal direct feedback is introduced. A systematic procedure to map these computations to the proposed machine is presented. A new scheduling problem for SIMD machines is investigated and a heuristic algorithm, called neighborhood scheduling, that reorders the processing sequence of subtasks to reduce the communication time is described. Mapping results of a benchmark algorithm are illustrated and discussed.

Lee, C. S. G.↗

Design of a Versatile, Teleoperable, Towable Lifting Machine with Robotic Capabilities for Use in Nasa's Lunar Base Operations

The lifting machine will assist in lifting cargo off of landers sent to the Moon and in the construction of a lunar base. Three possible designs were considered for the overall configuration of the lifting machine: the variable angle crane, the tower crane, and the gantry crane. Alternate designs were developed for the major components of the lifting machine. A teleoperable, variable angle crane was chosen as its final design. The design consists of a telescoping boom mounted to a chassis that is supported by two conical wheels for towing and four outriggers for stability. Attached to the end of the boom is a seven degree of freedom robot arm for light, dexterous, lifting operations. A cable and hook suspends from the end of the boom for heavy, gross, lifting operations. Approximate structural sizes were determined for the lifter and its components. However, further analysis is needed to determine the optimum design dimensions. The design team also constructed a model of the design which demonstrates its features and operating principals.

Harris, Elizabeth↗

A discrepancy within primate spatial vision and its bearing on the definition of edge detection processes in machine vision

The visual perception of form information is considered to be based on the functioning of simple and complex neurons in the primate striate cortex. However, a review of the physiological data on these brain cells cannot be harmonized with either the perceptual spatial frequency performance of primates or the performance which is necessary for form perception in humans. This discrepancy together with recent interest in cortical-like and perceptual-like processing in image coding and machine vision prompted a series of image processing experiments intended to provide some definition of the selection of image operators. The experiments were aimed at determining operators which could be used to detect edges in a computational manner consistent with the visual perception of structure in images. Fundamental issues were the selection of size (peak spatial frequency) and circular versus oriented operators (or some combination). In a previous study, circular difference-of-Gaussian (DOG) operators, with peak spatial frequency responses at about 11 and 33 cyc/deg were found to capture the primary structural information in images. Here larger scale circular DOG operators were explored and led to severe loss of image structure and introduced spatial dislocations (due to blur) in structure which is not consistent with visual perception. Orientation sensitive operators (akin to one class of simple cortical neurons) introduced ambiguities of edge extent regardless of the scale of the operator. For machine vision schemes which are functionally similar to natural vision form perception, two circularly symmetric very high spatial frequency channels appear to be necessary and sufficient for a wide range of natural images. Such a machine vision scheme is most similar to the physiological performance of the primate lateral geniculate nucleus rather than the striate cortex.

Jobson, Daniel J.↗

Fifth Fundamental Catalogue (FK5). Part 1: Basic fundamental stars (Fricke, Schwan, and Lederle 1988): 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 Basic FK5 provides improved mean positions and proper motions for the 1535 classical fundamental stars that had been included in the FK3 and FK4 catalogs. The machine version of the catalog contains the positions and proper motions of the Basic FK5 stars for the epochs and equinoxes J2000.0 and B1950.0, the mean epochs of individual observed right ascensions and declinations used to determine the final positions, and the mean errors of the final positions and proper motions for the reported epochs. The cross identifications to other designations used for the FK5 stars that are given in the published catalog were not included in the original machine versions, but the Durchmusterung numbers have been added at the Astronomical Data Center.

Warren, Wayne H., Jr.↗

Southern Durchmusterung (Schoenfeld 1886): 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 Southern Durchmusterung (SD) was computerized at the Centre de Donnees Astronomiques de Strasbourg and at the Astronomical Data Center at the National Space Science Data Center, NASA/Goddard Space Flight Center. Corrigenda listed in the original SD volume and published by Kuenster and Sticker were incorporated into the machine file. In addition, one star indicated to be missing in a published list, and later verified, is flagged so that it 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. This catalog covers the zones -02 to -23 degrees; zones +89 to -01 degrees (the Bonner Durchmusterung) are included in a separate catalog available in machine-readable form.

Warren, Wayne H., Jr.↗

Line-drawing algorithms for parallel machines

The fact that conventional line-drawing algorithms, when applied directly on parallel machines, can lead to very inefficient codes is addressed. It is suggested that instead of modifying an existing algorithm for a parallel machine, a more efficient implementation can be produced by going back to the invariants in the definition. Popular line-drawing algorithms are compared with two alternatives; distance to a line (a point is on the line if sufficiently close to it) and intersection with a line (a point on the line if an intersection point). For massively parallel single-instruction-multiple-data (SIMD) machines (with thousands of processors and up), the alternatives provide viable line-drawing algorithms. Because of the pixel-per-processor mapping, their performance is independent of the line length and orientation.

Pang, Alex T.↗

Operating System For Numerically Controlled Milling Machine

OPMILL program is operating system for Kearney and Trecker milling machine providing fast easy way to program manufacture of machine parts with IBM-compatible personal computer. Gives machinist "equation plotter" feature, which plots equations that define movements and converts equations to milling-machine-controlling program moving cutter along defined path. System includes tool-manager software handling up to 25 tools and automatically adjusts to account for each tool. Developed on IBM PS/2 computer running DOS 3.3 with 1 MB of random-access memory.

Ray, R. B.↗

Speed-Selector Guard For Machine Tool

Simple guardplate prevents accidental reversal of direction of rotation or sudden change of speed of lathe, milling machine, or other machine tool. Custom-made for specific machine and control settings. Allows control lever to be placed at only one setting. Operator uses handle to slide guard to engage or disengage control lever. Protects personnel from injury and equipment from damage occurring if speed- or direction-control lever inadvertently placed in wrong position.

Shakhshir, Roda J.↗

The paradigm compiler: Mapping a functional language for the connection machine

The Paradigm Compiler implements a new approach to compiling programs written in high level languages for execution on highly parallel computers. The general approach is to identify the principal data structures constructed by the program and to map these structures onto the processing elements of the target machine. The mapping is chosen to maximize performance as determined through compile time global analysis of the source program. The source language is Sisal, a functional language designed for scientific computations, and the target language is Paris, the published low level interface to the Connection Machine. The data structures considered are multidimensional arrays whose dimensions are known at compile time. Computations that build such arrays usually offer opportunities for highly parallel execution; they are data parallel. The Connection Machine is an attractive target for these computations, and the parallel for construct of the Sisal language is a convenient high level notation for data parallel algorithms. The principles and organization of the Paradigm Compiler are discussed.

Dennis, Jack B.↗

User's manual for tooth contact analysis of face-milled spiral bevel gears with given machine-tool settings

Research was performed to develop a computer program that will: (1) simulate the meshing and bearing contact for face milled spiral beval gears with given machine tool settings; and (2) to obtain the output, some of the data is required for hydrodynamic analysis. It is assumed that the machine tool settings and the blank data will be taken from the Gleason summaries. The theoretical aspects of the program are based on 'Local Synthesis and Tooth Contact Analysis of Face Mill Milled Spiral Bevel Gears'. The difference between the computer programs developed herein and the other one is as follows: (1) the mean contact point of tooth surfaces for gears with given machine tool settings must be determined iteratively, while parameters (H and V) are changed (H represents displacement along the pinion axis, V represents the gear displacement that is perpendicular to the plane drawn through the axes of the pinion and the gear of their initial positions), this means that when V differs from zero, the axis of the pionion and the gear are crossed but not intersected; (2) in addition to the regular output data (transmission errors and bearing contact), the new computer program provides information about the contacting force for each contact point and the sliding and the so-called rolling velocity. The following topics are covered: (1) instructions for the users as to how to insert the input data; (2) explanations regarding the output data; (3) numerical example; and (4) listing of the program.

Litvin, Faydor L.↗