2007 05 22

Yesterday, today, and tomorrow NCSA is running the PSP 2007 meeting. You may find some of my blogging about it here.

2007 05 14

I needed to reset the password for a user on a MediaWiki site. Luckily, I run into this post “Reset a user password on MediaWiki - Greg’s Postgres stuff” which helps you to do so. The five-cent summary for a MySQL powered site:

UPDATE user SET user_password = md5(CONCAT('123-',md5('newpassword'))) WHERE user_id=123;
2007 05 11

This presentation covers a general overview of the goals, origins, reasearch and tools currently available for the DISCUS project. For more information please visit the DISCUS project website.

2007 05 11

Sometimes you may need to sample a dataset. You may want to get a uniformly sampled subset out of a datatset stored in a file. The perlscript below does the job for you.


#!/usr/bin/perl -w
if ( $#ARGV!=1 ) {
        print "Wrong number of arguments\n\t".
                "uniform-sampler.pl <file> <sample_proportion>\n";
}
else {
        srand();
        open(FILE,$ARGV[0]) or die "File $ARGV[0] could not be open";
        while($line=<FILE>) {
                if ( rand()<$ARGV[1] ) {
                                print $line;
                }
        }
        close FILE;
}
1;

2007 05 10

SURFACE 51 is a Urbana-Champaign graphic and web design company. You can check out their portfolio here.

2007 05 01

Jon Kleinberg is visiting UIUC today and giving a talk “Decentralized Search, Cascading Behavior, and the Structure of On-Line Communities” in the Age of Networks seminar series. The abstract of his talk today:

The rise of large-scale information networks has provided us with systems that are simultaneously social and technological in nature, and in which the human interactions that unfold can be recorded and studied in extraordinary detail. Against this backdrop, a significant amount of recent work has focused on the development of mathematical models that capture some of the qualitative properties observed in large-scale network data; such models have the potential to help us reason, at a general level, about the ways in which large networks are organized, and about the ways in which abstract models can capture the processes we observe.

We discuss two lines of research that illustrate this theme, concerned with two network processes that can be viewed as complementary: search, which narrows toward a specific target; and cascading behavior, which spreads outward from a small seed. We relate the search problem to issues that underpin the well-known “six degrees of separation” phenomenon in social networks, and describe how recent data from on-line communities aligns surprisingly well with some of the basic mathematical models for the underlying process. We identify cascading behavior in many social network processes that can be thought of as unfolding with the dynamics of an epidemic: as individuals become aware of new ideas, technologies, fads, rumors, or gossip, they have the potential to pass them on to their friends and colleagues, causing the resulting behavior to spread rapidly through the network. Here too, we find that the processes taking place within on-line communities provide new insights into models for cascading behavior that have been extensively studied in the social sciences.

He covered some results on algorithmic network analysis. He started with the “six degree of separation result” and continued rolling over different models. One of the interesting stop, models of innovation diffusion over inventions. Yes, he went over Everret Rogers “Diffusion of innovations” work. Also presented the NP problem involved on finding the key diffusors and diminishing returns presenting some heuristics about it.