Results 51 to 60 of about 47,764 (259)
Shortest-Path Percolation on Random Networks
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a certain budget.
Minsuk Kim, Filippo Radicchi
openaire +3 more sources
Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system
Age‐dependent shifts in microbial communities engender shifts in microbial metabolite profiles. These in turn drive shifts in barrier surface permeability of the gut and brain and induce immune activation. When paired with preexisting age‐related chronic inflammation this increases the risk of neuroinflammation and neurodegenerative diseases.
Aaron Mehl, Eran Blacher
wiley +1 more source
Routes Obey Hierarchy in Complex Networks
The last two decades of network science have discovered stunning similarities in the topological characteristics of real life networks (many biological, social, transportation and organizational networks) on a strong empirical basis.
Attila Csoma +9 more
doaj +1 more source
Shortest, Fastest, and Foremost Broadcast in Dynamic Networks [PDF]
Highly dynamic networks rarely offer end-to-end connectivity at a given time. Yet, connectivity in these networks can be established over time and space, based on temporal analogues of multi-hop paths (also called journeys). Attempting to optimize the selection of the journeys in these networks naturally leads to the study of three cases: shortest ...
Arnaud Casteigts +3 more
openaire +2 more sources
Diversity and complexity in neural organoids
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
For a family of optimal two-dimensional circulant networks with an analytical description, two new improved versions of the shortest path search algorithm with a constant complexity estimate are obtained.
Emilia A. Monakhova +2 more
doaj +1 more source
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +1 more source
Location‐based data delivery between vehicles and infrastructure
Multi‐hop routing in vehicular ad‐hoc networks (VANETs) and wireless sensor networks has attracted significant interest of researchers in the wireless ad‐hoc networks community.
Farhan Khan, Sing Kiong Nguang
doaj +1 more source
Embryo‐like structures (stembryos) are an innovative tool, but they are hindered by experimental variability and limited developmental potential. DNA methylation is crucial for mammalian development, but its status in stembryo models is poorly characterized.
Sara Canil +4 more
wiley +1 more source
Solving the Robust Shortest Path Problem with Multimodal Transportation
This paper explores the challenges of finding robust shortest paths in multimodal transportation networks. With the increasing complexity and uncertainties in modern transportation systems, developing efficient and reliable routing strategies that can ...
Jinzuo Guo +3 more
doaj +1 more source

