Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “detection 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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Scaling and Quality of Modularity Optimization Methods for Graph Clustering

Real-world graphs exhibit structures known as “communities” or “clusters” consisting of a group of vertices with relatively high connectivity between them, as compared to the rest of the vertices in the network. Graph clustering or community detection is a fundamental graph operation used to analyze real-world graphs occurring in the areas of computational biology, cybersecurity, electrical grids, etc. Similar to other graph algorithms, owing to irregular memory accesses and inherently sequential nature, current algorithms for community detection are challenging to parallelize. However, in order to analyze large networks, it is important to develop scalable parallel implementations of graph clustering that are capable of exploiting the architectural features of modern supercomputers. In response to the 2019 Streaming Graph Challenge, we present quality and performance analysis of our distributed- memory community detection using Vite, which is our distributed memory implementation of the popular Louvain method, on the ALCF Theta supercomputer. Clustering methods such as Louvain that rely on modularity maximization are known to suffer from the resolution limit problem, preventing identification of clusters of certain sizes. Hence, we also include quality analysis of our shared-memory implementation of the Fast-tracking Resistance method, in comparison with Louvain on the challenge datasets. Furthermore, we introduce an edge-balanced graph distribution for our distributed memory implementation, that significantly reduces communication, offering up to 80% improvement in the overall execution time. In addition to performance/quality analysis, we also include details on the power/energy consumption, and memory traffic of the distributed-memory clustering implementation using real-world graphs with over a billion edges.

Ghosh, Sayan↗
DOE OSTI2021

Development of Automated Pipeline for Time-Resolved Link-Wise Vehicular Energy Consumption in the Chattanooga, TN Road Network

The Department of Energy (DOE) has shown strong interest in detecting energy inefficiencies in regional road networks, so as to derive energy consumed at a high spatial temporal resolution. We have developed a workflow to automate the estimation of time-resolved vehicular energy consumption over each link in a road network of interest. The road network used in the current work is centered around the city of Chattanooga, Tennessee and its bordering regions. Utilizing the most mature road network for the Chattanooga, TN region, vehicle speed & count data from TomTom in conjunction with machine learning methods, we have developed an automated pipeline to estimate energy consumption for every link in the network. The first step in the pipeline is ingesting vehicle probe counts and speed estimates from TomTom API. In the next step, the probe counts, speed profiles and other exogenous data (i.e. road types, weather data, ground-truth volume counts and more) were used as input to a supervised learning algorithm to estimate the number of vehicles throughout the entire region for each road segment. These volume estimates were then mapped to a unified road network that contained additional important information such as percentage change in gradient across a link, number of lanes and link lengths that are features in pre-trained single vehicle energy-consumption models available with the RouteE software developed at NREL. The per vehicle energy consumption on each road link predicted using appropriate RouteE vehicular models were multiplied by the volume estimate for the corresponding link over a given time period to predict energy consumed per link for the time interval of interest. Currently, work is underway to improve both the RouteE per vehicle energy estimate and the volume estimates derived from TomTom probe counts. We have also explored the correlation of the link-wise energy estimates with the features of the pre-trained RouteE machine learning model in order to gain insight into what factors contribute most to the link-wise energy consumption.

ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION,↗
DOE OSTI2024

Efficient Anomaly Detection Driven By Different Machine Learning Architectures And Models

The rapid growth and ubiquitous adoption of the internet and cyber-physical systems (CPS) have fundamentally transformed modern communication, work, and human-system interactions. While networks now form the backbone of critical digital ecosystems, enabling seamless data transmission across diverse, interconnected systems, this increased connectivity also expands the attack surface, making real-time detection of network intrusions and anomalies a pressing challenge. Detecting unusual activities within network infrastructure requires advanced data traffic analysis to differentiate between legitimate and malicious interactions. Traditional approaches to network anomaly detectionâ??such as rule-based and signature-based systemsâ??often depend on predefined patterns to identify known anomalies, limiting their effectiveness against emerging, stealthy, or previously unseen threats. These conventional methods suffer from high false alarm rates and fail to adapt to the ever-evolving nature of network traffic, particularly in large-scale, decentralized environments where data volume, velocity, and variety are constantly increasing. This dissertation presents artificial intelligence (AI)-driven approaches to anomaly detection that leverage graphics processing unit (GPU)-enabled high-performance computing (HPC) platforms for processing massive network traffic data and monitoring the components of cyber-physical systems (CPS) for potentially hazardous conditions. The research advances several key contributions: (1) Designing efficient machine learning techniques for CPS condition monitoring and anomaly detection; (2) enabling federated learning (FL) frameworks that enable distributed detection while preserving data privacy and system resilience; (3) exploring graph-based methodologies combining graph neural networks (GNN) and graph machine learning (ML) approaches for the Internet of Things (IoT) and automotive network security, and (4) performing distributed edge computing optimizations that integrate FL with scalable technologies for reduced communication overhead. Through extensive experiments, these methodologies demonstrate that complex anomaly detection and condition monitoring tasks can be achieved while balancing computational efficiency and detection accuracy through fine-grained network information processing. The frameworks developed in this research establish a robust foundation for network anomaly detection, providing scalable, adaptive, and privacy-preserving solutions for safeguarding CPS and IoT networks in an increasingly interconnected digital landscape. The practical implications of these research findings are significant, as they can inform the development of next-generation network security systems and contribute to the protection of critical infrastructure against sophisticated cyber attacks.

Marfo, William↗
NASA NTRS1989

Local area network with fault-checking, priorities, and redundant backup

This invention is a redundant error detecting and correcting local area networked computer system having a plurality of nodes each including a network connector board within the node for connecting to an interfacing transceiver operably attached to a network cable. There is a first network cable disposed along a path to interconnect the nodes. The first network cable includes a plurality of first interfacing transceivers attached thereto. A second network cable is disposed in parallel with the first cable and, in like manner, includes a plurality of second interfacing transceivers attached thereto. There are a plurality of three position switches each having a signal input, three outputs for individual selective connection to the input, and a control input for receiving signals designating which of the outputs is to be connected to the signal input. Each of the switches includes means for designating a response address for responding to addressed signals appearing at the control input and each of the switches further has its signal input connected to a respective one of the input/output lines from the nodes. Also, one of the three outputs is connected to a repective one of the plurality of first interfacing transceivers. There is master switch control means having an output connected to the control inputs of the plurality of three position switches and an input for receiving directive signals for outputting addressed switch position signals to the three position switches as well as monitor and control computer means having a pair of network connector boards therein connected to respective ones of one of the first interfacing transceivers and one of the second interfacing transceivers and an output connected to the input of the master switch means for monitoring the status of the networked computer system by sending messages to the nodes and receiving and verifying messages therefrom and for sending control signals to the master switch to cause the master switch to cause respective ones of the nodes to use a desired one of the first and second cables for transmitting and receiving messages and for disconnecting desired ones of the nodes from both cables.

Morales, Sergio↗
DOE OSTI2019

Future SDN-HPON Control Plane Architecture and Protocol for On-Demand Terabit End-to-End Extreme-Scale Science Applications

The UC Davis team conducted architecture, algorithm and experimental studies for next generation ultra-high-bandwidth optical networks in support of extreme-scale science applications. In particular, over the course of this 3-year project, the UC Davis team achieved the following main accomplishments: Designed a network architecture for automated multi-domain service provisioning: Designed information exchange schemes between autonomous systems (domains) Designed application programming interfaces to orchestrate resource reservation in data centers, high performance computation facilities, and communication networks belonging to different autonomous systems Experimentally assessed the multi-domain network architecture in a distributed field trial set-up connecting premises in three continents Designed a broker-based orchestrated multi-domain optical networking framework supporting observe-analyze-act cycle based cognitive inter-domain service provisioning: Designed an inter-domain operation mechanism, e.g., topology abstraction, for the broker plane and domain managers to collaboratively accomplish inter-domain service provisioning while respecting the autonomy of each administrative domain Designed an alien wavelength monitoring scheme and an artificial neural network based optical signal-to-noise ratio estimator for quality-of-transmission aware inter-domain service provisioning Developed a deep neural network based multi-domain traffic predictor and a cognitive routing and spectrum assignment algorithm to realize knowledge-based autonomous traffic engineering in multi-domain networks Implemented an optical signal-to-noise ratio estimator and traffic predictor with Google’s Tensor flow and assessed their performance using experimental and synthetic data Demonstrated the benefits of the proposed cognitive schemes with experiments ona two-domain elastic optical network testbed and evaluations on a six-domain simulation framework Built a two-domain software-defined networking control plane testbed using the ONOS platform and demonstrated the workflow of broker and domain manager cooperation, including hierarchical performance monitoring, topology abstraction and cognitive resource allocation. Designed self-learning cognitive service provisioning schemes using advanced machine learning technologies: Designed a self-taught anomaly detection framework for optical networks, including an unsupervised data clustering module for pattern recognition, a supervised data regression and classification module for online anomaly detection, and the system operation principle Experimentally validated the effectiveness of the self-taught anomaly detection framework with various failure/anomaly scenarios. Designed a self-learning autonomic routing, modulation and spectrum assignment (RMSA) provisioning framework for elastic optical networks with deep reinforcement learning. Designed effective modeling and training mechanisms for the self-learning RMSA framework Conducted extensive numerical simulations with various traffic patterns and topologies to verify the advantage of the self-learning RMSA framework.

42 ENGINEERING↗
DOE OSTI2016

Detection of regional infrasound signals using array data: Testing, tuning, and physical interpretation

This work quantifies the physical characteristics of infrasound signal and noise, assesses their temporal variations, and determines the degree to which these effects can be predicted by time-varying atmospheric models to estimate array and network performance. An automated detector that accounts for both correlated and uncorrelated noise is applied to infrasound data from three seismo-acoustic arrays in South Korea (BRDAR, CHNAR, and KSGAR), cooperatively operated by Korea Institute of Geoscience and Mineral Resources (KIGAM) and Southern Methodist University (SMU). Arrays located on an island and near the coast have higher noise power, consistent with both higher wind speeds and seasonably variable ocean wave contributions. On the basis of the adaptive F-detector quantification of time variable environmental effects, the time-dependent scaling variable is shown to be dependent on both weather conditions and local site effects. Significant seasonal variations in infrasound detections including daily time of occurrence, detection numbers, and phase velocity/azimuth estimates are documented. These time-dependent effects are strongly correlated with atmospheric winds and temperatures and are predicted by available atmospheric specifications. As a result, this suggests that commonly available atmospheric specifications can be used to predict both station and network detection performance, and an appropriate forward model improves location capabilities as a function of time.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Achieving robust somatic mutation detection with deep learning models derived from reference data sets of a cancer sample

Accurate detection of somatic mutations is challenging but critical in understanding cancer formation, progression, and treatment. We recently proposed NeuSomatic, the first deep convolutional neural network-based somatic mutation detection approach, and demonstrated performance advantages on in silico data. In this study, we use the first comprehensive and well-characterized somatic reference data sets from the SEQC2 consortium to investigate best practices for using a deep learning framework in cancer mutation detection. Using the high-confidence somatic mutations established for a cancer cell line by the consortium, we identify the best strategy for building robust models on multiple data sets derived from samples representing real scenarios, for example, a model trained on a combination of real and spike-in mutations had the highest average performance. The strategy identified in our study achieved high robustness across multiple sequencing technologies for fresh and FFPE DNA input, varying tumor/normal purities, and different coverages, with significant superiority over conventional detection approaches in general, as well as in challenging situations such as low coverage, low variant allele frequency, DNA damage, and difficult genomic regions.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2010

THE DISTRIBUTION OF COALESCING COMPACT BINARIES IN THE LOCAL UNIVERSE: PROSPECTS FOR GRAVITATIONAL-WAVE OBSERVATIONS

Merging compact binaries are the most viable and best-studied candidates for gravitational-wave (GW) detection by the fully operational network of ground-based observatories. In anticipation of the first detections, the expected distribution of GW sources in the local universe is of considerable interest. Here we investigate the full phase-space distribution of coalescing compact binaries at z = 0 using dark matter simulations of structure formation. The fact that these binary systems acquire large barycentric velocities at birth ('kicks') results in merger site distributions that are more diffusely distributed with respect to their putative hosts, with mergers occurring out to distances of a few Mpc from the host halo. Redshift estimates based solely on the nearest galaxy in projection can, as a result, be inaccurate. On the other hand, large offsets from the host galaxy could aid the detection of faint optical counterparts and should be considered when designing strategies for follow-up observations. The degree of isotropy in the projected sky distributions of GW sources is found to be augmented with increasing kick velocity and to be severely enhanced if progenitor systems possess large kicks as inferred from the known population of pulsars and double compact binaries. Even in the absence of observed electromagnetic counterparts, the differences in sky distributions of binaries produced by disparate kick-velocity models could be discerned by GW observatories, within the expected accuracies and detection rates of advanced LIGO-in particular with the addition of more interferometers.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

LSBGnet: an improved detection model for low-surface brightness galaxies

ABSTRACT The Chinese Space Station Telescope (CSST) is scheduled to launch soon, which is expected to provide a vast amount of image potentially containing low-surface brightness galaxies (LSBGs). However, detecting and characterizing LSBGs is known to be challenging due to their faint surface brightness, posing a significant hurdle for traditional detection methods. In this paper, we propose LSBGnet, a deep neural network specifically designed for automatic detection of LSBGs. We established LSBGnet-SDSS model using data set from the Sloan Digital Sky Survey (SDSS). The results demonstrate a significant improvement compared to our previous work, achieving a recall of 97.22 per cent and a precision of 97.27 per cent on the SDSS test set. Furthermore, we use the LSBGnet-SDSS model as a pre-training model, employing transfer learning to retrain the model with LSBGs from Dark Energy Survey (DES), and establish the LSBGnet-DES model. Remarkably, after retraining the model on a small DES sample, it achieves over 90 per cent precision and recall. To validate the model’s capabilities, we utilize the trained LSBGnet-DES model to detect LSBG candidates within a selected 5 sq. deg area in the DES footprint. Our analysis reveals the detection of 204 LSBG candidates, characterized by a mean surface brightness range of $23.5\ \mathrm{ mag}\ \mathrm{ arcsec}^{-2}\le \bar{\mu }_{\text{eff}}(g)\le 26.8\ \mathrm{ mag}\ \mathrm{ arcsec}^{-2}$ and a half-light radius range of 1.4 arcsec ≤ r1/2 ≤ 8.3 arcsec. Notably, 116 LSBG candidates exhibit a half-light radius ≥2.5 arcsec. These results affirm the remarkable performance of our model in detecting LSBGs, making it a promising tool for the upcoming CSST.

Su, Hao (ORCID:0009000778888301)↗
DOE OSTI2026

pyFLANK, a graph neural network based null distribution inference model for F ST outlier detection

Detecting genomic regions under selection is essential for understanding how populations adapt to different environments, yet it remains challenging due to the confounding effects of demographic history and linkage disequilibrium (LD). Fixation index (F ST ) is a widely used statistic to identify genomic regions under adaptation. However, identifying genes under selection by defining F ST outliers often remains challenging, owing to confounding effects of underlying demographic history. Traditional methods assume independence among loci and rely on simple demographic models, while newer models perform much better but are computationally expensive and not easily scalable. Here, we present pyFLANK, an open-source and automated Python implementation which detects F ST outliers using a null distribution inferred from quasi-independent loci. Our tool integrates three approaches to identify loci obeying a null distribution: graph neural network (GNN) inference, linkage disequilibrium (LD)-based inference, and user-defined input. Because pyFLANK uses GNN-based inference of quasi-independent loci, it yields a more accurate null model with less need for user parameter input. In simulation experiments, pyFLANK achieved lower false positive rates than current methods while maintaining comparable detection power, indicating that its refined null model better distinguishes true adaptive loci from background variation. The GNN-based model, in particular, detected additional loci associated with phenotypic variance that were not identified by existing methods. Assessments of simulation and real data from different species demonstrate that pyFLANK achieves lower false positive rates compared with other commonly used F ST outlier detectors, while maintaining comparable detection power and excellent computational performance, providing a robust and user-friendly tool for identifying loci under divergent selection. It extends existing F ST outlier frameworks by incorporating explicit LD-aware strategies for null model calibration. The method is intended as a practical and scalable complement to existing genome scan approaches.

FST↗
NASA NTRS1986

Fiber optic sensors; Proceedings of the Meeting, Cannes, France, November 26, 27, 1985

The conference presents papers on distributed sensors and sensor networks, signal processing and detection techniques, temperature measurements, chemical sensors, and the measurement of pressure, strain, and displacements. Particular attention is given to optical fiber distributed sensors and sensor networks, tactile sensing in robotics using an optical network and Z-plane techniques, and a spontaneous Raman temperature sensor. Other topics include coherence in optical fiber gyroscopes, a high bandwidth two-phase flow void fraction fiber optic sensor, and a fiber-optic dark-field microbend sensor.

Arditty, Herve J.↗
DOE OSTI2022

Locating fast-varying line disturbances with the frequency mismatch

In an attempt to provide an efficient method for line disturbance identification in complex networks of diffusively coupled agents, we recently proposed to leverage the frequency mismatch. The frequency mismatch filters out the intricate combination of interactions induced by the network structure and quantifies to what extent the trajectory of each agent is affected by the disturbance. In this previous work, we provided some analytical evidence of its efficiency when the perturbation is assumed to be slow. Here we claim that the frequency mismatch performs actually well for most disturbance regimes. This is shown through a series of simulations and is backed up by an analytical argument. Therefore, we argue that the frequency mismatch is an efficient and elegant tool for line disturbance location in complex networks of diffusively coupled agents.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Anomaly analysis and visualization for dynamic networks through spatiotemporal graph segmentations

With recent technology advance in Internet of Things (IoT) that involves human, sensors, and mobile devices, networks are not only growing much larger but more complex and dynamic in nature. The spatiotemporal dynamics of networks are represented by both topological changes and temporal shifts of attribute information associated with network components. Understanding the pattern and trend of dynamic networks is increasingly important. While data mining approaches are generally useful in analyzing the statistical properties of networks, there has been recent trend to consider bringing human into the loop, and to examine how feedback from visualizations of large-scale dynamic networks can further improve data mining and machine learning. Traditional visualization methods based on animation and sequences of snapshot graphs are also limited by human cognitive capability. Here, we present a dynamic network analysis and visualization (DNAV) tool which explores the spatiotemporal dimensions of graph components. In particular, nodes and edges are augmented with spatiotemporal segmentation based on both topological and attribute dynamics (e.g., time and locations of connectivity). To further facilitate analysis of large dynamic networks, DNAV includes statistical dynamic overviews alongside graph views, as well as data filtering modules for scalable analysis. Using case studies on public datasets, we demonstrate the effectiveness of DNAV in understanding and analyzing anomalies in dynamic networks such as computer communication networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Graph link prediction in computer networks using Poisson matrix factorisation

Graph link prediction is an important task in cybersecurity: relationships between entities within a computer network, such as users interacting with computers or system libraries and the corresponding processes that use them, can provide key insights into adversary behaviour. Poisson matrix factorisation (PMF) is a popular model for link prediction in large networks, particularly useful for its scalability. In this article PMF is extended to include scenarios that are commonly encountered in cybersecurity applications. Specifically, an extension is proposed to explicitly handle binary adjacency matrices and include known categorical covariates associated with the graph nodes. A seasonal PMF model is also presented to handle seasonal networks. To allow the methods to scale to large graphs, variational methods are discussed for performing fast inference. The results show an improved performance over the standard PMF model and other statistical network models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Probing the active massive black hole candidate in the center of NGC 404 with VLBI

Recently, Nyland et al. argued that the radio emission observed in the center of the dwarf galaxy NGC 404 originates in a low-luminosity active galactic nucleus powered by a massive black hole (MBH, M ≲ 10{sup 6} M{sub ☉}). High-resolution radio detections of MBHs are rare. Here we present sensitive, contemporaneous Chandra X-ray, and very long baseline interferometry (VLBI) radio observations with the European VLBI Network. The source is detected in the X-rays, and shows no long-term variability. If the hard X-ray source is powered by accretion, the apparent low accretion efficiency would be consistent with a black hole (BH) in the hard state. Hard state BHs are known to show radio emission compact on the milliarcsecond scales. However, the central region of NGC 404 is resolved out on 10 mas (0.15-1.5 pc) scales. Our VLBI non-detection of a compact, partially self-absorbed radio core in NGC 404 implies that either the BH mass is smaller than 3{sub −2}{sup +5}×10{sup 5} M{sub ☉}, or the source does not follow the fundamental plane of BH activity relation. An alternative explanation is that the central BH is not in the hard state. The radio emission observed on arcsecond (tens of parsecs) scales may originate in nuclear star formation or extended emission due to AGN activity, although the latter would not be typical considering the structural properties of low-ionization nuclear emission-line region galaxies with confirmed nuclear activity.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2017

Ensembles of novelty detection classifiers for structural health monitoring using guided waves

Guided wave structural health monitoring uses sparse sensor networks embedded in sophisticated structures for defect detection and characterization. The biggest challenge of those sensor networks is developing robust techniques for reliable damage detection under changing environmental and operating conditions. To address this challenge, we develop a novelty classifier for damage detection based on one class support vector machines. We identify appropriate features for damage detection and introduce a feature aggregation method which quadratically increases the number of available training observations.We adopt a two-level voting scheme by using an ensemble of classifiers and predictions. Each classifier is trained on a different segment of the guided wave signal, and each classifier makes an ensemble of predictions based on a single observation. Using this approach, the classifier can be trained using a small number of baseline signals. We study the performance using monte-carlo simulations of an analytical model and data from impact damage experiments on a glass fiber composite plate.We also demonstrate the classifier performance using two types of baseline signals: fixed and rolling baseline training set. The former requires prior knowledge of baseline signals from all environmental and operating conditions, while the latter does not and leverages the fact that environmental and operating conditions vary slowly over time and can be modeled as a Gaussian process.

Dib, Gerges (ORCID:0000000255004047)↗
NASA NTRS1992

Fault detection using a two-model test for changes in the parameters of an autoregressive time series

This article describes an investigation of a statistical hypothesis testing method for detecting changes in the characteristics of an observed time series. The work is motivated by the need for practical automated methods for on-line monitoring of Deep Space Network (DSN) equipment to detect failures and changes in behavior. In particular, on-line monitoring of the motor current in a DSN 34-m beam waveguide (BWG) antenna is used as an example. The algorithm is based on a measure of the information theoretic distance between two autoregressive models: one estimated with data from a dynamic reference window and one estimated with data from a sliding reference window. The Hinkley cumulative sum stopping rule is utilized to detect a change in the mean of this distance measure, corresponding to the detection of a change in the underlying process. The basic theory behind this two-model test is presented, and the problem of practical implementation is addressed, examining windowing methods, model estimation, and detection parameter assignment. Results from the five fault-transition simulations are presented to show the possible limitations of the detection method, and suggestions for future implementation are given.

Scholtz, P.↗