| Shili
Lin, The Ohio State University Time/place: Monday April 2, at 4:10 PM in 171 Durham Refreshments at 3:45 PM in Snedecor 104 Title: Modeling and
Analysis of SAGE Cerebellum Libraries |
![]() |
|
|
Fan
Chung Graham, University of
California-San Diego ISU visit photos Poster Time/place: Monday March 27, at 4:10 PM, in 001 Carver Hall Refreshments in 404 Carver 3:30-4:00 PM Title: Random graphs and Internet graphs Abstract: We will discuss some recent developments on random graphs with given expected degree distributions. Such ramdom graphs can be used to model various very large graphs arising in Internet and telecommunications. In turn, these "massive graphs" shed insights and lead to new directions for random graph theory. For example, it can be shown that the sizes of connected components depend primarily on the average degree and the second-order average degree under certain mild conditions. Furthermore, the spectra of the adjacency matrices of some random power law graphs obey the power law while the spectra of the Laplacian follow thesemi-circle law. We will mention a number of related results and problems that aresuggested by various applications of massive graphs. |
| Barbara Liskov,
Massachusetts Institute of Technology ISU visit photos Poster Time/place: Thursday, 06 April 2006, at 3:30 PM in Alliant Energy Lee Liu Auditorium, Howe Hall. Refreshments in 223 Atanasoff follwoing the lecture Title: Software Upgrades in Distributed Systems Abstract: Upgrading the software of long-lived, highly-available distributed systems is difficult. It is not possible to upgrade all the nodes in a system at once, since some nodes may be unavailable and halting the system for an upgrade is unacceptable. Instead, upgrades must happen gradually, and there may be long periods of time when different nodes run different software versions and need to communicate using incompatible protocols. This talk describes an infrastructure that make it possible to upgrade distributed systems automatically while limiting service disruption. It also describes a methodology for upgrades, including a new way to specify upgrades. |
![]() |
![]() |
Regina
Liu, Rutgers University ISU visit photos Poster Time/place: Tuesday, 25 April 2006, at 3:10 PM in Sweeney 1126. Title: Mining Massive Text Data and Developing Tracking Statistics Abstract: We present a systematic data mining procedure for exploring large free-style text datasets to discover useful features and develop tracking statistics, often referred to as performance measures or risk indicators. The procedure includes text classification, inference under error measurements and risk analysis. Some specific text analysis methodologies and tracking statistics are discussed. Several approaches for incorporating misclassified data or error measurements into the inference for tracking statistics are proposed and evaluated. Finally, we apply this data mining procedure to analyzing an aviation safety report repository from the FAA to illustrate its utility in aviation risk management and general decision-support systems. Although most illustrations here are drawn from aviation safety data, the proposed data mining procedure applies to many other domains, including, for example, mining free-style medical reports for tracking possible disease outbreaks. This is joint work with Daniel Jeske, Department of Statistics, UC Riverside. |
Part of our group met recently for lunch and planning:
Watch for more information- this page will be updated
regularly