|
This page contains a list of Mathematics and
Computer Science seminars for the current semester.
Links to previous semesters can be found at the
bottom of the page.
Fall 2005
Algebra
Seminar
Analysis Seminar
Computer
Science Seminar
Topology-Geometry
Seminar
Algebra
Seminar
Thursdays, 2:00 - 3:00 in Ritter Hall 220
| DATE |
SPEAKER |
TITLE |
Thu
Sep 8
|
Darrin Speegle
|
"A redundant version
of the Rado-Horn Theorem"
|
Abstract:
The Rado-Horn Theorem gives a characterization of
those sets of vectors which can be written as the union of
a fixed number of linearly independent sets. In this
talk, we discuss the redundant case. We show that the
span of the vectors can be written as the direct sum of a subspace
which directly fails the Rado-Horn criteria and a subspace
for which the Rado-Horn criteria hold. As a corollary, we
characterize those sets of vectors which, after the deletion
of a fixed number of vectors, can be written as the finite
union of a fixed number of linearly independent sets. This
is joint work with P. Casazza and G. Kutyniok.
Preprints of
the paper are available at http://euler.slu.edu/Dept/Faculty/speegled/research.html
Note: The department plans to
stream the algebra seminar live across the internet
(as a test for future use). Information is available
on the web page http://sylow.slu.edu/broadcasts/computer.html
|
Thu
Sep 15
|
Greg Marks
|
"A counterexample in
annelidan rings."
|
Thu
Sep 22
|
Greg Marks
|
"A counterexample in annelidan
rings. Part II. "
|
Thu
Sep 29
|
Jim Riles
|
"Finitely presented soluble
groups"
|
Abstract:
Jim Riles will lead our continuing workshop "Finitely
presented soluble groups," following an exposition by R.
Strebel, which highlights a theory of geometric invariants
that determine the structure of finitely generated groups in
certain varieties.
This talk
will be largely self-contained, independent of prior
talks in this series.
|
Thu
Oct 6
|
Jim Riles
|
Workshop: "Finitely presented
soluble groups,"
|
Abstract: Continuing
our workshop "Finitely presented soluble groups," following
an exposition by R. Strebel, which highlights a theory of geometric invariants
that determine the structure of finitely generated groups
in certain varieties.
|
Thu
Oct 13
|
Julianne Rainbolt
|
Weyl groups and Coxeter
elements
|
Abstract:
This talk will define and describe the Weyl group of a
finite group of Lie type. The standard example when G=GL(n,q)
will be discussed as well as the example when G=U(n,q). Included
will be an examination of some relationships between the Weyl
groups of GL(n,q) and U(n,q) including their Coxeter elements
|
Thu
Oct 20
|
Julianne Rainbolt
|
Weyl groups and Coxeter
elements. Cont'd
|
Thu
Oct 27
|
Julianne Rainbolt
|
Weyl groups and Coxeter
elements. Cont'd
|
Thu
Nov 3
|
Julianne Rainbolt
|
Weyl groups and Coxeter
elements. Cont'd
|
Thu
Nov 10
|
Jim Riles
|
"Finitely presented soluble
groups"
|
Abstract:
Jim Riles will lead our continuing workshop "Finitely
presented soluble groups," following an exposition by R.
Strebel, which highlights a theory of geometric invariants
that determine the structure of finitely generated groups in
certain varieties.
|
Thu
Nov 17
|
Jim Riles
|
"Finitely presented soluble
groups"
|
Abstract:
Jim Riles will lead our continuing workshop "Finitely
presented soluble groups," following an exposition by R.
Strebel, which highlights a theory of geometric invariants
that determine the structure of finitely generated groups in
certain varieties.
|
Thu
Dec 1
|
Jim Riles
|
"Finitely presented soluble
groups"
|
Abstract:
Jim Riles will lead our continuing workshop "Finitely
presented soluble groups," following an exposition by R.
Strebel, which highlights a theory of geometric invariants
that determine the structure of finitely generated groups in
certain varieties.
|
Thu
Dec 8
|
Jim Riles
|
"Finitely presented soluble
groups"
|
Abstract:
Jim Riles will lead our continuing workshop "Finitely
presented soluble groups," following an exposition by R.
Strebel, which highlights a theory of geometric invariants
that determine the structure of finitely generated groups in
certain varieties.
|
|
|
|
Abstract:
|
Analysis Seminar
Tuesdays, 3:00 - 3:50 in Ritter Hall 202
| DATE |
SPEAKER
|
TITLE |
Fri
Oct7
|
Kasso Okoudjou
of Cornell University
|
"On some Fourier multipliers
for modulation spaces"
|
Special Time: 2:30-3:30 pm MDDH 1016
Abstract: In this talk,
I will use some time-frequency analysis techniques to study
the continuity propeprties of a class of Fourier multipliers
on the modulation spaces. In particular, I will consider Fourier
multipliers related to certain evolution equations, and which
are known to be unbounded on Lebesgue spaces.
|
Tue
Oct 11
|
Darrin Speegle
|
"Harmonic Analysis
in Phase Space"
|
Abstract:
We will begin the year with a workshop on Folland's book
"Harmonic Analysis in Phase Space"; the presenter for the first
two meetings will be Darrin Speegle.
|
Tue
Oct 18
|
Darrin Speegle
|
"Harmonic Analysis
in Phase Space"
|
Special Time: 2:00
- 2:50
Abstract: A workshop on Folland's book "Harmonic
Analysis in Phase Space". Continued from last week.
|
Tue
Nov 1
|
Darrin Speegle
|
"Harmonic Analysis
in Phase Space"
|
Abstract: A workshop
on Folland's book "Harmonic Analysis in Phase Space".
Continued from last time.
|
Tue
Nov 8
|
Darrin Speegle
|
"Harmonic Analysis
in Phase Space"
|
Abstract: A workshop
on Folland's book "Harmonic Analysis in Phase Space".
Continued from last time.
|
Tue
Dec 6
|
Darrin Speegle
|
"Harmonic Analysis
in Phase Space"
|
Abstract: A workshop
on Folland's book "Harmonic Analysis in Phase Space".
Continued from last time.
|
Computer Science Seminar
Mondays, 3:00 - 3:50 in Ritter Hall 202
| DATE |
SPEAKER |
TITLE |
Mon
Oct 17
|
Jason Fritz
|
"A Meta-Learning Framework
for Improving Segmentation Evaluation"
|
Abstract: Object segmentation
is a fundamental early step in many target recognition systems.
A good segmentation of the object(s) from the optical image
or sensor data greatly increases recognition accuracy. Many
image segmentation methods have been used, but there is still
no satisfactory means for measuring the effectiveness of these various
methods. The lack of a good evaluation measure makes it hard to compare
different segmentation methods, or even different parameterizations
of a single method, thus hindering further improvements in the
accuracy of recognition systems.
It is well known that evaluating
the effectiveness of object segmentation is a hard problem.
Oftentimes, segmentation effectiveness is judged solely
on the recognition rate of the imaging system, which is inaccurate
because the performance of the segmentation itself is not necessarily
directly correlated with overall system performance. A few
standalone evaluation methods have been
proposed, but these techniques examine different fundamental
criteria, or examine the same criteria in varying ways. Consequently,
these methods work well in some cases, but poorly in the others.
Using machine learning methods,
we can determine the circumstances under which the various
metrics perform well versus when they perform poorly, and thereby
leverage the appropriate evaluators’ quality measures to achieve
reliable evaluation results. Consequently, we propose a meta-learning
framework for segmentation evaluation, in which different effectiveness
measures judge the segmentation performance according to their
various criteria, and then a meta-learner coalesces the results
to generate an overall effectiveness score based on the image characteristics.
This co-evaluation framework is being targeted for dual-use, so segmentation
evaluation results will be presented across a variety of single-
and multi-spectral images in both the military and commercial domains.
|
Mon
Nov 21
|
Mark Pedigo
|
An Online Scheduling Algorithm
for Non-Preemptive, Equal-Length Jobs Using Two Identical Machines
|
Abstract: We present
an online algorithm which schedules non-preemptive, equal length jobs using
two identical machines. Our goal is to maximize the number of jobs which can
be scheduled by their deadlines. Each job has an arbitrary release date and
deadline, which is revealed to the scheduler only upon its release time. We
analyze this algorithm by comparing its results to an optimal offline schedule.
In this way, we show that the algorithm is 3/2 competitive.
|
Mon
Nov 28
|
Bryan Clair
|
"The Microsoft security
workshop for academia"
|
Abstract: I'll be talking
about things I learned at the Microsoft security workshop for academia. I'll
demonstrate some common security vulnerabilities (including SQL injection
and Cross Site Scripting). I'll also talk about how Microsoft is attempting
to deal with these issues.
|
Topology- Geometry Seminar
Fridays, 11:00 - 11:50 in Ritter Hall 316
| DATE |
SPEAKER |
TITLE |
Thu
Sep 15
|
Bryan Clair
|
Optimal strategies
in sports betting pools. Part
I
|
Special Time: 3:45-4:45
p.m. RH 316
Abstract: Every
fall, millions of Americans enter betting pools to pick
winners of the weekly NFL football games. In the spring,
NCAA tournament basketball pools are even more popular. In both
cases, teams which are popularly perceived as “favorites”
gain a disproportionate share of entries. In large
pools there can be a significant advantage to picking
upsets that differentiate your picks from the crowd.
In this talk I will
present a probability model of betting pools that
incorporates pool participant behavior. From the model,
one can derive strategies that maximize the expected return
on a bet in both football and tournament style pools. This talk
will focus on football pools, which involve a collection of independent
outcomes.
|
Thu
Sep 22
|
Bryan Clair
|
Optimal strategies
in sports betting pools. Part
II
|
Special Time: 3:45-4:45
p.m. RH 316
Abstract: A
continuation of last week. This talk will focus on
basketball pools, which involve a collection of independent
outcomes.
|
Fri
Sep 30
|
David Letscher
|
Deciding if a
manifold is hyperbolic.
|
Fri
Oct 7
|
David Letscher
|
Deciding if a manifold
is hyperbolic.
|
Fri Nov 11
|
Anneke Bart
|
A note on stamping
|
Abstract:
Joint work with Kevin Scannell: Stamping was introduced
as a non-bending deformation. We show that this deformation as given in
the example is actually a sum of bends on three totally geodesic surfaces.
The first talk will provide an overview of the pertinent definitions and
theory.
|
Tue Nov 15
|
Adam Coffmann
IU - Purdue Fort Wayne
|
Unfolding CR Singularities
|
|
Note: Special time
Tuesday 4pm
Abstract: A notion of unfolding,
or multi-parameter deformation, of CR singularities of real submanifolds
in complex manifolds is proposed.
|
Fri Nov 18
|
Anneke Bart
|
A note on stamping, Cont'd
|
Abstract:
Joint work with Kevin Scannell: A continuation of last
week's talk.
|
|