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,081 records · Page 60

Sequence-Based Anomaly Detection in Critical Infrastructure Networks

United States critical infrastructure faces new cyber threats from adversarial nation-state actors in the form of malware-free attacks. Traditional cybersecurity techniques use rules-based methods to identify indicators of compromise on networks, often missing these sophisticated attacks. Our approach leverages multiple state of the art machine learning models in a pipeline to identify abnormal network events through sequential analysis. We combine both device and packet-level information into individual events to characterize anomalous network actions. The model is trained and tested on real network traffic from the Idaho National Lab High Performance Computing (HPC) with greater than 98% precision. It is capable of flagging malicious tactics used by adversaries in malware-free attacks, severe changes to the network, and abnormal user activity by network devices.

99 - GENERAL AND MISCELLANEOUS↗

Complexity analysis of pipeline mapping problems in distributed heterogeneous networks

Largescale scientific applications require using various system resources to execute complex computing pipelines in distributed networks to support collaborative research. System resources are typically shared in the Internet or over dedicated connections based on their location, availability, capability, and capacity. Optimizing the network performance of computing pipelines in such distributed environments is critical to the success of these applications. We consider two types of largescale distributed applications: (1) interactive applications where a single dataset is sequentially processed along a pipeline; and (2) streaming applications where a series of datasets continuously flow through a pipeline. The computing pipelines of these applications consist of a number of modules executed in a linear order in network environments with heterogeneous resources under different constraints. Our goal is to find an efficient mapping scheme that allocates the modules of a pipeline to network nodes for minimum endtoend delay or maximum frame rate. We formulate the pipeline mappings in distributed environments as optimization problems and categorize them into six classes with different optimization goals and mapping constraints: (1) Minimum Endtoend Delay with No Node Reuse (MEDNNR), (2) Minimum Endtoend Delay with Contiguous Node Reuse (MEDCNR), (3) Minimum Endtoend Delay with Arbitrary Node Reuse (MEDANR), (4) Maximum Frame Rate with No Node Reuse or Share (MFRNNRS), (5) Maximum Frame Rate with Contiguous Node Reuse and Share (MFRCNRS), and (6) Maximum Frame Rate with Arbitrary Node Reuse and Share (MFRANRS). Here, 'contiguous node reuse' means that multiple contiguous modules along the pipeline may run on the same node and 'arbitrary node reuse' imposes no restriction on node reuse. Note that in interactive applications, a node can be reused but its resource is not shared. We prove that MEDANR is polynomially solvable and the rest are NP-complete. MEDANR, where either contiguous or noncontiguous modules in the pipeline can be mapped onto the same node, is essentially the Maximum n-hop Shortest Path problem, and can be solved using a dynamic programming method. In MEDNNR and MFRNNRS, any network node can be used only once, which requires selecting the same number of nodes for onetoone onto mapping. We show its NP-completeness by reducing from the Hamiltonian Path problem. Node reuse is allowed in MEDCNR, MFRCNRS and MFRANRS, which are similar to the Maximum n-hop Shortest Path problem that considers resource sharing. We prove their NP-completeness by reducing from the Disjoint-Connecting-Path Problem and Widest path with the Linear Capacity Constraints problem, respectively.

99 GENERAL AND MISCELLANEOUS↗

Uncovering secondary metabolite evolution and biosynthesis using gene cluster networks and genetic dereplication

Abstract The increased interest in secondary metabolites (SMs) has driven a number of genome sequencing projects to elucidate their biosynthetic pathways. As a result, studies revealed that the number of secondary metabolite gene clusters (SMGCs) greatly outnumbers detected compounds, challenging current methods to dereplicate and categorize this amount of gene clusters on a larger scale. Here, we present an automated workflow for the genetic dereplication and analysis of secondary metabolism genes in fungi. Focusing on the secondary metabolite rich genus Aspergillus , we categorize SMGCs across genomes into SMGC families using network analysis. Our method elucidates the diversity and dynamics of secondary metabolism in section Nigri , showing that SMGC diversity within the section has the same magnitude as within the genus. Using our genome analysis we were able to predict the gene cluster responsible for biosynthesis of malformin, a potentiator of anti-cancer drugs, in 18 strains. To proof the general validity of our predictions, we developed genetic engineering tools in Aspergillus brasiliensis and subsequently verified the genes for biosynthesis of malformin.

59 BASIC BIOLOGICAL SCIENCES↗

AR-CITE: Analysis of Search Results for the Clarification and Identification of Technology Emergence

The Analysis of Search Results for the Clarification and Identification of Technology Emergence (AR-CITE) computer code examines a scientometric model that tracks the emergence of an identified technology from initial discovery (via original scientific and conference literature), through critical discoveries (via original scientific, conference literature and patents), transitioning through Technology Readiness Levels (TRLs) and ultimately on to commercial currency of citations, collaboration indicators, and on-line news patterns are identified. The combinations of four distinct and separate searchable on-line networked sources (i.e. scholarly publications and citation, world patents, news archives, and on-line mapping networks) are assembled to become one collective network (a dataset for analysis of relations). This established network becomes the basis from which to quickly analyze the temporal flow of activity (searchable events) for the subject domain to be clarified and identified.

Source record↗

Power Sharing-Based Framework for Allocating Automatic Generation Control in Distributed Energy Resources: Preprint

The recent proliferation of distributed energy resources (DERs) in the power network along with the retirement of conventional generators has made it challenging to regulate system frequency. In this paper, we present a centralized control framework to leverage the potential of DERs in the distribution network in provisioning secondary frequency control services to the grid. The proposed framework is based on network volt-watt sensitivity analysis and takes into account DER operational and network-imposed constraints to allocate the automatic generation control (AGC) request among the aggregated units. The proposed framework was implemented on the IEEE 8500-node test feeder and results were validated against a standard linear programming-based scheme. Numerical results indicate that the proposed framework can successfully utilize the available power production headroom of the network to meet the AGC request while maintaining nodal voltages within acceptable limits.

distributed energy resources↗

System and method for structural characterization of materials by supervised machine learning-based analysis of their spectra

A method of supervised machine learning-based spectrum analysis information, using a neural network trained with spectrum information, to identify a specified feature of a given material, a system for supervised machine learning-based spectrum analysis, and a method of training a neural network to analyze spectrum data. The method of supervised machine learning-base spectrum analysis comprises inputting into the neural network spectrum data obtained from a sample of the given material; and the neural network processing the spectrum data, in accordance with the training of the neural network, and outputting one or more values for the specified feature of the sample of the material. In an embodiment, the training set of data includes x-ray absorption spectroscopy data for the given material. In an embodiment, the training set of data includes electron energy loss spectra (EELS) data.

Frenkel, Anatoly↗

Phase identification using statistical analysis

A device includes at least one processor configured to determine, based on (i) a first plurality of time-varying electrical measurements corresponding to a feeder head of a power distribution network having a plurality of phases and (ii) a second plurality of time-varying electrical measurements corresponding to a node in the power distribution network, and using statistical analysis, a predicted phase, from the plurality of phases, that corresponds to the node. The processor may be configured to use ranked correlation coefficients (such as the Kendall rank correlation coefficient) to determine the predicted phase and may use principle component analysis. The processor is also configured to cause at least one device of the power distribution network to modify operation based at least on part on the predicted phase.

Veda, Santosh Sambamoorthy↗

Quantum Graph Analysis

In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neural Network Identification For a C5 Parallel Robot

This paper presents the design and analysis of a neural network-based identification of the inverse dynamic model of a C5 parallel robot. The identification structure is designed using the black box form (the dynamic model is completely unknown). This identification uses real data acquired on the C5 parallel robot by applying a nominal control scheme (PD). The desired trajectories of this scheme are based on Fourier series and the coefficients are chosen in a heuristic way. We have used this type of desired trajectories to obtain exciting trajectories for identification procedure. Three identification schemes are tested and compared. The comparison is performed based on the number of parameters used in each architecture and the quality of the generalization error. The used neural network is of MLP type and composed of one hidden layer.

42 ENGINEERING↗

A Transdisciplinary Review of Deep Learning Research and Its Relevance for Water Resources Scientists

Deep learning (DL), a new generation of artificial neural network research, has transformed industries, daily lives, and various scientific disciplines in recent years. DL represents significant progress in the ability of neural networks to automatically engineer problem-relevant features and capture highly complex data distributions. I argue that DL can help address several major new and old challenges facing research in water sciences such as interdisciplinarity, data discoverability, hydrologic scaling, equifinality, and needs for parameter regionalization. This review paper is intended to provide water resources scientists and hydrologists in particular with a simple technical overview, transdisciplinary progress update, and a source of inspiration about the relevance of DL to water. The review reveals that various physical and geoscientific disciplines have utilized DL to address data challenges, improve efficiency, and gain scientific insights. DL is especially suited for information extraction from image-like data and sequential data. Techniques and experiences presented in other disciplines are of high relevance to water research. Meanwhile, less noticed is that DL may also serve as a scientific exploratory tool. A new area termed AI neuroscience , where scientists interpret the decision process of deep networks and derive insights, has been born. This budding subdiscipline has demonstrated methods including correlation-based analysis, inversion of network-extracted features, reduced-order approximations by interpretable models, and attribution of network decisions to inputs. Moreover, DL can also use data to condition neurons that mimic problem-specific fundamental organizing units, thus revealing emergent behaviors of these units. Vast opportunities exist for DL to propel advances in water sciences.

54 ENVIRONMENTAL SCIENCES↗

An analysis of image storage systems for scalable training of deep neural networks

This study presents a principled empirical evaluation of image storage systems for training deep neural networks. We employ the Caffe deep learning framework to train neural network models for three different data sets, MNIST, CIFAR-10, and ImageNet. While training the models, we evaluate five different options to retrieve training image data: (1) PNG-formatted image files on local file system; (2) pushing pixel arrays from image files into a single HDF5 file on local file system; (3) in-memory arrays to hold the pixel arrays in Python and C++; (4) loading the training data into LevelDB, a log-structured merge tree based key-value storage; and (5) loading the training data into LMDB, a B+tree based key-value storage. The experimental results quantitatively highlight the disadvantage of using normal image files on local file systems to train deep neural networks and demonstrate reliable performance with key-value storage based storage systems. When training a model on the ImageNet dataset, the image file option was more than 17 times slower than the key-value storage option. Along with measurements on training time, this study provides in-depth analysis on the cause of performance advantages/disadvantages of each back-end to train deep neural networks. We envision the provided measurements and analysis will shed light on the optimal way to architect systems for training neural networks in a scalable manner.

Lim, Seung-Hwan↗

Retina Image Analysis and Ocular Telehealth: The Oak Ridge National Laboratory-Hamilton Eye Institute Case Study

Automated retina image analysis has reached a high level of maturity in recent years, and thus the question of how validation is performed in these systems is beginning to grow in importance. One application of retina image analysis is in telemedicine, where an automated system could enable the automated detection of diabetic retinopathy and other eye diseases as a low-cost method for broad-based screening. In this work we discuss our experiences in developing a telemedical network for retina image analysis, including our progression from a manual diagnosis network to a more fully automated one. We pay special attention to how validations of our algorithm steps are performed, both using data from the telemedicine network and other public databases.

Karnowski, Thomas↗

Quantifying the impact of microgrid location and behavior on transmission network congestion

This work presents a preliminary analysis considering impact of a grid-connected microgrid on network transmission of the power system. The locational marginal prices of the power system are used to strategically place the microgrid to avoid congestion problems. In addition, a Monte Carlo simulation approach is implemented to confirm that network congestion can be attenuated if appropriate price-based signals are set to define the import and export dynamic between the two systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

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↗