Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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 1,675 records · Page 93

JavaGenes Molecular Evolution

JavaGenes is a general-purpose, evolutionary software system written in Java. It implements several versions of a genetic algorithm, simulated annealing, stochastic hill climbing, and other search techniques. This software has been used to evolve molecules, atomic force field parameters, digital circuits, Earth Observing Satellite schedules, and antennas. This version differs from version 0.7.28 in that it includes the molecule evolution code and other improvements. Except for the antenna code, JaveGenes is available for NASA Open Source distribution.

Lohn, Jason↗

Optimal Padding for the Two-Dimensional Fast Fourier Transform

One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that can benefit from this algorithm, including optics, image-processing, signal-processing, and engineering applications.

Dean, Bruce H.↗

Stall Recovery Guidance Using Fast Model Predictive Control

Based on a detailed analysis of recent loss-of-control events, the Aircraft State Awareness Joint Safety Analysis Team has identified the need to develop algorithms and display strategies to provide control guidance for recovery from approach-to-stall or stall. In order to be effective, such guidance should enhance the pilots ability to execute the Federal Aviation Administrations recommended stall recovery procedure. This paper explores the use of a fast model predictive control algorithm that determines near optimal recovery guidance, which quantifies the aircraft configuration and situation dependent recovery information required to maximize the effectiveness of the recovery. This information includes the magnitude of the initial pitch down maneuver, the specific amount of airspeed and thrust needed before pulling out of the recovery dive, as well as the maximum pitch-up rate that can be sustained without causing a secondary stall. The algorithm was integrated and tested with an in-house desktop simulator that implements the General Transport Aircraft model and the associated stall aircraft dynamics. Preliminary results are presented to demonstrate the use of the proposed approach as a recovery aid for pilots.

predictive control↗

Frequency comparisons via GPS carrier-phase: jump processing, temperature compensation and zero/short-baseline noise-floors

GPS carrier-phase receivers have been used to produce high quality time/frequency comparisons between clocks and frequency standards. Current ways of processing the carrier-phase data, however, result in phase jumps and data gaps that make the data difficult to use effectively and repeatedly for long datasets. In addition, temperature fluctuations generally perturb receiver output detrimentally. We describe the steps of a simple but effective automated algorithm for comparing frequencies that can compensate for data gaps, day boundary jumps, and other phase jumps as well as for temperature disturbances. We describe process features and focus on zero-baseline noise-floors, measuring Allan deviations of the Deep Space Atomic Clock mission’s receiver down to 1x10-17 at 5x105 seconds, with an upper confidence level of 3x10-17. The zero-baseline noise floors we present give confidence in our algorithm and temperature compensation’s robustness.

Diener, William A.↗

MODIS Reflective Solar Bands Calibration Improvements for Collection 7

Calibration of Terra and Aqua MODIS reflective solar bands (RSB) has evolved significantly since the launch of the first MODIS instrument on the Terra satellite more than 21 years ago. In NASA’s current Collection 6 and 6.1 Level 1B products (C6/C6.1 L1B), the RSB calibration algorithm continues to rely primarily on the onboard solar diffuser to calibrate the instrument gain. Lunar observations are used to track on-orbit changes in the response versus scan angle (RVS), and data from pseudo-invariant desert sites are used to apply adjustments to the gain and RVS calibration for select bands. The resulting reflectance products have in general shown a very stable performance. In recent years, some performance degradation has been noted for a few bands and algorithm changes have been tested to further improve the calibration accuracy for the upcoming Collection 7 (C7) L1B reprocess. In this paper, we present the MODIS RSB calibration improvements that will be included in C7. Major improvements include: applying polarization correction to the desert data before using it to generateRVS for Terra bands 8, 9, 3, and 10; using ocean scene data and an interband calibration approach to correct for long-term drift of Terra bands 11 and 12; applying an updated crosstalk correction to Terra SWIR bands over the entire mission; and using data from deep convective clouds in Terra SWIR band calibration, including the addition of time-dependent RVS for bands 5 and 26. All other minor calibration changes are also covered. Overall, the reflectance differences at nadir between C6.1 and C7 are within a few percent, though the differences increase in some cases at large scan angles. The Terra visible (3, 8-12) and SWIR bands (5-7, 26) have the most significant improvements. For all other Terra bands and all Aqua bands, the C7-C6.1 differences are mostly within 1%

MODIS↗

NASA Tech Briefs, September 2006

Topics covered include: Improving Thermomechanical Properties of SiC/SiC Composites; Aerogel/Particle Composites for Thermoelectric Devices; Patches for Repairing Ceramics and Ceramic- Matrix Composites; Lower-Conductivity Ceramic Materials for Thermal-Barrier Coatings; An Alternative for Emergency Preemption of Traffic Lights; Vehicle Transponder for Preemption of Traffic Lights; Automated Announcements of Approaching Emergency Vehicles; Intersection Monitor for Traffic-Light-Preemption System; Full-Duplex Digital Communication on a Single Laser Beam; Stabilizing Microwave Frequency of a Photonic Oscillator; Microwave Oscillators Based on Nonlinear WGM Resonators; Pointing Reference Scheme for Free-Space Optical Communications Systems; High-Level Performance Modeling of SAR Systems; Spectral Analysis Tool 6.2 for Windows; Multi-Platform Avionics Simulator; Silicon-Based Optical Modulator with Ferroelectric Layer; Multiplexing Transducers Based on Tunnel-Diode Oscillators; Scheduling with Automated Resolution of Conflicts; Symbolic Constraint Maintenance Grid; Discerning Trends in Performance Across Multiple Events; Magnetic Field Solver; Computing for Aiming a Spaceborne Bistatic- Radar Transmitter; 4-Vinyl-1,3-Dioxolane-2-One as an Additive for Li-Ion Cells; Probabilistic Prediction of Lifetimes of Ceramic Parts; STRANAL-PMC Version 2.0; Micromechanics and Piezo Enhancements of HyperSizer; Single-Phase Rare-Earth Oxide/Aluminum Oxide Glasses; Tilt/Tip/Piston Manipulator with Base-Mounted Actuators; Measurement of Model Noise in a Hard-Wall Wind Tunnel; Loci-STREAM Version 0.9; The Synergistic Engineering Environment; Reconfigurable Software for Controlling Formation Flying; More About the Tetrahedral Unstructured Software System; Computing Flows Using Chimera and Unstructured Grids; Avoiding Obstructions in Aiming a High-Gain Antenna; Analyzing Aeroelastic Stability of a Tilt-Rotor Aircraft; Tracking Positions and Attitudes of Mars Rovers; Stochastic Evolutionary Algorithms for Planning Robot Paths; Compressible Flow Toolbox; Rapid Aeroelastic Analysis of Blade Flutter in Turbomachines; General Flow-Solver Code for Turbomachinery Applications; Code for Multiblock CFD and Heat-Transfer Computations; Rotating-Pump Design Code; Covering a Crucible with Metal Containing Channels; Repairing Fractured Bones by Use of Bioabsorbable Composites; Kalman Filter for Calibrating a Telescope Focal Plane; Electronic Absolute Cartesian Autocollimator; Fiber-Optic Gratings for Lidar Measurements of Water Vapor; Simulating Responses of Gravitational-Wave Instrumentation; SOFTC: A Software Correlator for VLBI; Progress in Computational Simulation of Earthquakes; Database of Properties of Meteors; Computing Spacecraft Solar-Cell Damage by Charged Particles; Thermal Model of a Current-Carrying Wire in a Vacuum; Program for Analyzing Flows in a Complex Network; Program Predicts Performance of Optical Parametric Oscillators; Processing TES Level-1B Data; Automated Camera Calibration; Tracking the Martian CO2 Polar Ice Caps in Infrared Images; Processing TES Level-2 Data; SmaggIce Version 1.8; Solving the Swath Segment Selection Problem; The Spatial Standard Observer; Less-Complex Method of Classifying MPSK; Improvement in Recursive Hierarchical Segmentation of Data; Using Heaps in Recursive Hierarchical Segmentation of Data; Tool for Statistical Analysis and Display of Landing Sites; Automated Assignment of Proposals to Reviewers; Array-Pattern-Match Compiler for Opportunistic Data Analysis; Pre-Processor for Compression of Multispectral Image Data; Compressing Image Data While Limiting the Effects of Data Losses; Flight Operations Analysis Tool; Improvement in Visual Target Tracking for a Mobile Robot; Software for Simulating Air Traffic; Automated Vectorization of Decision-Based Algorithms; Grayscale Optical Correlator Workbench; "One-Stop Shopping" for Ocean Remote-Sensing and Model Data; State Analysis Database Tool; Generating CAHV and CAHVOmages with Shadows in ROAMS; Improving UDP/IP Transmission Without Increasing Congestion; FORTRAN Versions of Reformulated HFGMC Codes; Program for Editing Spacecraft Command Sequences; Flight-Tested Prototype of BEAM Software; Mission Scenario Development Workbench; Marsviewer; Tool for Analysis and Reduction of Scientific Data; ASPEN Version 3.0; Secure Display of Space-Exploration Images; Digital Front End for Wide-Band VLBI Science Receiver; Multifunctional Tanks for Spacecraft; Lightweight, Segmented, Mostly Silicon Telescope Mirror; Assistant for Analyzing Tropical-Rain-Mapping Radar Data; and Anion-Intercalating Cathodes for High-Energy- Density Cells.

Source record↗

The Impact and Estimation of Uncertainty Correlation for Multi-Angle Polarimetric Remote Sensing of Aerosols and Ocean Color

Multi-angle polarimetric (MAP) measurements contain rich information for characterization of aerosol microphysical and optical properties that can be used to improve atmospheric correction in ocean color remote sensing. Advanced retrieval algorithms have been developed to obtain multiple geophysical parameters in the atmosphere-ocean system, although uncertainty correlation among measurements is generally ignored due to lack of knowledge on its strength and characterization. In this work, we provide a practical framework to evaluate the impact of the angular uncertainty correlation from retrieval results and a method to estimate correlation strength from retrieval fitting residuals. The Fast Multi-Angular Polarimetric Ocean coLor (FastMAPOL) retrieval algorithm, based on neural network forward models, is used to conduct the retrievals and uncertainty quantification. In addition, we also discuss a flexible approach to include a correlated uncertainty model in the retrieval algorithm. The impact of angular correlation on retrieval uncertainties is discussed based on synthetic AirHARP and HARP2 measurements using a Monte Carlo uncertainty estimation method. Correlation properties are estimated using auto-correlation functions based on the fitting residuals from both synthetic AirHARP and HARP2 data and real AirHARP measurement, with the resulting angular correlation parameters found to be larger than 0.9 and 0.8 for reflectance and DoLP, respectively, which correspond to correlation angles of 10° and 5°. Although this study focuses on angular correlation from HARP instruments, the methodology to study and quantify uncertainty correlation is also applicable to other instruments with angular, spectral, or spatial correlations, and can help inform laboratory calibration and characterization of the instrument uncertainty structure.

PACE↗

QSpace - An open-source tensor library for Abelian and non-Abelian symmetries

This is the documentation for the tensor library QSpace (v4.0), a toolbox to exploit ‘quan tum symmetry spaces’ in tensor network states in the quantum many-body context. QSpace permits arbitrary combinations of symmetries including the abelian symmetries $\mathbb{Z}_n$ and U(1), as well as all non-abelian symmetries based on the semisimple classical Lie algebras: A n , B n , C n , and D n , or respectively, the special unitary group SU(n), the odd orthogonal group SO(2n+1), the symplectic group Sp(2n), and the even orthogonal group SO(2n). The code (C++ embedded via the MEX interface into Matlab) is available open source as of QSpace v4.0 on bitbucket under the Apache 2.0 license. QSpace is designed as a bottom-up approach for non-abelian symmetries. It starts from the defining representation and the respective Lie algebra. By explicitly comput ing and tabulating generalized Clebsch-Gordan coefficient tensors, QSpace is versatile in the type of operations that it can perform across all symmetries. At the level of an ap plication, much of the symmetry-related details are hidden within the QSpace C++ core libraries. Hence when developing tensor network algorithms with QSpace, these can be coded (nearly) as if there are no symmetries at all, despite being able to fully exploit general non-abelian symmetries.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Generalized and Mechanistic PV Module Performance Prediction From Computer Vision and Machine Learning on Electroluminescence Images

Electroluminescence (EL) imaging of photovoltiac (PV) modules offers high-speed, high-resolution information about device performance, affording opportunities for greater insight and efficiency in module characterization across manufacturing, research and development, and power plant operations and management. Predicting module electrical properties from EL image features is a critical step toward these applications. In this article, we demonstrate quantification of both generalized and performance mechanism-specific EL image features, using pixel intensity-based and machine learning classification algorithms. From EL image features, we build predictive models for PV module power and series resistance, using time-series current-voltage (I-V) and EL data obtained stepwise on five brands of modules spanning three Si cell types through two accelerated exposures: damp heat (DH) (85°C/85% RH) and thermal cycling (TC) (IEC 61215). Overall, 195 pairs of EL images and I-V characteristics were analyzed, yielding 11700 individual PV cell images. A convolutional neural network was built to classify cells by the severity of busbar corrosion with high accuracy (95%). Generalized power predictive models estimated the maximum power of PV modules from EL images with high confidence and an adjusted-R 2 of 0.88, across all module brands and cell types in extended DH and TC exposures. Mechanistic degradation prediction was demonstrated by quantification of busbar corrosion in EL images of three module brands in DH, and subsequent modeling of series resistance using these mechanism-specific EL image features. For modules exhibiting busbar corrosion, we demonstrated series resistance predictive models with adjusted-R 2 of up to 0.73.

14 SOLAR ENERGY↗

A vectorized solution for incompressible flow

An algorithm is developed to obtain solutions to the unsteady Reynolds-averaged incompressible Navier-Stokes equations in general curvilinear coordinates on a vector processor. The governing equations are in nonconservative form with the velocity and pressure as dependent variables. Two momentum equations and the Poisson equation for pressure form a set of three governing equations for three flow field unknowns: u, v, and p. The governing equations and boundary conditions are expressed in terms of boundary-conforming curvilinear coordinates, and a checkerboard SOR iteration is used to solve the governing equations. Several possible sequences for a checkerboard SOR iteration are investigated for finding the best overall convergence rate. The efficiency and capability of the present algorithm was assessed using the example of an 18 percent thick NACA 66(3)018 airfoil at zero degree angle of attack for chord Reynolds number range 1000-40,000.

Patel, N. R.↗

Variational preparation of the thermofield double state of the Sachdev-Ye-Kitaev model

Here, we provide an algorithm for preparing the thermofield double (TFD) state of the Sachdev-Ye-Kitaev (SYK) model without the need for an auxiliary bath. Following previous work, the TFD can be cast as the approximate ground state of a Hamiltonian, H TFD . Using variational quantum circuits, we propose and implement a gradient-based algorithm for learning parameters that find this ground state, an application of the variational quantum eigensolver. Concretely, we find shallow quantum circuits that prepare the ground state of H TFD for the q = 4 SYK model for N = 8 Majoranas per side. For N = 12, we achieve a variational energy within 1% of the true ground-state energy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Revisiting matrix-based inversion of scanning mobility particle sizer (SMPS) and humidified tandem differential mobility analyzer (HTDMA) data

Abstract. Tikhonov regularization is a tool for reducing noise amplification during data inversion. This work introduces RegularizationTools.jl, a general-purpose software package for applying Tikhonov regularization to data. The package implements well-established numerical algorithms and is suitable for systems of up to ∼ 1000 equations. Included is an abstraction to systematically categorize specific inversion configurations and their associated hyperparameters. A generic interface translates arbitrary linear forward models defined by a computer function into the corresponding design matrix. This obviates the need to explicitly write out and discretize the Fredholm integral equation, thus facilitating fast prototyping of new regularization schemes associated with measurement techniques. Example applications include the inversion involving data from scanning mobility particle sizers (SMPSs) and humidified tandem differential mobility analyzers (HTDMAs). Inversion of SMPS size distributions reported in this work builds upon the freely available software DifferentialMobilityAnalyzers.jl. The speed of inversion is improved by a factor of ∼ 200, now requiring between 2 and 5 ms per SMPS scan when using 120 size bins. Previously reported occasional failure to converge to a valid solution is reduced by switching from the L-curve method to generalized cross-validation as the metric to search for the optimal regularization parameter. Higher-order inversions resulting in smooth, denoised reconstructions of size distributions are now included in DifferentialMobilityAnalyzers.jl. This work also demonstrates that an SMPS-style matrix-based inversion can be applied to find the growth factor frequency distribution from raw HTDMA data while also accounting for multiply charged particles. The outcome of the aerosol-related inversion methods is showcased by inverting multi-week SMPS and HTDMA datasets from ground-based observations, including SMPS data obtained at Bodega Marine Laboratory during the CalWater 2/ACAPEX campaign and co-located SMPS and HTDMA data collected at the US Department of Energy observatory located at the Southern Great Plains site in Oklahoma, USA. Results show that the proposed approaches are suitable for unsupervised, nonparametric inversion of large-scale datasets as well as inversion in real time during data acquisition on low-cost reduced-instruction-set architectures used in single-board computers. The included software implementation of Tikhonov regularization is freely available, general, and domain-independent and thus can be applied to many other inverse problems arising in atmospheric measurement techniques and beyond.

54 ENVIRONMENTAL SCIENCES↗

A multidimensional model for aerosols - Description of computational analogs

The numerical algorithms used to simulate the advection, diffusion, sedimentation, coagulation, and condensational growth of atmospheric aerosols are described. The model can be used in one, two, or three spatial dimensions. The continuity equation in a generalized horizontal and vertical coordinate system is developed, which allows the model to be quickly adapted to a wide variety of dynamical models of global or regional scale. Algorithms are developed to treat the various physical processes, and the results of simulations are presented, which show the strengths and weaknesses of these algorithms. Although the emphasis is on the modeling of aerosols, the work is also applicable to the simulations of the transport of gases.

Toon, O. B.↗

State preparation and measurement in a quantum simulation of the $O(\mathrm{3})$ sigma model

Recently, Singh and Chandrasekharan [Phys. Rev. D 100, 054505 (2019)] showed that fixed points of the nonlinear O ( 3 ) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. In a paper by the NuQS Collaboration [Phys. Rev. Lett. 123, 090501 (2019)], the proposal is made to simulate such field theories on a quantum computer using the universal properties of a similar model. In this paper, following that direction, we demonstrate how to prepare the ground state of the model from Singh and Chandrasekharan and measure a dynamical quantity of interest, the O ( 3 ) Noether charge, on a quantum computer. In particular, we apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes and use shadow tomography to measure the dynamics of local observables. Finally, we then present and analyze a quantum algorithm based on nonunitary randomized simulation methods that may yield an approach suitable for intermediate-term noisy quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

WELDSMART: A vision-based expert system for quality control

This work was aimed at exploring means for utilizing computer technology in quality inspection and evaluation. Inspection of metallic welds was selected as the main application for this development and primary emphasis was placed on visual inspection, as opposed to other inspection methods, such as radiographic techniques. Emphasis was placed on methodologies with the potential for use in real-time quality control systems. Because quality evaluation is somewhat subjective, despite various efforts to classify discontinuities and standardize inspection methods, the task of using a computer for both inspection and evaluation was not trivial. The work started out with a review of the various inspection techniques that are used for quality control in welding. Among other observations from this review was the finding that most weld defects result in abnormalities that may be seen by visual inspection. This supports the approach of emphasizing visual inspection for this work. Quality control consists of two phases: (1) identification of weld discontinuities (some of which may be severe enough to be classified as defects), and (2) assessment or evaluation of the weld based on the observed discontinuities. Usually the latter phase results in a pass/fail judgement for the inspected piece. It is the conclusion of this work that the first of the above tasks, identification of discontinuities, is the most challenging one. It calls for sophisticated image processing and image analysis techniques, and frequently ad hoc methods have to be developed to identify specific features in the weld image. The difficulty of this task is generally not due to limited computing power. In most cases it was found that a modest personal computer or workstation could carry out most computations in a reasonably short time period. Rather, the algorithms and methods necessary for identifying weld discontinuities were in some cases limited. The fact that specific techniques were finally developed and successfully demosntrated to work illustrates that the general approach taken here appears to be promising for commercial development of computerized quality inspection systems. Inspection based on these techniques may be used to supplement or substitute more elaborate inspection methods, such as x-ray inspections.

Andersen, Kristinn↗

Validation and Scaling of Soil Moisture in a Semi-Arid Environment: SMAP Validation Experiment 2015 (SMAPVEX15)

The NASA SMAP (Soil Moisture Active Passive) mission conducted the SMAP Validation Experiment 2015 (SMAPVEX15) in order to support the calibration and validation activities of SMAP soil moisture data products. The main goals of the experiment were to address issues regarding the spatial disaggregation methodologies for improvement of soil moisture products and validation of the in situ measurement upscaling techniques. To support these objectives high-resolution soil moisture maps were acquired with the airborne PALS (Passive Active L-band Sensor) instrument over an area in southeast Arizona that includes the Walnut Gulch Experimental Watershed (WGEW), and intensive ground sampling was carried out to augment the permanent in situ instrumentation. The objective of the paper was to establish the correspondence and relationship between the highly heterogeneous spatial distribution of soil moisture on the ground and the coarse resolution radiometer-based soil moisture retrievals of SMAP. The high-resolution mapping conducted with PALS provided the required connection between the in situ measurements and SMAP retrievals. The in situ measurements were used to validate the PALS soil moisture acquired at 1-km resolution. Based on the information from a dense network of rain gauges in the study area, the in situ soil moisture measurements did not capture all the precipitation events accurately. That is, the PALS and SMAP soil moisture estimates responded to precipitation events detected by rain gauges, which were in some cases not detected by the in situ soil moisture sensors. It was also concluded that the spatial distribution of the soil moisture resulted from the relatively small spatial extents of the typical convective storms in this region was not completely captured with the in situ stations. After removing those cases (approximately10 of the observations) the following metrics were obtained: RMSD (root mean square difference) of0.016m3m3 and correlation of 0.83. The PALS soil moisture was also compared to SMAP and in situ soil moisture at the 36-km scale, which is the SMAP grid size for the standard product. PALS and SMAP soil moistures were found to be very similar owing to the close match of the brightness temperature measurements and the use of a common soil moisture retrieval algorithm. Spatial heterogeneity, which was identified using the high-resolution PALS soil moisture and the intensive ground sampling, also contributed to differences between the soil moisture estimates. In general, discrepancies found between the L-band soil moisture estimates and the 5-cm depth in situ measurements require methodologies to mitigate the impact on their interpretations in soil moisture validation and algorithm development. Specifically, the metrics computed for the SMAP radiometer-based soil moisture product over WGEW will include errors resulting from rainfall, particularly during the monsoon season when the spatial distribution of soil moisture is especially heterogeneous.

SMAPVEX15↗

Introduction to a system for implementing neural net connections on SIMD architectures

Neural networks have attracted much interest recently, and using parallel architectures to simulate neural networks is a natural and necessary application. The SIMD model of parallel computation is chosen, because systems of this type can be built with large numbers of processing elements. However, such systems are not naturally suited to generalized communication. A method is proposed that allows an implementation of neural network connections on massively parallel SIMD architectures. The key to this system is an algorithm permitting the formation of arbitrary connections between the neurons. A feature is the ability to add new connections quickly. It also has error recovery ability and is robust over a variety of network topologies. Simulations of the general connection system, and its implementation on the Connection Machine, indicate that the time and space requirements are proportional to the product of the average number of connections per neuron and the diameter of the interconnection network.

Tomboulian, Sherryl↗

Introduction to a system for implementing neural net connections on SIMD architectures

Neural networks have attracted much interest recently, and using parallel architectures to simulate neural networks is a natural and necessary application. The SIMD model of parallel computation is chosen, because systems of this type can be built with large numbers of processing elements. However, such systems are not naturally suited to generalized elements. A method is proposed that allows an implementation of neural network connections on massively parallel SIMD architectures. The key to this system is an algorithm permitting the formation of arbitrary connections between the neurons. A feature is the ability to add new connections quickly. It also has error recovery ability and is robust over a variety of network topologies. Simulations of the general connection system, and its implementation on the Connection Machine, indicate that the time and space requirements are proportional to the product of the average number of connections per neuron and the diameter of the interconnection network.

Tomboulian, Sherryl↗