function em(){
            var n, d, e, em;
            n = 'd2mohapl';
            d = 'uwaterloo';
            e = '.ca'; 
            em= (n + '@' + d + e);
            out='<a class="blueu" href="mailto:'+ em +'">Dana Mohaplova</a>';
            return out;   
         }

         function report(sw)
         {
            var strl =new String();
            var strr =new String();
            var ctext=new String();
            var strc=new String();
            var pic  = document.getElementById("pic");
            var title="Dana's Pages";

            switch(sw)
            { 
               case 1: 
                  strl="<br /><b>Lecturer</b><br />Name:<br />";
                  strr="<br /><br />"+em()+"<br />";
                  var lab =   new Array("Branch",                     "Company",                "City",                "Province",  "Country","ZIP", "Phone", "Office");
                  var descr = new Array("School of Computer Science", "University of Waterloo", "Waterloo",            "Ontario",   "Canada", "N2L 3G1", "(519) 888 4567 x3007", "DC3138");
                  var urls =  new Array("www.cs.uwaterloo.ca",            "www.uwaterloo.ca",           "www.city.waterloo.on.ca", "www.gov.on.ca", "www.gc.ca",  "www.canadapost.ca","","");
                  pic.innerHTML    = "<img src='dana/d0015.jpg' vspace='50' width='200' align='middle' alt='Dana'/><br />"+title;
                  ctext="Dana.";
               break;
               case 2: // cs370 (fall 2002, winter 2003) 
                  strl="<b>Courses</b><br /><br />";
                  strr="<br /><br />";
                  var lab =   new Array("S2006", "W2006", "S2005", "S2005", "F2004",       "S2004", "W2004", "F2003", "S2003", "W2003", "W2003", "F2002", "F2002");
                  var descr = new Array("cs370", "cs246", "cs241", "cs132", "cs122/cs132", "cs246", "cs246", "cs131", "cs134", "cs370", "cs134", "cs124", "cs370");
                  var urls =  new Array(lab.length);

                  for (i=0; i < lab.length; i++){ 
                     if (i!=2)
                        urls[i]="www.student.math.uwaterloo.ca/~"+descr[i]; 
                     else
                        urls[2]="www.student.math.uwaterloo.ca/~cs132";                   
                  }

                  pic.innerHTML    = "<a target='_blanc' href='a103-18-3.jpg'> <img src='dana/a103-18-3.jpg' vspace='85' width='300'  border='0px' align='middle' alt='Nobel'/></a><br />"+title;
                  ctext="Photo by V. Makarov.";
               break;
               case 3: 
                  strc+="<br /><br />";
                  strc= "<b>Education</b><br />";
                  strc+="<br />M.Math in Computer Science, University of Waterloo"; 
                  strc+="<br />B.Math. in Computer Science, University of Waterloo";
                  strc+="<br /><a class='blue' target='new_window' href='http://www.cas.cz/en/Table.htm'>RNDr.</a> (M. Sci.) Mathematics and <a class='blue' target='new_window' href='http://www.upol.cz/UP_En'>Physics Palack University</a>";
                  strc+="<br /><br />";
                  strc+="<b>Profession</b><br />";
                  strc+="<br /><a class='blue' target='new_window' href='http://www.weblakes.com'>Software developer/tester at Lakes Environmental</a>";
                  strc+="<br /><a class='blue' target='new_window' href='http://mohapl.dyndns.org'>Computer consultant for EmInf</a>";
                  strc+="<br /><a class='blue' target='new_window' href='http://www.cs.uwaterloo.ca/'>Computer science lecturer of the University of Waterloo</a>";
                  strc+="<br /><a class='blue' target='new_window' href='http://www.gs.mcs.cz/'>High school teacher at Gymnasium Sternberk, Czech Republic</a>";
                  strc+="<br /><br />";
                  strc+="<b>Publications</b><br />";
                  strc+="<br />Ways of using a computer for evaluation of didactic tests <a class='blue' target='new_window' href='http://www.upol.cz/resources/exfyz/mfia.htm'><em>Mathematics and Physics at School</em></a>, 19, 1988/89, p. 273-277 (referenced as a study material at the <a class='blue' target='new_window' href='http://exphys.science.upjs.sk/degro/skolpoc.html'>P.J. Safarik University, Koice, Slovakia</a> )"
                  strc+="<br /><br />Comparison of kinematics test results from different types of training institutions, <a class='blue' target='new_window' href='http://www.upol.cz/resources/exfyz/mfia.htm'><em>Mathematics and Physics at School</em></a>, 19, 1988/89, p. 113-119"; 
  
               break;
               case 4: 
                  strl="<b>Local</b><br /><br />";
                  strr="<br /><br />";
                  var lab =   new Array("Research",           "Classes",                "Utilities",                         "News",                             "FAQ's",                           "Grads");
                  var descr = new Array("SciCom Group",       "Faculty of Mathematics", "IST",                               "U. of Waterloo",                   "MFCF/CSCF",                       "GSA");
                  var urls =  new Array("www.scicom.uwaterloo.ca","www.math.uwaterloo.ca",      "www.ist.uwaterloo.ca/as/whatisist.html","www.adm.uwaterloo.ca/infoipa/news.html","www.math.uwaterloo.ca/mfcf/faq/","www.gsa.uwaterloo.ca");
                  pic.innerHTML    = "<a target='_blanc' href='img00069.jpg'><img src='dana/img00069.jpg' align='middle' vspace=50 height='235'  border='0px' alt='Math building'/></a><br />"+title;
                  ctext="The UW math faculty.";
               break;                   
               case 5: 
                  strl="<b>Favorites</b><br /><br />";
                  strr="<br /><br />";
                  var lab =   new Array("Art", "Movies", "Food", "News", "Homes");
                  var descr = new Array("Vladimir Rencin", " Princess Cinema","Czech Beer","Radio Prague","Real Estate");
                  var urls =  new Array("www.rencin.cz", "www.princesscinemas.com", "www.radio.cz/en/article/46095","www.radio.cz/en","www.mls.ca");
                  pic.innerHTML    = "<a target='_blanc' href='rn01_005.gif'><img src='dana/rn01_005.gif' align='middle' vspace=50 width='250'  border='0px' alt='Pubic speach'/></a><br />"+title;
                  ctext="Picture by V. Rencin.";
               break;
               case 6:
                  strl="<b>Cities</b><br /><br />";
                  strr="<br /><br />"; 
                  var lab =   new Array("Searching", "Moravia","Moravia","Ontario","Ontario","Ontario");
                  var descr = new Array("Mapquest", "Šternberk", "Opava", "Waterloo","Toronto", "Niagara Falls");
                  var urls =  new Array("www.mapquest.com/","www.sternberk.cz", "www.opava-city.cz", "www.city.waterloo.on.ca","www.toronto.ca","www.city.niagarafalls.on.ca");
                  pic.innerHTML    = "<a target='_blanc' href='03_v.jpg'><img src='dana/03_v.jpg' align='middle' vspace=50 width='250'  border='0px' alt='Sternberk'/></a><br />"+title;
                  ctext="Town of Sternberk.";                 
               break;
               case 7: 
                  strl="<b>Books</b><br /><br />";
                  strr="<br /><br />"; 
                  var lab =   new Array("Book","On Line","Reviews","Abstracts");
                  var descr = new Array("Numerical Recipes", "Numerical Recipes in C", "MathSciNet", "Research Index");
                  var urls =  new Array("www.library.cornell.edu/nr/nr_index.cgi#thebooks","www.library.cornell.edu/nr/bookcpdf.html","www.ams.org/mathscinet/search", "citeseer.nj.nec.com");
                  pic.innerHTML    = "<a target='_blanc' href='reading.jpg'><img src='dana/reading.jpg' align='middle' vspace=50 width='250'  border='0px' alt='Reading Frankenstein'/></a><br />"+title;
                  //ctext="Evening reading."; 
                  ctext="<a class='blueu' target='_blanc' href='http://beallcenter.uci.edu/exhibitions/reading2003.php'>Reading Frankenstein</a>";                
               break;
               case 8: 
                  strl="<b>Freeware</b><br /><br />";
                  strr="<br /><br />"; 
                  var lab =   new Array("Resources",        "Numeric",                                     "Meshes",                               "Equations",                         "Modeling",                      "Notation");
                  var descr = new Array("C++",              "C/C++ Sources",                               "Triangulations",                       "PDELib",                            "UML",                           "CGNS");
                  var urls =  new Array("www.cplusplus.com","cliodhna.cop.uop.edu/~hetrick/c-sources.html","www-2.cs.cmu.edu/~quake/triangle.html","www.wias-berlin.de/software/pdelib","www.rational.com/uml/index.jsp","www.grc.nasa.gov/WWW/cgns/index.html");
                  pic.innerHTML    = "<a target='_blanc' href='32471.jpg'><img src='dana/32471.jpg' align='middle' vspace=50 width='250'  border='0px' alt='Climbing Palm Trees in Samoa'/></a><br />"+title;
                  ctext="Photo by E. Skowronek.";
               break;
               case 9:
                  strc+="<b>Thesis</b> Supervisor <a class='blue' target='new_window' href='http://www.scicom.uwaterloo.ca/~rbsimpso/'>Dr. B. Simpson.</a><br /> <em>An Object Oriented Assembler for Solution of Partial Differential Equations on Composite Meshes.</em>";
                  strc+="<br /><br />ABSTRACT: Numerical solution of PDEs (partial differential equations) is becoming a standard part of modelling and analysis of real-world phenomena in physics, chemistry, atmospheric and environmental sciences, economy, finance, computer graphics etc. This thesis presents basic ideas for construction and C++ implementation of an assembler for numerical solution of vector-valued evolution PDEs on unstructured composite meshes."; 
                  strc+="The assembler can be efficiently used for both the finite volume (FV) and finite element (FE) methods. The design works with a composite mesh and a discretized flux as inputs and returns the vector of approximate solutions at prescribed nodes of the mesh. The effort is to provide a universal assembler for node-centered FV and Galerkin FE methods that offers freedom of choice as to the discretized flux function and boundary conditions. The user is expected to provide several meshes with common boundaries and the discretized flux. The meshes are merged in one and the flux function is used to assembly the stiffness matrix of the algebraic equations for the discretized solution. Non-linear PDE systems leading to non-linear algebraic equations are solved using Newton's algorithm."; 
                  strc+="<br /><br /><b>Project</b> Part of <a class='blue' target='new_window' href='http://ai.uwaterloo.ca/~dale/cs786/w01'>cs786p.</a><br /> <em>An Empirical Construction of a Simple Neural Network with Application to Time-Series Forecasting.</em>";
                  strc+="<br /><br />ABSTRACT: The topic of the project is forecasting of a time series using a neural network. The goal is to find a method for identification of an optimal number of parameters (synaptic weights) in neurons of the network. The time series is considered as a net with synapses burdened by a noise and probabilistic modeling is used to determine the proper number of weights. The method is intended for building networks that would respect in a specific sense the structure of the data used for prediction. This start-up project is restricted to investigation of a simple input-output layer network with a single transfer function. It considers sensitivity of the neuron to the number of parameters as well as weight estimation if the model is miss-specified. The method is applied to a short time-series of Nortel equity stock prices at the Toronto Stock Exchange.";
                  strc+="<br /><br /><b>Project</b> Part of <a class='blue' target='new_window' href='http://www.student.math.uwaterloo.ca/~cs466'>cs666.</a><br /> <em>A triangulation algorithm for a set of points in the plane minimizing the maximum angle.</em>"; 
                  strc+="<br /><br />ABSTRACT: The problem to find a triangulation of a set of points minimizing the maximal angle, the so called minmax angle triangulation, is reviewed in context of some more recent results on mesh generation and optimal triangulation. The edge-insertion polynomial time algorithm for calculation of the minmax angle triangulation introduced by Edel, 1990, and generalized by Bern et al, 1993, is derived in detail including the proofs of correctness and complexity.";
               break;
            }

            var linel   = document.getElementById("tl");
            var liner   = document.getElementById("tr");  
            var comment = document.getElementById("c"); 
            var cpyright= document.getElementById("cr"); 
 
            var linec  = document.getElementById("tc");

            switch(sw)
            { 
               case 3: case 9:
                  pic.innerHTML    = "";
                  linel.innerHTML  = "";
                  liner.innerHTML  = "";     
                  comment.innerHTML= "";
                  cpyright.innerHTML= "";
                  linec.innerHTML=strc;
               break;  
               default:
                  for (i=0; i < descr.length; i++){
                     strl=strl+lab[i]+":<br />";
                     strr=strr+"<a class='blueu' href = http://"+urls[i]+" target='_blank'>"+ descr[i]+"</a><br />";
                  }
                            
                  linel.innerHTML  =strl;
                  liner.innerHTML  =strr;     
                  comment.innerHTML="<br />On the right: "+ctext;
                  cpyright.innerHTML= "<br />Design by <a class='blueu' target='_blank' href='http://mohapl.dyndns.org'>EmInf</a> &copy; 2004 - 2006";
                  linec.innerHTML="";
             }
         }