Graph mining refers to extracting knowledge from massive graphs. The data sets of telephone calls we see at AT&T can be viewed as a single graph, with several hundred million phone numbers as nodes, and calls between phone numbers as edges. It is a giant social network, like an internet connections graph or a rich citation network.
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.
Flower Network Flow Analysis ("Flower") is a suite of applications that are designed to ease the processing and analysis of network flow information. The Flower project will incorporate many features of standard Network Behavior Analysis tools.
My advisor is Prof. Ben Shneiderman, and I am a member of HCIL. My research is in the Information Visualization area of the Human-Computer Interaction field. My current research involves Network Visualization. I developed a tool called NVSS (see NVSS project page) to visualize netwoks (citation networks, food webs, social networks, etc.) using semantic substrates.
The Trans-European Research and Education Networking Association offers a forum to collaborate, innovate and share knowledge in order to foster the development of Internet technology, infrastructure and services to be used by the research and education community.
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.