Results 71 to 80 of about 876,573 (316)

An effective genetic algorithm for network coding [PDF]

open access: yes, 2012
The network coding problem (NCP), which aims to minimize network coding resources such as nodes and links, is a relatively new application of genetic algorithms (GAs) and hence little work has so far been reported in this area.
Mark S. Leeson   +5 more
core   +1 more source

Modelling equilibrium for a multi-criteria selfish routing network equilibrium flow problem

open access: yes, 2022
The selfish routing of network flow often considers a single objective, namely travel time or travel distance, and optimisation models are often guided by the principle of user equilibrium (UE).
Berry, S.   +4 more
core   +1 more source

A bit-arc capacity scaling algorithm for the maximum flow problem subjected to box constraints on the flow vector in digraph [PDF]

open access: yesNetwork Biology
A bit-arc capacity scaling algorithm to solve the maximal flow problem subjected to box constraints on the flow vector in directed network has been presented. The algorithm is mainly based on successive divisions of capacities by multiples of two.
Muhammad Tlas
doaj  

Outlier detection method use for the network flow anomaly detection / Išskirčių radimo metodų taikymas anomalijoms kompiuterių tinklo paketų srautuose aptikti

open access: yesMokslas: Lietuvos Ateitis, 2016
New and existing methods of cyber-attack detection are constantly being developed and improved because there is a great number of attacks and the demand to protect from them.
Rimas Ciplinskas, Nerijus Paulauskas
doaj   +1 more source

On the Duality Between Network Flows and Network Lasso [PDF]

open access: yesIEEE Signal Processing Letters, 2020
Many applications generate data with an intrinsic network structure such as time series data, image data or social network data. The network Lasso (nLasso) has been proposed recently as a method for joint clustering and optimization of machine learning models for networked data.
openaire   +2 more sources

Epigenetic blind spots – the role of DNA methylation dynamics in stem cell‐based models of embryogenesis

open access: yesFEBS Letters, EarlyView.
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

pH‐mediated activation of the lysosomal arginine sensor SLC38A9

open access: yesFEBS Letters, EarlyView.
Cells monitor nutrient levels via the lysosomal transporter SLC38A9 to activate the mechanistic target of rapamycin complex 1 (mTORC1). This study reveals that SLC38A9 function is regulated by pH. We identified histidine 544 as a critical pH sensor that undergoes conformational changes to control amino acid efflux from lysosomes; therefore, it ...
Xuelang Mu, Ampon Sae Her, Tamir Gonen
wiley   +1 more source

Research on Flow Sampling Algorithm Based on Counting Bloom Filter [PDF]

open access: yesJisuanji gongcheng, 2018
In order to adapt to the high-speed network environment and realize the accurate measurement of network traffic,a network algorithm of flow equal probability sampling based on the combination of Counting Bloom Filter and packet-based flow sampling ...
ZHAI Jinfeng,SUN Libo,LU Kai,LIN Xueyong,QIN Wenhu
doaj   +1 more source

The human gut microbiome across the life course

open access: yesFEBS Letters, EarlyView.
Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero   +4 more
wiley   +1 more source

A bit-capacity scaling algorithm for the constrained minimal cost network flow problem [PDF]

open access: yesNetwork Biology, 2021
A polynomial time algorithm for solving the minimum-cost network flow problem has been proposed in this paper. This algorithm is mainly based on the binary representation of capacities; it solves the minimum-cost flow problem in directed graph of n nodes
Muhammad Tlas
doaj  

Home - About - Disclaimer - Privacy