Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “coordinate computing”

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 289 records · Page 16

Numerical grid generation; Proceedings of the Symposium on Numerical Generation of Curvilinear Coordinate Systems and Their Use in the Numerical Solution of Partial Differential Equations, Nashville, TN, April 13-16, 1982

General curvilinear coordinate systems are considered along with the error induced by coordinate systems, basic differential models for coordinate generation, elliptic grid generation, conformal grid generation, algebraic grid generation, orthogonal grid generation, patched coordinate systems, and solid mechanics applications of boundary fitted coordinate systems. Attention is given to coordinate system control and adaptive meshes, the application of body conforming curvilinear grids for finite difference solution of external flow, the use of solution adaptive grids in solving partial differential equations, adaptive gridding for finite difference solutions to heat and mass transfer problems, and the application of curvilinear coordinate generation techniques to the computation of internal flows. Other topics explored are related to the solution of nonlinear water wave problems using boundary-fitted coordinate systems, the numerical modeling of estuarine hydrodynamics on a boundary-fitted coordinate system, and conformal grid generation for multielement airfoils.

Thompson, J. F.↗

A computer system to analyze showers in nuclear emulsions: Center Director's discretionary fund report

A system to rapidly digitize data from showers in nuclear emulsions is described. A TV camera views the emulsions though a microscope. The TV output is superimposed on the monitor of a minicomputer. The operator uses the computer's graphics capability to mark the positions of particle tracks. The coordinates of each track are stored on a disk. The computer then predicts the coordinates of each track through successive layers of emulsion. The operator, guided by the predictions, thus tracks and stores the development of the shower. The system provides a significant improvement over purely manual methods of recording shower development in nuclear emulsion stacks.

Meegan, C. A.↗

IMP F and G phase 1 magnetic field analysis

The program developed to analyze magnetic field data from the magnetic field experiment flown in IMP F is reported. The analysis converts the raw X, Y, Z sensor data as received on the magnetic field experiment tape into vector measurements of the ambient magnetic field observed by the experiment. These data are computed for four frames of reference -- apparent, payload, solar ecliptic and solar magnetospheric. In addition 20.45 second statistics are computed for the last three coordinate systems. Finally, a summary tape is produced containing detailed data and sequence statistics as well as the output from the autocorrelation computer, trajectory data and identification information.

Mish, W. H.↗

Shared Activity Coordination

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently reach consensus in real time. We briefly describe a largely unexplored class of real-time, distributed planning problems (inspired by interacting spacecraft missions), new challenges they pose, and a general approach to solving the problems. These problems involve self-interested agents that have infrequent communication but collaborate on joint activities. We describe a Shared Activity Coordination (SHAC) framework that provides a decentralized algorithm for negotiating the scheduling of shared activities in a dynamic environment, a soft, real-time approach to reaching consensus during execution with limited communication, and a foundation for customizing protocols for negotiating planner interactions. We apply SHAC to a realistic simulation of interacting Mars missions and illustrate the simplicity of protocol development.

coordination↗

The piecewise-parabolic method in curvilinear coordinates

We derive interpolation formulae for a third-order finite difference method in curvilinear, orthogonal coordinate systems. These formulae serve as a supplement to Colella and Woodward's PPM scheme for problems where the coordinate origin is included in the computational domain. Numerical examples of the improved accuracy of the advection scheme near coordinate singularities are shown.

Blondin, John M.↗

Continual coordination of shared activities

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. For domains with varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently achieve their goals. ShAC (Shared Activity Coordination) is a framework for designing coordination protocols and an algorithm for continually coordinating agents using these protocols during execution. We show how a variety of protocols can be constructed using this framework and describe how ShAC coordinates two rovers and an orbiter in a simulated Mars scenario.

multiple agents coordination planning scheduling M↗

Continual coordination through shared activities

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently reach consensus in real time. We briefly describe a largely unexplored class of realtime, distributed planning problems (inspired by interacting spacecraft missions), new challenges they pose, and a general approach to solving the problems. These problems involve self-interested agents that have infrequent communication but collaborate on joint activities. We describe a Shared Activity Coordination (SHAC) framework that provides a decentralized algorithm for negotiating the scheduling of shared activities over the lifetimes of separate missions, a soft, real-time approach to reaching consensus during execution with limited communication, and a foundation for customizing protocols for negotiating planner interactions. We apply SHAC to a realistic simulation of interacting Mars missions and illustrate the simplicity of protocol development.

planning↗

Continual coordination of spacecraft through shared activities

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently reach consensus. ShAC (Shared Activity Coordination) is a framework for designing coordination protocols with an algorithm for continually coordinating agents using these protocols during execution. We show how to construct a wide range of protocols using this framework and describe how ShAC coordinates two rovers and an orbiter in a simulated Mars scenario.

Multiple agents coordination planning scheduling M↗

A method for determining spiral-bevel gear tooth geometry for finite element analysis

An analytical method was developed to determine gear tooth surface coordinates of face-milled spiral bevel gears. The method uses the basic gear design parameters in conjunction with the kinematical aspects of spiral bevel gear manufacturing machinery. A computer program, SURFACE, was developed. The computer program calculates the surface coordinates and outputs 3-D model data that can be used for finite element analysis. Development of the modeling method and an example case are presented. This analysis method could also find application for gear inspection and near-net-shape gear forging die design.

Handschuh, Robert F.↗

Proteins with Novel Structure, Function and Dynamics

Recently, a small enzyme that ligates two RNA fragments with the rate of 10(exp 6) above background was evolved in vitro (Seelig and Szostak, Nature 448:828‐831, 2007). This enzyme does not resemble any contemporary protein (Chao et al., Nature Chem. Biol. 9:81‐83, 2013). It consists of a dynamic, catalytic loop, a small, rigid core containing two zinc ions coordinated by neighboring amino acids, and two highly flexible tails that might be unimportant for protein function. In contrast to other proteins, this enzyme does not contain ordered secondary structure elements, such as alpha‐helix or beta‐sheet. The loop is kept together by just two interactions of a charged residue and a histidine with a zinc ion, which they coordinate on the opposite side of the loop. Such structure appears to be very fragile. Surprisingly, computer simulations indicate otherwise. As the coordinating, charged residue is mutated to alanine, another, nearby charged residue takes its place, thus keeping the structure nearly intact. If this residue is also substituted by alanine a salt bridge involving two other, charged residues on the opposite sides of the loop keeps the loop in place. These adjustments are facilitated by high flexibility of the protein. Computational predictions have been confirmed experimentally, as both mutants retain full activity and overall structure. These results challenge our notions about what is required for protein activity and about the relationship between protein dynamics, stability and robustness. We hypothesize that small, highly dynamic proteins could be both active and fault tolerant in ways that many other proteins are not, i.e. they can adjust to retain their structure and activity even if subjected to mutations in structurally critical regions. This opens the doors for designing proteins with novel functions, structures and dynamics that have not been yet considered.

Proteins↗

Coordination Logic for Repulsive Resolution Maneuvers

This paper presents an algorithm for determining the direction an aircraft should maneuver in the event of a potential conflict with another aircraft. The algorithm is implicitly coordinated, meaning that with perfectly reliable computations and information, it will in- dependently provide directional information that is guaranteed to be coordinated without any additional information exchange or direct communication. The logic is inspired by the logic of TCAS II, the airborne system designed to reduce the risk of mid-air collisions between aircraft. TCAS II provides pilots with only vertical resolution advice, while the proposed algorithm, using a similar logic, provides implicitly coordinated vertical and horizontal directional advice.

Narkawicz, Anthony J.↗

Correlation of ERTS MSS data and earth coordinate systems

Experience has revealed a problem in the analysis and interpretation of ERTS multispectral scanner (MSS) data. The problem is one of accurately correlating ERTS MSS pixels (picture elements) with analysis areas specified on aerial photographs or topographic maps for training recognition computers and/or evaluating recognition results. A computer-aided procedure to correlate coordinates from topographic maps and/or aerial photographs with ERTS data coordinates has been developed. In the procedure, a map transformation from earth coordinates to ERTS scan line and point numbers is calculated using selected ground control points and the method of least squares. The map transformation is then applied to the earth coordinates of selected areas to obtain the corresponding ERTS point and line numbers.

Malila, W. A.↗

Benchmarking universal machine learning interatomic potentials for rapid analysis of inelastic neutron scattering data

The accurate calculation of phonons and vibrational spectra remains a significant challenge, requiring highly precise evaluations of interatomic forces. Traditional methods based on the quantum description of the electronic structure, while widely used, are computationally expensive and demand substantial expertise. Emerging universal machine learning interatomic potentials (uMLIPs) offer a transformative alternative by employing pre-trained neural network surrogates to predict interatomic forces directly from atomic coordinates. This approach dramatically reduces computation time and minimizes the need for technical knowledge. In this paper, we produce a phonon database comprising nearly 5000 inorganic crystals to benchmark the performance of several leading uMLIPs. We further assess these models in real-world applications by using them to analyze experimental inelastic neutron scattering data collected on a variety of materials. Through detailed comparisons, we identify the strengths and limitations of these uMLIPs, providing insights into their accuracy and suitability for fast calculations of phonons and related properties, as well as the potential for real-time interpretation of neutron scattering spectra. Our findings highlight how the rapid advancement of AI in science is revolutionizing experimental research and data analysis.

inelastic neutron scattering↗

Coordinates of features on the Mariner 6 and 7 pictures of Mars.

A control net of Mars has been computed from measurements of 115 control points identified on the Mariner 6 and 7 pictures. Most of these points are located with respect to topographic features on the surface of Mars, and their areographic coordinates were computed by photogrammetric techniques. These pictures offered the first opportunity to establish a control net of Mars based on topographic detail.

Davies, M. E.↗

A Fractional-Step Method Of Computing Incompressible Flow

Method of computing time-dependent flow of incompressible, viscous fluid involves numerical solution of Navier-Stokes equations on two- or three-dimensional computational grid based on generalized curvilinear coordinates. Equations of method derived in primitive-variable formulation. Dependent variables are pressure at center of each cell of computational grid and volume fluxes across faces of each cell. Volume fluxes replace Cartesian components of velocity; these fluxes correspond to contravariant components of velocity multiplied by volume of computational cell, in staggered grid. Choice of dependent variables enables simple extension of previously developed staggered-grid approach to generalized curvilinear coordinates and facilitates enforcement of conservation of mass.

Kwak, Dochan↗

Correlation of ERTS MSS data and earth coordinate systems

The author has identified the following significant results. Experience has revealed a problem in the analysis and interpretation of ERTS-1 multispectral scanner (MSS) data. The problem is one of accurately correlating ERTS-1 MSS pixels with analysis areas specified on aerial photographs or topographic maps for training recognition computers and/or evaluating recognition results. It is difficult for an analyst to accurately identify which ERTS-1 pixels on a digital image display belong to specific areas and test plots, especially when they are small. A computer-aided procedure to correlate coordinates from topographic maps and/or aerial photographs with ERTS-1 data coordinates has been developed. In the procedure, a map transformation from earth coordinates to ERTS-1 scan line and point numbers is calculated using selected ground control points nad the method of least squares. The map transformation is then applied to the earth coordinates of selected areas to obtain the corresponding ERTS-1 point and line numbers. An optional provision allows moving the boundaries of the plots inward by variable distances so the selected pixels will not overlap adjacent features.

Malila, W. A.↗

Computation of transonic potential flow about 3 dimensional inlets, ducts, and bodies

An analysis was developed and a computer code, P465 Version A, written for the prediction of transonic potential flow about three dimensional objects including inlet, duct, and body geometries. Finite differences and line relaxation are used to solve the complete potential flow equation. The coordinate system used for the calculations is independent of body geometry. Cylindrical coordinates are used for the computer code. The analysis is programmed in extended FORTRAN 4 for the CYBER 203 vector computer. The programming of the analysis is oriented toward taking advantage of the vector processing capabilities of this computer. Comparisons of computed results with experimental measurements are presented to verify the analysis. Descriptions of program input and output formats are also presented.

Reyhner, T. A.↗

Flow Analysis of X-34 Main Propulsion System Feedlines

This viewgraph presentation reviews the flow analysis of the propulsion feedlines in the X-34. The objective of the analysis was to determine the flow development at the engine interface, and to predict the pressure drop in the feedline. The presentation shows the design of the feedlines, and the computational grids. It reviews the numerical method, which included solving the curvilinear coordinate transport equations. Line graphs review the computational fluid dynamic results. The results and conclusions are also presented.

Vu, Bruce↗