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.
This archive is open for any geometer to publish new geometric models, or to browse this site for material to be used in education and research. These geometry models cover a broad range of mathematical topics from geometry, topology, and to some extent from numerics.
Design of Clinical Trials for Treatment of Pain, Development of Clinical Trials, Selected Qualitative Methods, Within-Patient Studies: Cross-over Trials & n-of-1 Studies, Clinical Economics, etc.