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 1,729 records · Page 96

Large Scale Computing and Storage Requirements for Biological and Environmental Research

In May 2009, NERSC, DOE's Office of Advanced Scientific Computing Research (ASCR), and DOE's Office of Biological and Environmental Research (BER) held a workshop to characterize HPC requirements for BER-funded research over the subsequent three to five years. The workshop revealed several key points, in addition to achieving its goal of collecting and characterizing computing requirements. Chief among them: scientific progress in BER-funded research is limited by current allocations of computational resources. Additionally, growth in mission-critical computing -- combined with new requirements for collaborative data manipulation and analysis -- will demand ever increasing computing, storage, network, visualization, reliability and service richness from NERSC. This report expands upon these key points and adds others. It also presents a number of"case studies" as significant representative samples of the needs of science teams within BER. Workshop participants were asked to codify their requirements in this"case study" format, summarizing their science goals, methods of solution, current and 3-5 year computing requirements, and special software and support needs. Participants were also asked to describe their strategy for computing in the highly parallel,"multi-core" environment that is expected to dominate HPC architectures over the next few years.

54 ENVIRONMENTAL SCIENCES↗

Using new edges for anomaly detection in computer networks

Creation of new edges in a network may be used as an indication of a potential attack on the network. Historical data of a frequency with which nodes in a network create and receive new edges may be analyzed. Baseline models of behavior among the edges in the network may be established based on the analysis of the historical data. A new edge that deviates from a respective baseline model by more than a predetermined threshold during a time window may be detected. The new edge may be flagged as potentially anomalous when the deviation from the respective baseline model is detected. Probabilities for both new and existing edges may be obtained for all edges in a path or other subgraph. The probabilities may then be combined to obtain a score for the path or other subgraph. A threshold may be obtained by calculating an empirical distribution of the scores under historical conditions.

97 MATHEMATICS AND COMPUTING↗

Using new edges for anomaly detection in computer networks

Creation of new edges in a network may be used as an indication of a potential attack on the network. Historical data of a frequency with which nodes in a network create and receive new edges may be analyzed. Baseline models of behavior among the edges in the network may be established based on the analysis of the historical data. A new edge that deviates from a respective baseline model by more than a predetermined threshold during a time window may be detected. The new edge may be flagged as potentially anomalous when the deviation from the respective baseline model is detected. Probabilities for both new and existing edges may be obtained for all edges in a path or other subgraph. The probabilities may then be combined to obtain a score for the path or other subgraph. A threshold may be obtained by calculating an empirical distribution of the scores under historical conditions.

97 MATHEMATICS AND COMPUTING↗

Using new edges for anomaly detection in computer networks

Creation of new edges in a network may be used as an indication of a potential attack on the network. Historical data of a frequency with which nodes in a network create and receive new edges may be analyzed. Baseline models of behavior among the edges in the network may be established based on the analysis of the historical data. A new edge that deviates from a respective baseline model by more than a predetermined threshold during a time window may be detected. The new edge may be flagged as potentially anomalous when the deviation from the respective baseline model is detected. Probabilities for both new and existing edges may be obtained for all edges in a path or other subgraph. The probabilities may then be combined to obtain a score for the path or other subgraph. A threshold may be obtained by calculating an empirical distribution of the scores under historical conditions.

97 MATHEMATICS AND COMPUTING↗

Using new edges for anomaly detection in computer networks

Creation of new edges in a network may be used as an indication of a potential attack on the network. Historical data of a frequency with which nodes in a network create and receive new edges may be analyzed. Baseline models of behavior among the edges in the network may be established based on the analysis of the historical data. A new edge that deviates from a respective baseline model by more than a predetermined threshold during a time window may be detected. The new edge may be flagged as potentially anomalous when the deviation from the respective baseline model is detected. Probabilities for both new and existing edges may be obtained for all edges in a path or other subgraph. The probabilities may then be combined to obtain a score for the path or other subgraph. A threshold may be obtained by calculating an empirical distribution of the scores under historical conditions.

97 MATHEMATICS AND COMPUTING↗

Groundwater Monitoring Optimization of Post Closure Waste Sites at SRS - 13184

Groundwater monitoring at the Savannah River Site (SRS) is required at dozens of waste sites and includes sampling at over 1,000 monitoring wells. The expected longevity of groundwater contamination and associated groundwater monitoring and reporting constitutes a significant long-term cost that represents an increasing proportion of the environmental management budget as surface waste units are closed. Therefore, a comprehensive evaluation of the monitoring program for eighteen regulated waste units was conducted to identify areas where monitoring could be optimized. The units evaluated varied considerably in the scope of monitoring; ranging from two wells to hundreds of wells. In order to systematically evaluate such disparate monitoring networks, SRS developed a decision-logic analysis using flow sheets to address potential areas of optimization. Five areas were identified for evaluation, including: (1) Comparison of current monitoring to regulatory requirements, (2) Spatial distribution, (3) Temporal sampling, (4) Analyte requirements, and (5) Reporting frequency and content. Optimization recommendations were made for fifteen of the eighteen groundwater units. The spatial evaluation resulted in recommendations to suspend sampling in 79 wells and add sampling at 16 wells. The temporal evaluation resulted in recommendations to reduce the number of well visits per year by 504. Analyte reductions were recommended at three groundwater units, with increases at three other units. Reporting frequency reductions were recommended for five units. Approximately $700,000 (direct dollars) of potential annualized cost savings were identified for these groundwater units, provided all recommendations are approved. The largest area of savings was associated with reducing the reporting frequency. The optimization approach has been presented to the EPA and South Carolina Department of Environmental Control (SCHDEC), with unit-specific recommendations approved for all five units presented. This approach can be expected to be highly successful for sites with rich historical data sets and where the requirements in regulatory monitoring plans can be negotiated. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Top Quark Produced Through the Electroweak Force: Discovery Using the Matrix Element Analysis and Search for Heavy Gauge Bosons Using Boosted Decision Trees

The top quark produced through the electroweak channel provides a direct measurement of the V tb element in the CKM matrix which can be viewed as a transition rate of a top quark to a bottom quark. This production channel of top quark is also sensitive to different theories beyond the Standard Model such as heavy charged gauged bosons termed W'. This thesis measures the cross section of the electroweak produced top quark using a technique based on using the matrix elements of the processes under consideration. The technique is applied to 2.3 fb -1 of data from the D0 detector. From a comparison of the matrix element discriminants between data and the signal and background model using Bayesian statistics, we measure the cross section of the top quark produced through the electroweak mechanism σ(p$\bar{p}$ → tb + X, tqb + X) = 4.30 -1.20 +0.98 pb. The measured result corresponds to a 4.9σ Gaussian-equivalent significance. By combining this analysis with other analyses based on the Bayesian Neural Network (BNN) and Boosted Decision Tree (BDT) method, the measured cross section is 3.94 ± 0.88 pb with a significance of 5.0σ, resulting in the discovery of electroweak produced top quarks. Using this measured cross section and constraining |V tb | < 1, the 95% confidence level (C.L.) lower limit is |V tb | > 0.78. Additionally, a search is made for the production of W' using the same samples from the electroweak produced top quark. An analysis based on the BDT method is used to separate the signal from expected backgrounds. No significant excess is found and 95% C.L. upper limits on the production cross section are set for W' with masses within 600-950 GeV. For four general models of W{prime} boson production using decay channel W' → t$\bar{p}$, the lower mass limits are the following: M(W' L with SM couplings) > 840 GeV; M(W' R ) > 880 GeV or 890 GeV if the right-handed neutrino is lighter or heavier than W{prime}{sub R}; and M(W' L+R ) > 915 GeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Peeking Network States with Clustered Patterns

Network traffic monitoring has long been a core element for effec- tive network management and security. However, it is still a chal- lenging task with a high degree of complexity for comprehensive analysis when considering multiple variables and ever-increasing traffic volumes to monitor. For example, one of the widely con- sidered approaches is to scrutinize probabilistic distributions, but it poses a scalability concern and multivariate analysis is not gen- erally supported due to the exponential increase of the complexity. In this work, we propose a novel method for network traffic moni- toring based on clustering, one of the powerful deep-learning tech- niques. We show that the new approach enables us to recognize clustered results as patterns representing the network states, which can then be utilized to evaluate “similarity” of network states over time. In addition, we define a new quantitative measure for the similarity between two compared network states observed in dif- ferent time windows, as a supportive means for intuitive analysis. Finally, we demonstrate the clustering-based network monitoring with public traffic traces, and show that the proposed approach us- ing the clustering method has a great opportunity for feasible, cost- effective network monitoring.

97 MATHEMATICS AND COMPUTING↗

A neutron crystallographic analysis of T{sub 6} porcine insulin at 2.1 Å resolution

The charge balance and hydrogen-bonding network at the core of the insulin T{sub 6} hexamer have been investigated by neutron diffraction analysis at 2.1 Å resolution. Neutron diffraction data for T{sub 6} porcine insulin were collected to 2.1 Å resolution from a single crystal partly deuterated by exchange of mother liquor. A maximum-likelihood structure refinement was undertaken using the neutron data and the structure was refined to a residual of 0.179. The hydrogen-bonding network of the central core of the hexamer was observed and the charge balance between positively charged Zn ions and their surrounding structure was interpreted by considering the protonation and/or deprotonation states and interactions of HisB10, water and GluB13. The observed double conformation of GluB13 was essential to interpreting the charge balance and could be compared with the structure of a dried crystal of T{sub 6} human insulin at 100 K. Differences in the dynamic behaviour of the water molecules coordinating the upper and lower Zn ions were observed and interpreted. The hydrogen bonds in the insulin molecules, as well as those involving HisB10 and GluB13, are discussed. The hydrogen/deuterium (H/D) exchange ratios of the amide H atoms of T{sub 6} porcine insulin in crystals were obtained and showed that regions highly protected from H/D exchange are concentrated in the centre of a helical region of the B chains. From the viewpoint of soaking time versus H/D-exchange ratios, the amide H atoms can be classified into three categories.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Dimensionality Reduction Library v 0.2

Dimensionality Reduction Library is a C++ library for dimensionality reduction. In the context of this library, dimensionality reduction is considered to consist of 1)estimation of the intrinsic dimensionality using sampled data, 2) Finding maps that reduce the dimensionality of data (forward map) or increase the dimensionality of data (reverse map) and 3) mapping arbitray coordinates to high and low dimensionalities. The library is intended to provide a consistent interface to multiple dimensionality reduction algorithms with an efficient C++ interface that runs efficiently on multicore architectures. A few routines have been optimized with an option for GPU acceleration or distributed computation. Currently the library offers intrinsic dimensionality estimation using point-PCA reconstruction error and/ residual variance. The following dimensionality reduction methods have been implemented: Principal Component Analysis Multidimensional Scaling Locally Linear Embedding IsoMap Autoencoder Neutral Networks An executable is also supplied that can be built to allow for command-line access to the library routines. A description for an application of the library for molecular structure analysis has been published.

BROWN, WILLIAM↗

Dimensionality Reduction Library v 0.2

Dimensionality Reduction Library is a C++ library for dimensionality reduction. In the context of this library, dimensionality reduction is considered to consist of 1)estimation of the intrinsic dimensionality using sampled data, 2) Finding maps that reduce the diemsionality of data (forward map) or increase the dimensionality of data (reverse map) and 3) mapping arbitray coordiantes to high and low dimensionalities. The library is intended toprovide a consistent interface to multiple dimensionality reduction algorithms with an efficient C++ interface that runs efficiently on multicore architectures. A few routines have been optimized with an option for GPU acceleration or distributed computation. Currently the library offers intrinsic dimensionality estimation using point-PCA reconstruction error and/ residual variance. The following dimensionality reduction methods have been implemented: Principal Component Analysis Multidimensional Scaling Locally Linear Embedding IsoMap Autoencoder Neutral Networks An executable is also supplied that can be built to allow for command-line access to the library routines. A description for an applciation of the library for molecular structure analysis has been published.

BROWN, WILLIAM↗

Dynamic Validation of CNN-Based Surrogate Models for Inverter-Based Resources in Open-Source Solvers

Traditionally, distribution system planning has focused on steady-state analyses, with limited consideration of dynamic behavior. However, as large or medium-scale inverter-based resources (IBRs), particularly grid-following (GFL) inverters in commercial or industry buildings, become more prevalent, understanding their dynamic impact is essential for grid planning and operation. This article presents an innovative deep-learning (DL)-approach using convolutional neural networks technique to model the GFL inverters. Developed from real grid-tied commercial IBR transient data, these dynamic DL models overcome proprietary constraints by requiring minimal knowledge of internal converter physics while maintaining high accuracy and flexibility. To demonstrate their applicability, the models were incorporated into GridLAB-D, an open-source, three-phase distribution analysis tool. This integration enables dynamic simulations of large-scale distribution networks with high IBR penetration stability analysis. Rigorous testing and validation, aligned with industry standards, confirmed the reliability and efficiency of this approach, paving the way for enhanced planning and operational assessments of modern power systems.

Deep-learning↗

DRIVE Analysis Tool Generates Custom Vehicle Drive Cycles Based on Real-World Data (Fact Sheet)

This fact sheet from the National Renewable Energy Laboratory describes the Drive-Cycle Rapid Investigation, Visualization, and Evaluation (DRIVE) analysis tool, which uses GPS and controller area network data to characterize vehicle operation and produce custom vehicle drive cycles, analyzing thousands of hours of data in a matter of minutes.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Technologies and Approaches to Elucidate and Model the Virulence Program of Salmonella.

Salmonella is a primary cause of enteric diseases in a variety of animals. During its evolution into a pathogenic bacterium, Salmonella acquired an elaborate regulatory network that responds to multiple environmental stimuli within host animals and integrates them resulting in fine regulation of the virulence program. The coordinated action by this regulatory network involves numerous virulence regulators, necessitating genome-wide profiling analysis to assess and combine efforts from multiple regulons. In this review we discuss recent high-throughput analytic approaches to understand the regulatory network of Salmonella that controls virulence processes. Application of high-throughput analyses have generated a large amount of data and driven development of computational approaches required for data integration. Therefore, we also cover computer-aided network analyses to infer regulatory networks, and demonstrate how genome-scale data can be used to construct regulatory and metabolic systems models of Salmonella pathogenesis. Genes that are coordinately controlled by multiple virulence regulators under infectious conditions are more likely to be important for pathogenesis. Thus, reconstructing the global regulatory network during infection or, at the very least, under conditions that mimic the host cellular environment not only provides a bird’s eye view of Salmonella survival strategy in response to hostile host environments but also serves as an efficient means to identify novel virulence factors that are essential for Salmonella to accomplish systemic infection in the host.

59 BASIC BIOLOGICAL SCIENCES↗

Recherche du boson de Higgs standard dans le canal WH a l'experience D0 aupres du Tevatron

The Higgs mechanism provides the Standard Model with an appropriate theory of the origin of the mass of gauge bosons and elementary fermions. The Higgs boson has not yet been discovered, but a lower limit on its mass has been set at 114.4 GeV at 95% con dence level by the Lep collaborations. Higgs searches are now being pursued at the Tevatron, a proton - anti-proton collider with a centreof- mass energy of 1.96TeV. At low mass the most sensitive channel is the associated production of a Higgs with a W boson. An analysis has been performed in the decay channel in which the Higgs goes into a b$\bar{b}$ pair and the W decays to a muon and a neutrino with 1 fb -1 of Run IIa data recorded by the DØ detector. The analysis relies on all the sub-detector components but most particularly on the calorimeter which is essential for reconstruction of the b$\bar{b}$ system. Good tracking and a b-identi cation neural network tool provide improved b-tagging performance which is crucial for this analysis. Because the energy resolution of jets is of paramount importance when hunting for a two-jet resonance bump, work has also been conducted on devising a better-performing calibration for jets which exhibit a muon and a neutrino in their fragmentation chain. The WH analysis is performed on a W+2 and W+3 jet event topology. Events containing a muon, missing transverse energy and two or three jets are selected; the jets are then b-tagged. The doubletagged and single-tagged channels are analysed separately so as to provide additional sensitivity. Signal-background separation via a neural network algorithme has furthermore been developed in the analysis in order to enhance sensitivity. This search for a standard Higgs boson has been conducted for Higgs masses ranging from 100GeV to 150GeV. Upper limits on production cross-section times branching ratio have been set. For a Higgs mass of 115GeV, the upper limit is set at 2.00 pb at 95% con dence level in the channel WH → μ b$\bar{b}$ and 1.37 pb when combining the two channels WH → μ b$\bar{b}$ and WH → e b$\bar{b}$, which is to be compared to the theoretical prediction of 0.136 pb. Those results have been submitted for publication, and are used in the global combination of Cdf's and DØ's Higgs analyses.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The behaviour of basic autocatalytic signalling modules in isolation and embedded in networks

In this paper, we examine the behaviour of basic autocatalytic feedback modules involving a species catalyzing its own production, either directly or indirectly. We first perform a systematic study of the autocatalytic feedback module in isolation, examining the effect of different factors, showing how this module is capable of exhibiting monostable threshold and bistable switch-like behaviour. We then study the behaviour of this module embedded in different kinds of basic networks including (essentially) irreversible cycles, open and closed reversible chains, and networks with additional feedback. We study the behaviour of the networks deterministically and also stochastically, using simulations, analytical work, and bifurcation analysis. We find that (i) there are significant differences between the behaviour of this module in isolation and in a network: thresholds may be altered or destroyed and bistability may be destroyed or even induced, even when the ambient network is simple. The global characteristics and topology of this network and the position of the module in the ambient network can play important and unexpected roles. (ii) There can be important differences between the deterministic and stochastic dynamics of the module embedded in networks, which may be accentuated by the ambient network. This provides new insights into the functioning of such enzymatic modules individually and as part of networks, with relevance to other enzymatic signalling modules as well.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Toward designing effective exascale scientific computing workflows: experiences and best practices

Many fields within scientific computing have embraced advances in big-data analysis and machine learning, which often requires the deployment of large, distributed and complicated workflows that may combine training neural networks, performing simulations, running inference, and performing database queries and data analysis in asynchronous, parallel and pipelined execution frameworks. Such a shift has brought into focus the need for scalable, efficient workflow management solutions with reproducibility, error and provenance handling, traceability, and checkpoint-restart capabilities, among other needs. Here, we discuss challenges and best-practices for deploying exascale-generation computational science workflows on resources at the Oak Ridge Leadership Computing Facility (OLCF). We present our experiences with large-scale deployment of distributed workflows on the Summit supercomputer, including for bioinformatics and computational biophysics, materials science, and deep learning model optimization. We also present problems and solutions created by working within a Python-centric software base on traditional HPC systems, and discuss steps that will be required before the convergence of HPC, AI, and data science can be fully realized. Our results point to a wealth of exciting new possibilities for harnessing this convergence to tackle new scientific challenges.

Coletti, Mark↗

Integrating tactical planning, operational planning and scheduling using data-driven feasibility analysis

Supply chain operations and scheduling are well-studied problems in the literature. Although these problems are related, they are often solved sequentially. This uncoordinated approach usually leads to sub-optimal solutions. Here this paper proposes a methodology for integrating scheduling operations into the supply chain network, motivated by the available enterprise data, and feasibility analysis. Existing literature on integrated models for addressing the supply chain is reviewed and classified. Then the mathematical model formulation for each level is discussed, after which the proposed data-driven integrated framework is described. The methodology is tested on two different case studies of varying dimensions. For each case study, the solution solves a multi-objective problem with the overall aim of an optimal solution that is robust towards achieving optimal cost while keeping customer satisfaction in mind.

42 ENGINEERING↗