Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

At least 757 records · Page 42
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

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.↗
NASA NTRS1985

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.↗
DOE OSTI2026

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↗
NASA NTRS1987

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.↗
DOE OSTI2024

ℤ2 × ℤ2 Equivariant Quantum Neural Networks: Benchmarking against Classical Neural Networks

This paper presents a comparative analysis of the performance of Equivariant Quantum Neural Networks (EQNNs) and Quantum Neural Networks (QNNs), juxtaposed against their classical counterparts: Equivariant Neural Networks (ENNs) and Deep Neural Networks (DNNs). We evaluate the performance of each network with three two-dimensional toy examples for a binary classification task, focusing on model complexity (measured by the number of parameters) and the size of the training dataset. Our results show that the Z2×Z2 EQNN and the QNN provide superior performance for smaller parameter sets and modest training data samples.

Dong, Zhongtian (ORCID:0000000210003454)↗
NASA NTRS1987

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.↗
DOE OSTI2022

ThunderSecure: deploying real-time intrusion detection for 100G research networks by leveraging stream-based features and one-class classification network

Nowadays, data generated by large-scale scientific experiments are on the scale of petabytes per month. These data are transferred through dedicated high-bandwidth networks (40/100G) across distributed sites for processing, storage, and analysis. Like general purpose networks, research networks experience intrusions. However, monitoring anomalies in such high-speed network traffics is challenging given current cyber-infrastructure. Moreover, traditional network intrusion detection systems (NIDS) are signature based. However, anomaly patterns are difficult to define and that rulesets are often not updated frequently enough to reflect the changes of attack behaviors. We present ThunderSecure, a high-throughput, unsupervised learning-based intrusions detection system for 100G research networks. ThunderSecure implements an efficient packet processing and detection pipeline using multi-cores and GPUs. It extracts statistical and temporal features from real-time network data streams and feeds them to a one-class anomaly detection network. A baseline of normal distribution will be created based on the training observation. Testing traffic deviated from the learned profile will be marked as anomalies. We trained ThunderSecure on hundreds of billions of science data packets mirrored from two 100G network connections at Fermi National Accelerator Laboratory. The detection performance was evaluated on traffic captured from the same research network days and weeks after the training with different types of attack flows injected. Results show that ThunderSecure can recognize science data traffic captured long after the training and made nearly certain detection on the segment of the streams where anomalous flows were injected.

100G research network↗
NASA NTRS2008

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↗
DOE OSTI2022

Climatic clustering and longitudinal analysis with impacts on food, bioenergy, and pandemics

Predicted growth in world population will put unparalleled stress on the need for sustainable energy and global food production, as well as increase the likelihood of future pandemics. In this work, we identify high-resolution environmental zones in the context of a changing climate and predict longitudinal processes relevant to these challenges. We do this using exhaustive vector comparison methods that measure the climatic similarity between all locations on earth at high geospatial resolution relative to global-scale analyses. The results are captured as networks, in which edges between geolocations are defined if their historical climate similarities exceed a threshold. We apply Markov clustering and our novel Correlation of Correlations method to the resulting climatic networks, which provides unprecedented agglomerative and longitudinal views of climatic relationships across the globe. The methods performed here resulted in the fastest (9.37x10 18 operations/sec) and one of the largest (168.7x10 21 operations) scientific computations ever performed, with more than 100 quadrillion edges considered for a single climatic network. Our climatic analysis reveals areas of the world experiencing rapid environmental changes, which can have important implications for global carbon fluxes and zoonotic spillover events. Correlation and network analyses of this kind are widely applicable across computational and predictive biology domains, including systems biology, ecology, carbon cycles, biogeochemistry, and zoonosis research.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

A new paradigm in electron microscopy: Automated microstructure analysis utilizing a dynamic segmentation convolutional neutral network

Over the past half century, the transmission electron microscope enabled insight into the fundamental arrangements and structures of materials. State-of-the-art electron microscopes can acquire large image datasets across multiple imaging modalities. However, the manual annotation process for feature or defect quantification may not be feasible with the modern microscope. Convolutional neural networks emerged to characterize individual microstructural features from an image in a cost-effective, consistent manner. However, many of these neural network approaches rely on thousands to hundreds of thousands of manual annotations of each feature type across hundreds of images to train the network for adequate performance. This work focused on the development and application of a pixel-wise defect detection machine-learning dynamic segmentation convolutional neural network with associated automated acquisition and postprocessing to identify microstructural features rapidly and quantitatively from a small initial dataset incorporating multiple imaging modes. The approach was demonstrated for characterization of superalloy 718 from both single image acquisition on multiple detectors to in-situ evolution captured with a single detector on a standard desktop computer to demonstrate the low barrier to entry required for widespread adoption. Pixel-by-pixel class identification was excellent with strong identification of chemically distinct phases, structurally distinct phases, and defect structures, thus demonstrating the new paradigm of machine learning-assisted characterization.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Discovery of widespread transcription initiation at microsatellites predictable by sequence-based deep neural network

Using the Cap Analysis of Gene Expression (CAGE) technology, the FANTOM5 consortium provided one of the most comprehensive maps of transcription start sites (TSSs) in several species. Strikingly, ~72% of them could not be assigned to a specific gene and initiate at unconventional regions, outside promoters or enhancers. Here, we probe these unassigned TSSs and show that, in all species studied, a significant fraction of CAGE peaks initiate at microsatellites, also called short tandem repeats (STRs). To confirm this transcription, we develop Cap Trap RNA-seq, a technology which combines cap trapping and long read MinION sequencing. We train sequence-based deep learning models able to predict CAGE signal at STRs with high accuracy. These models unveil the importance of STR surrounding sequences not only to distinguish STR classes, but also to predict the level of transcription initiation. Importantly, genetic variants linked to human diseases are preferentially found at STRs with high transcription initiation level, supporting the biological and clinical relevance of transcription initiation at STRs. Together, our results extend the repertoire of non-coding transcription associated with DNA tandem repeats and complexify STR polymorphism.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1999

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.↗
NASA NTRS1999

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.↗
NASA NTRS1999

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.↗