/*******************************************
 * Kaosweaver Expert Breadcrumbs           *
 * by Paul Davis http://www.kaosweaver.com * 
 * Copyright 2003 all rights reserved      *
 *******************************************/
var KW_uTitle=document.title
function KW_breadcrumbs(o,m,n,r,f,q,v) { // v1.3.0
	d=document;l=window.location.toString();s=l.split("/");i=q;d1=" <span class='kwspan'>"+m+"</span> "
	if (f!=-1) if (l.indexOf(f)!=-1) s.pop();h="<a href='"+KW_jTrail(l,i)+f+"' class='kwhref'>"+o+"</a>";
	t="<span class='kwtitle'>"+KW_uTitle+"</span>";if (s.length==q) {h=t;d1=""}	w=(r==1)?h+d1:t;
	d.write(w);if (n&&!r) d.write("<br>");if (r==1) for (i=v;i<s.length;i++) {d.write("<a href='");
	d.write(KW_jTrail(l,i)+f+"' class='kwhref'>"+KW_fName(s[i-1])+"</a> <span class='kwspan'>"+m+"</span> ")
	l=window.location.toString();} else for (i=s.length;i>v;i--) {d.write(" <span class='kwspan'>"+m)
	d.write("</span> <a href='"+KW_jTrail(l,i-1)+f+"' class='kwhref'>"+KW_fName(s[i-2])+"</a>");
	l=window.location.toString();}if (n && r) d.write("<br>");w=(r==1)?t:d1+h;if (s.length!=q) d.write(w)
}
function KW_jTrail(l,i){ // v1.3.0
	p=0;for (z=0;z<i;z++)p=l.indexOf("/",p)+1;return l.substring(0,p)
}
function KW_fName(a) { // v1.3.0
	a=unescape(a); g=a.split(' '); for (l=0;l<g.length;l++)	
	g[l]=g[l].toUpperCase().slice(0,1)+g[l].slice(1);retVal=g.join(" "); 
	nList= new Array("itas","ITAS","legis","Legislative Network","career","Career Services","inventing","Inventing Tomorrow","inventing","Inventing Tomorrow","1998_Fall","Fall 1998","1998_Spring","Spring 1998","1999_Fall","Fall 1999","1999_Spring","Spring 1999","2000_Fall","Fall 2000","2000_Spring","Spring 2000","2001_Fall","Fall 2001","2001_Spring","Spring 2001","2002_Fall","Fall 2002","2002_Spring","Spring 2002","2003_Spring","Spring 2003","2004_Summer","Summer 2004","2004_Winter","Winter 2004","items","ITems","dao","Diversity and Outreach","campuslife","Campus Life","lowerdiv","Lower Division","new_students","New Students","upperdiv","Upper Division")
	for (var x=0;x<nList.length;x=x+2) 	if (a==nList[x]) {retVal=nList[x+1];break;}	
	return retVal;
}