Search NASA⌕ Search

SEARCH · Search NASA

Results for “weighted network”

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

Sensitivity of feedforward neural networks to weight errors

An analysis is made of the sensitivity of feedforward layered networks of Adaline elements (threshold logic units) to weight errors. An approximation is derived which expresses the probability of error for an output neuron of a large network (a network with many neurons per layer) as a function of the percentage change in the weights. As would be expected, the probability of error increases with the number of layers in the network and with the percentage change in the weights. The probability of error is essentially independent of the number of weights per neuron and of the number of neurons per layer, as long as these numbers are large (on the order of 100 or more).

Stevenson, Maryhelen↗

Markov Chain Monte Carlo Bayesian Learning for Neural Networks

Conventional training methods for neural networks involve starting al a random location in the solution space of the network weights, navigating an error hyper surface to reach a minimum, and sometime stochastic based techniques (e.g., genetic algorithms) to avoid entrapment in a local minimum. It is further typically necessary to preprocess the data (e.g., normalization) to keep the training algorithm on course. Conversely, Bayesian based learning is an epistemological approach concerned with formally updating the plausibility of competing candidate hypotheses thereby obtaining a posterior distribution for the network weights conditioned on the available data and a prior distribution. In this paper, we developed a powerful methodology for estimating the full residual uncertainty in network weights and therefore network predictions by using a modified Jeffery's prior combined with a Metropolis Markov Chain Monte Carlo method.

Goodrich, Michael S.↗

Low-frequency sine wave hard-limiting technique

Circuit includes serial-in/parallel-out shift register and weighting network that are used to eliminate effects of noise and other nonrepetitive circuit transients. Register and weighting network average decisions from section of signal where decisions are more dependable or where differences between two consecutive samples are larger.

Anderson, T. O.↗

Design of a 24-channel transmultiplexer

The design of a transmultiplexer capable of performing the bilateral conversion between one 1544 kbit/s digital signal (which represents 24 PCM coded voice channels) and two analog group signals (each one containing 12 voice channels in the 60-108 kHz band) is investigated. It is shown that an FIR filter bank required as part of such a transmultiplexer can be realized efficiently by cascading a discrete cosine transform processor and a weighting network. Fast convolution algorithms are derived for evaluating the cosine transform. A method of using the symmetry conditions to reduce the computation rate in the weighting network and an elegant hardware configuration for implementing it are also discussed.

Narasimha, M. J.↗

A general weight matrix formulation using optimal control

Classical methods from optimal control theory are used in deriving general forms for neural network weights. The network learning or application task is encoded in a performance index of a general structure. Consequently, different instances of this performance index lead to special cases of weight rules, including some well-known forms. Comparisons are made with the outer product rule, spectral methods, and recurrent back-propagation. Simulation results and comparisons are presented.

Farotimi, Oluseyi↗

Quantifying Spatial Drought Propagation Potential in North America Using Complex Network Theory

Droughts have a dominant three-dimensional (3-D) spatiotemporal structure typically spanning hundreds of kilometers and often lasting for months to years. Here, we introduced a novel framework to explore the 3-D structure of the evolution of droughts based on network theory concepts. The proposed framework is applied to identify critical source regions responsible for large-scale drought onsets during 1901–2014 for the North American continent using the Standardized Precipitation Evaporation Index (SPEI). We built a spatial network connecting the drought onset timings for the North American continent. Using a spatially weighted network partitioning algorithm, the whole continent is then classified into regional spatial drought networks (RSN), where droughts are more likely to propagate within these regional systems. Finally, a customized network metric was applied to identify locations (source regions) where the drought onsets further propagate to other areas within the regional spatial network. Our results indicated that the West coast, Texas coastal region, and Southeastern Arkansas as major source regions through which atmospheric drought propagates to Western, South Central, and Eastern North America. The formation of drought source regions are due to presence of high pressure ridges and anomalous wind patterns. Furthermore, our results indicate that the drought propagation from these source regions may be due to inadequate moisture transport. The proposed framework can help to develop an early warning detection system for droughts and other spatially extensive extreme events such as heatwaves and floods.

Goutam Konapala↗

Real-time Adaptive Control Using Neural Generalized Predictive Control

The objective of this paper is to demonstrate the feasibility of a Nonlinear Generalized Predictive Control algorithm by showing real-time adaptive control on a plant with relatively fast time-constants. Generalized Predictive Control has classically been used in process control where linear control laws were formulated for plants with relatively slow time-constants. The plant of interest for this paper is a magnetic levitation device that is nonlinear and open-loop unstable. In this application, the reference model of the plant is a neural network that has an embedded nominal linear model in the network weights. The control based on the linear model provides initial stability at the beginning of network training. In using a neural network the control laws are nonlinear and online adaptation of the model is possible to capture unmodeled or time-varying dynamics. Newton-Raphson is the minimization algorithm. Newton-Raphson requires the calculation of the Hessian, but even with this computational expense the low iteration rate make this a viable algorithm for real-time control.

Haley, Pam↗

Model-free distributed learning

Model-free learning for synchronous and asynchronous quasi-static networks is presented. The network weights are continuously perturbed, while the time-varying performance index is measured and correlated with the perturbation signals; the correlation output determines the changes in the weights. The perturbation may be either via noise sources or orthogonal signals. The invariance to detailed network structure mitigates large variability between supposedly identical networks as well as implementation defects. This local, regular, and completely distributed mechanism requires no central control and involves only a few global signals. Thus it allows for integrated on-chip learning in large analog and optical networks.

Dembo, Amir↗

The INSTEP Monitoring Network: Merging High-and-Low Cost Measurements to Characterize California Wildfires

Despite challenges with data quality and scope, low-cost sensor networks have skyrocketed in popularity over the last 15 years, making air quality data available on refined spatial scales. More recently, studies have leveraged both high and low-quality instruments to create stronger “hybrid” models, with most studies focusing on particulate matter. Low-cost measurements typically represent ground-level emissions only, providing context for human health issues from climate change-driven events such as wildfires. Since low-cost sensors’ capabilities are localized, daily events and microclimates tend to dominate the data rather than larger regional or atmospheric trends. Likewise, their low cost explains their high uncertainty. In contrast, some regulatory-grade instruments produce column measurements as well, providing reliable information on a broader scope. To bridge this gap while expanding into gas-phase measurements, we deployed 12 air quality sensor packages in California, USA during the 2022 wildfire season. These INSTEP (Inexpensive Network Sensor Technology Exploring Pollution) monitors measure carbon monoxide (CO), carbon dioxide (CO2), ozone (O3), nitrogen dioxide (NO2), and several hydrocarbons including methane (CH4) and formaldehyde (HCHO). Half of the monitors were co-located with remote sensing spectrometers: NASA Pandora and Total Column Carbon Observing Network (TCCON). The overlap in pollutants includes NO2, O3, and HCHO between the INSTEP monitors and the Pandora column measurements. TCCON covers column CO, CO2, and CH4, rounding out our comparison. Most of the monitors were distributed throughout the San Francisco Bay area, and an additional three were located within 100 km of Los Angeles. The sites ranged in geographic and population characteristics, including desert, mountainous, coastal, and urban locations. Since varying environmental conditions such as temperature and pressure are known to challenge sensor performance, we will apply newer sensor “calibration” techniques meant to combat this. We will normalize our sensor signals by z-scoring them prior to applying a single calibration model in the form of multivariate linear regression or an artificial neural network. While this technique has been validated for the hydrocarbon and ozone sensor types (metal oxide), it has not yet been tested on electrochemical and non-dispersive infrared sensors, which are also used in the INSTEP monitors. This will serve as a test to see if this normalization technique – or another – is most effective in accounting for environmental differences among sensors. Related data analysis efforts have found success with a variety of geospatial analysis techniques, including weighted network models in which high-quality instruments are given higher weights than their low-cost counterparts. Our preliminary analysis will focus on kriging, which uses a Gaussian algorithm to assign weights, providing estimated pollution levels at locations between monitors. Smoke trajectory and evolution will also be considered using both measurement types. We also aim to baseline subtract our emission estimates from each region to determine which portion of emissions are regional and local, further characterizing burn differences in northern and southern California fires. Future directions include using INSTEP jointly with TEMPO satellite data, and mobile deployments on aircraft and uncrewed aerial vehicles (UAV).

Low-cost sensors↗

Cognitive network organization and cockpit automation

Attention is given to a technique for the derivation of pilot cognitive networks from empirical data, which has been successfully used to guide the redesign of the Control Display Unit that serves as the primary interface of the complex flight management system being developed by NASA's Advanced Concepts Flight Simulator program. The 'pathfinder' algorithm of Schvaneveldt et al. (1985) is used to obtain the conceptual organization of four pilots by generating a family of link-weighted networks from a set of psychological distance data derived through similarity ratings. The degree of conceptual agreement between pilots is assessed, and the means of translating a cognitive network into a menu structure are noted.

Roske-Hofstrand, R. J.↗

Implementation of real-time digital signal processing systems

Special purpose hardware implementation of DFT Computers and digital filters is considered in the light of newly introduced algorithms and IC devices. Recent work by Winograd on high-speed convolution techniques for computing short length DFT's, has motivated the development of more efficient algorithms, compared to the FFT, for evaluating the transform of longer sequences. Among these, prime factor algorithms appear suitable for special purpose hardware implementations. Architectural considerations in designing DFT computers based on these algorithms are discussed. With the availability of monolithic multiplier-accumulators, a direct implementation of IIR and FIR filters, using random access memories in place of shift registers, appears attractive. The memory addressing scheme involved in such implementations is discussed. A simple counter set-up to address the data memory in the realization of FIR filters is also described. The combination of a set of simple filters (weighting network) and a DFT computer is shown to realize a bank of uniform bandpass filters. The usefulness of this concept in arriving at a modular design for a million channel spectrum analyzer, based on microprocessors, is discussed.

Narasimha, M.↗

System design for a million channel digital spectrum analyzer /MCSA/

The system design of a wideband (8 MHz) million-channel digital spectrum analyzer for use with a SETI receiver is presented. The analyzer makes use of a digital bandpass filter bank for transforming the wideband input signal into a specified number (120) of uniform narrowband output channels by the use of a Fourier transform digital processor combined with a prototype digital weighting network (finite impulse response filter). The output is then processed separately by 120 microprocessor-based discrete Fourier transform computers, each producing 8190 output channels of approximately 8 Hz bandwidth by the use of an 8190-point prime factor algorithm.

Peterson, A.↗

Neural network based adaptive control of nonlinear plants using random search optimization algorithms

This paper presents a method for utilizing artificial neural networks for direct adaptive control of dynamic systems with poorly known dynamics. The neural network weights (controller gains) are adapted in real time using state measurements and a random search optimization algorithm. The results are demonstrated via simulation using two highly nonlinear systems.

Boussalis, Dhemetrios↗

An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics

This report is a repository of the results obtained from a large scale empirical comparison of seven iterative and evolution-based optimization heuristics. Twenty-seven static optimization problems, spanning six sets of problem classes which are commonly explored in genetic algorithm literature, are examined. The problem sets include job-shop scheduling, traveling salesman, knapsack, binpacking, neural network weight optimization, and standard numerical optimization. The search spaces in these problems range from 2368 to 22040. The results indicate that using genetic algorithms for the optimization of static functions does not yield a benefit, in terms of the final answer obtained, over simpler optimization heuristics. Descriptions of the algorithms tested and the encodings of the problems are described in detail for reproducibility.

Baluja, Shumeet↗

Methodologies for Adaptive Flight Envelope Estimation and Protection

This paper reports the latest development of several techniques for adaptive flight envelope estimation and protection system for aircraft under damage upset conditions. Through the integration of advanced fault detection algorithms, real-time system identification of the damage/faulted aircraft and flight envelop estimation, real-time decision support can be executed autonomously for improving damage tolerance and flight recoverability. Particularly, a bank of adaptive nonlinear fault detection and isolation estimators were developed for flight control actuator faults; a real-time system identification method was developed for assessing the dynamics and performance limitation of impaired aircraft; online learning neural networks were used to approximate selected aircraft dynamics which were then inverted to estimate command margins. As off-line training of network weights is not required, the method has the advantage of adapting to varying flight conditions and different vehicle configurations. The key benefit of the envelope estimation and protection system is that it allows the aircraft to fly close to its limit boundary by constantly updating the controller command limits during flight. The developed techniques were demonstrated on NASA s Generic Transport Model (GTM) simulation environments with simulated actuator faults. Simulation results and remarks on future work are presented.

Tang, Liang↗

Minimum switching network for generating the weight of a binary vector

Vector is divided into three variable sections, and each section is processed by unary-to-binary decoder or adder. Resulting network performs on iterative collection process; all outputs of same kind are collected in same manner. In combination with simple comparator gates, weighting network can also be used as majority network.

Anderson, T. O.↗

Real-Time Adaptive Color Segmentation by Neural Networks

Artificial neural networks that would utilize the cascade error projection (CEP) algorithm have been proposed as means of autonomous, real-time, adaptive color segmentation of images that change with time. In the original intended application, such a neural network would be used to analyze digitized color video images of terrain on a remote planet as viewed from an uninhabited spacecraft approaching the planet. During descent toward the surface of the planet, information on the segmentation of the images into differently colored areas would be updated adaptively in real time to capture changes in contrast, brightness, and resolution, all in an effort to identify a safe and scientifically productive landing site and provide control feedback to steer the spacecraft toward that site. Potential terrestrial applications include monitoring images of crops to detect insect invasions and monitoring of buildings and other facilities to detect intruders. The CEP algorithm is reliable and is well suited to implementation in very-large-scale integrated (VLSI) circuitry. It was chosen over other neural-network learning algorithms because it is better suited to realtime learning: It provides a self-evolving neural-network structure, requires fewer iterations to converge and is more tolerant to low resolution (that is, fewer bits) in the quantization of neural-network synaptic weights. Consequently, a CEP neural network learns relatively quickly, and the circuitry needed to implement it is relatively simple. Like other neural networks, a CEP neural network includes an input layer, hidden units, and output units (see figure). As in other neural networks, a CEP network is presented with a succession of input training patterns, giving rise to a set of outputs that are compared with the desired outputs. Also as in other neural networks, the synaptic weights are updated iteratively in an effort to bring the outputs closer to target values. A distinctive feature of the CEP neural network and algorithm is that each update of synaptic weights takes place in conjunction with the addition of another hidden unit, which then remains in place as still other hidden units are added on subsequent iterations. For a given training pattern, the synaptic weight between (1) the inputs and the previously added hidden units and (2) the newly added hidden unit is updated by an amount proportional to the partial derivative of a quadratic error function with respect to the synaptic weight. The synaptic weight between the newly added hidden unit and each output unit is given by a more complex function that involves the errors between the outputs and their target values, the transfer functions (hyperbolic tangents) of the neural units, and the derivatives of the transfer functions.

Duong, Tuan A.↗

Simulation of Foam Divot Weight on External Tank Utilizing Least Squares and Neural Network Methods

Simulation of divot weight in the insulating foam, associated with the external tank of the U.S. space shuttle, has been evaluated using least squares and neural network concepts. The simulation required models based on fundamental considerations that can be used to predict under what conditions voids form, the size of the voids, and subsequent divot ejection mechanisms. The quadratic neural networks were found to be satisfactory for the simulation of foam divot weight in various tests associated with the external tank. Both linear least squares method and the nonlinear neural network predicted identical results.

Chamis, Christos C.↗