Proposals
Below are some proposals for talks from the past (and current). By clicking on the ID number, more details are shown. By default, these are sorted chronologically (recent first) and by then by last name. The data can be sorted by alternate means by using the links at the top right, each allowing ascending or descending orders.
Displaying 61-80 of 471 results.
Sort by:
ID:
263
Year: 2009
Name: Bridgette Stevens
Institution: University of Northern Iowa
Subject area(s): Mathematics Education
Title of Talk: Mathematics Courses for Elementary Education Majors
Abstract: At the recent IMSEP Summit for math and science educators in August, it was discussed that mathematics educators should begin a dialogue regarding a set of core competencies (content) for teaching elementary mathematics in the state of Iowa. To in part meet that need, this is a working group session in which participants will discuss a variety of issues around the mathematics courses offered for prospective elementary mathematics teachers at Iowa
Year: 2009
Name: Bridgette Stevens
Institution: University of Northern Iowa
Subject area(s): Mathematics Education
Title of Talk: Mathematics Courses for Elementary Education Majors
Abstract: At the recent IMSEP Summit for math and science educators in August, it was discussed that mathematics educators should begin a dialogue regarding a set of core competencies (content) for teaching elementary mathematics in the state of Iowa. To in part meet that need, this is a working group session in which participants will discuss a variety of issues around the mathematics courses offered for prospective elementary mathematics teachers at Iowa
ID:
438
Year: 2016
Name: Meghan Stevens
Institution: Drake University
Subject area(s): Ordinary Differential Equations, Mathematical Biology, Global Dynamics
Title of Talk: Global Dynamics of a Breast Cancer Competition System
Abstract: In this talk I present a system of five ordinary differential equations to model the competition for space and resources between breast cancer cells and healthy cells. Included is the cancer stem cell hypothesis, which states that there exist proliferating cancer stem cells that repopulate non-proliferating tumor cells and can lead to tumor recurrence. These cancer stem cells exist in a smaller population, making them harder to detect. Additionally, the system contains an equation for the immune system in order to show how the body naturally defends itself from invading tumors. Finally, because the majority of breast cancer cells are estrogen-receptor positive, the role of excess estrogen in the body introduced through birth control in included. Estrogen increases the amount of cancer cells while hindering the effectiveness of the immune system. Its presence also increases the likelihood that healthy cells will mutate.Through stability analysis of sub-models in addition to the full model, states in which cancer is eradicated are found, as well as states in which cancer persists, given certain parameter values.
Year: 2016
Name: Meghan Stevens
Institution: Drake University
Subject area(s): Ordinary Differential Equations, Mathematical Biology, Global Dynamics
Title of Talk: Global Dynamics of a Breast Cancer Competition System
Abstract: In this talk I present a system of five ordinary differential equations to model the competition for space and resources between breast cancer cells and healthy cells. Included is the cancer stem cell hypothesis, which states that there exist proliferating cancer stem cells that repopulate non-proliferating tumor cells and can lead to tumor recurrence. These cancer stem cells exist in a smaller population, making them harder to detect. Additionally, the system contains an equation for the immune system in order to show how the body naturally defends itself from invading tumors. Finally, because the majority of breast cancer cells are estrogen-receptor positive, the role of excess estrogen in the body introduced through birth control in included. Estrogen increases the amount of cancer cells while hindering the effectiveness of the immune system. Its presence also increases the likelihood that healthy cells will mutate.Through stability analysis of sub-models in addition to the full model, states in which cancer is eradicated are found, as well as states in which cancer persists, given certain parameter values.
ID:
286
Year: 2010
Name: Jitka Stehnova
Institution: Mt. Mercy College
Subject area(s): Number Theory, Representation Theory
Title of Talk: Representation Theory
Abstract: In this talk, we first give an introduction to the representation theory of p-adic groups. We will then focus on the subset of unitary groups, specifically U(1,1) and U(2) and show a process of parametrization of irreducible admissible supercuspidal representations.
Year: 2010
Name: Jitka Stehnova
Institution: Mt. Mercy College
Subject area(s): Number Theory, Representation Theory
Title of Talk: Representation Theory
Abstract: In this talk, we first give an introduction to the representation theory of p-adic groups. We will then focus on the subset of unitary groups, specifically U(1,1) and U(2) and show a process of parametrization of irreducible admissible supercuspidal representations.
ID:
325
Year: 2012
Name: Jitka Stehnova
Institution: Mt. Mercy University
Subject area(s): Grants for Math
Title of Talk: Pi Day, STEM MNOS and ExploreU@MMU
Abstract: Last year, our department was able to secure funding for several different events and programs supporting mathematics on various levels. In this talk, I will talk about these programs, funding opportunities and grant writing.
Year: 2012
Name: Jitka Stehnova
Institution: Mt. Mercy University
Subject area(s): Grants for Math
Title of Talk: Pi Day, STEM MNOS and ExploreU@MMU
Abstract: Last year, our department was able to secure funding for several different events and programs supporting mathematics on various levels. In this talk, I will talk about these programs, funding opportunities and grant writing.
ID:
517
Year: 2018
Name: Chris Spicer
Institution: Morningside College
Subject area(s):
Title of Talk: On Sheldon Primes
Abstract: In a 2015 MAA Math Horizons article, the authors introduced the concept of a Sheldon prime, based on a conversation between several characters in the CBS sitcom The Big Bang Theory. The authors left open whether or not any number other than 73 satisfied the specific properties. Recent work has proven that it is in fact unique. We will introduce Sheldon primes and the number theory behind them, and demonstrate its uniqueness.
Year: 2018
Name: Chris Spicer
Institution: Morningside College
Subject area(s):
Title of Talk: On Sheldon Primes
Abstract: In a 2015 MAA Math Horizons article, the authors introduced the concept of a Sheldon prime, based on a conversation between several characters in the CBS sitcom The Big Bang Theory. The authors left open whether or not any number other than 73 satisfied the specific properties. Recent work has proven that it is in fact unique. We will introduce Sheldon primes and the number theory behind them, and demonstrate its uniqueness.
ID:
329
Year: 2012
Name: Chris Spicer
Institution: Morningside College
Subject area(s): Combinatorics
Title of Talk: 2-Color Rado Numbers
Abstract: Rado numbers are a branch of Combinatorics and are closely related to Ramsey numbers. In this talk, after discussing some of the historical work done on this topic, we will completely determine the 2-color Rado numbers for equations of a certain form.
Year: 2012
Name: Chris Spicer
Institution: Morningside College
Subject area(s): Combinatorics
Title of Talk: 2-Color Rado Numbers
Abstract: Rado numbers are a branch of Combinatorics and are closely related to Ramsey numbers. In this talk, after discussing some of the historical work done on this topic, we will completely determine the 2-color Rado numbers for equations of a certain form.
ID:
394
Year: 2014
Name: Chris Spicer
Institution: Morningside College
Subject area(s): graph theory
Title of Talk: Cops and Robbers on Oriented Graphs
Abstract: Cops and Robbers is a turn-based game traditionally played on graphs. In this talk, we extend this game to oriented graphs. Although a complete characterization of 1-cop-win graphs is known, there is not yet a corresponding characterization for oriented graphs. Necessary conditions are described for an oriented graph to be 1-cop-win, and several results are provided toward finding sufficient conditions.
Year: 2014
Name: Chris Spicer
Institution: Morningside College
Subject area(s): graph theory
Title of Talk: Cops and Robbers on Oriented Graphs
Abstract: Cops and Robbers is a turn-based game traditionally played on graphs. In this talk, we extend this game to oriented graphs. Although a complete characterization of 1-cop-win graphs is known, there is not yet a corresponding characterization for oriented graphs. Necessary conditions are described for an oriented graph to be 1-cop-win, and several results are provided toward finding sufficient conditions.
ID:
448
Year: 2016
Name: Chris Spicer
Institution: Morningside College
Subject area(s): combinatorics, math education
Title of Talk: Extreme Wild Card Poker, or, Engaging Women in Undergraduate Research
Abstract: The first half of this talk will describe a research project completed with 3 undergraduate students last year involving poker played with wild cards. We find the minimum number of wild cards needed to ensure five-of-a-kind is the most common hand. The second half will discuss preliminary results regarding engaging more women in undergraduate mathematics research.
Year: 2016
Name: Chris Spicer
Institution: Morningside College
Subject area(s): combinatorics, math education
Title of Talk: Extreme Wild Card Poker, or, Engaging Women in Undergraduate Research
Abstract: The first half of this talk will describe a research project completed with 3 undergraduate students last year involving poker played with wild cards. We find the minimum number of wild cards needed to ensure five-of-a-kind is the most common hand. The second half will discuss preliminary results regarding engaging more women in undergraduate mathematics research.
ID:
50
Year: 2004
Name: Rick Spellerberg
Institution: Simpson College
Subject area(s): Game Theory
Title of Talk: The Sequence Prediction Game
Abstract: This talk will center on a review of a paper that appeared in the International Journal of Game Theory authored by David Blackwell who is a member of the statistics department at the University of California at Berkeley. In his paper, Blackwell considered the problem of predicting the short-term future behavior of a sequence, after observing it as long as you please, so as to achieve a specified reliability against all possible sequences. In particular, predicting when in a sequence of 0
Year: 2004
Name: Rick Spellerberg
Institution: Simpson College
Subject area(s): Game Theory
Title of Talk: The Sequence Prediction Game
Abstract: This talk will center on a review of a paper that appeared in the International Journal of Game Theory authored by David Blackwell who is a member of the statistics department at the University of California at Berkeley. In his paper, Blackwell considered the problem of predicting the short-term future behavior of a sequence, after observing it as long as you please, so as to achieve a specified reliability against all possible sequences. In particular, predicting when in a sequence of 0
ID:
74
Year: 2004
Name: Rick Spellerberg
Institution: Simpson College
Subject area(s):
Title of Talk: Capstone Course In Mathematics. Components For Success.
Abstract: In the fall of 1998, the Simpson College Mathematics Department started offering a capstone course in mathematics called Senior Seminar. This talk will focus on the evolution of this course and what has taken place that has made this course the success it is today.
Year: 2004
Name: Rick Spellerberg
Institution: Simpson College
Subject area(s):
Title of Talk: Capstone Course In Mathematics. Components For Success.
Abstract: In the fall of 1998, the Simpson College Mathematics Department started offering a capstone course in mathematics called Senior Seminar. This talk will focus on the evolution of this course and what has taken place that has made this course the success it is today.
ID:
335
Year: 2012
Name: Rick Spellerberg
Institution: Simpson College
Subject area(s):
Title of Talk: Sabbatical Leave, the Perfect Time to Mentor Undergraduates in Research.
Abstract: During my previous and now current sabbatical I have involved undergraduates in my research activities. I included my intentions in my sabbatical applications and this fact I firmly believe strengthened my proposals. This talk will focus on the strategies I have employed in involving students in my work and the subsequent outcomes.
Year: 2012
Name: Rick Spellerberg
Institution: Simpson College
Subject area(s):
Title of Talk: Sabbatical Leave, the Perfect Time to Mentor Undergraduates in Research.
Abstract: During my previous and now current sabbatical I have involved undergraduates in my research activities. I included my intentions in my sabbatical applications and this fact I firmly believe strengthened my proposals. This talk will focus on the strategies I have employed in involving students in my work and the subsequent outcomes.
ID:
127
Year: 2005
Name: Rick Spellerberg
Institution: Simpson College
Subject area(s):
Title of Talk: The Evolution of Cooperation
Abstract: This talk will present some of the basic concepts of Evolutionary Game Theory as we discuss models related to the evolution of cooperation. This talk should be of special interest to students or faculty interested in undergraduate research in mathematics. Included will be a preview of a few of the student presentations related to the topic that will be presented at the second annual Midwest Undergraduate Mathematics Symposium held at Simpson College April 9th.
Year: 2005
Name: Rick Spellerberg
Institution: Simpson College
Subject area(s):
Title of Talk: The Evolution of Cooperation
Abstract: This talk will present some of the basic concepts of Evolutionary Game Theory as we discuss models related to the evolution of cooperation. This talk should be of special interest to students or faculty interested in undergraduate research in mathematics. Included will be a preview of a few of the student presentations related to the topic that will be presented at the second annual Midwest Undergraduate Mathematics Symposium held at Simpson College April 9th.
ID:
169
Year: 2006
Name: Rick Spellerberg
Institution: Simpson College
Subject area(s): Biology / Mathematics
Title of Talk: Sperm Competition Games
Abstract: Sperm Competition occurs when ejaculates of multiple males compete to fertilize the eggs of one female. In this talk we will discuss the work of G.A. Parker in his paper; Sperm Competition: sneaks and extra-pair copulations. In this paper, Parker examines ejaculation strategies for cases when an opportunist male "steals" a mating with the female of a paired male.
Year: 2006
Name: Rick Spellerberg
Institution: Simpson College
Subject area(s): Biology / Mathematics
Title of Talk: Sperm Competition Games
Abstract: Sperm Competition occurs when ejaculates of multiple males compete to fertilize the eggs of one female. In this talk we will discuss the work of G.A. Parker in his paper; Sperm Competition: sneaks and extra-pair copulations. In this paper, Parker examines ejaculation strategies for cases when an opportunist male "steals" a mating with the female of a paired male.
ID:
47
Year: 2004
Name: Ronald Smith
Institution: Graceland College
Subject area(s): Algorithms
Title of Talk: The distribution of digits in consecutive integers
Abstract: The distribution of digits problem asks for the frequency of each digit (0
Year: 2004
Name: Ronald Smith
Institution: Graceland College
Subject area(s): Algorithms
Title of Talk: The distribution of digits in consecutive integers
Abstract: The distribution of digits problem asks for the frequency of each digit (0
ID:
313
Year: 2011
Name: Ronald Smith
Institution: Graceland University
Subject area(s): Introductory Complex Analysis
Title of Talk: Just Plane Numbers
Abstract: The vocabulary of a typical introduction to complex numbers challenges the beginner with a bewildering array of words with strong connotations of "imaginary," "complex," and "non-real." By combining a geometric approach to complex arithmetic found in Roger Penrose's book "The Road to Reality" with the interactive geometry package, Geogebra, we show that it is possible and even insightful to characterize these as just plane numbers.
Year: 2011
Name: Ronald Smith
Institution: Graceland University
Subject area(s): Introductory Complex Analysis
Title of Talk: Just Plane Numbers
Abstract: The vocabulary of a typical introduction to complex numbers challenges the beginner with a bewildering array of words with strong connotations of "imaginary," "complex," and "non-real." By combining a geometric approach to complex arithmetic found in Roger Penrose's book "The Road to Reality" with the interactive geometry package, Geogebra, we show that it is possible and even insightful to characterize these as just plane numbers.
ID:
355
Year: 2013
Name: Ronald Smith
Institution: Graceland University
Subject area(s): algorithms
Title of Talk: Beautiful Strings
Abstract: Let S and T be strings. S is more beautiful than T if (i) S is longer than T, or (ii) if S and T have the same length, then S > T lexicographically. S derives T, if T is a subsequence (not necessarily a substring) of S. T is unique if each character in T appears exactly once. The "Beautiful Strings Problem" is to find the most beautiful unique string that can be derived from a given string S. This problem appeared on the web and in at least one programming contest last year, with no correct solution known to this author. We give an efficient solution, showing the usefulness of a mathematical approach.
Year: 2013
Name: Ronald Smith
Institution: Graceland University
Subject area(s): algorithms
Title of Talk: Beautiful Strings
Abstract: Let S and T be strings. S is more beautiful than T if (i) S is longer than T, or (ii) if S and T have the same length, then S > T lexicographically. S derives T, if T is a subsequence (not necessarily a substring) of S. T is unique if each character in T appears exactly once. The "Beautiful Strings Problem" is to find the most beautiful unique string that can be derived from a given string S. This problem appeared on the web and in at least one programming contest last year, with no correct solution known to this author. We give an efficient solution, showing the usefulness of a mathematical approach.
ID:
128
Year: 2005
Name: Ronald Smith
Institution: Graceland University
Subject area(s): Voting
Title of Talk: The Mathematics of Common Consent
Abstract: Many religious traditions, including my own, value
Year: 2005
Name: Ronald Smith
Institution: Graceland University
Subject area(s): Voting
Title of Talk: The Mathematics of Common Consent
Abstract: Many religious traditions, including my own, value
ID:
389
Year: 2014
Name: Jason Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Inquiry Based Learning
Abstract: A discussion about the Inquiry Based Learning(IBL) Workshop I attended this summer as well as my experience using the IBL methods in Probability and Stochastic Processes. I will discuss some early successes and early failures in class. I will mention some of the research in support of IBL.
Year: 2014
Name: Jason Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Inquiry Based Learning
Abstract: A discussion about the Inquiry Based Learning(IBL) Workshop I attended this summer as well as my experience using the IBL methods in Probability and Stochastic Processes. I will discuss some early successes and early failures in class. I will mention some of the research in support of IBL.
ID:
449
Year: 2016
Name: Ronald Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Covering Cylinders
Abstract: We wil show how to design a cover to fit intersecting cylinders of different diameters. This is a real problem involving my neighbor's underground house.
Year: 2016
Name: Ronald Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Covering Cylinders
Abstract: We wil show how to design a cover to fit intersecting cylinders of different diameters. This is a real problem involving my neighbor's underground house.
ID:
194
Year: 2007
Name: Ronald Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Optimal arrangement of digits
Abstract: Problem: Arrange a sequence of mn positive digits into m n-digit numbers whose product is minimized or maximized. We show how to recognize optimal arrangements of digits, and give an efficient algorithm for finding solutions.
Year: 2007
Name: Ronald Smith
Institution: Graceland University
Subject area(s):
Title of Talk: Optimal arrangement of digits
Abstract: Problem: Arrange a sequence of mn positive digits into m n-digit numbers whose product is minimized or maximized. We show how to recognize optimal arrangements of digits, and give an efficient algorithm for finding solutions.