Multi-species Identification of Polymorphic Peptide Variants via Propagation in Spectral Networks
Not Available
Na, Seungjin↗
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.
GNET2: an R package for constructing gene regulatory networks from transcriptomic data
Abstract Motivation The Gene Network Estimation Tool (GNET) is designed to build gene regulatory networks (GRNs) from transcriptomic gene expression data with a probabilistic graphical model. The data preprocessing, model construction and visualization modules of the original GNET software were developed on different programming platforms, which were inconvenient for users to deploy and use. Results Here, we present GNET2, an improved implementation of GNET as an integrated R package. GNET2 provides more flexibility for parameter initialization and regulatory module construction based on the core iterative modeling process of the original algorithm. The data exchange interface of GNET2 is handled within an R session automatically. Given the growing demand for regulatory network reconstruction from transcriptomic data, GNET2 offers a convenient option for GRN inference on large datasets. Availability and implementation The source code of GNET2 is available at https://github.com/jianlin-cheng/GNET2. Supplementary information Supplementary data are available at Bioinformatics online.
59 BASIC BIOLOGICAL SCIENCES↗
Network portal: a database for storage, analysis and visualization of biological networks
The ease of generating high-throughput data has enabled investigations into organismal complexity at the systems level through the inference of networks of interactions among the various cellular components (genes, RNAs, proteins and metabolites). The wider scientific community, however, currently has limited access to tools for network inference, visualization and analysis because these tasks often require advanced computational knowledge and expensive computing resources. We have designed the network portal (http://networks.systemsbiology.net) to serve as a modular database for the integration of user uploaded and public data, with inference algorithms and tools for the storage, visualization and analysis of biological networks. The portal is fully integrated into the Gaggle framework to seamlessly exchange data with desktop and web applications and to allow the user to create, save and modify workspaces, and it includes social networking capabilities for collaborative projects. While the current release of the database contains networks for 13 prokaryotic organisms from diverse phylogenetic clades (4678 co-regulated gene modules, 3466 regulators and 9291 cis-regulatory motifs), it will be rapidly populated with prokaryotic and eukaryotic organisms as relevant data become available in public repositories and through user input. The modular architecture, simple data formats and open API support community development of the portal.
59 BASIC BIOLOGICAL SCIENCES↗
Quantum-inspired weight-constrained neural network: Reducing variable numbers by 100× compared to standard neural networks
Although quantum machine learning has shown great promise, the practical application of quantum computers remains constrained in the noisy intermediate-scale quantum era. To take advantage of quantum machine learning, we investigate the underlying mathematical principles of these quantum models and find that the quantum neural network with amplitude encoding is equivalent to a weight-constrained neural network. Motivated by this discovery, we develop a classical weight-constrained neural network. We find that this approach can reduce the number of variables in a classical neural network by a factor of 135 while preserving its accuracy. In addition, we develop a dropout method to enhance the robustness of quantum machine learning models, which are highly susceptible to adversarial attacks. This technique can also be applied to improve the adversarial robustness of the classical weight-constrained neural network, which is essential for industry applications, such as self-driving vehicles. Our work offers an approach to reduce the complexity of large classical neural networks, addressing a critical challenge in machine learning.
quantum algorithms & computation↗
Interpretable Models for Workflow Differentiation in High-Performance Scientific Networks
Scientific workflows in high-performance networks spawn hundreds of interdependent flows that must be managed collectively—yet existing network classifiers treat each flow in isolation, leading to fragmented QoS decisions and missed interflow patterns. We present a novel traffic classification solution that operates at the workflow level, distinguishing entire filetransfer operations from streaming analytics by capturing how concurrent flows interact and burst together. We introduce a workflow identification window (WIW) that ingests raw packet headers from parallel flows into unified tensors, preserving the spatial-temporal patterns that differentiate scientific workflows. This approach achieves 98.7% accuracy using CNN, LSTM, and hybrid architectures, while maintaining 84% accuracy on production traffic collected a week later—demonstrating robustness to temporal drift. By integrating SHAP and GradCAM explainability, we reveal that early-packet timing patterns and cross-flow correlations drive classification decisions, providing operators with interpretable insights. Our system enables coherent workflow-level QoS enforcement and dynamic bandwidth allocation in scientific networks, eliminating manual per-flow configuration while maintaining classification latency at millisecond level.
Giannakou, Anna [LBL, Berkeley]↗
Hyperparameter Optimization in Binary Communication Networks for Neuromorphic Deployment
Training neural networks for neuromorphic deployment is non-trivial. There have been a variety of approaches proposed to adapt back-propagation or back-propagation-like algorithms appropriate for training. Considering that these networks often have very different performance characteristics than traditional neural networks, it is often unclear how to set either the network topology or the hyperparameters to achieve optimal performance. In this work, we introduce a Bayesian approach for optimizing the hyperparameters of an algorithm for training binary communication networks that can be deployed to neuromorphic hardware. We show that by optimizing the hyperparameters on this algorithm for each dataset, we can achieve improvements in accuracy over the previous state-of-the-art for this algorithm on each dataset (by up to 15 percent). This jump in performance continues to emphasize the potential when converting traditional neural networks to binary communication applicable to neuromorphic hardware.
Parsa, Maryam↗
Networked-based Cyber Analysis using Deep Packet Inspection (DPI) for High-Speed Networks
Today’s networked systems utilize advanced security components such as Next Generation Firewall (NGFW), Intrusion Detection Systems (IDS), Intrusion Prevention Systems (IPS), and methods for network traffic classification. A fundamental aspect of these security components and methods is network packet visibility and packet inspection. To achieve packet visibility, a compute mechanism used by these security components and methods is Deep Packet Inspection (DPI). DPI is used to obtain visibility into packet fields by looking deeper inside packets, beyond just IP address, port, and protocol. However, DPI is considered extremely expensive in terms of compute processing costs and very challenging to implement on high speed network systems. The fundamental scientific paradigm addressed in this research project is the application of greater network packet visibility and packet inspection at data rates greater than 40Gbps to secure computer network systems. The greater visibility and inspection will enable detection of advanced content-based threats that exploit application vulnerabilities and are designed to bypass traditional security approaches such as firewalls and antivirus scanners. Greater visibility and inspection are achieved through identification of the application protocol (e.g., HTTP, SMTP, Skype) and, in some cases, extraction and processing of the information contained in the packet payload. Analysis is then performed on the resulting DPI data to identify potentially malicious behavior. In order to obtain visibility and inspect the application protocol and contents at high speed data rates, advanced DPI technologies and implementations are developed.
97 MATHEMATICS AND COMPUTING↗
Data-Driven Chance-Constrained Design of Voltage Droop Control for Distribution Networks: Preprint
This paper addresses the design of local control methods for voltage control in distribution networks with high level of distributed energy resources (DERs). The designed control methods adapt the active and reactive power output of distributed energy resources proportional to the deviation of the local measured voltage magnitudes from a reference voltage, which is referred to as droop control. Thus, the design focuses on determining the droop characteristics which satisfy network-wide voltage magnitude constraints. The uncertainty and variability of DERs renders the design of optimal droop controls very challenging. Hence, this paper proposes chance constraints to limit the risk from intermittent DERs, by designing droop control coefficients that guarantee the satisfaction of network operational constraints with a specific probability. In addition, the proposed approach relies entirely on historical data rather than assuming knowledge of the probability distributions that characterize the uncertainty of DERs. The efficacy of the proposed method is demonstrated on a 37-bus distribution feeder.
chance-constrained optimization↗
Network design for quantifying urban CO<sub>2</sub> emissions: assessing trade-offs between precision and network density
The majority of anthropogenic CO 2 emissions are attributable to urban areas. While the emissions from urban electricity generation often occur in locations remote from consumption, many of the other emissions occur within the city limits. Evaluating the effectiveness of strategies for controlling these emissions depends on our ability to observe urban CO 2 emissions and attribute them to specific activities. Cost-effective strategies for doing so have yet to be described. Here we characterize the ability of a prototype measurement network, modeled after the Berkeley Atmospheric CO 2 Observation Network (BEACO 2 N) in California's Bay Area, in combination with an inverse model based on the coupled Weather Research and Forecasting/Stochastic Time-Inverted Lagrangian Transport (WRF-STILT) to improve our understanding of urban emissions. The pseudo-measurement network includes 34 sites at roughly 2 km spacing covering an area of roughly 400 km 2 . The model uses an hourly 1 × 1 km 2 emission inventory and 1 × 1 km 2 meteorological calculations. We perform an ensemble of Bayesian atmospheric inversions to sample the combined effects of uncertainties of the pseudo-measurements and the model. We vary the estimates of the combined uncertainty of the pseudo-observations and model over a range of 20 to 0.005 ppm and vary the number of sites from 1 to 34. We use these inversions to develop statistical models that estimate the efficacy of the combined model–observing system in reducing uncertainty in CO 2 emissions. We examine uncertainty in estimated CO 2 fluxes on the urban scale, as well as for sources embedded within the city such as a line source (e.g., a highway) or a point source (e.g., emissions from the stacks of small industrial facilities). Using our inversion framework, we find that a dense network with moderate precision is the preferred setup for estimating area, line, and point sources from a combined uncertainty and cost perspective. The dense network considered here (modeled after the BEACO 2 N network with an assumed mismatch error of 1 ppm at an hourly temporal resolution) could estimate weekly CO 2 emissions from an urban region with less than 5 % error, given our characterization of the combined observation and model uncertainty.
54 ENVIRONMENTAL SCIENCES↗
Microbial Community Metabolic Modeling: A Community Data-Driven Network Reconstruction: COMMUNITY DATA-DRIVEN METABOLIC NETWORK MODELING
Metabolic network modeling of microbial communities provides an in-depth understanding of community-wide metabolic and regulatory processes. Compared to single organism analyses, community metabolic network modeling is more complex because it needs to account for interspecies interactions. To date, most approaches focus on reconstruction of high-quality individual networks so that, when combined, they can predict community behaviors as a result of interspecies interactions. However, this conventional method becomes ineffective for communities whose members are not well characterized and cannot be experimentally interrogated in isolation. Here, we tested a new approach that uses community-level data as a critical input for the network reconstruction process. This method focuses on directly predicting interspecies metabolic interactions in a community, when axenic information is insufficient. We validated our method through the case study of a bacterial photoautotroph-heterotroph consortium that was used to provide data needed for a community-level metabolic network reconstruction. Resulting simulations provided experimentally validated predictions of how a photoautotrophic cyanobacterium supports the growth of an obligate heterotrophic species by providing organic carbon and nitrogen sources.
compartmentalized metabolic network↗
Analytical transport network theory to guide the design of 3-D microstructural networks in energy materials: Part 1. Flow without reactions
Here we present a fully analytical, heuristic model – the “Analytical Transport Network Model” – for steady-state, diffusive, potential flow through a 3-D network. Employing a combination of graph theory, linear algebra, and geometry, the model explicitly relates a microstructural network's topology and the morphology of its channels to an effective material transport coefficient (a general term meant to encompass, e.g., conductivity or diffusion coefficient). The model's transport coefficient predictions agree well with those from electrochemical fin (ECF) theory and finite element analysis (FEA), but are computed 0.5–1.5 and 5–6 orders of magnitude faster, respectively. In addition, the theory explicitly relates a number of morphological and topological parameters directly to the transport coefficient, whereby the distributions that characterize the structure are readily available for further analysis. Furthermore, ATN's explicit development provides insight into the nature of the tortuosity factor and offers the potential to apply theory from network science and to consider the optimization of a network's effective resistance in a mathematically rigorous manner. The ATN model's speed and relative ease-of-use offer the potential to aid in accelerating the design (with respect to transport), and thus reducing the cost, of energy materials.
25 ENERGY STORAGE↗
Voltage Calculations in Secondary Distribution Networks via Physics-Inspired Neural Network Using Smart Meter Data
The increasing penetration of distributed energy resources (DERs) leads to voltage issues across distribution networks, necessitating voltage calculations by utilities. Electric model-free voltage calculation offers an enticing solution. However, most researches mainly focus on primary distribution networks ignoring secondary distribution networks and commonly overlook extreme voltage case calculations, which require the model’s extrapolation abilities. Here, in addressing the gaps, this paper presents a customized physics-inspired neural network (PINN) model, the structure of which is inspired by the derived coupled power flow model of primary-secondary distribution networks. To ensure precision and rapid convergence, a crafted training framework for the PINN model is proposed. The PINN’s “structure-mimetic” design enables superior extrapolation for unseen scenarios and enhances physical information awareness. We demonstrate this through two applications: hosting capacity analysis and customer-transformer connectivity. The effectiveness and advantages of the proposed PINN model are validated on two public testing systems and one utility distribution feeder model.
Distribution network↗
Evaluation of Station Performance of the Idaho National Laboratory Seismic Monitoring Network Using Network Detection Thresholds
The Idaho National Laboratory (INL) Seismic Monitoring Network is located in eastern Idaho and monitors a portion of the intermountain seismic belt. It has been in place for 50 yr and has undergone several major changes, the most recent of which has been the transition to the Antelope real‐time acquisition system and the implementation of automatic phase picking algorithms to aid in analysis. This study discusses the efforts to evaluate the performance of the INL seismic monitoring network (and other surrounding stations) using the new real‐time acquisition system. The method outlined by Wilson et al. (2021) is used to develop an empirical relationship between the observability of local earthquakes as a function of magnitude and distance. This relationship is used to produce detection thresholds for Pwaves for all stations of interest. The INL seismic network has two main goals: monitor tectonic‐and volcanic‐related events and measure ground motions for input into seismic hazard analysis. Because of these two overall objectives, several seismic stations have been installed near critical facilities and, therefore, are not as quiet as stations that are used primarily for earthquake detection. This is reflected in their detection thresholds, which are much smaller for stations away from facilities. This study shows that the INL Seismic Monitoring Network is able to detect earthquakes near INL facilities with M L > 1.2, with redundancies built in to ensure this sensitivity even if data became unavailable from some stations. This study also shows “holes” in the monitoring network where the detection of smaller earthquakes is highly dependent on sparsely placed seismic stations. In conclusion, the results of this study will be used to govern plans for expansion of earthquake monitoring in Idaho and the surrounding region and to fine‐tune the detection thresholds for individual stations.
58 - GEOSCIENCES↗
Software-Defined Networking Traffic Engineering Process for Operational Technology Networks
Network design goals are often functional with little consideration for security. Growth and maintenance of critical infrastructure mission-focused networks can be ad hoc and preclude large-scale technology replacements, reconfigurations, or even patching. These restrictions are contributing factors to increased vulnerabilities. Over 90% of all attacks begin with phishing and include lateral movement (Frinke 2019). Adopting a software-defined networking (SDN) approach is an effective mitigation strategy for many existing vulnerabilities. SDNs deny-by-default approach to networking restricts an adversary’s freedom of movement without impacting an organization’s mission. SDN implementations require a process that identifies an organization’s mission-specific network communications. A well-defined traffic engineering process ensures that only known devices communicate with each other on specific ports.
Software Defined Networking, Situational Awareness↗
Network bandwidth utilization forecast model on high bandwidth networks
With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2%. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.
97 MATHEMATICS AND COMPUTING↗
Network Bandwidth Utilization Forecast Model on High Bandwidth Network
With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2percent. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.
97 MATHEMATICS AND COMPUTING↗
Pleiotropic and Epistatic Network-Based Discovery: Integrated Networks for Target Gene Discovery
Biological organisms are complex systems that are composed of functional networks of interacting molecules and macro-molecules. Complex phenotypes are the result of orchestrated, hierarchical, heterogeneous collections of expressed genomic variants. However, the effects of these variants are the result of historic selective pressure and current environmental and epigenetic signals, and, as such, their co-occurrence can be seen as genome-wide correlations in a number of different manners. Biomass recalcitrance (i.e., the resistance of plants to degradation or deconstruction, which ultimately enables access to a plant's sugars) is a complex polygenic phenotype of high importance to biofuels initiatives. This study makes use of data derived from the re-sequenced genomes from over 800 different Populus trichocarpa genotypes in combination with metabolomic and pyMBMS data across this population, as well as co-expression and co-methylation networks in order to better understand the molecular interactions involved in recalcitrance, and identify target genes involved in lignin biosynthesis/degradation. A Lines Of Evidence (LOE) scoring system is developed to integrate the information in the different layers and quantify the number of lines of evidence linking genes to target functions. This new scoring system was applied to quantify the lines of evidence linking genes to lignin-related genes and phenotypes across the network layers, and allowed for the generation of new hypotheses surrounding potential new candidate genes involved in lignin biosynthesis in P. trichocarpa, including various AGAMOUS-LIKE genes. Lastly, the resulting Genome Wide Association Study networks, integrated with Single Nucleotide Polymorphism (SNP) correlation, co-methylation, and co-expression networks through the LOE scores are proving to be a powerful approach to determine the pleiotropic and epistatic relationships underlying cellular functions and, as such, the molecular basis for complex phenotypes, such as recalcitrance.
09 BIOMASS FUELS↗