February 1, 2005
12:30-1:30
CSCAMM Library |
Chris Danforth - Tools used to create a useful scientific computing desktop. Unix, Presentation template
|
February 8, 2005
12:30-1:30
CSCAMM Library |
Bob Shuttleworth - Parallel Preconditioners for the Incompressible Navier-Stokes Equations
Danny Dunlavy - Homotopy Optimization Methods and Protein Structure Prediction
|
February 15, 2005 Postponed
12:30-1:30
CSCAMM Library |
Darran Furnival - Linear Solvers for the Stochastic Finte Element Method.
|
February 22, 2005
12:30-1:30
CSCAMM Library |
Aleksey Zimin - Using mate pairs to evaluate genome assemblies
In this talk I will introduce the method of obtaining the genomic sequence based on Whole Genome Shotgun (WGS) data. I will explain the basic idea of assembling genomes from WGS data and evaluating the performance of the different assemblers based on comparison with the finished sequence and mate pair analysis. I will show the examples from the recent Drosophila fly assembly effort in which several assemblers from different centers were used to produce assemblies the genomes from the same data.
|
March 8, 2005
12:30-1:30
CSCAMM Library |
Darran Furnival - Linear Solvers for the Stochastic Finite Element Method
|
March 15, 2005
12:30-1:30
CSCAMM Library |
J.T. Halbert- Calculating the Fractal Dimension of Sets
|
March 22, 2005
12:30-1:30
CSCAMM Library |
Spring Break
|
March 29, 2005
12:30-1:30
CSCAMM Library |
Open
|
April 6, 2005
12:30-1:30
CSCAMM Library |
Open
|
April 12, 2005
12:30-1:30
CSS LCV 4364 |
Dongwook Lee - Divergence-Free Methods in Ideal Magnetohydrodynamics
|
April 19, 2005
12:30-1:30
CSCAMM Library |
Open
|
April 26, 2005
12:30-1:30
CSCAMM Library |
Ian Frommer - Optimizing Transmission Network Layout using a Genetic Algorithm
Abstract:
In this talk I consider a variation of the Euclidean Steiner tree problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This problem is significant in many practical situations, such as laying cable transmission networks, where the cost for laying a cable can be highly dependent on the location and the nature of the area through which it is to be laid. I present a genetic-algorithm-based procedure and apply it to a variety of test cases of this problem. I show that this procedure is able to find optimal or near-optimal solutions in a small fraction of the time taken by an exact algorithm.
|
