Development of digital computer program for thermal network correction. Phase 1 - Investigation/feasibility study Final report
Feasibility of analytical error analysis applied to thermal network solutions
Gaski, J. D.↗
SEARCH · Search NASA
Results for “NETWORK ANALYSIS”
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.
Data Analysis for the SOLIS Vector Spectromagnetograph
The National Solar Observatory's SOLIS Vector Spectromagnetograph (VSM), which will produce three or more full-disk maps of the Sun's photospheric vector magnetic field every day for at least one solar magnetic cycle, is in the final stages of assembly. Initial observations, including cross-calibration with the current NASA/NSO spectromagnetograph (SPM) will soon be carried out at a test site in Tucson. This paper discusses data analysis techniques for reducing the raw data, calculation of line-of-sight magnetograms and both quick-look and high-precision inference of vector fields from Stokes spectral profiles. Existing SPM algorithms, suitably modified to accomodate the cameras, scanning pattern, and polarization calibration optics for the VSM, will be used to "clean" the raw data and to process line-of-sight, magnetograms. A recent. version of the High Altitude Observatory Milne-Eddington (HAO-ME) inversion code (Skumanich and Lites; 1987, 11)J 322, p. 473) will he used for high-precision vector fields since the algorithm has been extensively tested, is well understood, and is fast enough to complete data analysis within 24 hours of data acquisition. The simplified inversion algorithm of Auer, Heasley. arid House (1977, Sol. Phys. 55, p. 47) forms the initial guess for this version of the HAO-ME code and will be used for quick-look vector analysis of VSM data since its performance on simulated Stokes profiles is better than other candidate methods. Improvements (e.g., principal components analysis or neural networks) are under consideration and will be straightforward to implement. However, current resources are sufficient to store the original Stokes profiles only long enough for high-precision analysis. Retrospective reduction of Stokes data with improved methods will not be possible, and modifications will only be introduced when the advantages of doing so are compelling enough to justify discontinuity in the long-term data stream.
Jones, Harrison P.↗
Micro-kinetic modeling of temporal analysis of products data using kinetics-informed neural networks
Kinetics-informed neural networks improve fit quality for multi-pulse and noisy temporal analysis of products datasets.
Nai, Dingqi↗
Self-organization in neural networks - Applications in structural optimization
The present paper discusses the applicability of ART (Adaptive Resonance Theory) networks, and the Hopfield and Elastic networks, in problems of structural analysis and design. A characteristic of these network architectures is the ability to classify patterns presented as inputs into specific categories. The categories may themselves represent distinct procedural solution strategies. The paper shows how this property can be adapted in the structural analysis and design problem. A second application is the use of Hopfield and Elastic networks in optimization problems. Of particular interest are problems characterized by the presence of discrete and integer design variables. The parallel computing architecture that is typical of neural networks is shown to be effective in such problems. Results of preliminary implementations in structural design problems are also included in the paper.
Hajela, Prabhat↗
h-Parameter Analysis Of Teleoperators
Hybrid two-port input/output mathematical model originally developed for small-signal analysis of transistors, amplifiers, and electrical networks in general adapted to analysis of teleoperator sensing forces and velocities at master and slave. Well suited to characterization of bidirectional flows of energy in terms of relationships between input and output signals. Leads to intuitive representation of performance of system and used to design system according to concept of bilateral impedance control.
Hannaford, Blake↗
A performance analysis of DS-CDMA and SCPC VSAT networks
Spread-spectrum and single-channel-per-carrier (SCPC) transmission techniques work well in very small aperture terminal (VSAT) networks for multiple-access purposes while allowing the earth station antennas to remain small. Direct-sequence code-division multiple-access (DS-CDMA) is the simplest spread-spectrum technique to use in a VSAT network since a frequency synthesizer is not required for each terminal. An examination is made of the DS-CDMA and SCPC Ku-band VSAT satellite systems for low-density (64-kb/s or less) communications. A method for improving the standardf link analysis of DS-CDMA satellite-switched networks by including certain losses is developed. The performance of 50-channel full mesh and star network architectures is analyzed. The selection of operating conditions producing optimum performance is demonstrated.
Hayes, David P.↗
Exploiting parallel computing with limited program changes using a network of microcomputers
Network computing and multiprocessor computers are two discernible trends in parallel processing. The computational behavior of an iterative distributed process in which some subtasks are completed later than others because of an imbalance in computational requirements is of significant interest. The effects of asynchronus processing was studied. A small existing program was converted to perform finite element analysis by distributing substructure analysis over a network of four Apple IIe microcomputers connected to a shared disk, simulating a parallel computer. The substructure analysis uses an iterative, fully stressed, structural resizing procedure. A framework of beams divided into three substructures is used as the finite element model. The effects of asynchronous processing on the convergence of the design variables are determined by not resizing particular substructures on various iterations.
Rogers, J. L., Jr.↗
Community detection robustness of graph neural networks
Graph neural networks (GNNs) are increasingly widely used for community detection in attributed networks. They combine structural topology with node attributes through message passing and pooling. However, their robustness or lack thereof with respect to different perturbations and targeted attacks in conjunction with community detection tasks is not well understood. To shed light on latent mechanisms behind GNN sensitivity on community detection tasks, we conduct a systematic computational evaluation of six widely adopted GNN architectures graph convolutional network, graph attention network, graph sample and aggregate (GraphSAGE), differentiable pooling (DiffPool), minimum cut pooling (MinCUT), and deep modularity networks (DMoN). The analysis covers three perturbation categories: node attribute manipulations, edge topology distortions, and adversarial attacks. We use element-centric similarity as the evaluation metric on synthetic benchmarks and real-world citation networks. Our findings indicate that supervised GNNs tend to achieve higher baseline accuracy, while unsupervised methods, particularly DMoN, maintain stronger resilience under targeted and adversarial perturbations. Furthermore, robustness appears to be strongly influenced by community strength, with well-defined communities reducing performance loss. Across all models, node attribute perturbations associated with targeted edge deletions and shifts in attribute distributions tend to cause the largest degradation in community recovery. These findings highlight important trade-offs between accuracy and robustness in GNN-based community detection and offer insights into selecting architectures resilient to noise and adversarial attacks.
Goel, Jaidev [Virginia Polytechnic Inst. and State↗
Steady-State Thermal-Analysis Program For Microcomputers
Nodal-network model of heat flow implemented by computer program. Steady State Thermal Analysis Program, STEADY, provides thermal designer with quick and convenient method for calculation of heat loads and temperatures. Used on small nodal networks for conceptual or preliminary thermal design and analysis. Accepts up to 20 nodes of fixed or variable temperatures, with constant or temperature-dependent thermal conductivities, and any set of consistent units. Written in FORTRAN 77.
Petrick, S. W.↗
Performance prediction of concurrent systems
Concurrent systems are computers that use multiple processors to solve a single problem. A means to predict the application performance on these systems is a useful tool in many areas of concurrent system research. A computationally efficient and accurate method to predict performance for a class of parallel computations on concurrent systems is described. A parallel computation is modeled as a task system with precedence relationships expressed as a series parallel directed acyclic graph. Resources in concurrent systems are modeled as service centers in queueing network models. Using these two models as inputs, the method outputs predictions of both the time to complete the computation and the concurrent system utilization. The algorithm used is based on the approximate Mean Value Analysis in queueing network modeling with extensions to model concurrency in the computation. The new algorithm was validated against both detailed simulation and actual execution on a commercial multiprocessor.
Mak, Victor W. K.↗
Adapting Thermal Energy Networks to Site Conditions for Improved Cost and Energy Performance
Overview of the analysis of thermal energy networks (TENs) for two U.S. DOD installations.
25 ENERGY STORAGE↗
Spiking Neurons for Analysis of Patterns
Artificial neural networks comprising spiking neurons of a novel type have been conceived as improved pattern-analysis and pattern-recognition computational systems. These neurons are represented by a mathematical model denoted the state-variable model (SVM), which among other things, exploits a computational parallelism inherent in spiking-neuron geometry. Networks of SVM neurons offer advantages of speed and computational efficiency, relative to traditional artificial neural networks. The SVM also overcomes some of the limitations of prior spiking-neuron models. There are numerous potential pattern-recognition, tracking, and data-reduction (data preprocessing) applications for these SVM neural networks on Earth and in exploration of remote planets. Spiking neurons imitate biological neurons more closely than do the neurons of traditional artificial neural networks. A spiking neuron includes a central cell body (soma) surrounded by a tree-like interconnection network (dendrites). Spiking neurons are so named because they generate trains of output pulses (spikes) in response to inputs received from sensors or from other neurons. They gain their speed advantage over traditional neural networks by using the timing of individual spikes for computation, whereas traditional artificial neurons use averages of activity levels over time. Moreover, spiking neurons use the delays inherent in dendritic processing in order to efficiently encode the information content of incoming signals. Because traditional artificial neurons fail to capture this encoding, they have less processing capability, and so it is necessary to use more gates when implementing traditional artificial neurons in electronic circuitry. Such higher-order functions as dynamic tasking are effected by use of pools (collections) of spiking neurons interconnected by spike-transmitting fibers. The SVM includes adaptive thresholds and submodels of transport of ions (in imitation of such transport in biological neurons). These features enable the neurons to adapt their responses to high-rate inputs from sensors, and to adapt their firing thresholds to mitigate noise or effects of potential sensor failure. The mathematical derivation of the SVM starts from a prior model, known in the art as the point soma model, which captures all of the salient properties of neuronal response while keeping the computational cost low. The point-soma latency time is modified to be an exponentially decaying function of the strength of the applied potential. Choosing computational efficiency over biological fidelity, the dendrites surrounding a neuron are represented by simplified compartmental submodels and there are no dendritic spines. Updates to the dendritic potential, calcium-ion concentrations and conductances, and potassium-ion conductances are done by use of equations similar to those of the point soma. Diffusion processes in dendrites are modeled by averaging among nearest-neighbor compartments. Inputs to each of the dendritic compartments come from sensors. Alternatively or in addition, when an affected neuron is part of a pool, inputs can come from other spiking neurons. At present, SVM neural networks are implemented by computational simulation, using algorithms that encode the SVM and its submodels. However, it should be possible to implement these neural networks in hardware: The differential equations for the dendritic and cellular processes in the SVM model of spiking neurons map to equivalent circuits that can be implemented directly in analog very-large-scale integrated (VLSI) circuits.
Huntsberger, Terrance↗
Spatial-temporal analysis of groundwater well features from neural network prediction of hexavalent chromium concentration
Not Available
De La Noval, Alejandro J.↗
Performance Analysis of TCP Enhancements in Satellite Data Networks
This research examines two proposed enhancements to the well-known Transport Control Protocol (TCP) in the presence of noisy communication links. The Multiple Pipes protocol is an application-level adaptation of the standard TCP protocol, where several TCP links cooperate to transfer data. The Space Communication Protocol Standard - Transport Protocol (SCPS-TP) modifies TCP to optimize performance in a satellite environment. While SCPS-TP has inherent advantages that allow it to deliver data more rapidly than Multiple Pipes, the protocol, when optimized for operation in a high-error environment, is not compatible with legacy TCP systems, and requires changes to the TCP specification. This investigation determines the level of improvement offered by SCPS-TP's Corruption Mode, which will help determine if migration to the protocol is appropriate in different environments. As the percentage of corrupted packets approaches 5 %, Multiple Pipes can take over five times longer than SCPS-TP to deliver data. At high error rates, SCPS-TP's advantage is primarily caused by Multiple Pipes' use of congestion control algorithms. The lack of congestion control, however, limits the systems in which SCPS-TP can be effectively used.
Broyles, Ren H.↗
A Diagnostic Analysis of the Kennedy Space Center LDAR Network
The performance characteristics of the Kennedy Space Center Lightning Detection and Ranging (LDAR) network are investigated at medium-far range (50-300 km). A 19 month noise-filtered sample of LDAR observations is examined, from which it is determined that the "climatological" VHF source density as observed by LDAR falls off approximately 10 dB every 71 km of ground range from the network centroid. The underlying vertical distribution of LDAR sources is approximately normally distributed with a mean of 9 km and a standard deviation of 2.7 km, implying that loss of below-horizon sources has a negligible effect on column-integrated source densities within 200 km ground range. At medium to far ranges, location errors are primarily radial and have a slightly asymmetric distribution whose first moment increases as r(exp 2). A range calibration derived from these results is used to normalize source density maps on monthly, daily and hourly time scales and yields significant improvements in correlation with NLDN ground strike densities.
Boccippio, Dennis J.↗
A Diagnostic Analysis of the Kennedy Space Center LDAR Network: Data Characteristics - 1
An analytical framework is developed in which to analyze climatological VHF (66 MHz) radiation measurements taken by the Kennedy Space Center Lightning Detection and Ranging (LDAR) network. A 19-month noise-filtered sample of LDAR observations is examined using this framework. It is found that the climatological VHF source density as observed by LDAR falls off approximately 10 dB every 71 km of ground range away from the network centroid (a 31 km e-folding scale). From this framework it is inferred that the underlying source distribution is likely inverse exponential in amplitude, with a log-slope of 126-147 mW(sup -1/2). The underlying vertical distribution of VHF sources is approximately normally distributed with a mean altitude of 9 km and a standard deviation of 2.7 km; this implies that the loss of below-horizon sources has a negligible effect on column-integrated source densities within 200 km ground range. At medium to far ranges, location errors are primarily radial and have a slightly asymmetric distribution whose first moment increases as range squared. Error moments estimated from observed lightning are significantly higher than those from aircraft-based signal generator or analytic solution estimates, suggesting that timing errors arising from poor signal identification and discrimination may dominate over timing errors arising from nominal sensor resolution. The VHF source properties of individual LDAR-observed flashes are computed and an analytic expression for flash detection efficiency vs. range is derived. This reveals nearly constant flash detection efficiency to 80-94 km range from the network centroid.
Boccippio, D. J.↗
A Diagnostic Analysis of the Kennedy Space Center LDAR Network: Cross-Sensor Studies - 2
Range dependencies in total (intracloud and cloud-to-ground) lightning observed by the Kennedy Space Center Lightning Detection and Ranging (LDAR) network are established through cross-comparison with other lightning sensors. Using total lightning observed by the Lightning Imaging Sensor (LIS), LDAR flash detection efficiency is shown to remain above 90% out to 90-100 km range, and to be below 25% at 200 km range. LDAR VHF source location error distributions are also determined as a function of range, and are found to be asymmetric with first moments increasing roughly as range squared. Range normalization schemes for total VHF source density are tested and shown to yield significant (up to 50%) skill improvements over uncorrected data, when compared with National Lightning Detection Network (NLDN) ground flash counts at hourly, daily, monthly and climatological time scales.
Boccippio, D. J.↗
A Diagnostic Analysis of the Kennedy Space Center LDAR Network 2. Cross-Sensor Studies
Range dependencies in total (intracloud and cloud to ground) lightning observed by the Kennedy Space Center Lightning Detection and Ranging (LDAR) network are established through cross comparison with other lightning sensors. Using total lightning observed from space by the Lightning Imaging Sensor (LIS), MAR flash detection efficiency is shown to remain above 90% out to 90-100 km range, and to be below 25% at 200 km range. MAR VHF source location error distributions are also determined as a function of range and are found to be asymmetric with standard deviation increasing roughly as r 2 . Range normalization schemes for total VHF source density are tested and shown to yield significant improvements in correlation with National Lightning Detection Network (NLDN) ground flash density at hourly, daily, monthly, and climatological timescales (up to 50% over uncorrected source densities using an exponential-in-range correction factor with 40-50 km e-folding scale).
Boccippio, D. J.↗