Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 1,693 records · Page 94
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Hylia: Time-Series Library for Network Operations (Hylia) v1

The ability to analyze time-series data in network operations is critical to ensure optimal operations and management in wide area networks, sensor networks, and cloud networks. Hylia is a collection of multiple time-series prediction algorithms designed specifically to work with network monitoring data sets such as SNMP, NETFLOW and other monitoring data. It is designed to recognize these features and perform the extrapolation of the data.

Kiran, Mariam↗
DOE OSTI2024

UFNet: Joint U-Net and Fully Connected Neural Network to Bias Correct Precipitation Predictions from

Paper information. Shuang Yu, Indrasis Chakraborty, Gemma J. Anderson, Donald D. Lucas, Yannic Lops, and Daniel Galea. UFNet: Joint U-Net and fully connected neural network to bias correct precipitation predictions from climate models. Artificial Intelligence for the Earth Systems, 2024. Overview. This work develops the UFNet methodology to correct E3SM historical precipitation projection bias. The UFNet deep learning framework consists of a two-part architecture: a U-Net convolutional network to capture the spatiotemporal distribution of precipitation and a fully connected network to capture the distribution of higher-order statistics. The joint network, termed UFNet, can simultaneously improve the spatial structure of the modeled precipitation and capture the distribution of extreme precipitation values. Below we provide guidance for applying UFNet to correct the Energy Exascale Earth System Model (E3SM; Golaz et al. 2019) daily precipitation projection over the contiguous United States (CONUS). Getting started 1. Obtain the historical climate simulation and observation data. The E3SM historical simulation data are available through https://aims2.llnl.gov/search/cmip6/. The CPC unified gauge-based analysis of daily precipitation can be found through https://psl.noaa.gov/data/gridded/data.cpc.globalprecip.html. The ECMWF atmospheric reanalysis of the 20th century (ERA-20C) data are available through https://www.ecmwf.int/en/forecasts/datasets/reanalysis-datasets/era-20c. The spatial resolution of E3SM and observed datasets are both regridded to a common 1° resolution grid using conservative interpolation. The regridded E3SM, CPC and ERA-20C with 1° resolution can be found throught ./data/. 2. Train the fully connected network (DNN) Python train_dnn.py 3. Train the UFNet Python train_ufnet.py 4. Evaluation and compared with the baseline Python evaluation.py

Lucas, DonaldD↗
DOE OSTI2022

Observing Profiles of Derived Kinematic Field Quantities Using a Network of Profiling Sites

Abstract Observations of thermodynamic and kinematic parameters associated with derivatives of the thermodynamics and wind fields, namely, advection, vorticity, divergence, and deformation, can be obtained by applying Green’s theorem to a network of observing sites. The five nodes that comprise the Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) profiling network, spaced 50–80 km apart, are used to obtain measurements of these parameters over a finite region. To demonstrate the applicability of this technique at this location, it is first applied to gridded model output from the High-Resolution Rapid Refresh (HRRR) numerical weather prediction model, using profiles from the locations of ARM network sites, so that values calculated from this method can be directly compared to finite difference calculations. Good agreement is found between both approaches as well as between the model and values calculated from the observations. Uncertainties for the observations are obtained via a Monte Carlo process in which the profiles are randomly perturbed in accordance with their known error characteristics. The existing size of the ARM network is well suited to capturing these parameters, with strong correlations to model values and smaller uncertainties than a more closely spaced network, yet it is small enough that it avoids the tendency for advection to go to zero over a large area.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Network Scale Travel Time Prediction using Deep Learning

In recent years, deep learning models have been receiving increased attention within the artificial intelligence (AI) community because of their high prediction accuracy. In this paper, two deep learning models, long short-term memory (LSTM) and convolutional neural network (CNN), are proposed to predict travel time in a road network. One major advantage of using deep learning for travel time prediction is that it can make accurate predictions for all the segments in the transportation network with a single model structure, instead of building customized models for each segment separately. The proposed models were evaluated on a transportation network in the City of Saint Louis, Missouri. The prediction results show that deep learning can provide accurate prediction for both congested and uncongested traffic conditions, and can successfully capture the traffic dynamics of unexpected incidents or special events. The study findings show that deep learning offers a promising approach to real-time prediction of travel times on a network scale.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2018

A Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network

This paper proposes a time-dependent intermodal A* (TDIMA*) algorithm. The algorithm works on a multimodal network with transit, walking, and vehicular network links, and finds paths for the three major modes (transit, walking, driving) and any feasible combination thereof (e.g., park-and-ride). Turn penalties on the vehicular network and progressive transfer penalties on the transit network are considered for improved realism. Moreover, upper bounds to prevent excessive waiting and walking are introduced, as well as an upper bound on driving for the park-and-ride (PNR) mode. The algorithm is validated on the large-scale Chicago Regional network using real-world trips against the Google Directions API and the Regional Transit Authority router.

Verbas, Omer↗
DOE OSTI2014

The founding charter of the Genomic Observatories Network

The co-authors of this paper hereby state their intention to work together to launch the Genomic Observatories Network (GOs Network) for which this document will serve as its Founding Charter. We define a Genomic Observatory as an ecosystem and/or site subject to long-term scientific research, including (but not limited to) the sustained study of genomic biodiversity from single-celled microbes to multicellular organisms. An international group of 64 scientists first published the call for a global network of Genomic Observatories in January 2012. The vision for such a network was expanded in a subsequent paper and developed over a series of meetings in Bremen (Germany), Shenzhen (China), Moorea (French Polynesia), Oxford (UK), Pacific Grove (California, USA), Washington (DC, USA), and London (UK). While this community-building process continues, here we express our mutual intent to establish the GOs Network formally, and to describe our shared vision for its future. The views expressed here are ours alone as individual scientists, and do not necessarily represent those of the institutions with which we are affiliated.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Genome co-amplification upregulates a mitotic gene network activity that predicts outcome and response to mitotic protein inhibitors in breast cancer

Background: High mitotic activity is associated with the genesis and progression of many cancers. Small molecule inhibitors of mitotic apparatus proteins are now being developed and evaluated clinically as anticancer agents. With clinical trials of several of these experimental compounds underway, it is important to understand the molecular mechanisms that determine high mitotic activity, identify tumor subtypes that carry molecular aberrations that confer high mitotic activity, and to develop molecular markers that distinguish which tumors will be most responsive to mitotic apparatus inhibitors. Methods: We identified a coordinately regulated mitotic apparatus network by analyzing gene expression profiles for 53 malignant and non-malignant human breast cancer cell lines and two separate primary breast tumor datasets. We defined the mitotic network activity index (MNAI) as the sum of the transcriptional levels of the 54 coordinately regulated mitotic apparatus genes. The effect of those genes on cell growth was evaluated by small interfering RNA (siRNA). Results: High MNAI was enriched in basal-like breast tumors and was associated with reduced survival duration and preferential sensitivity to i nhibitors of the mitotic apparatus proteins, polo-like kinase, centromere associated protein E and aurora kinase designated GSK462364, GSK923295 and GSK1070916, respectively. Co-amplification of regions of chromosomes 8q24, 10p15-p12, 12p13, and 17q24-q25 was associated with the transcriptional upregulation of this network of 54 mitotic apparatus genes, and we identify transcription factors that localize to these regions and putatively regulate mitotic activity. Knockdown of the mitotic network by siRNA identified 22 genes that might be considered as additional therapeutic targets for this clinically relevant patient subgroup. Conclusions: We define a molecular signature which may guide therapeutic approaches for tumors with high mitotic network activity.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Network upgrade exploiting multi band: S- or E-band?

Nowadays, the fiber spectrum is only partially exploited, i.e., mainly in the C-band and more recently in the C + L-band, where the fiber attenuation profile experiences the minimum. Thus, fiber communications technology—amplifiers, switching, transceivers, etc.—and networking solutions are mature for those spectrum bands. However, the continuous increase in traffic means that capacity saturation of the current infrastructure is looming. Taking advantage of the unused portions of the spectrum (e.g., the S- and E-bands) may be an efficient solution to accommodate an increase in traffic without installing new fibers. Research is thus investigating multi-band transmission and networking to evaluate and enable such network upgrades. Some issues need to be solved or taken into account, from the enabling technology (e.g., amplifiers in the S- or E-band are still under development) to physical layer effects previously neglected, such as stimulated Raman scattering (SRS). SRS affects wideband transmission, potentially degrading active channels. The contribution of this paper is the investigation of network upgrades for C + L-band systems. In particular, upgrades exploiting the E- and S-bands are compared taking into account each band capacity and the effects of SRS on both new and already deployed channels (in both the C- and L-bands). A detailed analysis of the physical layer is provided also in the presence of guard bands between previously exploited bands and the bands used for upgrade. By leveraging the physical layer assessment, a networking analysis is carried out to evaluate the supported traffic increase and also the signal quality degradation due to SRS on active channels. Overall, the results suggest that upgrades to the E- and S-bands support a comparable increase in traffic. However, the exploitation of the E-band with 14 THz of guard band between the C- and E-bands may avoid detrimental effects to already active channels in the C + L-band, suggesting this upgrade strategy can be the most effective of the two.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Optimal resource allocation for flexible-grid entanglement distribution networks

We use a genetic algorithm (GA) as a design aid for determining the optimal provisioning of entangled photon spectrum in flex-grid quantum networks with arbitrary numbers of channels and users. After introducing a general model for entanglement distribution based on frequency-polarization hyperentangled biphotons, we derive upper bounds on fidelity and entangled bit rate for networks comprising one-to-one user connections. Simple conditions based on user detector quality and link efficiencies are found that determine whether entanglement is possible. We successfully apply a GA to find optimal resource allocations in four different representative network scenarios and validate features of our model experimentally in a quantum local area network in deployed fiber. Our results show promise for the rapid design of large-scale entanglement distribution networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Fibrin Networks Regulate Protein Transport during Thrombus Development

Thromboembolic disease is a leading cause of morbidity and mortality worldwide. In the last several years there have been a number of studies attempting to identify mechanisms that stop thrombus growth. This paper identifies a novel mechanism related to formation of a fibrin cap. In particular, protein transport through a fibrin network, an important component of a thrombus, was studied by integrating experiments with model simulations. The network permeability and the protein diffusivity were shown to be important factors determining the transport of proteins through the fibrin network. Our previous in vivo studies in mice have shown that stabilized non-occluding thrombi are covered by a fibrin network (‘fibrin cap’). Model simulations, calibrated using experiments in microfluidic devices and accounting for the permeable structure of the fibrin cap, demonstrated that thrombin generated inside the thrombus was washed downstream through the fibrin network, thus limiting exposure of platelets on the thrombus surface to thrombin. Moreover, by restricting the approach of resting platelets in the flowing blood to the thrombus core, the fibrin cap impaired platelets from reaching regions of high thrombin concentration necessary for platelet activation and limited thrombus growth. The formation of a fibrin cap prevents small thrombi that frequently develop in the absence of major injury in the 60000 km of vessels in the body from developing into life threatening events.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2017

Community detection in sequence similarity networks based on attribute clustering

Networks are powerful tools for the presentation and analysis of interactions in multi-component systems. A commonly studied mesoscopic feature of networks is their community structure, which arises from grouping together similar nodes into one community and dissimilar nodes into separate communities. Here in this paper, the community structure of protein sequence similarity networks is determined with a new method: Attribute Clustering Dependent Communities (ACDC). Sequence similarity has hitherto typically been quantified by the alignment score or its expectation value. However, pair alignments with the same score or expectation value cannot thus be differentiated. To overcome this deficiency, the method constructs, for pair alignments, an extended alignment metric, the link attribute vector, which includes the score and other alignment characteristics. Rescaling components of the attribute vectors qualitatively identifies a systematic variation of sequence similarity within protein superfamilies. The problem of community detection is then mapped to clustering the link attribute vectors, selection of an optimal subset of links and community structure refinement based on the partition density of the network. ACDC-predicted communities are found to be in good agreement with gold standard sequence databases for which the "ground truth" community structures (or families) are known. ACDC is therefore a community detection method for sequence similarity networks based entirely on pair similarity information. A serial implementation of ACDC is available from https://cmb.ornl.gov/resources/developments

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Benchmarking treewidth as a practical component of tensor network simulations

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network’s line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Hydrologic Model Data for the East Fork Poplar Creek Watershed Simulated with the Advanced Terrestrial Simulator (ATS): Streamflow and Network Expansion–Contraction Dynamics

This dataset supports hydrologic modeling and stream network expansion–contraction analysis for the East Fork Poplar Creek (EFPC) Watershed in Tennessee. It includes a Jupyter notebook for model setup, model configuration files, simulation outputs, and derived products used to evaluate model performance and investigate stream dynamics under varying hydrologic conditions. The dataset was generated using the Watershed Workflow Python package and the Advanced Terrestrial Simulator (ATS), enabling integrated surface–subsurface hydrologic simulations using a stream-aligned mesh. Outputs include high-resolution time series of streamflow, active network length, water table depth, and related hydrologic variables. Also included are spatially explicit stream persistency indices and classifications of reaches as perennial or non-perennial. These data facilitate reproducibility and support further research on stream intermittency and variability in network extent.The model data archive is organized in following directories:1) model_setup_inputsContains the Watershed Workflow Jupyter notebooks (accessed through any open source code editor), selected input datasets, and resulting ATS input files, including XML files (access through any open source code editor), computational mesh (.exo files can be viewed using Paraview), and meteorological forcing files (.h5 files can be accessed through h5py python package and HDFView open source software). 2) model_outputsIncludes ATS simulation outputs relevant to this study. Time series of spatially integrated or averaged variables (e.g., streamflow, water table depth) are provided as CSV files. Select spatial fields (e.g., ponded depth and water table depth) are saved as pickled Python objects to reduce file size, and can be accessed through pickle package in Python. Key geometry objects from Watershed Workflow—such as the surface mesh and river tree—are also included to support analysis of streamflow persistency and expansion–contraction dynamics. These files can also be accessed through Watershed Workflow Python package.3) model_evaluationProvides observed streamflow time series and field survey-based flow regime classifications used to evaluate model performance. Jupyter notebooks for processing ATS outputs and comparing model predictions with observations to build confidence in the model prior to scientific analysis are also included.4) Q_L_relationshipsContains workflows for generating time series of discharge, active network length, and related hydrologic variables used in the stream network expansion–contraction analysis. Includes routines for delineating baseflow-dominated periods. For each catchment, notebooks and processed data (as pickled DataFrames accessed through Pandas Python package) are provided. 5) figure_scriptsProvides the Jupyter notebooks used to generate the figures presented in the paper.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Learning the ground state of a non-stoquastic quantum Hamiltonian in a rugged neural network landscape

Strongly interacting quantum systems described by non-stoquastic Hamiltonians exhibit rich low-temperature physics. Yet, their study poses a formidable challenge, even for state-of-the-art numerical techniques. Here, we investigate systematically the performance of a class of universal variational wave-functions based on artificial neural networks, by considering the frustrated spin- 1/2 1 / 2 J_1-J_2 J 1 − J 2 Heisenberg model on the square lattice. Focusing on neural network architectures without physics-informed input, we argue in favor of using an ansatz consisting of two decoupled real-valued networks, one for the amplitude and the other for the phase of the variational wavefunction. By introducing concrete mitigation strategies against inherent numerical instabilities in the stochastic reconfiguration algorithm we obtain a variational energy comparable to that reported recently with neural networks that incorporate knowledge about the physical system. Through a detailed analysis of the individual components of the algorithm, we conclude that the rugged nature of the energy landscape constitutes the major obstacle in finding a satisfactory approximation to the ground state wavefunction, and prevents learning the correct sign structure. In particular, we show that in the present setup the neural network expressivity and Monte Carlo sampling are not primary limiting factors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

More Opportunities than Wealth. A Network of Power and Frustration

We introduce a minimal agent-based model to qualitatively conceptualize the allocation of limited wealth among more abundant opportunities. We study the interplay of power, satisfaction and frustration in the problem of wealth distribution, concentration, and inequality. This framework allows us to compare subjective measures of frustration and satisfaction to collective measures of fairness in wealth distribution, such as the Lorenz curve and the Gini index. We find that a completely libertarian, law-of-the-jungle setting, where every agent can acquire wealth from, or lose wealth to, anybody else invariably leads to a complete polarization of the distribution of wealth vs. opportunity, only minimally ameliorated by disorder in a non-optimized society. The picture is however dramatically modified when hard constraints are imposed over agents, and they are forced to share wealth with neighbors on a network. We discuss the case of random networks and scale free networks. We then propose an out of equilibrium dynamics of the networks, based on a competition of power and frustration in the decision-making of agents that leads to network evolution. We show that the ratio of power and frustration controls different dynamical regimes separated by kinetic transition and characterized by drastically different values of the indices of equality.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Cyber Security Research Frameworks For Coevolutionary Network Defense

Several architectures have been created for developing and testing systems used in network security, but most are meant to provide a platform for running cyber security experiments as opposed to automating experiment processes. In the first paper, we propose a framework termed Distributed Cyber Security Automation Framework for Experiments (DCAFE) that enables experiment automation and control in a distributed environment. Predictive analysis of adversaries is another thorny issue in cyber security. Game theory can be used to mathematically analyze adversary models, but its scalability limitations restrict its use. Computational game theory allows us to scale classical game theory to larger, more complex systems. In the second paper, we propose a framework termed Coevolutionary Agent-based Network Defense Lightweight Event System (CANDLES) that can coevolve attacker and defender agent strategies and capabilities and evaluate potential solutions with a custom network defense simulation. The third paper is a continuation of the CANDLES project in which we rewrote key parts of the framework. Attackers and defenders have been redesigned to evolve pure strategy, and a new network security simulation is devised which specifies network architecture and adds a temporal aspect. We also add a hill climber algorithm to evaluate the search space and justify the use of a coevolutionary algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Workshop on Incomplete Network Data Held at Sandia National Labs – Livermore

While network analysis is applied in a broad variety of scientific fields (including physics, computer science, biology, and the social sciences), how networks are constructed and the resulting bias and incompleteness have drawn more limited attention. For example, in biology, gene networks are typically developed via experiment -- many actual interactions are likely yet to be discovered. In addition to this incompleteness, the data-collection processes can introduce significant bias into the observed network datasets. For instance, if you observe part of the World Wide Web network through a classic random walk, then high degree nodes are more likely to be found than if you had selected nodes at random. Unfortunately, such incomplete and biasing data collection methods must be often used.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

The Livermore Brain: Massive Deep Learning Networks Enabled by High Performance Computing

The proliferation of inexpensive sensor technologies like the ubiquitous digital image sensors has resulted in the collection and sharing of vast amounts of unsorted and unexploited raw data. Companies and governments who are able to collect and make sense of large datasets to help them make better decisions more rapidly will have a competitive advantage in the information era. Machine Learning technologies play a critical role for automating the data understanding process; however, to be maximally effective, useful intermediate representations of the data are required. These representations or “features” are transformations of the raw data into a form where patterns are more easily recognized. Recent breakthroughs in Deep Learning have made it possible to learn these features from large amounts of labeled data. The focus of this project is to develop and extend Deep Learning algorithms for learning features from vast amounts of unlabeled data and to develop the HPC neural network training platform to support the training of massive network models. This LDRD project succeeded in developing new unsupervised feature learning algorithms for images and video and created a scalable neural network training toolkit for HPC. Additionally, this LDRD helped create the world’s largest freely-available image and video dataset supporting open multimedia research and used this dataset for training our deep neural networks. This research helped LLNL capture several work-for-others (WFO) projects, attract new talent, and establish collaborations with leading academic and commercial partners. Finally, this project demonstrated the successful training of the largest unsupervised image neural network using HPC resources and helped establish LLNL leadership at the intersection of Machine Learning and HPC research.

97 MATHEMATICS AND COMPUTING↗