graph tools

Graphblast
GraphClust http://www.cs.nyu.edu/cs/faculty/shasha/papers/GraphClust.html

Subdue (discover sub patterns) http://ailab.uta.edu/subdue/

xml and grid computing in today's zdnet

Microsoft XML guru sees power for the people

By Martin LaMonica, CNET News.com

Paoli predicts that within five years, 75 percent of new documents will be created in XML.

Datasynapse is a grid computing service company

scientific linux

SL is a Linux release put together by various labs and universities around the world. It's primary purpose is to reduce duplicated effort of the labs, and to have a common install base for the various experimentors.

The base SL distribution is basically Enterprise Linux, recompiled from source.

Our main goal for the base distribution is to have everything compatible with Enterprise, with only a few minor additions or changes. An example of of items that were added are Pine, and OpenAFS.

Our secondary goal is to allow easy customization for a site, without disturbing the Scientific Linux base. The various labs are able to add their own modifications to their own site areas. By the magic of scripts, and the anaconda installer, each site is be able to create their own distributions with minimal effort. Or, if a users wishes, they can simply install the base SL release.

InfiniBand

InfiniBand is a high-speed networking technology that offers short delays and minimum processor effort when one computer needs to communicate with another. It arrived later than advocates hoped and isn't as widely used as once promised, but it's now an increasingly common feature of supercomputers made by connecting numerous low-end systems.

maximum common graph

Maximal common subgraph (MCS) and simply connected common subgraph (SCCS): A subgraph of graph G is a new graph obtained from G by deleting some edges and vertices. A common subgraph of G₁ and G₂, CS(G₁, G₂), is a graph which is isomorphic to a subgraph of both G₁ and G₂. The maximal common subgraph of G₁ and G₂, MCS(G₁, G₂), is the CS(G₁, G₂) whose cardinality is not smaller than that of any other CS(G₁, G₂). A simply connected common subgraph, SCCS(G₁, G₂), is a CS(G₁, G₂) within which each vertex is connected to at least one other vertex. The MCS(G₁, G₂) must be a set of SCCS(G₁, G₂)'s.