Search NASA⌕ Search

SEARCH · Search NASA

Results for “Ensemble 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 19 records

The Mark III Hypercube-Ensemble Computers

Mark III Hypercube concept applied in development of series of increasingly powerful computers. Processor of each node of Mark III Hypercube ensemble is specialized computer containing three subprocessors and shared main memory. Solves problem quickly by simultaneously processing part of problem at each such node and passing combined results to host computer. Disciplines benefitting from speed and memory capacity include astrophysics, geophysics, chemistry, weather, high-energy physics, applied mechanics, image processing, oil exploration, aircraft design, and microcircuit design.

Peterson, John C.↗

Risk analysis simulation of rover operations for Mars surface exploration

Risk management advocates have long sought to directly influence the early stages of the systems engineering process through a more effective role in system design trade studies. The principal obstacle to this has been the lack of credible ways to represent and quantify mission risk—that is, a combination of the probability of mission success (“system safety”) and science value—for the project manager and the rest of the design team. If it were possible to quantify mission risk, then the effects of proposed mission and system design changes could be calculated, and along with life-cycle costs, could be used to explore the design space more extensively and select better designs. JPL has been working to build the capability to quantify the probability of mission success using a federation of diverse simulations and models, each of which contributes some vital piece of the puzzle. The initial institutional focus has been on Mars surface operations. This ensemble computing framework enables the diverse models and simulations to work together seamlessly. Recent work at JPL has demonstrated the capability to exercise this ensemble from end-to-end using an Oracle-based database to automatically move results from one model/simulation to the next stage in the analysis.

Shishko, Robert↗

Computational chaos in massively parallel neural networks

A fundamental issue which directly impacts the scalability of current theoretical neural network models to massively parallel embodiments, in both software as well as hardware, is the inherent and unavoidable concurrent asynchronicity of emerging fine-grained computational ensembles and the possible emergence of chaotic manifestations. Previous analyses attributed dynamical instability to the topology of the interconnection matrix, to parasitic components or to propagation delays. However, researchers have observed the existence of emergent computational chaos in a concurrently asynchronous framework, independent of the network topology. Researcher present a methodology enabling the effective asynchronous operation of large-scale neural networks. Necessary and sufficient conditions guaranteeing concurrent asynchronous convergence are established in terms of contracting operators. Lyapunov exponents are computed formally to characterize the underlying nonlinear dynamics. Simulation results are presented to illustrate network convergence to the correct results, even in the presence of large delays.

Barhen, Jacob↗

Predicting Aircraft Spray Patterns on Crops

Agricultural Dispersion Prediction (AGDISP) system developed to predict deposition of agricultural material released from rotary- and fixed-wing aircraft. AGDISP computes ensemble average mean motion resulting from turbulent fluid fluctuations. Used to examine ways of making dispersal process more efficient by insuring uniformity, reducing waste, and saving money. Programs in AGDISP system written in FORTRAN IV for interactive execution.

Teske, M. E.↗

An algorithm for the Italian atomic time scale

During the past twenty years, the time scale at the IEN has been realized by a commercial cesium clock, selected from an ensemble of five, whose rate has been continuously steered towards UTC to maintain a long term agreement within 3 x 10(exp -13). A time scale algorithm, suitable for a small clock ensemble and capable of improving the medium and long term stability of the IEN time scale, has been recently designed taking care of reducing the effects of the seasonal variations and the sudden frequency anomalies of the single cesium clocks. The new time scale, TA(IEN), is obtained as a weighted average of the clock ensemble computed once a day from the time comparisons between the local reference UTC(IEN) and the single clocks. It is foreseen to include in the computation also ten cesium clocks maintained in other Italian laboratories to further improve its reliability and its long term stability. To implement this algorithm, a personal computer program in Quick Basic has been prepared and it has been tested at the IEN time and frequency laboratory. Results obtained using this algorithm on the real clocks data relative to a period of about two years are presented.

Cordara, F.↗

Ensemble averaging of acoustic data

A computer program called Ensemble Averaging of Acoustic Data is documented. The program samples analog data, analyzes the data, and displays them in the time and frequency domains. Hard copies of the displays are the program's output. The documentation includes a description of the program and detailed user instructions for the program. This software was developed for use on the Ames 40- by 80-Foot Wind Tunnel's Dynamic Analysis System consisting of a PDP-11/45 computer, two RK05 disk drives, a tektronix 611 keyboard/display terminal, and FPE-4 Fourier Processing Element, and an analog-to-digital converter.

Stefanski, P. K.↗

A time-averaged cosmic ray propagation theory

An argument is presented, which casts doubt on our ability to choose an appropriate magnetic field ensemble for computing the average behavior of cosmic ray particles. An alternate procedure, using time-averages rather than ensemble-averages, is presented.

Klimas, A. J.↗

Computer measurement and representation of the heart in two and three dimensions

Methods for accurate measurement and meaningful display of cardiac dimensions as obtained from fluoroscopy were surveyed. Recorded images were scaled back to actual dimensions and cardiac motion was displayed to assess functional changes. This was accomplished by use of a low-cost but flexible ensemble of computer and video equipment which assisted in (1) digitizing image outlines or points, (2) filing digitized images for later recall in any sequence, (3) correcting recorded images for distortion, (4) modeling heart geometry, (5) analyzing dimensional changes, and (6) displaying both heart geometry and results of analysis in a useful form.

Rasmussen, D.↗

The ensemble variability properties of faint QSOs

A refined sample of 64 variable objects with stellar image structure has been identified in SA 57 to B approximately = 22.5, over a time baseline of 15 yr, sampled at 11 distinct epochs. The photometric data typically have a root-mean-square (rms) error at B = 22 of only 0.05 mag. Thirty-five quasars in this field have already been spectroscopically confirmed, 34 of which are among the sample of variables. Of the other variables, six are known spectroscopically to be stars, 10 additional objects are stars based on reliable detection of proper motion, and one is spectroscopically a narrow emission line galaxy. Of the 13 remaining variables, it is argued that they are a mixture of distant halo subdwarfs and quasars with starlike colors. We compute the ensemble average structure function and autocorrelation function from the light curves in the respective quasar rest frames, which are used to investigate the general dependences on apparent magnitude, absolute magnitude, and redshift.

Trevese, Dario↗

Context dependent anti-aliasing image reconstruction

Image Reconstruction has been mostly confined to context free linear processes; the traditional continuum interpretation of digital array data uses a linear interpolator with or without an enhancement filter. Here, anti-aliasing context dependent interpretation techniques are investigated for image reconstruction. Pattern classification is applied to each neighborhood to assign it a context class; a different interpolation/filter is applied to neighborhoods of differing context. It is shown how the context dependent interpolation is computed through ensemble average statistics using high resolution training imagery from which the lower resolution image array data is obtained (simulation). A quadratic least squares (LS) context-free image quality model is described from which the context dependent interpolation coefficients are derived. It is shown how ensembles of high-resolution images can be used to capture the a priori special character of different context classes. As a consequence, a priori information such as the translational invariance of edges along the edge direction, edge discontinuity, and the character of corners is captured and can be used to interpret image array data with greater spatial resolution than would be expected by the Nyquist limit. A Gibb-like artifact associated with this super-resolution is discussed. More realistic context dependent image quality models are needed and a suggestion is made for using a quality model which now is finding application in data compression.

Beaudet, Paul R.↗

Intensity and polarization of light scattered by size distributions of randomly oriented nonspherical particles

Calculations of light scattering by small particles are important in many diverse fields of science and engineering. In many cases of practical interest, scattering particles are nonspherical and are distributed over sizes and orientations. However, accurate light scattering computations for ensembles of nonspherical particles are difficult and time-consuming, and the literature in which such calculations are reported is rather scarce. In this paper, the T-matrix approach, as extended recently to randomly oriented particles, is used to calculate rigorously light scattering by size distributions of randomly oriented axially symmetric particles. To model the variation of particle sizes in real ensembles, we use a power law distribution typical of some terrestrial aerosols. Contour plots of intensity and degree of linear polarization for polydisperse prolate and oblate spheroids of different aspect ratios and effective equivalent-sphere size parameters from 0 to 10 are calculated and compared with calculations for equivalent spheres. The angular scattering behavior of nonspherical polydispersions is found to be greatly different from that of spheres, while the scattering properties of oblate and prolate spheroids of the same aspect ratio are similar. With increasing particle size, both intensity and polarization become more shape-dependent. In general, nonspherical particles are stronger side scatterers and weaker backscatterers than equivalent spheres. With increasing aspect ratio of nonspherical particles polarization tends to be predominantly positive. Possible effects of particle nonsphericity on optical remote sensing of atmospheric aerosols are discussed.

Mishchenko, M. I.↗

An Efficient GPU-Accelerated Multi-Source Global Fit Pipeline for LISA Data Analysis

The large-scale analysis task of deciphering gravitational wave signals in the LISA data stream will be difficult, requiring a large amount of computational resources and extensive development of computational methods. Its high dimensionality, multiple model types, and complicated noise profile require a global fit to all parameters and input models simultaneously. In this work, we detail our global fit algorithm, called “Erebor,” designed to accomplish this challenging task. It is capable of analysing current state-of-the-art datasets and then growing into the future as more pieces of the pipeline are completed and added. We describe our pipeline strategy, the algorithmic setup, and the results from our analysis of the LDC2A Sangria dataset, which contains Massive Black Hole Binaries, compact Galactic Binaries, and a parameterized noise spectrum whose parameters are unknown to the user. The Erebor algorithm includes three unique and very useful contributions: GPU acceleration for enhanced computational efficiency; ensemble MCMC sampling with multiple MCMC walkers per temperature for better mixing and parallelized sample creation; and special online updates to reversible-jump (or trans-dimensional) sampling distributions to ensure sampler mixing and accurate initial estimates for detectable sources in the data. We recover posterior distributions for all 15 (6) of the injected MBHBs in the LDC2A training (hidden) dataset. We catalog ∼12000 Galactic Binaries (∼8000 as high confidence detections) for both the training and hidden datasets. All of the sources and their posterior distributions are provided in publicly available catalogs.

LISA global fit↗

Efficient GPU-Accelerated MultiSource Global Fit Pipeline for LISA Data Analysis

The large-scale analysis task of deciphering gravitational-wave signals in the LISA data stream will be difficult, requiring a large amount of computational resources and extensive development of computational methods. Its high dimensionality, multiple model types, and complicated noise profile require a global fit to all parameters and input models simultaneously. In this work, we detail our global fit algorithm, called “Erebor,” designed to accomplish this challenging task. It is capable of analyzing current state-of-the-art datasets and then growing into the future as more pieces of the pipeline are completed and added. We describe our pipeline strategy, the algorithmic setup, and the results from our analysis of the LDC2A Sangria dataset, which contains massive black hole binaries, compact galactic binaries, and a parametrized noise spectrum whose parameters are unknown to the user. The Erebor algorithm includes three unique and very useful contributions: GPU acceleration for enhanced computational efficiency; ensemble Markov Chain Monte Carlo (MCMC) sampling with multiple MCMC walkers per temperature for better mixing and parallelized sample creation; and special online updates to reversible-jump (or transdimensional) sampling distributions to ensure sampler mixing and accurate initial estimates for detectable sources in the data.We recover posterior distributions for all 15 (6) of the injected massive black hole binaries (MBHB) in the LDC2A training (hidden) dataset. We catalog ∼12000 galactic binaries (∼8000 as high confidence detections) for both the training and hidden datasets. All of the sources and their posterior distributions are provided in publicly available catalogs.

LISA↗

Highly parallel reconfigurable computer architecture for robotic computation having plural processor cells each having right and left ensembles of plural processors

In a computer having a large number of single-instruction multiple data (SIMD) processors, each of the SIMD processors has two sets of three individual processor elements controlled by a master control unit and interconnected among a plurality of register file units where data is stored. The register files input and output data in synchronism with a minor cycle clock under control of two slave control units controlling the register file units connected to respective ones of the two sets of processor elements. Depending upon which ones of the register file units are enabled to store or transmit data during a particular minor clock cycle, the processor elements within an SIMD processor are connected in rings or in pipeline arrays, and may exchange data with the internal bus or with neighboring SIMD processors through interface units controlled by respective ones of the two slave control units.

Fijany, Amir↗

Parallel solution of closely coupled systems

An odd-even permutation and a nested dissection technique were used to circumvent the strong seriality of a system of closely coupled equations. The effect of transforming the n x n Hermitian definite positive matrix coefficient on the topology of Cholesky factors is discussed. A series of directed graphs is constructed in order to show the computational steps required for the odd-even permutation. Numerical expressions for the speed-up and efficiency of parallel N-processing techniques and sequential processing by a single computer are derived. Similar expressions are derived for the case of insufficient processing capacity. The application of the odd-even permutation to the ensemble class of computer architectures is demonstrated.

Utku, S.↗

A new method for simulating atmospheric turbulence for rotorcraft applications

Simulation of atmospheric turbulence as seen by a rotating blade element involves treatment of cyclostationary processes. Conventional filtering techniques do not lend themselves well to the generation of such turbulence sample functions as are required in rotorcraft flight dynamics simulation codes. A method to generate sample functions containing second order statistics of mean and covariance is presented. Compared to ensemble averaging involving excessive computer time, the novelty is to exploit cycloergodicity and thereby, replace ensemble averaging by averaging over a single path sample function of long duration. The method is validated by comparing its covariance results with the analytical and ensemble averaged results for a widely used 1-D turbulence approximation.

J. Riaz↗

A new method for simulating atmospheric turbulence for rotorcraft applications

Simulation of atmospheric turbulence as seen by a rotating blade element involves treatment of cyclostationary processes. Conventional filtering techniques do not lend themselves well to the generation of such turbulence sample functions as are required in rotorcraft flight dynamics simulation codes. A method to generate sample functions containing second-order statistics of mean and covariance is presented. Compared to ensemble averaging involving excessive computer time, the novelty is to exploit cycloergodicity and thereby, replace ensemble averaging by averaging over a single-path sample function of long duration. The method is validated by comparing its covariance results with the analytical and ensemble-averaged results for a widely used one-dimensional turbulence approximation.

Prasad, J. V. R.↗

Principal component analysis of solar flares in the soft X-ray flux

The paper considers principal component analysis of solar flares in the soft X-ray flux, a technique for extracting the salient features from a mass of data. The method applies particularly to the analysis of nonstationary ensembles, and its computations require the evaluation of eigenvalues of matrices. The Eispack matrix eigen system routines were used to analyze full-disk proportional-counter data from the X-ray event analyzer which was part of the Skylab experiment. Empirical orthogonal functions were derived for events in the soft X-ray spectrum between 2.5 and 20 A during different time periods, indicating that about 90% of the cumulative power of each analyzed flare is contained in the largest eigenvector. The first two largest eigenvectors are sufficient for an empirical curve fit through the raw data and a characterization of solar flares in the soft X-ray flux, and power spectra of two largest eigenvectors reveal a reported periodicity of about 5 min.

Teuber, D. L.↗