Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “NETWORKING”

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,459 records · Page 81

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↗

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↗

Enriching regulatory networks by bootstrap learning using optimised GO-based gene similarity and gene links mined from PubMed abstracts

Transcriptional regulatory networks are being determined using “reverse engineering” methods that infer connections based on correlations in gene state. Corroboration of such networks through independent means such as evidence from the biomedical literature is desirable. Here, we explore a novel approach, a bootstrapping version of our previous Cross-Ontological Analytic method (XOA) that can be used for semi-automated annotation and verification of inferred regulatory connections, as well as for discovery of additional functional relationships between the genes. First, we use our annotation and network expansion method on a biological network learned entirely from the literature. We show how new relevant links between genes can be iteratively derived using a gene similarity measure based on the Gene Ontology that is optimized on the input network at each iteration. Second, we apply our method to annotation, verification, and expansion of a set of regulatory connections found by the Context Likelihood of Relatedness algorithm.

59 BASIC BIOLOGICAL SCIENCES↗

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↗

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↗

Modeling the Dynamics of Compromised Networks

Accurate predictive models of compromised networks would contribute greatly to improving the effectiveness and efficiency of the detection and control of network attacks. Compartmental epidemiological models have been applied to modeling attack vectors such as viruses and worms. We extend the application of these models to capture a wider class of dynamics applicable to cyber security. By making basic assumptions regarding network topology we use multi-group epidemiological models and reaction rate kinetics to model the stochastic evolution of a compromised network. The Gillespie Algorithm is used to run simulations under a worst case scenario in which the intruder follows the basic connection rates of network traffic as a method of obfuscation.

97 MATHEMATICS AND COMPUTING↗

The Graph Laplacian and the Dynamics of Complex Networks [Slides]

In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.

97 MATHEMATICS AND COMPUTING↗

A Demand-driven, Capacity-constrained, Adaptive Algorithm for Computing Steady-state and Transient Flows in a Petroleum Transportation Network

We developed an algorithm to perform simulations of a supply network for crude oil and refined products in order to estimate the consequences of disruptions to components of the network. Components include oil fields, import terminals, refineries, transmission pipelines, tank farms, and distribution terminals. The physical system is represented as network connections, capacities, and inventories. The governing equations describe mass balance in a non-linear diffusive system in which flows in the network are along gradients in a potential field. Each node in the network has a defined storage capacity and desired storage amount. The potential at each node is a function of the difference between the actual and desired amount of fluid stored. The potential can be thought of as the balance between the desire to increase inflows to maintain the desired storage level and the willingness to provide fluid for consumption or outflow to downstream nodes.

02 PETROLEUM↗

XML Network Description Language (XNDL) for ns-3: ns-3 XSD v0.9

This document is the “XML Network Description Language (XNDL) for ns-3 ns-3 XSD v0.9” addressing the Statement of Work for the Proposed Research in Network Simulation under contract L145271. This work performed by Lawrence Livermore National Laboratory (LLNL) is specifically for the Army Research Laboratory. There exists a dichotomy between a desire to create generic network models that are framework-agnostic and models that are tailored to specific simulation implementations. Both methods have advantages and disadvantages. A generic approach would yield models that can be used and shared among many implementations and thus potentially gain support of a larger user community. However, there would remain a gap between concepts in a generic model and the corresponding representation needed for specific implementations. An approach that targets a specific implementation allows models to take full advantage of tighter integration and have a more explicit representation of simulation concepts and relationships. But locking into a specific implementation removes the portability aspect of the model. See Barnes, et al, for a more complete discussion. XNDL is a XML-based architecture being developed at LLNL for the purpose modeling networks at a high level of abstraction while using a hierarchical structure of targeted grammars to interface with a broader base of network simulation frameworks and their associated tools (see Figure 1).

97 MATHEMATICS AND COMPUTING↗

A Survey of Recent Advances in Transmission Network Switching

Optimal Transmission Switching for electric power networks is a research topic of great interest for both researchers and electric power engineers. Transmission switching is commonly considered a corrective mechanism tool for overloaded networks; however in recent years it has been sought as a means to reduce power loss in the network. Ultimately the objective of this analysis is to provide smart tools for power and economic dispatch planning, allowing utilities and engineers to utilize existing infrastructure as a means of automatic control. The optimization problem is a complex multi-objective search including criteria such as system power loss, equality/non-equality constraints, islanding management, and radial topology configuration in the case of distribution networks. Many optimization methods have been adopted for the transmission switching problem in past years using various heuristic search algorithms. The scope of methodology extends from tried and true methods such as simulated annealing to more modern methods like neural network optimization. Solution benchmarks under consideration commonly include solution state accuracy, computational burden and solution time. The objective of this presentation is to provide a comprehensive account of development in transmission switching methodologies. Benchmarking and testing strategies will be discussed as well as application of the Transmission Expansion Planning Tool in finding transmission switching solutions. Limited Discrepancy Search (LOS) and Probe Discrepancy Search (PDS) Algorithms are compared with more classic optimization strategies, as seen in defining literature and publications in this research field.

24 POWER TRANSMISSION AND DISTRIBUTION↗

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↗

Scaling the Earth System Grid to 100Gbps Networks

The SC11 demonstration, titled Scaling the Earth System Grid to 100Gbps Networks, showed the ability to use underlying infrastructure for the movement of climate data over 100Gbps network. Climate change research is one of the critical data intensive sciences, and the amount of data is continuously growing. Climate simulation data is geographically distributed over the world, and it needs to be accessed from many sources for fast and efficient analysis and inter-comparison of simulations. We used a 100Gbps link connecting National Energy Research Scientific Computing Center (NERSC) at Lawrence Berkeley National Laboratory (LBNL), Argonne National Laboratory (ANL) and Oak Ridge National Laboratory (ORNL). In the demo, the Intergovernmental Panel on Climate Change (IPCC) Fourth Assessment Report (AR4) phase 3 of the Coupled Model Intercomparison Project (CMIP-3) dataset was staged into the memory of computing nodes at ANL and ORNL from NERSC over the 100Gbps network for analysis and visualization. In general, climate simulation data consists of relatively small and large files with irregular file size distribution in each dataset. In this demo, we addressed challenges on data management in terms of high bandwidth networks, usability of existing protocols and middleware tools, and how applications can adapt and benefit from next generation networks.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

DragonView: Toward Understanding Network Interference in Dragonfly-based Supercomputers

Acquiring and maintaining high performance computing systems represents a substantial, long term investment. Therefore, it is paramount to optimize their utilization in order to maximize the return on investment and the impact on science and engineering. In this context, network congestion and inter-job interference are a major challenge as they can lead to significant systemwide performance degregation. This is especially pertinent in shared interconnects such as the dragonfly network, in which resources are shared by multiple jobs. Since many large-scale applications are communication-bound, a few communication heavy applications can have a large impact on the performance of all jobs and decrease the overall system throughput. In this paper, we describe a web-based visual analytics environment to study congestion and inter-job interference on dragonfly networks. The system enables network architects, system administrators and application developers to explore the potential impact of machine configuration, job placement policies and routing algorithms by visualizing and comparing ensembles of simulated workloads and real world data. We focus on the design of the system and describe the challenges, design decisions and the final implementation. Finally, we present two detailed case studies of prototypical analysis sessions by our stakeholders aimed at exploring the implications of different workloads and machine configurations using ensembles of network simulations.

97 MATHEMATICS AND COMPUTING↗

Utilizing Weak Indicators to Detect Anomalous Behaviors in Networks

We consider the use of a novel weak in- dicator alongside more commonly used weak indicators to help detect anomalous behavior in a large computer network. The data of the network which we are studying in this research paper concerns remote log-in information (Virtual Private Network, or VPN sessions) from the internal network of Los Alamos National Laboratory (LANL). The novel indicator we are utilizing is some- thing which, while novel in its application to data science/cyber security research, is a concept borrowed from the business world. The Her ndahl-Hirschman Index (HHI) is a computationally trivial index which provides a useful heuristic for regulatory agencies to ascertain the relative competitiveness of a particular industry. Using this index as a lagging indicator in the monthly format we have studied could help to detect anomalous behavior by a particular or small set of users on the network.

97 MATHEMATICS AND COMPUTING↗

Emulation Platform for Cyber Analysis of Wireless Communication Network Protocols

Wireless networking and mobile communications is increasing around the world and in all sectors of our lives. With increasing use, the density and complexity of the systems increase with more base stations and advanced protocols to enable higher data throughputs. The security of data transported over wireless networks must also evolve with the advances in technologies enabling more capable wireless networks. However, means for analysis of the effectiveness of security approaches and implementations used on wireless networks are lacking. More specifically a capability to analyze the lower-layer protocols (i.e., Link and Physical layers) is a major challenge. An analysis approach that incorporates protocol implementations without the need for RF emissions is necessary. In this research paper several emulation tools and custom extensions that enable an analysis platform to perform cyber security analysis of lower layer wireless networks is presented. A use case of a published exploit in the 802.11 (i.e., WiFi) protocol family is provided to demonstrate the effectiveness of the described emulation platform.

97 MATHEMATICS AND COMPUTING↗