|
 |
2004-2005
Academic Year Colloquium Schedule |
|
August 26, 2004
| Title |
Hippocrates and the Quadrature of the Lune |
| Speaker |
John Stoughton
Professor of Mathematics
Hope College
Holland, MI |
| Abstract |
The problem of squaring the circle (i.e., given a circle, can we construct, with
straightedge and compass alone, a square with EXACTLY the same area?) is one of
the oldest in mathematics. It was proposed sometime before 440 BC (the time of
Hippocrates) and was not solved until 1882. Hippocrates came very close to
showing that it could be done and his work led some of the world's best
mathematicians to believe that it could. (It can't.) In this talk, we examine
Hippocrates' work and discuss why it took over 2300 years from his time for the
problem to be solved. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
August 26, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
September 2, 2004
| Title |
Time's Arrows |
| Speaker |
Ronald Fintushel
University Distinguished Professor of Mathematics
Michigan State University
Lansing, MI |
| Abstract |
I will discuss a simple combinatorial problem related to
clocks and describe how to solve it by using the topology of Riemann
surfaces. This talk should be accessible to any student who has had
calculus. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
September 2, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
September 9, 2004
| Title |
Do Dogs Know Calculus? |
| Speaker |
Tim Pennings
Professor of Mathematics
Hope College
Holland, MI |
| Abstract |
A standard calculus modeling problem is to find the quickest path from
a point on shore to a point in a lake, given that running speed is greater than
swimming speed. Elvis, my Welsh Corgi, has never had a calculus course. But
when we play "fetch" on the shore of Lake Michigan, he appears to choose paths
close to the optimal one. In this talk we reveal what was found when we
experimentally tested this ability. Elvis will be available for follow-up
questions.
|
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
September 9, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
September 16, 2004
| Title |
Study Abroad Opportunities in Russia |
| Speaker |
Darren E. Mason
Assistant Professor of Mathematics
Albion College
Albion, MI |
| Abstract |
Albion College students have a new opportunity to study
mathematics, engineering, education, and Russian culture in Russia during
the summer. This option is part of a multi-institution program involving
Albion College, Michigan State University, and Northwestern Michigan College.
Participating students first visit St. Petersburg and Moscow for several days of tourism, and then continue
on to study in Volgograd (formerly Stalingrad) for four weeks. This
image-intensive talk will not only focus on the sightseeing and academic components of this
novel program, but also on student adaptation to the cultural challenges of living in contemporary Russian society. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
September 16, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
September 23, 2004
| Title |
Mathematics and Materials Science |
| Speaker |
Peter Bates
Professor and Chair of Mathematics
Michigan State University
East Lansing, MI |
| Abstract |
Starting
with some fundamental assumptions about the nature of materials, we will
formulate laws governing the evolution of material states (such as differing
phases, local magnetic orientation, etc.). These laws become equations of
evolution. We will then try to determine the qualitative behavior of solutions
or look at special wave-like solutions and in so doing generate good mathematics
and (I hope) good science. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
September 23, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
September 30, 2004
| Title |
The Oak Ridge Science Semester Program |
| Speaker |
Daniel Gibson
Professor of Physics and
Director of the Oak Ridge Science Semester
Denison University
Granville, OH |
| Abstract |
The Oak Ridge Science Semester is an undergraduate study
and research program based at Oak Ridge National Laboratory in Oak Ridge, TN.
This nationally recognized fall-semester program directly involves undergraduate students
in the ongoing research projects of practicing biologists, chemists, computer
scientists, mathematicians, and physicists. Recent student research areas
include complex biological systems, engineering, environmental science, high
performance computing, physical and chemical sciences, and national security.
Participating students receive academic credit in their field. To offset costs, students
also receive a monthly stipend and housing allowance. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
September 30, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
October 7, 2004
| Title |
It's my party, and I'll cry if I want to (you would cry
too if you missed this introduction to Ramsey Theory...) |
| Speaker |
Giovanni Dimatteo
Junior Mathematics Major - Track I
Deparment of Mathematics and Computer Science
Albion College
Albion, MI |
| Abstract |
Ramsey theory is the study of the structures on a
mathematical object that are preserved under partitions. In
this talk, we'll examine the Party problem, solve it, and
discuss generalizations, closing up with Ramsey's theorem. An
example of the party problem asks, `how many people must you
invite to your party to ensure that there exists a group of 4
mutual friends or a group of 4 mutual strangers.' Applications to
computer science and other fields will be discussed, along with
the statement of several research problems on which undergraduates
are capable of making progress. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
October 7, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
October 15, 2004
| Title |
Phosphorus Contamination in Lake Sediments: Model and Solution |
| Speaker |
Gilbert N. Lewis
Associate Professor
Department of Mathematics
Michigan Technological University
Houghton, MI |
| Abstract |
Phosphorus is a contaminant that can enter a lake due to
natural or human activity (effluent from a wastewater treatment plant,
non-point runoff from farmlands, etc.). Once in the lake, it may enter the
sediments at the bottom of the lake, where it is stored and becomes available
as a further source of contamination to the lake waters. In this study, we
model the deposition of phosphorus in the solid phase to lake sediments, the
subsequent conversion (diagenesis) to a liquid form, and the diffusion of the
liquid phase phosphorus back into the lake water. We develop a system of two
partial differential equations involving two dependent variables (solid and
liquid phosphorus concentrations) and two independent variables (time and depth
in the sediment). We then show the numerical solution of the system and compare
it with observed data. The ultimate goal is to be able to accurately predict
future rates of release of phosphorus from the lake sediments if restrictions
are placed on the level of human input to the system. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
October 15, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
October 21, 2004
| Title |
Transformations in Software Development |
| Speaker |
Erik Eid
Systems Architect
NSF International
B.A. in Computational Mathematics - 1995
Albion College |
| Abstract |
An Albion College alum returns to present an overview of his
almost-nine-year career in software development and how both his concept of
programming and he as a whole has been changed. He will then discuss two
challenges encountered during that career, one regarding rewriting an
application for multiple languages and platforms, and one regarding the
conversion of data from legacy systems. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
October 21, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
October 28, 2004
| Title |
Beauty at the Extreme: The Hunt for Extremal Graphs |
| Speaker |
Jason Williford
Visiting Assistant Professor of Mathematics
Albion College |
| Abstract |
In this talk we will explore the relatively young field of
Extremal Graph Theory. One of the first results in this field answers
the following question: how many edges can a graph with n vertices
have if it has no complete graph of size k as a subgraph? Since the
solution of this problem in the 1940's there have been many
generalizations; however overall little is known. One of the main
reasons for the lack of knowledge stems from the fact that graphs
with certain properties are often hard to construct. Examples of
certain known constructions will be given, and possibilities for
undergraduate research projects will be discussed. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
October 28, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
November 4, 2004
| Title |
Eine Kleine Bottle Musing |
| Speaker |
Robert Messer
Associate Professor of Mathematics and Computer Science
Albion College
Albion, Michigan |
| Abstract |
We will see how the intuitive idea of a surface
can be modeled as a mathematical concept. This will enable us
to recognize when two surfaces are essentially the same, and we will
be able to distinguish between surfaces that are different.
Our primary goal is to understand the glass Klein bottle on our trophy
for first place in the 2004 Lower Michigan Mathematics Competition.
Albion College students interested in further information about surfaces
are invited to take Math 389, Topics in Topology, next spring. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
November 4, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
November 11, 2004
| Title |
Face Detection / Recognition |
| Speaker |
George Stockman
Professor of Computer Science
Michigan State University
East Lansing, MI |
| Abstract |
We are assessing the use of a 3D sensor for
recognition or authentication of persons. Curvatures of the sensed surface
are analyzed in order to detect eyes, nose and mouth. Then
the sensed scan is compared to stored models using the L2
norm, iteratively improving over small changes in location
and orientation of the face scan relative to the stored model.
For authentication, the sensed scan is matched only to the
one model stated to be the person; for recognition, the system
must find best matches from a set of possibilities -- e.g. all
MWA customers, or all workers in the plant. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
November 11, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
November 18, 2004
| Title |
Material Surface Energy and the Kaczmarz Algorithm |
| Speaker |
Darren E. Mason
Assistant Professor of Mathematics
Albion College
Albion, MI |
| Abstract |
A problem in contemporary materials science is determining how the
energy of an interface in a material (such as aluminum) depends on the
orientation of the surface in space. A powerful computational approach has
been developed that uses vast amounts of experimental data to understand the
functional form of such a boundary energy. A critical step in
this technique is the consideration of a large system of inconsistent linear
equations. Since the absence of a solution to such a system is likely the
result of experimental noise, an approximate solution is instead sought.
In 1937 a relatively unknown Polish mathematician, Stefan Kaczmarz, developed an
iterative projection algorithm that yields an "optimal solution" to just such a
system. This iterative scheme, as well as its influence on the
aforementioned problem, will be discussed. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
November 18, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
December 2, 2004
| Title |
Three Cool Linear Algebra Applications from the Sciences |
| Speaker |
Mark Hanisch
Associate Professor of Mathematics
Calvin College
Grand Rapids, MI |
| Abstract |
Polling recent mathematics graduates might lead one
to conclude that Markov processes, curve fitting, and
systems of ODEs are the main applications for linear
algebra. But thanks to the simplicity of linear models,
one does not have to look hard to find solutions to many
other applied problems that employ linear algebra in a
significant way. In this talk I will outline three more
science problems, the physics of spinning objects,
"dimensional analysis", and the spectroscopic examination
of chemical solutions, for which fundamental ideas from
linear algebra provide amazing clarity. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
December 2, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
December 9, 2004
| Title |
Sharing Work is a Full-Time Job |
| Speaker |
Quentin F. Stout
Professor of Computer Science and Engineering
Director - Center for Parallel Computing
Co-Director - Center for Space Environment Modeling
The University of Michigan
Ann Arbor, MI |
| Abstract |
Parallel programs, using many processors to solve a single
task, should balance the computational load among
the processors. While there are often simple ways to do this,
a significant number of applications require nontrivial
approaches in order to achieve reasonable efficiency. As the
number of applications increases, it seems that the number of
new load-balancing variations needed is never ending. This
talk will illustrate some approaches to load balancing,
motivated by problems where load balancing was an important
component of our work. These problems range from theoretical
algorithms to large-scale scientific simulations utilizing
over a thousand processors. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
December 9, 2004
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
January 11, 2005
| Title |
1, 2, 3... Counting Integer Partitions |
| Speaker |
Tina Garrett
Visiting Assistant Professor
Department of Mathematics and Computer Science
Carleton College
Northfield, MN |
| Abstract |
Everyone knows how to factor a positive integer into
primes. But how many ways can we break up a positive integer into a sum
of smaller integers? This is one of the most basic questions in Partition
Theory. In this talk we will cover the basics of partition theory,
examine some of the classical theorems and proofs using ferrers shapes and
generating functions and discuss some interesting open problems. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
January 11, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
January 13, 2005
| Title |
Group Actions on Curves |
| Speaker |
Darren B. Glass
VIGRE/Ritt Assistant Professor
Department of Mathematics
Columbia University
New York, NY |
| Abstract |
Algebraic Geometry is the study of curves which are defined by polynomial
equations. Some of these curves have special properties, such as the
existence of a group action on the curve. These group actions correspond
to nice symmetries in the curve, and are useful in calculating certain
invariants. This talk will define all of these terms, and give many
examples of such actions. In particular, we will look at the elliptic
curves which were recently made famous in the proof of Fermat's Last
Theorem, and generalizations such as the hyperelliptic and superelliptic
curves. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
January 13, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
January 14, 2005
| Title |
Partitions of Graphs by Complete Bipartite Subgraphs |
| Speaker |
Valerie Watts
Assistant Professor
School of Mathematics and Statistics
Carleton University
Ottawa, Ontario, Canada |
| Abstract |
In a 1971 paper, Graham and Pollak proposed an addressing scheme
for networks. The addresses consisted of n-tuples of 0's, 1's, and d's.
The Hamming distance between two such n-tuples is the number of
places where one n-tuple has a 0 and the other a 1. The addresses
were assigned to the vertices of a network so that the distance between any
two vertices equals the Hamming distance of their corresponding addresses.
Graham and Pollak were interested in finding the minimum n necessary
to address a network in this fashion. In fact, Graham and Pollack's addressing
scheme is equivalent to a partition of the edges of the associated distance
graph of the network with complete bipartite subgraphs, also known as
bicliques. In this talk, we will examine partitions of the edges of a graph
by bicliques. A known lower bound on the minimum number of bicliques needed
in such a partition will be given. This lower bound is the minimum number
of positive and negative eigenvalues of the adjacency matrix of the graph.
We will also discuss necessary conditions for equality in this bound. Finally,
we will consider fractional biclique partitions, which are given by the linear
relaxation of the (0,1)-integer program that defines the biclique partition. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
January 14, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
January 20, 2005
| Title |
Anonymous Credentials with Biometrically-Enforced Non-Transferability:
Designing Hand Stamps for the Digital World |
| Speaker |
Sara Miner More
Faculty Fellow Professor
School of Computer Science and Engineering
University of California - San Diego |
| Abstract |
Digital non-transferable anonymous credentials allow individuals in a
particular group to remain anonymous while demonstrating group membership.
An analogous credential in the real world is a hand stamp one might
obtain upon entering an establishment that serves alcohol, after
demonstrating that he is of legal drinking age. The individual later uses
his stamp to prove to the bartender that he is old enough to purchase
alcohol, but the stamp alone does not reveal the individual's identity.
Furthermore, this credential cannot be transferred to a different
individual. In this talk, we address the challenges of achieving this type of
credential in the digital world, and present a solution based on
cryptography and secure hardware. No prior knowledge of cryptography or
security is required. This talk describes joint work with Russell
Impagliazzo from UCSD. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
January 20, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
January 31, 2005
| Title |
The Physics of Hard Problems |
| Speaker |
Harold Connamacher
Doctoral Candidate
Department of Computer Science
University of Toronto |
| Abstract |
A large number of problems we deal with in computer
science are considered hard. One such problem is the Satisfiability
Problem (SAT). Despite years of work, no one has developed
algorithms for SAT that can solve all possible instances in a
reasonable amount of time. In fact, most researchers do not believe
any such algorithm exists. In practice, SAT-solvers are either
complete solvers that always solve the problem and sometimes run in
a reasonable amount of time or incomplete solvers that always run
in a reasonable amount of time and sometimes solve the problem.
Recently, a group of physicists have applied techniques of
statistical mechanics to problems such as SAT to gain more
insight into why the problems are hard. As part of their work,
they have proposed a new algorithm called Survey Propagation
that seems to work better than other current incomplete solvers.
This talk will highlight the current state of the research and
expose reasons why this new algorithm works well and reasons
why it may fail in some important situations.
|
| Time |
5:10 PM |
| Location |
Norris 109 |
| |
Flyer |
January 31, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
February 3, 2005
| Title |
Off-Campus Programs in Mathematics and Computer Science |
| Speaker |
David Reimann
Associate Professor
and
Darren E. Mason
Assistant Professor
and
Mr. William Green
Senior Mathematics and Physics Major
Department of Mathematics and Computer Science
Albion College
Albion, MI
|
| Abstract |
Have you ever wondered if you can study
mathematics and/or computer science off-campus?
Either during the summer or during the academic year? Each
year a number of high-quality academic opportunities are available
to Albion College students. Options include research/study internships
at
- academic institutions both within the United States (Mount Holyoke College,
Williams College, University of Minnesota - Duluth, etc.) and abroad
(England, Hungary, etc.)
- numerous federal government
agencies (NASA, NSA, etc.)
- a number of government scientific laboratories
(Oak Ridge, Los Alamos, etc.).
In this presentation we will tour a new portion of the Albion College Math/CS
website that illustrates these various opportunities as well as provide advice
on how to apply, deadlines, etc. Our own Will Green will also talk about his recent
off-campus experience at Argonne National Laboratory as well as his experience in
applying for graduate school. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
February 3, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
February 10, 2005
| Title |
Sums-of-Squares Formulas |
| Speaker |
Daniel Isaksen
Assistant Professor
Department of Mathematics
Wayne State University
Detroit, MI |
| Abstract |
Consider the polynomial identity (x12 +
x22 )(y12 + y22)
= (x1y1 - x2y2)2
+ (x1y2 + x2y1)2
This formula might be generalized as
(x12 + ... + xr2
)(y12 + ... + ys2)
= z12 + ... + zn2
where each zi is "bilinear" in the x's and
y's in the sense that it is a sum of monomials of the form c
(xi yk). These
identities are relevant to questions about normed algebras, embeddings of
topological spaces, and linear algebra.
We'll find a few examples of such identities, but the problem of finding this
type of identity is extremely difficult. It turns out to be easier to show
that identities cannot exist under certain circumstances. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
February 10, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
February 17, 2005
| Title |
The Millennium Problems - Part I |
| Speaker |
John Torrence Tate, Jr. (Virtual)
Sid W. Richardson Foundation Regents Chair
Department of Mathematics
University of Texas
Austin, TX |
| Abstract |
At the beginning of the new millennium the
Clay Mathematics Institute (CMI)
of Cambridge, Massachusetts, named seven Millennium Prize Problems which, if solved,
would earn the solver $1,000,000! To officially present these problems to the
world, on May 24,
2000, the CMI held the Millennium Meeting at the College de France in Paris. The timing and
location
of this conference was influenced by David Hilbert's address on August 8, 1900, to the
2nd International Congress of Mathematicians in Paris, which resulted
in the now famous Hilbert Problems.
In this colloquium
we will show a video presentation of a lecture given by Professor John Torrence Tate, Jr., (a student of the
famous algebraist
Emil Artin) at the Millennium Meeting. The problems
discussed by Dr. Tate are the Riemann Hypothesis, the Birch and Swinnerton-Dyer Conjecture, and the
P vs. NP problem.
A question and answer period with Albion College faculty will follow the video presentation. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
February 17, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
February 24, 2005
| Title |
The Millennium Problems - Part II |
| Speaker |
Sir Michael Atiyah (Virtual)
Honorary Professor of Mathematics
University of Edinburgh
Edinburgh, Scotland |
| Abstract |
At the beginning of the new millennium the
Clay Mathematics Institute (CMI)
of Cambridge, Massachusetts, named seven Millennium Prize Problems which, if solved,
would earn the solver $1,000,000! To officially present these problems to the
world, on May 24,
2000, the CMI held the Millennium Meeting at the College de France in Paris. The timing and
location
of this conference was influenced by David Hilbert's address on August 8, 1900, to the
2nd International Congress of Mathematicians in Paris, which resulted
in the now famous
Hilbert Problems.
In this colloquium
we will show a video presentation of a lecture given by Sir Michael Atiyah (a
recipient of the
Fields
Medal in 1966) at the Millennium Meeting. The problems
discussed by Professor Atiyah are the Poincare Conjecture, the Hodge
Conjecture, the Quantum Yang-Mills Problem, and the Navier-Stokes Problem.
A question and answer period with Albion College faculty will follow the video presentation. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
February 24, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
March 3, 2005
| Title |
Game Theory: The Nobel Prizes |
| Speaker |
Daniel Christiansen
Professor and Chair of Economics and Management
Albion College
Albion, MI |
| Abstract |
An outline of the study of game theory, focusing on the contributions
of the winners of the 1994 Nobel Prize in Economics -- John Nash, Reinhard Selton,
and John Harsanyi. In particular, we look at the concepts of Nash equilibrium,
subgame-perfect Nash equilbrium, and Bayesian Nash equilibrium. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
March 3, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
March 17, 2005
| Title |
Using Electronic Textbooks to Foster Active Reading Habits |
| Speaker |
Ryan McFall
Assistant Professor of Computer Science
Hope College
Holland, MI |
| Abstract |
Electronic textbooks are an enticing idea. Most publishers tout digital
media as a cheaper and more portable textbook. Unfortunately, the
electronic textbook models that have been proposed too often seek to mimic
the paper textbook, perhaps adding search capabilities or touting the
possibility of interactive animations and activities. These electronic
textbooks fail to take full advantage of the pedagogical opportunities that
a digital medium provides.
This talk will outline the design goals and features of an electronic
textbook application designed at Hope College with the goal of extending,
rather than simply mimicking, a traditional textbook. In particular, we
will discuss how an electronic textbook can be used to bring the idea of
collaborative learning into the textbook reading experience, and how such a
textbook can be used to facilitate change in the way the classroom
experience is conducted. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
March 17, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
March 24, 2005
| Title |
Patent Citation Networks |
| Speaker |
Jan Tobochnik
Professor of Physics and Computer Science
Dow Distinguished Professor of Natural Science
Kalamazoo College
Kalamazoo, MI |
| Abstract |
Patent applications contain citations which are similar to but different
from those found in published scientific papers. In particular, patent
citations are governed by legal rules. Moreover, a large fraction of
citations are made not by the patent inventor, but by a patent examiner
during the application procedure. Using a patent database which
contains the patent citations, assignees and inventors, we have applied
network analysis and built network models. After giving a brief overview
of recent developments in network theory, I will discuss our latest
results on patent citation networks. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
March 24, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
March 31, 2005
| Title |
Bioinformatics at Hope College |
| Speaker |
Matt DeJongh
Assistant Professor of Computer Science
and
Aaron Best
Assistant Professor of Biology
Hope College
Holland, MI |
| Abstract |
Bioinformatics is an emerging field that seeks to apply the tools and
techniques of computer science to the management and analysis of biological
data. Because of the explosive growth in this field and related careers
over the last decade, many undergraduate institutions have recognized the
need for incorporating bioinformatics into the undergraduate curriculum.
Getting started on this task is difficult because of the requirement of
interdisciplinary cooperation among computer scientists, biologists,
chemists and other scientists.
In this talk we will give an introduction to bioinformatics from our
perspectives as a computer scientist and a microbiologist. We will describe
an introductory course in bioinformatics that we have developed for computer
science and biology students. Finally, we will discuss an interdisciplinary
research project that we are conducting with undergraduate students at Hope
College.
|
| Time |
4:10 PM |
| Location |
Olin 232 |
| |
Flyer |
March 31, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
April 7, 2005
| Title |
Fuzzy Logic Control Systems |
| Speaker |
Mr. William Green
Mathematics and Physics Major
Albion College
Albion, MI
|
| Abstract |
This past summer I worked at the Division of Mathematics and Computer
Science at Argonne National Lab. on the NEESGrid Project. NEESGrid is an
attempt to connect the work of earthquake engineers to allow large scale, remote
simulations and calculations. My specific work focused on designing control
systems for instrumentation using Fuzzy Logic. The basics of Fuzzy Logic as
well as its uses will be discussed. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
April 7, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
April 28, 2005
| Title |
Simulating and Visualizing Supercell Thunderstorms |
| Speaker |
Leigh Orf
Assistant Professor Of Atmospheric Science
Department of Geography
Central Michigan University
|
| Abstract |
Supercell thunderstorms are intense, long-lived rotating thunderstorms
which rumble across the heartland of the United States every spring.
Because supercells produce the strongest tornadoes, their behavior is
a focus of active research. Meteorologists have yet to answer such
fundamental questions such as: How do tornadoes form within a supercell?
Why do some supercells produce devastating tornadoes while other do not
produce a tornado at all? The two primary approaches to this problem
are observation (including storm chasing) and numerical modeling. I am
taking the modeling approach to investigate the internal workings of
supercells. In this talk I will present an overview of the predictive
mathematical equations which describe the behavior of the atmosphere,
how 3D atmospheric models work (with some discussion of parallel
processing), and the challenges of taking terabytes of binary model
data and visualizing it in a human-intuitive way. |
| Time |
4:10 PM |
| Location |
Norris 109 |
| |
Flyer |
April 28, 2005
| Title |
TBA |
| Speaker |
TBA |
| Abstract |
TBA |
| Time |
TBA |
| Location |
TBA |
| |
Flyer |
|
|
|
|
