Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational graph”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Strategies for concurrent processing of complex algorithms in data driven architectures

Research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a special distributed computer environment is presented. This model is identified by the acronym ATAMM which represents Algorithms To Architecture Mapping Model. The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation.

Stoughton, John W.↗
NASA NTRS1987

Operation of a multi-year, multi-agency project

Organizational and technological aspects of the operation by NASA and ESA of the IUE satellite observatory since its launch in 1978 are discussed. Topics addressed include the division of responsibilities among the ground stations, the IUE orbit and its evolution, the IUE spacecraft, normal operations (proposal selection and observation planning, shift handover, and spacecraft operations), and a typical observation (target identification and acquisition, telescope focus, spectrograph modes, camera operations, calibration, and data reduction). Consideration is given to constraints on IUE operation due to the sun-earth-moon configuration (eclipses), spacecraft power, radiation, temperature, and momentum-wheel speed; problems encountered with gyros, onboard computers, the fine sun sensor, and cameras; and the reliable high-efficiency overall performance of the IUE. Diagrams, drawings, and graphs are provided.

Faelker, Juergen↗
NASA NTRS1989

Nuclear cross sections for estimating secondary radiations produced in spacecraft

The physical theory underlying calculations of nuclear absorption and fragmentation cross sections and EM dissociation cross sections is reviewed; typical results are presented in graphs; and the adequacy of the experimental data bases for each type of cross section are discussed. The emphasis is on computations applicable to the estimation of secondary radiation in shielded spacecraft.

Townsend, L. W.↗
NASA NTRS1990

Integrated controls-structures optimization of a large space structure

A technique for the simultaneous optimization of structural and control elements of a large space structure is developed and demonstrated for a test problem, the NASA COFS-I Mast Flight System. General-purpose control and structural-analysis codes are applied directly to a large detailed model, with realistic objective and constraint functions. The steps in the process (structural optimization, control optimization, and system coordination) are described and illustrated with diagrams; the numerical implementation (using different computers for different steps) is discussed; and results showing significant design improvements in three COFS-I configurations are presented in graphs. When the weights of both structure and power-generating equipment are taken into account, a 40-bay truss design is found to be better than designs with 42 or 44 bays.

Padula, Sharon L.↗
NASA NTRS1991

A high-fidelity N-body ephemeris generator for satellites in Earth orbit

A program is currently used for mission planning called the Analytic Satellite Ephemeris Program (ASEP), which produces projected data for orbits that remain fairly close to Earth. Lunar and solar perturbations are taken into account in another program called GRAVE. This project is a revision of GRAVE which incorporates more flexible means of input for initial data, provides additional kinds of output information, and makes use of structured programming techniques to make the program more understandable and reliable. The computer program ORBIT was tested against tracking data for the first 313 days of operation of the CRRES satellite. A sample graph is given comparing the semi-major axis calculated by the program with the values supplied by NORAD. When calculated for points at which CRRES passes through the ascending node, the argument of perigee, the right ascension of the ascending node, and the mean anomaly all stay within about a degree of the corresponding values from NORAD; the inclination of the orbital plane is much closer. The program value of the eccentricity is in error by no more than 0.0002.

Simmons, David R.↗
NASA NTRS2003

Software for Training in Pre-College Mathematics

The Intelligent Math Tutor (IMT) is a computer program for training students in pre-college and college-level mathematics courses, including fundamentals, intermediate algebra, college algebra, and trigonometry. The IMT can be executed on a server computer for access by students via the Internet; alternatively, it can be executed on students computers equipped with compact- disk/read-only-memory (CD-ROM) drives. The IMT provides interactive exercises, assessment, tracking, and an on-line graphing calculator with algebraic-manipulation capabilities. The IMT provides an innovative combination of content, delivery mechanism, and artificial intelligence. Careful organization and presentation of the content make it possible to provide intelligent feedback to the student based on performance on exercises and tests. The tracking and feedback mechanisms are implemented within the capabilities of a commercial off-the-shelf development software tool and are written in the Unified Modeling Language to maximize reuse and minimize development cost. The graphical calculator is a standard feature of most college and pre-college algebra and trigonometry courses. Placing this functionality in a Java applet decreases the cost, provides greater capabilities, and provides an opportunity to integrate the calculator with the lessons.

Shelton, Robert O.↗
NASA NTRS2002

An Efficient Scheme for Updating Sparse Cholesky Factors

Raghavan had earlier developed the software package DCSPACK which can be used for solving sparse linear systems where the coefficient matrix is symmetric and positive definite (this project was not funded by NASA but by agencies such as NSF). DSCPACK-S is the serial code and DSCPACK-P is a parallel implementation suitable for multiprocessors or networks-of-workstations with message passing using MCI. The main algorithm used is the Cholesky factorization of a sparse symmetric positive positive definite matrix A = LL(T). The code can also compute the factorization A = LDL(T). The complexity of the software arises from several factors relating to the sparsity of the matrix A. A sparse N x N matrix A has typically less that cN nonzeroes where c is a small constant. If the matrix were dense, it would have O(N2) nonzeroes. The most complicated part of such sparse Cholesky factorization relates to fill-in, i.e., zeroes in the original matrix that become nonzeroes in the factor L. An efficient implementation depends to a large extent on complex data structures and on techniques from graph theory to reduce, identify, and manage fill. DSCPACK is based on an efficient multifrontal implementation with fill-managing algorithms and implementation arising from earlier research by Raghavan and others. Sparse Cholesky factorization is typically a four step process: (1) ordering to compute a fill-reducing numbering, (2) symbolic factorization to determine the nonzero structure of L, (3) numeric factorization to compute L, and, (4) triangular solution to solve L(T)x = y and Ly = b. The first two steps are symbolic and are performed using the graph of the matrix. The numeric factorization step is of dominant cost and there are several schemes for improving performance by exploiting the nested and dense structure of groups of columns in the factor. The latter are aimed at better utilization of the cache-memory hierarchy on modem processors to prevent cache-misses and provide execution rates (operations/second) that are close to the peak rates for dense matrix computations. Currently, EPISCOPACY is being used in an application at NASA directed by J. Newman and M. James. We propose the implementation of efficient schemes for updating the LL(T) or LDL(T) factors computed in DSCPACK-S to meet the computational requirements of their project. A brief description is provided in the next section.

Raghavan, Padma↗
NASA NTRS1999

Large-Scale Parallel Viscous Flow Computations using an Unstructured Multigrid Algorithm

The development and testing of a parallel unstructured agglomeration multigrid algorithm for steady-state aerodynamic flows is discussed. The agglomeration multigrid strategy uses a graph algorithm to construct the coarse multigrid levels from the given fine grid, similar to an algebraic multigrid approach, but operates directly on the non-linear system using the FAS (Full Approximation Scheme) approach. The scalability and convergence rate of the multigrid algorithm are examined on the SGI Origin 2000 and the Cray T3E. An argument is given which indicates that the asymptotic scalability of the multigrid algorithm should be similar to that of its underlying single grid smoothing scheme. For medium size problems involving several million grid points, near perfect scalability is obtained for the single grid algorithm, while only a slight drop-off in parallel efficiency is observed for the multigrid V- and W-cycles, using up to 128 processors on the SGI Origin 2000, and up to 512 processors on the Cray T3E. For a large problem using 25 million grid points, good scalability is observed for the multigrid algorithm using up to 1450 processors on a Cray T3E, even when the coarsest grid level contains fewer points than the total number of processors.

Mavriplis, Dimitri J.↗
NASA NTRS1972

A survey of compiler optimization techniques

Major optimization techniques of compilers are described and grouped into three categories: machine dependent, architecture dependent, and architecture independent. Machine-dependent optimizations tend to be local and are performed upon short spans of generated code by using particular properties of an instruction set to reduce the time or space required by a program. Architecture-dependent optimizations are global and are performed while generating code. These optimizations consider the structure of a computer, but not its detailed instruction set. Architecture independent optimizations are also global but are based on analysis of the program flow graph and the dependencies among statements of source program. A conceptual review of a universal optimizer that performs architecture-independent optimizations at source-code level is also presented.

Schneck, P. B.↗
NASA NTRS1952

Comparison of Three Multicylinder Icing Meters and Critique of Multicylinder Method

Three multicylinder cloud meters, fundamentally similar but differing in important details, were compared in use at the Mount Washington Observatory. Determinations of liquid water content were found to agree within the limits of the probable error, but the two instruments designed by the National Advisory Committee for Aeronautics indicated larger drop sizes than did the Observatory's instrument, apparently because of spurious ice catch on the rather rough surface of the larger cylinders. Comparisons of drop-size distribution were largely indeterminate., In a critique of the method, the probable error of determination of liquid water content was found to be +/-8 percent; of drop size, +/-6 percent; and of drop-size distribution, about +/-0.7 unit of the modulus of distribution. Of the systematic errors, run-off of unfrozen water is most important, blow-off and erosion seldom being hampering. Revision of collection-efficiency computations for cylinders in clouds with distributed drop sizes was found necessary and also revision of one of the correction-factor graphs heretofore used. The assumption of constant ice density in deriving cylinder size was found to be permissible for cylinders 1 inch or more in diameter.

Howell, Wallace E.↗
NASA NTRS1987

Prediction of tip vortex self-induced motion parameters in terms of rotor blade loading

The self-induced motion of curved vortex filaments at the tip of a helicopter rotor blade is investigated analytically. The derivation of a method for inviscid roll-up (IRU) is presented in detail, with attention to the cutoff-distance reformulation of the problem, a control-volume analysis of the self-induction properties of the vortex core, the adaptation of the roll-up method of Betz (1932) to IRU in three dimensions, the treatment of linear and elliptic loading, vortices with turbulent central cores, and the effect of cutoff distance on helicopter free-wake computations. Numerical results showing the significant effect of core properties on the geometry of a rotor wake in hover are presented in graphs and briefly characterized.

Bliss, Donald B.↗
NASA NTRS1989

A new technique in the global reliability of cyclic communications network

The global reliability of a communications network is the probability that given any pair of nodes, there exists a viable path between them. A characterization of connectivity, for a given class of networks, can enable one to find this reliability. Such a characterization is described for a useful class of undirected networks called daisy-chained or braided networks. This leads to a new method of quickly computing the global reliability of these networks. Asymptotic behavior in terms of component reliability is related to geometric properties of the given graph. Generalization of the technique is discussed.

Sjogren, Jon A.↗
NASA NTRS1996

Program Computes Receiver Gain And Noise Profiles

RCVRPROF computer program is computer-aided-design (CAD) software tool useful in analysis and design of communication receivers and downconverters. Provides customized spreadsheet with formulas and graphs providing detailed description of performance of receiver. Such performance parameters as noise temperature, gain, noise power, noise spectral density, and dynamic range analyzed for contribution of each to overall performance of receiver.

Mcwatters, Dalia↗
NASA NTRSDate not supplied

Quantum-accelerated Global Constraint Filtering

Motivated by recent advances in quantum algorithms and gate-model quantum computation, we introduce quantum-accelerated filtering algorithms for global constraints in constraint programming. We adapt recent work in quantum algorithms for graph problems and identify quantum subroutines that accelerate the main domain consistency algorithms for the all different constraint and the global cardinality constraint (gcc). The subroutines are based on quantum algorithms for finding maximum matchings and strongly connected components in graphs, and provide speedups over the best classical algorithms. We detail both complete and bounded-probability frameworks for quantum-accelerated global constraint filtering algorithms within backtracking search.

Quantum algorithms↗
NASA NTRS1978

Custom blending of lamp phosphors

Spectral output of fluorescent lamps can be precisely adjusted by using computer-assisted analysis for custom blending lamp phosphors. With technique, spectrum of main bank of lamps is measured and stored in computer memory along with emission characteristics of commonly available phosphors. Computer then calculates ratio of green and blue intensities for each phosphor according to manufacturer's specifications and plots them as coordinates on graph. Same ratios are calculated for measured spectrum. Once proper mix is determined, it is applied as coating to fluorescent tubing.

Klemm, R. E.↗
NASA NTRS1983

Establishing homologies in protein sequences

Computer-based statistical techniques used to determine homologies between proteins occurring in different species are reviewed. The technique is based on comparison of two protein sequences, either by relating all segments of a given length in one sequence to all segments of the second or by finding the best alignment of the two sequences. Approaches discussed include selection using printed tabulations, identification of very similar sequences, and computer searches of a database. The use of the SEARCH, RELATE, and ALIGN programs (Dayhoff, 1979) is explained; sample data are presented in graphs, diagrams, and tables and the construction of scoring matrices is considered.

Dayhoff, M. O.↗
NASA NTRS1989

Initial Ada components evaluation

The SAIC has the responsibility for independent test and validation of the SSE. They have been using a mathematical functions library package implemented in Ada to test the SSE IV and V process. The library package consists of elementary mathematical functions and is both machine and accuracy independent. The SSE Ada components evaluation includes code complexity metrics based on Halstead's software science metrics and McCabe's measure of cyclomatic complexity. Halstead's metrics are based on the number of operators and operands on a logical unit of code and are compiled from the number of distinct operators, distinct operands, and total number of occurrences of operators and operands. These metrics give an indication of the physical size of a program in terms of operators and operands and are used diagnostically to point to potential problems. McCabe's Cyclomatic Complexity Metrics (CCM) are compiled from flow charts transformed to equivalent directed graphs. The CCM is a measure of the total number of linearly independent paths through the code's control structure. These metrics were computed for the Ada mathematical functions library using Software Automated Verification and Validation (SAVVAS), the SSE IV and V tool. A table with selected results was shown, indicating that most of these routines are of good quality. Thresholds for the Halstead measures indicate poor quality if the length metric exceeds 260 or difficulty is greater than 190. The McCabe CCM indicated a high quality of software products.

Moebes, Travis↗
NASA NTRS1991

NASA Ames-Dryden integrated test facility: Presentation outline

The topics are presented in view graph form and include the following: (1) a Dryden overview; (2) the Integrated Tests Facility (ITF); (3) the ITF system architecture; (4) the computer aided system testing; and (5) the ITF system video.

Schilling, Larry↗