function validate(){
if( (validateNumber(document.form1.p_value.value)) && (validateNumber(document.form1.n_nodes.value)) )
{
if( (isEmpty(document.form1.upload_file.value))&&(isEmpty(document.form1.edit_functions.value)) )
{
alert("Please upload a function file to continue.");
return false;
}
return true;
}
else
{
return false;
}
}
function isEmpty(val) {
return ( ( val == null ) || (val.length == 0) )
}
function validateNumber(num) {
if(isEmpty(num))
{
alert("Cannot accept empty input.");
return false;
}
for(i = 0; i < num.length; i++)
{
var c = num.charAt(i);
if(!((c >= "0") && (c <= "9")))
{
alert("Input must be a positive integer.");
return false;
}
}
return true;
}
function validatePrime(prime) {
if(!(validateNumber(prime)) )
{
return false;
}
if(prime == 1)
{
alert(prime + " is not a prime number.");
return false;
}
for(i = 2; i <= Math.sqrt(prime); i++)
{
if( (prime%i) == 0 )
{
alert(prime + " is not a prime number.");
return false;
}
}
return true;
}
function doWarn(element) {
if(element.value == "Yes"){
alert("WARNING!! May not be able to display graph with a large number of nodes");
return true;
}
else {
return false;
}
}
/*function doFileWarn(element) {
if(element.value == "No"){
alert("REMINDER!! Please make sure your polynomial function file adheres to the specified format.");
return true;
}
else {
return false;
}
}*/
// This code is from Dynamic Web Coding www.dyn-web.com
// Copyright 2002 by Sharon Paine Permission granted to use this code as long as this entire notice is included.
// Permission granted to SimplytheBest.net to feature script in its
// DHTML script collection at http://simplythebest.net/scripts/dhtml_scripts.html
var dom = (document.getElementById) ? true : false;
var ns5 = ((navigator.userAgent.indexOf("Gecko")>-1) && dom) ? true: false;
var ie5 = ((navigator.userAgent.indexOf("MSIE")>-1) && dom) ? true : false;
var ns4 = (document.layers && !dom) ? true : false;
var ie4 = (document.all && !dom) ? true : false;
var nodyn = (!ns5 && !ns4 && !ie4 && !ie5) ? true : false;
var origWidth, origHeight;
if (ns4) {
origWidth = window.innerWidth; origHeight = window.innerHeight;
window.onresize = function() { if (window.innerWidth != origWidth || window.innerHeight != origHeight) history.go(0); }
}
if (nodyn) { event = "nope" }
var tipFollowMouse = true;
var tipWidth = 200;
var offX = 12; // how far from mouse to show tip
var offY = 12;
var tipFontFamily = "Verdana, arial, helvetica, sans-serif";
var tipFontSize = "8pt";
var tipFontColor = "#000000";
var tipBgColor = "#DDECFF";
var origBgColor = tipBgColor; // in case no bgColor set in array
var tipBorderColor = "#000080";
var tipBorderWidth = 2;
var tipBorderStyle = "ridge";
var tipPadding = 4;
var messages = new Array();
messages[0] = new Array('This is the number \'n\' of nodes in your discrete dynamical system.',"#DDECFF");
messages[1] = new Array('This is the number \'m\' of different states each node can take on.',"#DDECFF");
messages[2] = new Array('The file must be a plain text file and adhere to the format specified in the tutorial. The number of functions in this file must equal the \'number of nodes\' value entered above. For each variable a single update function or a set of update functions (in curly brackets) can be given. In the latter, probabilites can be given, seperated formt he function by the pound sign',"#DDECFF");
messages[3] = new Array('This will specify how the operations in the function file should be interpreted.
Polynomial: the operations are interpreted as polynomial addition and multiplication Boolean: the operations are interpreted as Boolean AND, OR, and NOT. Note that the \'number of states\' value must be 2.',"#DDECFF");
messages[4] = new Array('This will determine the order in which to evaluate the functions.
Synchronous: all functions get evaluated at the same time. The input can be a deterministic system, or a set of update functions for each variable Update Stochastic: this uses a random sequential update order. That is implemented by randomly delaying most variables and only updateing a few. The input has to be a deterministic system Sequential: the functions are evaluated in some specified order. The function indices must be entered with each index used exactly once. Input must be deterministic',"#DDECFF");
messages[5] = new Array('Displays information about the structure of the trajectory graph generated using all possible states or a single user-provided initial state.',"#DDECFF");
messages[6] = new Array('State space graph: draws the graph of all trajectories or a single trajectory as requested by the user, probabilities on each edge can be included.
Dependency graph: draws the dependency graph of the network described by the input functions.',"#DDECFF")
/*if (document.images) {
var theImgs = new Array();
for (var i=0; i
';
//var midStr = '
';
var endStr = '
';
var tooltip, tipcss;
function initTip() {
if (nodyn) return;
tooltip = (ns4)? document.tipDiv.document: (ie4)? document.all['tipDiv']: (ie5||ns5)? document.getElementById('tipDiv'): null;
tipcss = (ns4)? document.tipDiv: tooltip.style;
if (ie4||ie5||ns5) { // ns4 would lose all this on rewrites
tipcss.width = tipWidth+"px";
tipcss.fontFamily = tipFontFamily;
tipcss.fontSize = tipFontSize;
tipcss.color = tipFontColor;
tipcss.backgroundColor = tipBgColor;
tipcss.borderColor = tipBorderColor;
tipcss.borderWidth = tipBorderWidth+"px";
tipcss.padding = tipPadding+"px";
tipcss.borderStyle = tipBorderStyle;
}
if (tooltip&&tipFollowMouse) {
if (ns4) document.captureEvents(Event.MOUSEMOVE);
document.onmousemove = trackMouse;
}
}
window.onload = initTip;
var t1,t2; // for setTimeouts
var tipOn = false; // check if over tooltip link
function doTooltip(evt,num) {
if (!tooltip) return;
if (t1) clearTimeout(t1); if (t2) clearTimeout(t2);
tipOn = true;
// set colors if included in messages array
if (messages[num][1]) var curBgColor = messages[num][1];
else curBgColor = tipBgColor;
if (messages[num][2]) var curFontColor = messages[num][2];
else curFontColor = tipFontColor;
if (ns4) {
var tip = '