Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

SFRmaker and Linesink-Maker: Rapid Construction of Streamflow Routing Networks from Hydrography Data.

ABSTRACT: Groundwater models have evolved to encompass more aspects of the water cycle, but the incorporation of realistic boundary conditions representing surface water remains time-consuming and error-prone. We present two Python packages that robustly automate this process using readily available hydrography data as the primary input. SFRmaker creates input for the MODFLOW SFR package, while Linesink-maker creates linesink string input for the GFLOW analytic element program. These programs can reduce weeks or even months of manual effort to a few minutes of execution time, and carry the added advantages of reduced potential for error, improved reproducibility and facilitation of step-wise modeling through reduced dependency on a particular conceptual model or discretization. Two real-world examples at the county to multi-state scales are presented.

SUBMITTER: Leaf AT

PROVIDER: S-EPMC8518817 | biostudies-literature | 2021 Sep

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

SFRmaker and Linesink-Maker: Rapid Construction of Streamflow Routing Networks from Hydrography Data.

Leaf Andrew T AT Fienen Michael N MN Reeves Howard W HW

Ground water 20210408 5

Groundwater models have evolved to encompass more aspects of the water cycle, but the incorporation of realistic boundary conditions representing surface water remains time-consuming and error-prone. We present two Python packages that robustly automate this process using readily available hydrography data as the primary input. SFRmaker creates input for the MODFLOW SFR package, while Linesink-maker creates linesink string input for the GFLOW analytic element program. These programs can reduce w ...[more]

PMID: 33745128

Similar Datasets

Entanglement-Gradient Routing for Quantum Networks.

Project description:We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

| S-EPMC5660278 | biostudies-literature

Greedy routing optimisation in hyperbolic networks.

Project description:Finding the optimal embedding of networks into low-dimensional hyperbolic spaces is a challenge that received considerable interest in recent years, with several different approaches proposed in the literature. In general, these methods take advantage of the exponentially growing volume of the hyperbolic space as a function of the radius from the origin, allowing a (roughly) uniform spatial distribution of the nodes even for scale-free small-world networks, where the connection probability between pairs decays with hyperbolic distance. One of the motivations behind hyperbolic embedding is that optimal placement of the nodes in a hyperbolic space is widely thought to enable efficient navigation on top of the network. According to that, one of the measures that can be used to quantify the quality of different embeddings is given by the fraction of successful greedy paths following a simple navigation protocol based on the hyperbolic coordinates. In the present work, we develop an optimisation scheme for this score in the native disk representation of the hyperbolic space. This optimisation algorithm can be either used as an embedding method alone, or it can be applied to improve this score for embeddings obtained from other methods. According to our tests on synthetic and real networks, the proposed optimisation can considerably enhance the success rate of greedy paths in several cases, improving the given embedding from the point of view of navigability.

| S-EPMC10754836 | biostudies-literature

Multicommodity routing optimization for engineering networks.

Project description:Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods. However, it is not yet clear if this formalism has empirical validity on engineering networks. We address this issue by considering different response functions-quantities determining the interaction between passengers-in the dynamics implementing the optimal transport formulation. Particularly, we couple passengers' fluxes by taking their sum or the sum of their squares. The first choice naturally reflects edges occupancy in transportation networks, however the second guarantees convergence to an optimal configuration of flows. Both modeling choices are applied to the Paris metro. We measure the extent of traffic bottlenecks and infrastructure resilience to node removal, showing that the two settings are equivalent in the congested transport regime, but different in the branched one. In the latter, the two formulations differ on how fluxes are distributed, with one function favoring routes consolidation, thus potentially being prone to generate traffic overload. Additionally, we compare our method to Dijkstra's algorithm to show its capacity to efficiently recover shortest-path-like graphs. Finally, we observe that optimal transport networks lie in the Pareto front drawn by the energy dissipated by passengers, and the cost to build the infrastructure.

| S-EPMC9076927 | biostudies-literature

Dynamic information routing in complex networks.

Project description:Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function.

| S-EPMC4832059 | biostudies-literature

A spectrum of routing strategies for brain networks.

Project description:Communication of signals among nodes in a complex network poses fundamental problems of efficiency and cost. Routing of messages along shortest paths requires global information about the topology, while spreading by diffusion, which operates according to local topological features, is informationally "cheap" but inefficient. We introduce a stochastic model for network communication that combines local and global information about the network topology to generate biased random walks on the network. The model generates a continuous spectrum of dynamics that converge onto shortest-path and random-walk (diffusion) communication processes at the limiting extremes. We implement the model on two cohorts of human connectome networks and investigate the effects of varying the global information bias on the network's communication cost. We identify routing strategies that approach a (highly efficient) shortest-path communication process with a relatively small global information bias on the system's dynamics. Moreover, we show that the cost of routing messages from and to hub nodes varies as a function of the global information bias driving the system's dynamics. Finally, we implement the model to identify individual subject differences from a communication dynamics point of view. The present framework departs from the classical shortest paths vs. diffusion dichotomy, unifying both models under a single family of dynamical processes that differ by the extent to which global information about the network topology influences the routing patterns of neural signals traversing the network.

| S-EPMC6426276 | biostudies-literature

Collective navigation of complex networks: Participatory greedy routing.

Project description:Many networks are used to transfer information or goods, in other words, they are navigated. The larger the network, the more difficult it is to navigate efficiently. Indeed, information routing in the Internet faces serious scalability problems due to its rapid growth, recently accelerated by the rise of the Internet of Things. Large networks like the Internet can be navigated efficiently if nodes, or agents, actively forward information based on hidden maps underlying these systems. However, in reality most agents will deny to forward messages, which has a cost, and navigation is impossible. Can we design appropriate incentives that lead to participation and global navigability? Here, we present an evolutionary game where agents share the value generated by successful delivery of information or goods. We show that global navigability can emerge, but its complete breakdown is possible as well. Furthermore, we show that the system tends to self-organize into local clusters of agents who participate in the navigation. This organizational principle can be exploited to favor the emergence of global navigability in the system.

| S-EPMC5460226 | biostudies-literature

Oscillations and filtering networks support flexible routing of information.

Project description:The mammalian brain exhibits profuse interregional connectivity. How information flow is rapidly and flexibly switched among connected areas remains poorly understood. Task-dependent changes in the power and interregion coherence of network oscillations suggest that such oscillations play a role in signal routing. We show that switching one of several convergent pathways from an asynchronous to an oscillatory state allows accurate selective transmission of population-coded information, which can be extracted even when other convergent pathways fire asynchronously at comparable rates. We further show that the band-pass filtering required to perform this information extraction can be implemented in a simple spiking network model with a single feed-forward interneuron layer. This constitutes a mechanism for flexible signal routing in neural circuits, which exploits sparsely synchronized network oscillations and temporal filtering by feed-forward inhibition.

| S-EPMC3125699 | biostudies-literature

Beyond Streamflow: Call for a National Data Repository of Streamflow Presence for Streams and Rivers in the United States.

Project description:Observations of the presence or absence of surface water in streams are useful for characterizing streamflow permanence, which includes the frequency, duration, and spatial extent of surface flow in streams and rivers. Such data are particularly valuable for headwater streams, which comprise the vast majority of channel length in stream networks, are often non-perennial, and are frequently the most data deficient. Datasets of surface water presence exist across multiple data collection groups in the United States but are not well aligned for easy integration. Given the value of these data, a unified approach for organizing information on surface water presence and absence collected by diverse surveys would facilitate more effective and broad application of these data and address the gap in streamflow data in headwaters. In this paper, we highlight the numerous existing datasets on surface water presence in headwater streams, including recently developed crowdsourcing approaches. We identify the challenges of integrating multiple surface water presence/absence datasets that include differences in the definitions and categories of streamflow status, data collection method, spatial and temporal resolution, and accuracy of geographic location. Finally, we provide a list of critical and useful components that could be used to integrate different streamflow permanence datasets.

| S-EPMC8943845 | biostudies-literature

Construction, visualisation, and clustering of transcription networks from microarray expression data.

Project description:Network analysis transcends conventional pairwise approaches to data analysis as the context of components in a network graph can be taken into account. Such approaches are increasingly being applied to genomics data, where functional linkages are used to connect genes or proteins. However, while microarray gene expression datasets are now abundant and of high quality, few approaches have been developed for analysis of such data in a network context. We present a novel approach for 3-D visualisation and analysis of transcriptional networks generated from microarray data. These networks consist of nodes representing transcripts connected by virtue of their expression profile similarity across multiple conditions. Analysing genome-wide gene transcription across 61 mouse tissues, we describe the unusual topography of the large and highly structured networks produced, and demonstrate how they can be used to visualise, cluster, and mine large datasets. This approach is fast, intuitive, and versatile, and allows the identification of biological relationships that may be missed by conventional analysis techniques. This work has been implemented in a freely available open-source application named BioLayout Express(3D).

| S-EPMC2041979 | biostudies-literature

Quantum networks with coherent routing of information through multiple nodes.

Project description:Large-scale communication networks, such as the Internet, rely on routing packets of data through multiple intermediate nodes to transmit information from a sender to a receiver. In this paper, we develop a model of a quantum communication network that routes information simultaneously along multiple paths passing through intermediate stations. We demonstrate that a quantum routing approach can in principle extend the distance over which information can be transmitted reliably. Surprisingly, the benefit of quantum routing also applies to the transmission of classical information: even if the transmitted data is purely classical, delocalising it on multiple routes can enhance the achievable transmission distance. Our findings highlight the potential of a future quantum internet not only for achieving secure quantum communication and distributed quantum computing but also for extending the range of classical data transmission.

| S-EPMC11661969 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data