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,783 records · Page 99

Detecting Dominant Motions in Dense Crowds

We discuss the problem of detecting dominant motions in dense crowds, a challenging and societally important problem. First, we survey the general literature of computer vision algorithms that deal with crowds of people, including model- and feature-based approaches to segmentation and tracking as well as algorithms that analyze general motion trends. Second, we present a system for automatically identifying dominant motions in a crowded scene. Accurately tracking individual objects in such scenes is difficult due to inter- and intra-object occlusions that cannot be easily resolved. Our approach begins by independently tracking low-level features using optical flow. While many of the feature point tracks are unreliable, we show that they can be clustered into smooth dominant motions using a distance measure for feature trajectories based on longest common subsequences. Results on real video sequences demonstrate that the approach can successfully identify both dominant and anomalous motions in crowded scenes. These fully-automatic algorithms could be easily incorporated into distributed camera networks for autonomous scene analysis.

99 GENERAL AND MISCELLANEOUS↗

Atypical Behavior Identification in Large Scale Network Traffic

Cyber analysts are faced with the daunting challenge of identifying exploits and threats within potentially billions of daily records of network traffic. Enterprise-wide cyber traffic involves hundreds of millions of distinct IP addresses and results in data sets ranging from terabytes to petabytes of raw data. Creating behavioral models and identifying trends based on those models requires data intensive architectures and techniques that can scale as data volume increases. Analysts need scalable visualization methods that foster interactive exploration of data and enable identification of behavioral anomalies. Developers must carefully consider application design, storage, processing, and display to provide usability and interactivity with large-scale data. We present an application that highlights atypical behavior in enterprise network flow records. This is accomplished by utilizing data intensive architectures to store the data, aggregation techniques to optimize data access, statistical techniques to characterize behavior, and a visual analytic environment to render the behavioral trends, highlight atypical activity, and allow for exploration.

99 GENERAL AND MISCELLANEOUS↗

Visual Data-Analytics of Large-Scale Parallel Discrete-Event Simulations

Parallel discrete-event simulation (PDES) is an important tool in the codesign of extreme-scale systems because PDES provides a cost-effective way to evaluate designs of highperformance computing systems. Optimistic synchronization algorithms for PDES, such as Time Warp, allow events to be processed without global synchronization among the processing elements. A rollback mechanism is provided when events are processed out of timestamp order. Although optimistic synchronization protocols enable the scalability of large-scale PDES, the performance of the simulations must be tuned to reduce the number of rollbacks and provide an improved simulation runtime. To enable efficient large-scale optimistic simulations, one has to gain insight into the factors that affect the rollback behavior and simulation performance. We developed a tool for ROSS model developers that gives them detailed metrics on the performance of their large-scale optimistic simulations at varying levels of simulation granularity. Model developers can use this information for parameter tuning of optimistic simulations in order to achieve better runtime and fewer rollbacks. In this work, we instrument the ROSS optimistic PDES framework to gather detailed statistics about the simulation engine. We have also developed an interactive visualization interface that uses the data collected by the ROSS instrumentation to understand the underlying behavior of the simulation engine. The interface connects real time to virtual time in the simulation and provides the ability to view simulation data at different granularities. We demonstrate the usefulness of our framework by performing a visual analysis of the dragonfly network topology model provided by the CODES simulation framework built on top of ROSS. The instrumentation needs to minimize overhead in order to accurately collect data about the simulation performance. To ensure that the instrumentation does not introduce unnecessary overhead, we perform a scaling study that compares instrumented ROSS simulations with their noninstrumented counterparts in order to determine the amount of perturbation when running at different simulation scales.

Ross, Caitlin↗

Security-Constrained Unit Commitment for Electricity Market: Modeling, Solution Methods, and Future Challenges

This paper summarizes the technical activities of the IEEE Task Force on Solving Large Scale Optimization Problems in Electricity Market and Power System Applications. This Task Force was established by the IEEE Technology and Innovation Subcommittee to first review the state-of-the-art of the security-constrained unit commitment (SCUC) business model, its mathematical formulation, and solution techniques in solving electricity market clearing problems. The Task Force then investigated the emerging challenges of future market clearing problems and presented efforts in building benchmark mathematical and business models.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The MeDICi Integration Framework: A Platform for High Performance Data Streaming Applications

Building high performance analytical applications for data streams generated from sensors is a challenging software engineering problem. Such applications typically comprise a complex pipeline of processing components that capture, transform and analyze the incoming data stream. In addition, applications must provide high throughput, be scalable, and easily modifiable so that new analytical components can be added with minimum effort. In this paper we describe the MeDICi Integration Framework (MIF), which is a middleware platform we have created to address these challenges. The MIF extends an open source messaging platform with a component-based API for integrating components into analytical pipelines. We describe the features and capabilities of the MIF, and show how it has been used to build a production analytical application for detecting cyber security attacks. The application was composed from multiple independently developed components using several different programming languages. The resulting application was able to process network sensor traffic in real time and provide insightful feedback to network analysts as soon as potential attacks were recognized.

99 GENERAL AND MISCELLANEOUS↗

The evolution of grain boundary energy in textured and untextured Ca–doped alumina during grain growth

The role of anisotropic grain boundary energy in grain growth is investigated using textured microstructures that contain a high proportion of special grain boundaries. Textured and untextured Ca–doped alumina was prepared by slip casting inside and outside a high magnetic field, respectively. At 1600°C, the textured microstructure exhibits faster growth than the untextured microstructure and its population of low–angle boundaries increases. Atomic force microscopy (AFM) is employed to measure the geometry of thermal grooves to assess the relative grain boundary energy of these systems before and after growth. In the textured microstructure, the grain boundary energy distribution narrows and shifts to a lower average energy. Conversely, the energy distribution broadens for the untextured microstructure as it grows and exhibits abnormal grain growth. Further analysis of the boundary networks neighboring abnormal grains reveals an energy incentive that facilitates their growth. These results suggest that coarsening is not the only dominant grain growth mechanism and that the system can lower its energy effectively by replacing high energy boundaries with those of low energy. The faster growth of lower energy boundaries suggests that isotropic simulations do not adequately account for anisotropic grain growth mechanisms or anisotropic mobility.

36 MATERIALS SCIENCE↗

IGCAPT

The IGCAPT allows electric utility personnel to perform a static analysis of their communications network supporting smart grid architectures from a network utilization and performance standpoint. IGCAPT is meant to be a "first order" planning tool - the tool will accommodate estimates and best available data alongside default settings, which the user can then improve over time.

Young, JeffreyM.↗

FLOWER IPv4/IPv6 Network Flow Summarization software

FLOWER was written as a refactoring/reimplementation of the existing Flo software used by the Cooperative Protection Program (CPP) to provide network flow summaries for analysis by the Operational Analysis Center (OAC) and other US Department of Energy cyber security elements. FLOWER is designed and tested to operate at 10 gigabits/second, nearly 10 times faster than competing solutions. FLOWER output is optimized for importation into SQL databases for categorization and analysis. FLOWER is written in C++ using current best software engineering practices.

Nickless, Bill↗

Code for Experiment in Publication “Sensitivity Analysis in the Presence of Intrinsic Stochasticity for Discrete Fracture Network Simulations”

Following the Open Research requirements for AGU journals, we must release the code used to perform the experiment described in our recent publication, posted at (https://arxiv.org/abs/2312.04722). This code fits a joint emulator to data from a Discrete Fracture Network (DFN) simulation, performed using the open-source software DFNworks (https://dfnworks.lanl.gov/). All code to be released implements existing methods; there are no novel algorithms nor any major innovations to existing software.

Murph, Alexander↗

Metabolic investigation of host/pathogen interaction using MS2-infected Escherichia coli

RNA viruses are responsible for a variety of illnesses among people, including but not limited to the common cold, the flu, HIV, and ebola. Developing new drugs and new strategies for treating diseases caused by these viruses can be an expensive and time-consuming process. Mathematical modeling may be used to elucidate host-pathogen interactions and highlight potential targets for drug development, as well providing the basis for optimizing patient treatment strategies. The purpose of this work was to determine whether a genome-scale modeling approach could be used to understand how metabolism is impacted by the host-pathogen interaction during a viral infection. Escherichia coli/MS2 was used as the host-pathogen model system as MS2 is easy to work with, harmless to humans, but shares many features with eukaryotic viruses. In addition, the genome-scale metabolic model of E. coli is the most comprehensive model at this time. Employing a metabolic modeling strategy known as "flux balance analysis" coupled with experimental studies, we were able to predict how viral infection would alter bacterial metabolism. Based on our simulations, we predicted that cell growth and biosynthesis of the cell wall would be halted. Furthermore, we predicted a substantial increase in metabolic activity of the pentose phosphate pathway as a means to enhance viral biosynthesis, while a break down in the citric acid cycle was predicted. Also, no changes were predicted in the glycolytic pathway. Through our approach, we have developed a technique of modeling virus-infected host metabolism and have investigated the metabolic effects of viral infection. These studies may provide insight into how to design better drugs. They also illustrate the potential of extending such metabolic analysis to higher order organisms, including humans.

59 BASIC BIOLOGICAL SCIENCES↗

Characterization of the Populus Rab family genes and the function of PtRabE1b in salt tolerance

Background: Rab proteins form the largest family of the Ras superfamily of small GTP-binding proteins and regulate intracellular trafficking pathways. However, the function of the Rab proteins in woody species is still an open question. Results: Here, a total of 67 PtRabs were identified in Populus trichocarpa and categorized into eight subfamilies (RabA-RabH). Based on their chromosomal distribution and duplication blocks in the Populus genome, a total of 27 PtRab paralogous pairs were identified and all of them were generated by whole-genome duplication events. Combined the expression correlation and duplication date, the PtRab paralogous pairs that still keeping highly similar expression patterns were generated around the latest large-scale duplication (~ 13 MYA). The cis-elements and co-expression network of unique expanded PtRabs suggest their potential roles in poplar development and environmental responses. Subcellular localization of PtRabs from each subfamily indicates each subfamily shows a localization pattern similar to what is revealed in Arabidopsis but RabC shows a localization different from their counterparts. Furthermore, we characterized PtRabE1b by overexpressing its constitutively active mutant PtRabE1b(Q74L) in poplar and found that PtRabE1b(Q74L) enhanced the salt tolerance. Conclusions: These findings provide new insights into the functional divergence of PtRabs and resources for genetic engineering resistant breeding in tree species.

54 ENVIRONMENTAL SCIENCES↗

A deep learning approach to real-time HIV outbreak detection using genetic data

Pathogen genomic sequence data are increasingly made available for epidemiological monitoring. A main interest is to identify and assess the potential of infectious disease outbreaks. While popular methods to analyze sequence data often involve phylogenetic tree inference, they are vulnerable to errors from recombination and impose a high computational cost, making it difficult to obtain real-time results when the number of sequences is in or above the thousands. Here, we propose an alternative strategy to outbreak detection using genomic data based on deep learning methods developed for image classification. The key idea is to use a pairwise genetic distance matrix calculated from viral sequences as an image, and develop convolutional neutral network (CNN) models to classify areas of the images that show signatures of active outbreak, leading to identification of subsets of sequences taken from an active outbreak. We showed that our method is efficient in finding HIV-1 outbreaks with R0 ≥ 2.5, and overall a specificity exceeding 98% and sensitivity better than 92%. We validated our approach using data from HIV-1 CRF01 in Europe, containing both endemic sequences and a well-known dual outbreak in intravenous drug users. Our model accurately identified known outbreak sequences in the background of slower spreading HIV. Importantly, we detected both outbreaks early on, before they were over, implying that had this method been applied in real-time as data became available, one would have been able to intervene and possibly prevent the extent of these outbreaks. This approach is scalable to processing hundreds of thousands of sequences, making it useful for current and future real-time epidemiological investigations, including public health monitoring using large databases and especially for rapid outbreak identification.

59 BASIC BIOLOGICAL SCIENCES↗

Evolution of DDB1-binding WD40 (DWD) in the viridiplantae

Damaged DNA Binding 1 (DDB1)—binding WD40 (DWD) proteins are highly conserved and involved in a plethora of developmental and physiological processes such as flowering time control, photomorphogenesis, and abiotic stress responses. The phylogeny of this family of proteins in plants and algae of viridiplante is a critical area to understand the emergence of this family in such important and diverse functions. We aimed to investigate the putative homologs of DWD in the viridiplante and establish a deeper DWD evolutionary grasp. The advancement in publicly available genomic data allowed us to perform an extensive genome-wide DWD retrieval. Using annotated Arabidopsis thaliana DWDs as the reference, we generated and characterized a comprehensive DWD database for the studied photoautotrophs. Further, a generic DWD classification system (Type A to K), based on (i) position of DWD motifs, (ii) number of DWD motifs, and (iii) presence/absence of other domains, was adopted. About 72–80% DWDs have one DWD motif, whereas 17–24% DWDs have two and 0.5–4.7% DWDs have three DWD motifs. Neighbor-joining phylogenetic construction of A. thaliana DWDs facilitated us to tune these substrate receptors into 15 groups. Though the DWD count increases from microalgae to higher land plants, the ratio of DWD to WD40 remained constant throughout the viridiplante. The DWD expansion appeared to be the consequence of consistent DWD genetic flow accompanied by several gene duplication events. The network, phylogenetic, and statistical analysis delineated DWD evolutionary relevance in the viridiplante.

59 BASIC BIOLOGICAL SCIENCES↗

Dynamic Path Scheduling through Extensions to Generalized Multiprotocol Label Switching (GMPLS) (Final Report)

The major accomplishments of the project are the successful software implementation of the Phase I scheduling algorithms for GMPLS Label Switched Paths (LSPs) and the extension of the IETF Path Computation Element (PCE) Protocol to support scheduling extensions. In performing this work, we have demonstrated the theoretical work of Phase I, analyzed key issues, and made relevant extensions. Regarding the software implementation, we developed a proof of concept prototype as part of our Algorithm Evaluation System (AES). This implementation uses the Linux operating system to provide software portability and will be the foundation for our commercial software. To demonstrate proof of concept, we have implemented LSP scheduling algorithms to support two of the key GMPLS switching technologies (Lambda and Packet) and support both Fixed Path (FP) and Switched Path (SP) routing. We chose Lambda and Packet because we felt it was essential to include both circuit and packet switching technologies as well as to address all-optical switching in the study. As conceptualized in Phase I, the FP algorithms use a traditional approach where the LSP uses the same physical path for the entire service duration while the innovative SP algorithms allow the physical path to vary during the service duration. As part of this study, we have used the AES to conduct a performance analysis using metro size networks (up to 32 nodes) that showed that these algorithms are suitable for commercial implementation. Our results showed that the CPU time required to compute an LSP schedule was small compared to expected inter-arrival time between LSP requests. Also, when the network size increased from 7 to 15 to 32 nodes with 10, 26, and 56 TE links, the CPU processing time showed excellent scaling properties. When Fixed Path and Switched Path routing were compared, SP provided only modestly better performance with respect to LSP completion rate, service duration, path length, and start time deviation. In addition, the SP routing required somewhat more CPU time than the FP routing. However, when the allowable range for the start time is increased, the CPU time for SP increased less rapidly than FP such that the CPU processing times became comparable. Therefore, SP routing may scale better than FP routing. The Path Computation Element Working Group is a complementary working group to the GMPLS working group (CCAMP) in the IETF and is developing standards to discover, manage, and access elements that compute routes for GMPLS for LSPs. The algorithms used to compute the routes are not subject to standardization. Since the PCE supports only standard GMPLS LSPs, it does not support scheduled LSPs. Therefore, it is a natural extension of our Phase I work to introduce this enhancement into the PCE. In addition, the PCE adds another dimension to our product line because the PCE by itself may be a product with a standard interface.

97 MATHEMATICS AND COMPUTING↗

Framework for Adaptable Operating and Runtime Systems (Final Project Report)

In this grant, we examined a wide range of techniques for constructing high-performance con gurable system software for HPC systems and its application to DOE-relevant problems. Overall, research and development on this project focused in three specifc areas: (1) software frameworks for constructing and deploying con gurable system software, (2) applcation of these frameworks to HPC-oriented adaptable networking software, (3) performance analysis of HPC system software to understand opportunities for performance optimization.

97 MATHEMATICS AND COMPUTING↗

Integrated network design and scheduling problems :

We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

Nurre, Sarah G.↗