Simulated, Emulated, and Physical Investigative Analysis (SEPIA) of networked systems.
Abstract not provided.
SEARCH · Engineering Papers
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.
Abstract not provided.
Smart inverters (SI) have huge potential in providing grid services which has not been fully realized yet. One of these grid services, distribution network voltage regulation by SI, can improve the network voltage by regulating the SI reactive and active power output. Voltage regulation by SI is much faster compared to traditional voltage regulating devices, e.g. tap changing transformer, capacitor banks. However, there is gap in available published literature on the characteristics of SIs when the SI is controlled by local controller or external control signal. This paper presents the experimental study to characterize SI reactive power regulation response to two different control methods: autonomous control method and remote dispatch method. It was found that IS reactive power regulation response could be significantly different in terms of delay, and ramp rate for these two methods. Finally, Power-Hardware-in-The-Loop (PHIL) tests were conducted to evaluate the performance of these two methods. The PHIL tests results show that SI response characteristics for autonomous control method and remote dispatch method need to be considered during planning for distribution network voltage regulation using SI.
We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.
The importance of interdisciplinary research is ever increasing as challenging world problems require expertise across diverse fields. Despite the apparent conceptual boundaries of scientific fields, a formal description for their evolution is lacking. Here we describe a novel approach to study the dynamics and evolution of scientific ideas and fields using a network-based analysis. We build a idea network consisting of American Physical Society Pacs numbers as nodes representing scientific concepts. Two Pacs numbers are linked in the network if there exist publications that reference them simultaneously. We locate scientific fields using an overlapping community finding algorithm and describe the time evolution of these fields using a community evolution method over the course of 1985-2006. We find that the communities we find map to scientific fields, the lifetime of these fields strongly depends on their size, impact and activity, and longest living communities are least volatile. The described approach to quantify the evolution of ideas is expected to be relevant in making predictions about the future of science and how to guide its development.
This paper presents a final report on Wavelet and Multiresolution Analysis for Finite Element Networking Paradigms. The focus of this research is to derive and implement: 1) Wavelet based methodologies for the compression, transmission, decoding, and visualization of three dimensional finite element geometry and simulation data in a network environment; 2) methodologies for interactive algorithm monitoring and tracking in computational mechanics; and 3) Methodologies for interactive algorithm steering for the acceleration of large scale finite element simulations. Also included in this report are appendices describing the derivation of wavelet based Particle Image Velocity algorithms and reduced order input-output models for nonlinear systems by utilizing wavelet approximations.
One of the core tasks of the emerging discipline of systems biology is the reconstruction of the various biological networks in an organism. The importance of understanding such regulatory, interaction, and signaling networks has fueled the development by bioinformatics researchers of many inference algorithms for determining their structure. The Software Environment for BIological Network Inference (SEBINI) has been created to provide an interactive environment for the deployment, testing, and improvement of algorithms used to reconstruct the structures of regulatory and interaction networks from high-throughput expression data. Networks inferred from the SEBINI software platform can be further analyzed using the Collective Analysis of Biological Interaction Networks (CABIN) tool, a software package for exploratory data analysis that allows basic integration and analysis of protein-protein interaction and gene-to-gene regulatory evidence obtained from multiple sources. Thus, the combined SEBINI–CABIN platform aids in the more accurate determination of biological networks, in less time, with less effort. In this paper, we present a case study demonstrating the use of the SEBINI and CABIN tools for protein-protein interaction network reconstruction. Incorporating the Bayesian Estimator of Protein-Protein Association Probabilities (BEPro) algorithm into the SEBINI toolkit, we have created a pipeline for structural inference and supplemental analysis of protein-protein interaction networks from sets of mass spectrometry bait-prey experiment data. To the best of our knowledge the pipeline so designed is the first to be publicly available for such use. A demonstration web site for SEBINI can be accessed from https://www.emsl.pnl.gov/NIT/NIT.html. Source code and PostgreSQL database schema are available under open source license. Contact: ronald.taylor@pnl.gov. For commercial use, some algorithms included in SEBINI require licensing from the original developers. The BEPro algorithm is available under GNU license within SEBINI and separately at http://www.pnl.gov/statistics/BEPro3/index.htm. Contact: ds.daly@pnl.gov. CABIN can be accessed from SEBINI or downloaded separately from www.sysbio.org/dataresources/cabin.stm. Contact: mudita.singhal@pnl.gov.
Explore the source record for details and available documents.
Report presents analysis of nested neural networks, consisting of interconnected subnetworks. Analysis based on simplified mathematical models more appropriate for artificial electronic neural networks, partly applicable to biological neural networks. Nested structure allows for retrieval of individual subpatterns. Requires fewer wires and connection devices than fully connected networks, and allows for local reconstruction of damaged subnetworks without rewiring entire network.
Network traffic analysis can reveal a lot about what's right or wrong with a network's cybersecurity footing. Using Malcolm, a powerful open-source network traffic analysis tool suite for network security monitoring, cyber analysts and asset owners can validate cybersecurity best practices and uncover red flags in network configuration, including: proper network segmentation east-west (cross-segment) and north-south traffic unsecure or outdated network protocols authentication using clear text credentials rogue devices and services unexpected protocols (e.g., IPv6, DNS, DHCP, update checks, etc.) suspicious file transfers
Explore the source record for details and available documents.
Parameters determined from the analysis of data from a global GPS network, specifically satellite parameters, can be held fixed in the analysis of data from regional GPS networks.
We present a reformulation of modularity that allows the analysis of the community structure in networks of correlated data. The new modularity preserves the probabilistic semantics of the original definition even when the network is directed, weighted, signed, and has self-loops. This is the most general condition one can find in the study of any network, in particular those defined from correlated data. We apply our results to a real network of correlated data between stores in the city of Lyon (France).
This paper presents an extension of a numerical algorithm for network flow analysis code to perform multi-dimensional flow calculation. The one dimensional momentum equation in network flow analysis code has been extended to include momentum transport due to shear stress and transverse component of velocity. Both laminar and turbulent flows are considered. Turbulence is represented by Prandtl's mixing length hypothesis. Three classical examples (Poiseuille flow, Couette flow, and shear driven flow in a rectangular cavity) are presented as benchmark for the verification of the numerical scheme.
This paper presents an extension of a numerical algorithm for network flow analysis code to perform multi-dimensional flow calculation. The one dimensional momentum equation in network flow analysis code has been extended to include momentum transport due to shear stress and transverse component of velocity. Both laminar and turbulent flows are considered. Turbulence is represented by Prandtl's mixing length hypothesis. Three classical examples (Poiseuille flow, Couette flow and shear driven flow in a rectangular cavity) are presented as benchmark for the verification of the numerical scheme.
Despite the apparent conceptual boundaries of scientific fields, a formal description for their evolution is lacking. Here we describe a novel approach to study the dynamics and evolution of scientific fields using a network-based analysis. We build an idea network consisting of American Physical Society PACS numbers as nodes representing scientific concepts. Two PACS numbers are linked if there exist publications that reference them simultaneously. We locate scientific fields using Cfinder, an overlapping community finding algorithm, and describe the time evolution of these fields using a community evolution method over the course of 1985-2006. The communities we identify map to known scientific fields, and their age strongly depends on t.heir size, impact and activity. Our analysis further suggests that communities that redefine themselves by merging and creating new groups of ideas tend to have more fitness as measured by the impact per paper, and hence communities with a higher fitness tend to be short-lived. The described approach to quantify the evolution of ideas may be relevant in making predictions about the future of science and how to guide its development.
Netmeter software reads a data stream from up to 250 networked phasemeters, synchronizes the data, saves the reduced data to disk (after applying a low-pass filter), and provides a Web server interface for remote control. Unlike older phasemeter software that requires a special, real-time operating system, this program can run on any general-purpose computer. It needs about five percent of the CPU (central processing unit) to process 20 channels because it adds built-in data logging and network-based GUIs (graphical user interfaces) that are implemented in Scalable Vector Graphics (SVG). Netmeter runs on Linux and Windows. It displays the instantaneous displacements measured by several phasemeters at a user-selectable rate, up to 1 kHz. The program monitors the measure and reference channel frequencies. For ease of use, levels of status in Netmeter are color coded: green for normal operation, yellow for network errors, and red for optical misalignment problems. Netmeter includes user-selectable filters up to 4 k samples, and user-selectable averaging windows (after filtering). Before filtering, the program saves raw data to disk using a burst-write technique.