Results 61 to 70 of about 12,493,799 (287)

Network Goodness Calculus Propositions

open access: yesAppliedMath
We coin the term “network goodness” for a value we define for a network embedded in a given environment as a metric that describes the suitability of that network for meeting a demand.
Marina Bershadsky   +2 more
doaj   +1 more source

Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry

open access: yesFEBS Letters, EarlyView.
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri   +5 more
wiley   +1 more source

Using network calculus to optimize the AFDX network [PDF]

open access: yes, 2006
This paper presents quantitative results we obtained when optimizing the setting of priorities of the AFDX traffic flows, with the objective to obtain tighter latency and queue-size deterministic bounds (those bounds are calculated by our Network ...
Frances, Fabrice   +2 more
core  

Modelling the guaranteed QoS for wireless sensor networks: a network calculus approach

open access: yesEURASIP Journal on Wireless Communications and Networking, 2011
Wireless sensor networks (WSNs) became one of the high technology domains during the last 10 years. Real-time applications for them make it necessary to provide the guaranteed quality of service (QoS).
Yu Jianping   +2 more
doaj  

Emerging experimental and computational methods for studying redox‐regulated structural transitions

open access: yesFEBS Letters, EarlyView.
Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass   +2 more
wiley   +1 more source

Calculus of service guarantees for network coding [PDF]

open access: yes, 2006
A large class of networks is able to provide some guarantees in terms of quality of service, end-to-end delays and throughput to data flows. In return, the data flows must verify constraints of burstiness and throughput.
Fraboul, Christian   +2 more
core  

Service chain deployment algorithms for deterministic end-to-end delay upper bound

open access: yesTongxin xuebao, 2021
To solve the problem that the current service chain deployment algorithms cannot guarantee the delay of each packet passing through the service chain (SC), a SC deployment algorithm for deterministic end-to-end delay upper bound was proposed.First, the ...
Ze’nan WANG   +4 more
doaj  

Translophagy—A potential link between autophagy impairment and translational errors

open access: yesFEBS Letters, EarlyView.
Neurodegenerative diseases are characterised by the accumulation of abnormal proteins and protein aggregates, but their origin often remains unknown. We propose that selective autophagy removes damaged protein‐making machinery, preventing errors during protein synthesis.
Mykola V. Korolchuk   +11 more
wiley   +1 more source

Software-defined dynamic QoS provisioning for smart metering in energy Internet using fog computing and network calculus

open access: yesIET Cyber-Physical Systems, 2018
Energy Internet (EI) is a revolution of power systems due to its flexible energy control. The smart meters are the key components in EI which perform real-time monitoring and require high demands on quality of services (QoSs).
Lina Huang   +5 more
doaj   +1 more source

DeepTMA: Predicting Effective Contention Models for Network Calculus using Graph Neural Networks

open access: yesIEEE Conference on Computer Communications, 2019
Network calculus computes end-to-end delay bounds for individual data flows in networks of aggregate schedulers. It searches for the best model bounding resource contention between these flows at each scheduler.
Fabien Geyer, Steffen Bondorf
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy