<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://www.w3.org/2005/Atom">
<title>Student Research Papers (Mathematics)</title>
<link href="http://hdl.handle.net/1957/17264" rel="alternate"/>
<subtitle/>
<id>http://hdl.handle.net/1957/17264</id>
<updated>2013-06-20T09:23:34Z</updated>
<dc:date>2013-06-20T09:23:34Z</dc:date>
<entry>
<title>Percolation and the bilevel lattice</title>
<link href="http://hdl.handle.net/1957/29452" rel="alternate"/>
<author>
<name>Hunt, Jonathan</name>
</author>
<id>http://hdl.handle.net/1957/29452</id>
<updated>2012-05-30T20:37:06Z</updated>
<published>2012-05-30T00:00:00Z</published>
<summary type="text">Percolation and the bilevel lattice
Hunt, Jonathan
The paper reviews percolation and some of its important properties, particularly&#13;
on the 2-D square lattice. A bilevel lattice is introduced, with a percolation model&#13;
representing the spread of a forest fire according to characteristics of the forest. It is&#13;
proven that the value of the laddering probability may determine whether a  fire  fizzles&#13;
out or spreads without bound, and a programmed simulation assists in determining a&#13;
critical laddering probability.
</summary>
<dc:date>2012-05-30T00:00:00Z</dc:date>
</entry>
<entry>
<title>Polynomial Chaos Expansions for Random Ordinary Differential Equations</title>
<link href="http://hdl.handle.net/1957/26650" rel="alternate"/>
<author>
<name>McKenzie, Brian</name>
</author>
<id>http://hdl.handle.net/1957/26650</id>
<updated>2012-01-11T18:32:29Z</updated>
<published>2012-01-06T00:00:00Z</published>
<summary type="text">Polynomial Chaos Expansions for Random Ordinary Differential Equations
McKenzie, Brian
We consider numerical methods for finding approximate solutions&#13;
to Ordinary Differential Equations (ODEs) with parameters distributed&#13;
with some probability by the Generalized Polynomial Chaos (GPC)&#13;
approach. In particular, we consider those with forcing functions that&#13;
have a random parameter in both the scalar and vector case. We then&#13;
consider linear systems of ODEs with deterministic forcing and randomness&#13;
in the matrix of the systems and conclude with a method&#13;
of approximating solutions to the case where the system involves a&#13;
nonlinear function of a matrix and a random variable.
</summary>
<dc:date>2012-01-06T00:00:00Z</dc:date>
</entry>
<entry>
<title>Effectiveness in Stallings' Proof of Grushko's Theorem</title>
<link href="http://hdl.handle.net/1957/26514" rel="alternate"/>
<author>
<name>Synhavsky, Paul</name>
</author>
<id>http://hdl.handle.net/1957/26514</id>
<updated>2012-01-06T17:53:42Z</updated>
<published>2008-12-22T00:00:00Z</published>
<summary type="text">Effectiveness in Stallings' Proof of Grushko's Theorem
Synhavsky, Paul
Graduation date: 2009
</summary>
<dc:date>2008-12-22T00:00:00Z</dc:date>
</entry>
<entry>
<title>De Bruijn graphs and their applications to fault tolerant networks</title>
<link href="http://hdl.handle.net/1957/26215" rel="alternate"/>
<author>
<name>Baker, Joel</name>
</author>
<id>http://hdl.handle.net/1957/26215</id>
<updated>2011-12-19T21:14:59Z</updated>
<published>2011-12-16T00:00:00Z</published>
<summary type="text">De Bruijn graphs and their applications to fault tolerant networks
Baker, Joel
See paper for abstract.
2011
</summary>
<dc:date>2011-12-16T00:00:00Z</dc:date>
</entry>
</feed>
