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,189 records · Page 66

Automating Log Synthesis and Visualization with Python and Splunk

The goal of this project is to automate log analysis by utilizing Splunk, Bash, and Python together. Simplifying the monitoring and analysis of network traffic was the main goal. In order to accomplish this, a Bash script was created to use 'tcpdump' to automate network sniffing. It also included a 24-hour file rotation mechanism to effectively manage the pcap files that were generated. After that, a Python script was written to read these pcap files and retrieve pertinent data about network traffic. After processing the collected data, Splunk is used to summarize the important metrics and visualize said information with relevant graphs.

99 GENERAL AND MISCELLANEOUS↗

Comparative Analysis of HEATNETS for Geothermal Network Performance: Preprint

Thermal energy networks (TENs), also known as 5th generation district energy systems, or more specifically geothermal networks when exchanging heat with geothermal boreholes, are an important technology for decarbonization. In these networks an ambient loop connects buildings and thermal sources, such as a borehole field, to exchange energy and maintain a desired loop temperature. Water-source heat pumps are used at the buildings to connect to the ambient or thermal loop to meet to the building heating and cooling loads and maintain comfort. A semi-transient, reduced-order technical model and techno-economic model, called HEATNETS, has been developed at NREL that captures the flow of energy around a TEN. In this work, a comparison of the HEATNETS technical model and a well-known coding platform used for modeling geothermal networks, TRNSYS, has been completed for a proposed geothermal network as a verification process. Hourly data provided from the TRNSYS simulation included building loads, pumping power, heat pump power, temperature entering and leaving the borehole field, and mass flow rates. The hourly borehole temperatures were used to create a linear regression model utilized in HEATNETS to estimate the borehole field heat exchange. The building loads and mass flow rates were direct inputs to HEATNETS while the pumping power, heat pump power, borehole temperatures, and coefficients of performance were all simulated and calculated by HEATNETS, allowing for direct comparison of the thermal energy transfer, rather than also comparing control systems responses. HEATNETS considers the full process from design inputs to economic outputs and can provide modeling options for high-level initial system design and operational optimization. This study shows that HEATNETS, while not intended to replace other modeling tools, can be a unique modeling tool for the performance of a full geothermal network system.

15 GEOTHERMAL ENERGY↗

Evaluating Security Controls Based on Key Performance Indicators and Stakeholder Mission

Good security metrics are required to make good decisions about how to design security countermeasures, to choose between alternative security architectures, and to improve security during operations. Therefore, in essence, measurement can be viewed as a decision aid. The lack of sound practical security metrics is severely hampering progress in the development of secure systems. The Cyberspace Security Econometrics System (CSES) offers the following advantages over traditional measurement systems: (1) CSES reflects the variances that exist amongst different stakeholders of the same system. Different stakeholders will typically attach different stakes to the same requirement or service (e.g., a service may be provided by an information technology system or process control system, etc.). (2) For a given stakeholder, CSES reflects the variance that may exist among the stakes she/he attaches to meeting each requirement. The same stakeholder may attach different stakes to satisfying different requirements within the overall system specification. (3) For a given compound specification (e.g., combination(s) of commercial off the shelf software and/or hardware), CSES reflects the variance that may exist amongst the levels of verification and validation (i.e., certification) performed on components of the specification. The certification activity may produce higher levels of assurance across different components of the specification than others. Consequently, this paper introduces the basis, objectives and capabilities for the CSES including inputs/outputs and the basic structural and mathematical underpinnings.

97 MATHEMATICS AND COMPUTING↗

GPU-based Real-Time Execution of Vehicular Mobility Models in Large-Scale Road Network Scenarios

A methodology and its associated algorithms are presented for mapping a novel, field-based vehicular mobility model onto graphical processing unit computational platform for simulating mobility in large-scale road networks. Of particular focus is the achievement of real-time execution, on desktop platforms, of vehicular mobility on road networks comprised of millions of nodes and links, and multi-million counts of simultaneously active vehicles. The methodology is realized in a system called GARFIELD, whose implementation details and performance study are described. The runtime characteristics of a prototype implementation are presented that show real-time performance in simulations of networks at the scale of a few states of the US road networks.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

An evidential path logic for multi-relational networks

Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Description Framework (RDF). One of the primary purposes of a knowledge network is to reason; that is, to alter the topology of the network according to an algorithm that uses the existing topological structure as its input. There exist many such reasoning algorithms. With respect to the Semantic Web, the bivalent, axiomatic reasoners of the RDF Schema (RDFS) and the Web Ontology Language (OWL) are the most prevalent. However, nothing prevents other forms of reasoning from existing in the Semantic Web. This article presents a non-bivalent, non-axiomatic, evidential logic and reasoner that is an algebraic ring over a multi-relational network and two binary operations that can be composed to perform various forms of inference. Given its multi-relational grounding, it is possible to use the presented evidential framework as another method for structuring knowledge and reasoning in the Semantic Web. The benefits of this framework are that it works with arbitrary, partial, and contradictory knowledge while, at the same time, supporting a tractable approximate reasoning process.

99 GENERAL AND MISCELLANEOUS↗

THREAT ANTICIPATION AND DECEPTIVE REASONING USING BAYESIAN BELIEF NETWORKS

Recent events highlight the need for tools to anticipate threats posed by terrorists. Assessing these threats requires combining information from disparate data sources such as analytic models, simulations, historical data, sensor networks, and user judgments. These disparate data can be combined in a coherent, analytically defensible, and understandable manner using a Bayesian belief network (BBN). In this paper, we develop a BBN threat anticipatory model based on a deceptive reasoning algorithm using a network engineering process that treats the probability distributions of the BBN nodes within the broader context of the system development process.

97 MATHEMATICS AND COMPUTING↗

Robopedia: Leveraging Sensorpedia for Web-Enabled Robot Control

There is a growing interest in building Internetscale sensor networks that integrate sensors from around the world into a single unified system. In contrast, robotics application development has primarily focused on building specialized systems. These specialized systems take scalability and reliability into consideration, but generally neglect exploring the key components required to build a large scale system. Integrating robotic applications with Internet-scale sensor networks will unify specialized robotics applications and provide answers to large scale implementation concerns. We focus on utilizing Internet-scale sensor network technology to construct a framework for unifying robotic systems. Our framework web-enables a surveillance robot s sensor observations and provides a webinterface to the robot s actuators. This lets robots seamlessly integrate into web applications. In addition, the framework eliminates most prerequisite robotics knowledge, allowing for the creation of general web-based robotics applications. The framework also provides mechanisms to create applications that can interface with any robot. Frameworks such as this one are key to solving large scale mobile robotics implementation problems. We provide an overview of previous Internetscale sensor networks, Sensorpedia (an ad-hoc Internet-scale sensor network), our framework for integrating robots with Sensorpedia, two applications which illustrate our frameworks ability to support general web-based robotic control, and offer experimental results that illustrate our framework s scalability, feasibility, and resource requirements.

42 ENGINEERING↗

Cyber-Physical Trade-Offs in Distributed Detection Networks

We consider a network of sensors that measure the scalar intensity due to the background or a source combined with background, inside a two-dimensional monitoring area. The sensor measurements may be random due to the underlying nature of the source and background or due to sensor errors or both. The detection problem is infer the presence of a source of unknown intensity and location based on sensor measurements. In the conventional approach, detection decisions are made at the individual sensors, which are then combined at the fusion center, for example using the majority rule. With increased communication and computation costs, we show that a more complex fusion algorithm based on measurements achieves better detection performance under smooth and non-smooth source intensity functions, Lipschitz conditions on probability ratios and a minimum packing number for the state-space. We show that these conditions for trade-offs between the cyber costs and physical detection performance are applicable for two detection problems: (i) point radiation sources amidst background radiation, and (ii) sources and background with Gaussian distributions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Localization Leads to Improved Distributed Detection Under Non-Smooth Distributions

We consider a detection network of sensors that measure intensity levels due to a source amidst background inside a two-dimensional monitoring area. The source intensity decays away from it possibly in discrete jumps, and the corresponding sensor measurements could be random due to the nature of source and background, or due to sensor errors, or both. The detection problem is to infer the presence of a source based on sensor measurements. In the conventional decision/detection fusion approach, detection decisions are made at the individual sensors using Sequential Probability Ratio Test (SPRT), and are combined at the fusion center using a Boolean fusion rule. We show that better detection can be achieved by utilizing sensor measurements at the fusion center, by first localizing the source and then utilizing a more effective SPRT. This approach leads to the detection performance superior to any Boolean detection fuser, under fairly general conditions: (i) smooth and non-smooth source intensity functions and probability ratios, and (ii) a minimum packing number of the state-space. We apply this method to improve the detection of (a) low-level point radiation sources amidst background radiation under strong shielding conditions, and (b) the well-studied Gaussian source amidst Gaussian background.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Toward higher-radix switches with co-packaged optics for improved network locality in data center and HPC networks [Invited]

In this work, we study the network locality improvements that can be achieved by using co-packaged optics in data center and high-performance computing (HPC) networks. The increased escape bandwidth offered by co-packaged optics can enable switches with speeds of 51.2 Tb/s and beyond. From a network architecture perspective, the key advantages of introducing co-packaged optics at the switch points include the implementation of large-scale topologies of >12,000 end points with 4× higher bisection bandwidth and the reduction of the required number of switches by >40% compared with state-of-the-art approaches. From a network operation perspective, improved network locality and faster operation can be achieved since the higher-radix switches can mitigate the impact of network contention. Placing applications under fewer leaf switches reduces the number of packets that cross the spine switches in a leaf-spine topology. The proposed scheme is evaluated via discrete-event simulations: we initially evaluate the network locality properties of the system by using virtual-machine traces from a production data center, and we subsequently quantify the performance improvements by simulating an all-to-all pattern for a variety of message sizes over a number of nodes. The results suggest that co-packaged optics form a promising solution for keeping up with bandwidth scaling in future networks. The virtual-machine analysis shows that large-scale applications can be placed under up to 50% fewer first-level switches, while the network analysis shows speedups of up to 7.1, which translates to execution time reductions of up to 26% and 42.7% for applications with communication ratios of 0.3 and 0.5, respectively.

99 GENERAL AND MISCELLANEOUS↗

Analysis of telescope site selection for optical Deep Space Network.

In this paper, therefore, we present an analysis of site selection for an optical deep space network as performed by the ODSN study group at JPL. Given a set of mission requirements, we illustrate how the high-level requirements, along with the properties of the atmospheric channel, can be used to determine the site selection and the architecture of an ODSN. Moreover, we characterize candidate sites for a global optical network and their possible suitability for global architectures such as the linear dispersed optical subnet (LDOS) and cluster optical subnet network (COS).

Cesarone, Robert↗

A Framework of Hyperspectral Image Compression using Neural Networks

Hyperspectral image analysis has gained considerable attention due to its wide range of applications. Hyperspectral images provide a vast amount of information about underlying objects in an image by using a large range of the electromagnetic spectrum for each pixel. However, since the same image is taken multiple times using distinct electromagnetic bands, the size of such images tend to be significant, which leads to greater processing requirements. The aim of this paper is to present a proposed framework for image compression and to study the possible effects of spatial compression on quality of unmixing results. Image compression allows us to reduce the dimensionality of an image while still preserving most of the original information, which could lead to faster image processing. This paper presents preliminary results of different training techniques used in Artificial Neural Network (ANN) based compression algorithm.

97 MATHEMATICS AND COMPUTING↗

The Delplot kinetic method applied to systems with adsorbates: Hydrodeoxygenation of benzofuran on a bimetallic CoPd phosphide catalyst supported on KUSY

The Delplot method provides a means of analyzing conversion and selectivity data to derive a reaction sequence and has been applied so far to gas-phase or liquid-phase species. This study analyses the applicability of the method for catalytic reactions and considers for the first time adsorbed intermediates. The method is applied to a contact time study of the hydrodeoxygenation (HDO) of benzofuran at 0.5 MPa and 350 °C over a catalyst consisting of bimetallic CoPd phosphide supported on a potassium ion-exchanged ultra-stable Y (KUSY) zeolite. Both simple and detailed reaction networks were derived. The simple networks considered only gas-phase species and were modeled by a first-order sequence of steps, whereas the detailed network took into account adsorbed intermediates and was simulated using a rake mechanism. The networks were compared using F-statistics, which accounted for the differences in the number of fitting parameters. The detailed network gave a better fit to the experimental data because it represented a more realistic description of the transformation. A suggested sequence from the Delplot method was consistent with the simple network but not with the detailed network. The lack of applicability of the Delplot analysis to the network with adsorbates was linked to overly large equilibrium constants, a determination supported by Delplot fitting for a model sequence. Further, this study indicated the inapplicability of the Delplot method in determining reaction sequences that involve adsorbed species with large equilibrium constants for formation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Network interface unit design options performance analysis

An analysis is presented of three design options for the Space Station Freedom (SSF) onboard Data Management System (DMS) Network Interface Unit (NIU). The NIU provides the interface from the Fiber Distributed Data Interface (FDDI) local area network (LAN) to the DMS processing elements. The FDDI LAN provides the primary means for command and control and low and medium rate telemetry data transfers on board the SSF. The results of this analysis provide the basis for the implementation of the NIU.

Miller, Frank W.↗

Quantitative Analysis of the Drosophila Segmentation Regulatory Network Using Pattern Generating Potentials

Cis-regulatory modules that drive precise spatial-temporal patterns of gene expression are central to the process of metazoan development. We describe a new computational strategy to annotate genomic sequences based on their ‘‘pattern generating potential’’ and to produce quantitative descriptions of transcriptional regulatory networks at the level of individual protein-module interactions. We use this approach to convert the qualitative understanding of interactions that regulate Drosophila segmentation into a network model in which a confidence value is associated with each transcription factor-module interaction. Sequence information from multiple Drosophila species is integrated with transcription factor binding specificities to determine conserved binding site frequencies across the genome. These binding site profiles are combined with transcription factor expression information to create a model to predict module activity patterns. This model is used to scan genomic sequences for the potential to generate all or part of the expression pattern of a nearby gene, obtained from available gene expression databases. Interactions between individual transcription factors and modules are inferred by a statistical method to quantify a factor’s contribution to the module’s pattern generating potential. We use these pattern generating potentials to systematically describe the location and function of known and novel cis-regulatory modules in the segmentation network, identifying many examples of modules predicted to have overlapping expression activities. Surprisingly, conserved transcription factor binding site frequencies were as effective as experimental measurements of occupancy in predicting module expression patterns or factor-module interactions. Thus, unlike previous module prediction methods, this method predicts not only the location of modules but also their spatial activity pattern and the factors that directly determine this pattern. As databases of transcription factor specificities and in vivo gene expression patterns grow, analysis of pattern generating potentials provides a general method to decode transcriptional regulatory sequences and networks.

59 BASIC BIOLOGICAL SCIENCES↗