Search NASA⌕ Search

SEARCH · Search NASA

Results for “time coding”

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

Contamination Analysis Tools

This talk presents 3 different tools developed recently for contamination analysis:HTML QCM analyzer: runs in a web browser, and allows for data analysis of QCM log filesJava RGA extractor: can load in multiple SRS.ana files and extract pressure vs. time dataC++ Contamination Simulation code: 3D particle tracing code for modeling transport of dust particulates and molecules. Uses residence time to determine if molecules stick. Particulates can be sampled from IEST-STD-1246 and be accelerated by aerodynamic forces.

Implementation and Characterization of Three-Dimensional Particle-in-Cell Codes on Multiple-Instruction-Multiple-Data Massively Parallel Supercomputers

A three-dimensional electrostatic particle-in-cell (PIC) plasma simulation code has been developed on coarse-grain distributed-memory massively parallel computers with message passing communications. Our implementation is the generalization to three-dimensions of the general concurrent particle-in-cell (GCPIC) algorithm. In the GCPIC algorithm, the particle computation is divided among the processors using a domain decomposition of the simulation domain. In a three-dimensional simulation, the domain can be partitioned into one-, two-, or three-dimensional subdomains ("slabs," "rods," or "cubes") and we investigate the efficiency of the parallel implementation of the push for all three choices. The present implementation runs on the Intel Touchstone Delta machine at Caltech; a multiple-instruction-multiple-data (MIMD) parallel computer with 512 nodes. We find that the parallel efficiency of the push is very high, with the ratio of communication to computation time in the range 0.3%-10.0%. The highest efficiency (> 99%) occurs for a large, scaled problem with 64(sup 3) particles per processing node (approximately 134 million particles of 512 nodes) which has a push time of about 250 ns per particle per time step. We have also developed expressions for the timing of the code which are a function of both code parameters (number of grid points, particles, etc.) and machine-dependent parameters (effective FLOP rate, and the effective interprocessor bandwidths for the communication of particles and grid points). These expressions can be used to estimate the performance of scaled problems--including those with inhomogeneous plasmas--to other parallel machines once the machine-dependent parameters are known.

Lyster, P. M.↗

Real-time minimal bit error probability decoding of convolutional codes

A recursive procedure is derived for decoding of rate R=1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e. fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications such as in the inner coding system for concatenated coding.

Lee, L. N.↗

Frequencies and modes for shells of revolution (FAMSOR)

Using stiffness matrix and lumped-mass representation specified number of natural frequencies are obtained using inverse iteration method. Mode shapes for each frequency are also obtained. These frequencies and mode shapes can be found in reasonable periods of computer time utilizing this code.

Mcwhorter, L. B.↗

On the inherent intractability of finding good codes

The problem of computing the minimum distance of an arbitrary binary linear code is non-polynomial complete. This strongly suggests, but does not imply, that it is impossible to design a computer algorithm for computing the minimum distance of an arbitrary code whose running time is bounded by a polynomial in the number of inputs.

Mceliece, R. J.↗

Software engineering project management - A state-of-the-art report

The management of software engineering projects in the aerospace industry was investigated. The survey assessed such features as contract type, specification preparation techniques, software documentation required by customers, planning and cost-estimating, quality control, the use of advanced program practices, software tools and test procedures, the education levels of project managers, programmers and analysts, work assignment, automatic software monitoring capabilities, design and coding reviews, production times, success rates, and organizational structure of the projects.

Thayer, R. H.↗

A computer-aided design system geared toward conceptual design in a research environment

A computer-aided design system has recently been developed specifically for the small research group environment. The system is implemented on a Prime 400 minicomputer linked with a CDC 6600 computer. The goal was to assign the minicomputer specific tasks, such as data input and graphics, thereby reserving the large mainframe computer for time-consuming analysis codes. The basic structure of the design system consists of GEMPAK, a computer code that generates detailed configuration geometry from a minimum of input; interface programs that reformat GEMPAK geometry for input to the analysis codes; and utility programs that simplify computer access and data interpretation. The working system has had a large positive impact on the quantity and quality of research performed by the originating group. This paper describes the system, the major factors that contributed to its particular form, and presents examples of its application.

STACK S. H.↗

LORAN-C, an overview

LORAN-C a highly accurate radio navigation positioning system which operates at an assigned frequency of 10 kHz, and provides phase-coded pulses to develop hyperbolic time-difference lines-of-position (LOP's) was evaluated. LORAN-C provides precise time and time interval to within plus or minus 5 microseconds of UTC. The steps taken to plan, install, operate, and maintain the LORAN-C system up to the year 2000 are discussed. Topics included in the discussion were: theory of operation, timing, chain lanning, group repetition interval, coding delay versus emission delay, chain calibration, chart verification, system accuracy, signal reliability, and future developments.

Thrall, W. J.↗

Analytical investigation of critical MHD phenomena

Development and analysis of schemes for suppression of the startup overvoltage transient in the AEDC High Performance Demonstration Experiment (HPDE), analysis of performance enhancement due to electrode voltage drop reduction by use of pyrolytic graphites in the HPDE, prediction of optimal loading schemes for the HPDE, prediction of PHDE performance with a diagonal electrical connection, and predictions of the likelihood and effects of axial current leakage between adjacent electrodes in the HPDE are reviewed. Simulations of tests at the AEDC/HPDE with STD Research Corporation multidimensional and time dependent computer codes provided additional validation for the computer codes and shed light on physical mechanisms which govern performance and durability of MHD power generators. The magnetoaerothermal effect was predicted by STD Research Corporation to have a significant effect on the HPDE/MHD generator performance at high interaction.

Source record↗

Preliminary results in implementing a model of the world economy on the CYBER 205: A case of large sparse nonsymmetric linear equations

A brief description of the Model of the World Economy implemented at the Institute for Economic Analysis is presented, together with our experience in converting the software to vector code. For each time period, the model is reduced to a linear system of over 2000 variables. The matrix of coefficients has a bordered block diagonal structure, and we show how some of the matrix operations can be carried out on all diagonal blocks at once.

Szyld, D. B.↗

Analysis of three-dimensional transonic compressors

A method for computing the three-dimensional transonic flow around the blades of a compressor or of a propeller is given. The method is based on the use of the velocity potential, on the hypothesis that the flow is inviscid, irrotational and isentropic. The equation of the potential is solved in a transformed space such that the surface of the blade is mapped into a plane where the periodicity is implicit. This equation is in a nonconservative form and is solved with the help of a finite difference method using artificial time. A computer code is provided and some sample results are given in order to demonstrate the influence of three-dimensional effects and the blade's rotation.

Bourgeade, A.↗

Variation of the auroral Birkeland and current pattern associated with the north-south component of the IMF

In this study, the data set acquired from the vector magnetometer on board MAGSAT during the period October 1979 to June 1980 is examined. Auroral zone crossings were sorted by hourly averaged values of the Interplanetary Magnetic Field. The result is a catalog of sorted data files, from which color-coded magnetic local time invariant latitude plots have been generated that image the auroral Birkeland current pattern, over each prescribed parameter range. These images are used to statistically examine the dynamics of the current pattern. Results indicate that during the periods of B(z) less than 0, the region 1 and 2 current system expands toward lower latitudes accompanied by an expansion of the auroral zones. When B(z) is greater than 0, the region 1 and 2 currents continue to flow with greatly reduced amplitude in the presence of extensive small scale structure.

Bythrow, P. F.↗

A numerical study of diffusive shock acceleration of cosmic rays in supernova shocks

The evolution of the energy spectrum of cosmic rays accelerated by the first order Fermi mechanism, by a supernova remnant shock wave, including adiabatic deceleration effects behind the front, is carried out by means of a time-dependent numerical code. The calculations apply to the adiabatic stage (or Sedov stage) of the supernova explosion, and the energetic particle spectrum is calculated in the test particle limit (i.e., the back reaction of the cosmic rays on the flow is not included). The particles are injected mono-energetically at the shock. The radial distribution, The radial distribution, and the spectrum of the accelerated and decelerated particles is shown.

Ko, C. M.↗

Theoretical studies of chromospheres and winds in cool stars

Propagation of pulsational waves through the atmosphere of the M supergiant alpha Ori was explored using a time dependent hydrodynamic code. Wind properties for three FU Orionis objects were determined using radiative transfer models based on optical line profiles. The effects of varying wind temperature while keeping the velocity steady were considered. Using the premise that FU Orionis eruptions result from massive accretions from a disk into a T Tauri star explains a variety of observational peculiarities of FU Orionis objects.

Hartmann, L.↗

Documenting the Development of Software

Some routine supervisory functions performed automatically. Program Management Facility (PMF) computer program integrated software-development and control system. Applicable to large software systems involving as many as several hundred programmers and one million lines of codes, it ensures timely and orderly planning, development, implementation, and documentation of software. Designed as support tool. Has many features providing efficient processing and utilization of space for development programmer. Incorporates security system to prevent improper maintenance. Provides full set of cross-referenced reports and supervisory functions for detailed management information. Written in assembler. IBM program TSO required.

Source record↗

Fifty Year Canon of Solar Eclipses: 1986 - 2035

A complete catalog is presented, listing the general characteristics of every solar eclipse from 1901 through 2100. To complement this catalog, a detailed set of cylindrical projection world maps shows the umbral paths of every solar eclipse over the 200 year interval. Focusing in on the next 50 years, accurate geodetic path coordinates and local circumstances for the 71 central eclipses from 1987 through 2035 are tabulated. Finally, the geodetic paths of the umbral and penumbral shadows of all 109 solar eclipses in this period are plotted on orthographic projection maps of the Earth. Appendices are included which discuss eclipse geometry, eclipse frequency and occurrence, modern eclipse prediction and time determination. Finally, code for a simple Fortran program is given to predict the occurrence and characteristics of solar eclipses.

Espenak, Fred↗

Application of advanced grid generation techniques for flow field computations about complex configurations

In the computation of flowfields about complex configurations, it is very difficult to construct a boundary-fitted coordinate system. An alternative approach is to use several grids at once, each of which is generated independently. This procedure is called the multiple grids or zonal grids approach; its applications are investigated. The method conservative providing conservation of fluxes at grid interfaces. The Euler equations are solved numerically on such grids for various configurations. The numerical scheme used is the finite-volume technique with a three-stage Runge-Kutta time integration. The code is vectorized and programmed to run on the CDC VPS-32 computer. Steady state solutions of the Euler equations are presented and discussed. The solutions include: low speed flow over a sphere, high speed flow over a slender body, supersonic flow through a duct, and supersonic internal/external flow interaction for an aircraft configuration at various angles of attack. The results demonstrate that the multiple grids approach along with the conservative interfacing is capable of computing the flows about the complex configurations where the use of a single grid system is not possible.

Kathong, Monchai↗

A conservative approach for flow field calculations on multiple grids

In the computation of flow fields about complex configurations, it is very difficult to construct body-fitted coordinate systems. An alternative approach is to use several grids at once, each of which is generated independently. This procedure is called the 'multiple grids' or 'zonal grids' approach and its applications are investigated in this study. The method follows the conservative approach and provides conservation of fluxes at grid interfaces. The Euler equations are solved numerically on such grids for various configurations. The numerical scheme used is the finite-volume technique with a three-stage Runge-Kutta time integration. The code is vectorized and programmed to run on the CDC VPS-32 computer. Some steady state solutions of the Euler equations are presented and discussed.

Kathong, M.↗