The Datagram Congestion Control Protocol (DCCP) is a transport protocol that provides bidirectional unicast connections of congestion-controlled unreliable datagrams. DCCP is suitable for applications that transfer fairly large amounts of data and that can benefit from control over the tradeoff between timeliness and reliability.
The past decade has seen a convergence of social and technological networks, with systems such as the World Wide Web characterized by the interplay between rich information content, the millions of individuals and organizations who create it, and the technology that supports it. This course covers recent research on the structure and analysis of such networks, and on models that abstract their basic properties. Topics include combinatorial and probabilistic techniques for link analysis, centralized and decentralized search algorithms, network models based on random graphs, and connections with work in the social sciences.
M.V. Simkin, V.P. Roychowdhury
Scientists often re-invent things which were long known. Here we review these activities as related to the mechanism of producing power law distributions, originally proposed in 1922 by Yule to explain experimental data on the sizes of biological genera, collected by Willis. We estimate that scientists are busy re-discovering America about 2/3 of time.
I. Dorn, A. Lindenblatt, and K. Zweig. Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012), page 9--14. Washington, DC, USA, IEEE Computer Society, (2012)
L. Dietz, S. Bickel, and T. Scheffer. Proceedings of the 24th international conference on Machine learning, page 233--240. New York, NY, USA, ACM, (2007)