For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
The massive, ever-growing literature in life science makes it increasingly difficult for individuals to grasp all the information relevant to their interests. Since even experts’...
This paper studies the effect of path delay on SCTP performance. It focuses on the SCTP fast retransmit algorithm and demonstrates that the performance in the current retransmissio...
Yuansong Qiao, Enda Fallon, Liam Murphy, John Murp...
We propose a layered quality adaptation scheme for video streams to smooth the short-term oscillations induced by Additive Increase Multiplicative Decrease (AIMD) mechanisms, and e...
In this paper we present an approach to analyzing the social behaviors that occur in a typical office space. We describe a system consisting of over 200 motion sensors connected ...
Christopher Richard Wren, Yuri A. Ivanov, Ishwinde...