Results 11 - 20
of
178
ative Commons Attribution Non-Commercial No Derivatives licence. Researchers
"... I herewith certify that all material in this dissertation which is not my own work has been properly acknowledged. ..."
Abstract
- Add to MetaCart
I herewith certify that all material in this dissertation which is not my own work has been properly acknowledged.
Flush: A Reliable Bulk Transport Protocol for Multihop Wireless Networks
"... We present Flush, a reliable, high goodput bulk data trans-port protocol for wireless sensor networks. Flush provides end-to-end reliability, reduces transfer time, and adapts to time-varying network conditions. It achieves these proper-ties using end-to-end acknowledgments, implicit snooping of con ..."
Abstract
- Add to MetaCart
of control information, and a rate-control algorithm that op-erates at each hop along a flow. Using several real network topologies, we show that Flush closely tracks or exceeds the maximum goodput achievable by a hand-tuned but fixed rate for each hop over a wide range of path lengths and varying network
hardware and mobile web technology Master of Science Thesis in Programme Computer Systems and Networks
, 2013
"... Digitising statistics handling through ..."
The recycling endosome of Madin-Darby canine kidney cells is a mildly acidic compartment rich in raft components
- Mol. Biol. Cell
, 2000
"... We present a biochemical and morphological characterization of recycling endosomes containing the transferrin receptor in the epithelial Madin-Darby canine kidney cell line. We find that recycling endosomes are enriched in molecules known to regulate transferrin recycling but lack proteins involved ..."
Abstract
-
Cited by 55 (2 self)
- Add to MetaCart
-Golgi network and has been proposed to function in Tf recycling Next, we analyzed the distribution of rab5, which is known to localize to the plasma membrane and early endosomes Acidification Properties of MDCK TfR-containing Recycling Endosomes Because endocytosed TfR is expected to transit through early
New Techniques for Geographic Routing
, 2006
"... As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but ..."
Abstract
- Add to MetaCart
As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing
Vehicular Ad hoc Network Highway Scenario
"... Vehicular Ad hoc networks are kind of Ad hoc networks which are designed to produce wireless communication between vehicles. These networks are subset of Mobile Ad hoc Network, but because of unique characteristic probability of network fragmentation is very high due to rapid topology changing and h ..."
Abstract
- Add to MetaCart
Vehicular Ad hoc networks are kind of Ad hoc networks which are designed to produce wireless communication between vehicles. These networks are subset of Mobile Ad hoc Network, but because of unique characteristic probability of network fragmentation is very high due to rapid topology changing
1Capacity Approximations for Gaussian Relay Networks
"... Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network within an additive gap. Here, the relays quantize their receiv ..."
Abstract
- Add to MetaCart
Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network within an additive gap. Here, the relays quantize
Generalized Louvain method for community detection in large networks
"... Abstract—In this paper we present a novel strategy to discover the community structure of (possibly, large) networks. This approach is based on the well-know concept of network modularity optimization. To do so, our algorithm exploits a novel measure of edge centrality, based on the κ-paths. This te ..."
Abstract
- Add to MetaCart
Abstract—In this paper we present a novel strategy to discover the community structure of (possibly, large) networks. This approach is based on the well-know concept of network modularity optimization. To do so, our algorithm exploits a novel measure of edge centrality, based on the κ
Results 11 - 20
of
178