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 301-320 of 471 results.
Sort by:
ID:
520
Year: 2018
Name: Laura McCauley
Institution: Peru State College
Subject area(s): Graph Theory
Title of Talk: Spot It! with Combinatorics
Abstract: The game of Spot It! consists of 55 game cards, each card has 8 symbols, and each pair of cards has exactly one symbol in common. The idea is to 'spot' the match on your card before the other players 'spot' their match. There are many ways to approach the mathematics behind designing a game of Spot It!. Different fields of mathematics are considered and applied to the problem, ultimately resulting in a beautiful interconnectedness within concepts of Combinatorics.
Year: 2018
Name: Laura McCauley
Institution: Peru State College
Subject area(s): Graph Theory
Title of Talk: Spot It! with Combinatorics
Abstract: The game of Spot It! consists of 55 game cards, each card has 8 symbols, and each pair of cards has exactly one symbol in common. The idea is to 'spot' the match on your card before the other players 'spot' their match. There are many ways to approach the mathematics behind designing a game of Spot It!. Different fields of mathematics are considered and applied to the problem, ultimately resulting in a beautiful interconnectedness within concepts of Combinatorics.
ID:
122
Year: 2005
Name: Monica Meissen
Institution: Clarke College
Subject area(s):
Title of Talk: Factoring Trinomials with Less Struggling and More Success!
Abstract: This talk will publicize a surprisingly underutilized technique of factoring trinomials which is based on
Year: 2005
Name: Monica Meissen
Institution: Clarke College
Subject area(s):
Title of Talk: Factoring Trinomials with Less Struggling and More Success!
Abstract: This talk will publicize a surprisingly underutilized technique of factoring trinomials which is based on
ID:
243
Year: 2008
Name: Monica Meissen
Institution: Clarke College
Subject area(s):
Title of Talk: Using Artificial Intelligence in the Teaching of Algebra and Precalculus
Abstract: Clarke College has been using software developed by Hawkes Learning to teach their Elementary Algebra, Intermediate Algebra and Precalculus courses with great success, especially during the current academic year. In addition to giving a demonstration of the software, Monica will describe how using Hawkes' products has helped with student placement and success in the classroom.
Year: 2008
Name: Monica Meissen
Institution: Clarke College
Subject area(s):
Title of Talk: Using Artificial Intelligence in the Teaching of Algebra and Precalculus
Abstract: Clarke College has been using software developed by Hawkes Learning to teach their Elementary Algebra, Intermediate Algebra and Precalculus courses with great success, especially during the current academic year. In addition to giving a demonstration of the software, Monica will describe how using Hawkes' products has helped with student placement and success in the classroom.
ID:
111
Year: 2005
Name: Kristen Meyer
Institution: Iowa State University
Subject area(s): Cryptography
Title of Talk: Message Authentication Codes and Quasigroups
Abstract: Message Authentication Codes, or MACs, are commonly used cryptographic tools to ensure that a message has not been changed in transit. MACs can be constructed from a variety of mathematical structures and in a variety of ways. In this talk, I will describe a new MAC (called QMAC) which is based on the non-associativity of quasigroups. In order to obtain security against forgeries, quasigroups of large order must be used. I will also discuss how to create and represent such quasigroups.
Year: 2005
Name: Kristen Meyer
Institution: Iowa State University
Subject area(s): Cryptography
Title of Talk: Message Authentication Codes and Quasigroups
Abstract: Message Authentication Codes, or MACs, are commonly used cryptographic tools to ensure that a message has not been changed in transit. MACs can be constructed from a variety of mathematical structures and in a variety of ways. In this talk, I will describe a new MAC (called QMAC) which is based on the non-associativity of quasigroups. In order to obtain security against forgeries, quasigroups of large order must be used. I will also discuss how to create and represent such quasigroups.
ID:
412
Year: 2014
Name: Jonas Meyer
Institution: Loras College
Subject area(s): functional analysis, complex variables
Title of Talk: Interplay between function theory and Hilbert space
Abstract: Some classic results in Hilbert space theory are best described through the lens of functions of a complex variable, and vice versa. This survey talk will focus on some examples of that interplay, including how invariant subspaces of some operators on Hilbert space can be described using complex functions, and how Hilbert space theory can be used to prove results on interpolation with analytic functions.
Year: 2014
Name: Jonas Meyer
Institution: Loras College
Subject area(s): functional analysis, complex variables
Title of Talk: Interplay between function theory and Hilbert space
Abstract: Some classic results in Hilbert space theory are best described through the lens of functions of a complex variable, and vice versa. This survey talk will focus on some examples of that interplay, including how invariant subspaces of some operators on Hilbert space can be described using complex functions, and how Hilbert space theory can be used to prove results on interpolation with analytic functions.
ID:
425
Year: 2015
Name: Jonas Meyer
Institution: Loras College
Subject area(s): Education, Math problem solving, Networking
Title of Talk: Starting a Math Teachers' Circle in Dubuque
Abstract: Math Teachers' Circles are "professional communities centered on mathematics," in which professors and middle school math teachers come together to solve mathematics problems, discuss teaching, and more. The presenter worked with colleagues in Dubuque to start a Math Teachers' Circle this year. He'll provide an overview of what MTCs are, then discuss our Circle, including what we've done so far, our hopes for the near future, and examples of some of the problems and activities we've done.
Year: 2015
Name: Jonas Meyer
Institution: Loras College
Subject area(s): Education, Math problem solving, Networking
Title of Talk: Starting a Math Teachers' Circle in Dubuque
Abstract: Math Teachers' Circles are "professional communities centered on mathematics," in which professors and middle school math teachers come together to solve mathematics problems, discuss teaching, and more. The presenter worked with colleagues in Dubuque to start a Math Teachers' Circle this year. He'll provide an overview of what MTCs are, then discuss our Circle, including what we've done so far, our hopes for the near future, and examples of some of the problems and activities we've done.
ID:
211
Year: 2007
Name: Rana Mikkelson
Institution: Iowa State University
Subject area(s):
Title of Talk: An Introduction to Minimum Rank of a Graph
Abstract: Given a graph, we can associate a set of matrices therewith: the set of all symmetric matrices A over R where aij = 0 ? G has an edge between vertex i and j . We define the minimum rank of a graph is then the minimum among the ranks of all the matrices in this set. There is no one easy formula for computing this value given any graph, but for certain types graphs we can find the minimum rank exactly, and for others we can at least determine a few bounds. This talk introduces the topic and begins to explore the known results.
Year: 2007
Name: Rana Mikkelson
Institution: Iowa State University
Subject area(s):
Title of Talk: An Introduction to Minimum Rank of a Graph
Abstract: Given a graph, we can associate a set of matrices therewith: the set of all symmetric matrices A over R where aij = 0 ? G has an edge between vertex i and j . We define the minimum rank of a graph is then the minimum among the ranks of all the matrices in this set. There is no one easy formula for computing this value given any graph, but for certain types graphs we can find the minimum rank exactly, and for others we can at least determine a few bounds. This talk introduces the topic and begins to explore the known results.
ID:
514
Year: 2018
Name: Brittney Miller
Institution: Coe College
Subject area(s):
Title of Talk: Using Playdough and 3D Prints to Visualize Volumes
Abstract: Using two-dimensional images to visualize three-dimensional objects can be challenging. Instead, playdough and 3D prints can help us better understand different shapes and their cross sections. Let’s have some fun with these physical representations of objects to more clearly illustrate and help our students learn how to, for example, set up volume integrals.
Year: 2018
Name: Brittney Miller
Institution: Coe College
Subject area(s):
Title of Talk: Using Playdough and 3D Prints to Visualize Volumes
Abstract: Using two-dimensional images to visualize three-dimensional objects can be challenging. Instead, playdough and 3D prints can help us better understand different shapes and their cross sections. Let’s have some fun with these physical representations of objects to more clearly illustrate and help our students learn how to, for example, set up volume integrals.
ID:
264
Year: 2009
Name: Catherine Miller and Megan Balong
Institution: University of Northern Iowa
Subject area(s): Mathematics Education
Title of Talk: An overview of Mathematics in the Iowa Core Curriculum
Abstract: Information about the Iowa Core Curriculum's mathematics component will be shared. Focus will be on the grades 9-12 component as it is to be implemented in Iowa classrooms first. We will also discuss some ways in which the Iowa Core Curriculum may affect college mathematics curriculum and instruction.
Year: 2009
Name: Catherine Miller and Megan Balong
Institution: University of Northern Iowa
Subject area(s): Mathematics Education
Title of Talk: An overview of Mathematics in the Iowa Core Curriculum
Abstract: Information about the Iowa Core Curriculum's mathematics component will be shared. Focus will be on the grades 9-12 component as it is to be implemented in Iowa classrooms first. We will also discuss some ways in which the Iowa Core Curriculum may affect college mathematics curriculum and instruction.
ID:
143
Year: 2006
Name: Mark Mills
Institution: Central College
Subject area(s):
Title of Talk: Using NASCAR to Illustrate Optimization
Abstract: Over the past several years, the authors have taken part in a Fantasy NASCAR league. For each race, we were required to
Year: 2006
Name: Mark Mills
Institution: Central College
Subject area(s):
Title of Talk: Using NASCAR to Illustrate Optimization
Abstract: Over the past several years, the authors have taken part in a Fantasy NASCAR league. For each race, we were required to
ID:
191
Year: 2007
Name: Mark Mills
Institution: Central College
Subject area(s):
Title of Talk: What I did on my sabbatical: Experiencing the "real world"
Abstract: In an effort to gain some "real world" experience with mathematics and statistics during my sabbatical this year, I have been working at a local windows manufacturer doing a number of things that involve mathematical and statistical thinking. This talk will describe some of the things I have been doing, as well as some of the things I have learned through the experience. I will also discuss how I went about setting-up this experience, how I think my employer perceives my experiences, and how I expect this to be something that lasts beyond this year.
Year: 2007
Name: Mark Mills
Institution: Central College
Subject area(s):
Title of Talk: What I did on my sabbatical: Experiencing the "real world"
Abstract: In an effort to gain some "real world" experience with mathematics and statistics during my sabbatical this year, I have been working at a local windows manufacturer doing a number of things that involve mathematical and statistical thinking. This talk will describe some of the things I have been doing, as well as some of the things I have learned through the experience. I will also discuss how I went about setting-up this experience, how I think my employer perceives my experiences, and how I expect this to be something that lasts beyond this year.
ID:
199
Year: 2007
Name: Mark Mills
Institution: Central College
Subject area(s):
Title of Talk: An algorithm for creating "equal" regions
Abstract: This talk will discuss an algorithm that is still in development. The goal of the algorithm is to take a large area that has been broken up into counties and use some quantifiable information for each county (e.g., population) to create a given number of geographically compact regions having relatively equal quantities. The speaker will discuss the evolution of the algorithm from first being a greedy algorithm to now being what you might call an "altruistic" algorithm.
Year: 2007
Name: Mark Mills
Institution: Central College
Subject area(s):
Title of Talk: An algorithm for creating "equal" regions
Abstract: This talk will discuss an algorithm that is still in development. The goal of the algorithm is to take a large area that has been broken up into counties and use some quantifiable information for each county (e.g., population) to create a given number of geographically compact regions having relatively equal quantities. The speaker will discuss the evolution of the algorithm from first being a greedy algorithm to now being what you might call an "altruistic" algorithm.
ID:
351
Year: 2012
Name: Joseph Moen
Institution: Wartburg College
Subject area(s): Mathematical Immunology
Title of Talk: Development of Molecular Profiles to Predict Treatment Outcomes in Lymphoma Patients
Abstract: Lymphoma, a cancer which affects the immune system, is the fifth most common cancer in North America. Rituximab-based chemotherapy (R-CHOP) has become the standard recommended cancer-management course for this disease. Using previously collected data from a 2008 study conducted by Lenz G. Wright and publicly available from the National Center for Biotechnology Information, we used statistical methods to identify genetic characteristics associated with survival in R-CHOP treated patients. Univariate screening reduced the 54,000 recorded genes per patient into a manageable group which displayed strong possible correlation with overall survival. The resulting gene collection was partitioned into clusters of related genes and then scored using principal components. Then, a multivariate Cox-Regression model of these principal components was developed to best predict survival in Lymphoma patients. The resulting model can be used to help identify genetic characteristics of patients who are less likely to respond to current therapy and are potential targets for new drug development.
Year: 2012
Name: Joseph Moen
Institution: Wartburg College
Subject area(s): Mathematical Immunology
Title of Talk: Development of Molecular Profiles to Predict Treatment Outcomes in Lymphoma Patients
Abstract: Lymphoma, a cancer which affects the immune system, is the fifth most common cancer in North America. Rituximab-based chemotherapy (R-CHOP) has become the standard recommended cancer-management course for this disease. Using previously collected data from a 2008 study conducted by Lenz G. Wright and publicly available from the National Center for Biotechnology Information, we used statistical methods to identify genetic characteristics associated with survival in R-CHOP treated patients. Univariate screening reduced the 54,000 recorded genes per patient into a manageable group which displayed strong possible correlation with overall survival. The resulting gene collection was partitioned into clusters of related genes and then scored using principal components. Then, a multivariate Cox-Regression model of these principal components was developed to best predict survival in Lymphoma patients. The resulting model can be used to help identify genetic characteristics of patients who are less likely to respond to current therapy and are potential targets for new drug development.
ID:
301
Year: 2010
Name: Darin Mohr
Institution: University of Iowa
Subject area(s):
Title of Talk: The Iowa Mathematical Modeling Challenge: Modeling in an Experimental Learning Setting
Abstract: We discuss the recent success of the third annual Iowa Mathematical Modeling Challenge (IMMC). The IMMC is a twenty-four hour contest similar to COMAP's Mathematical Contest in Modeling, but with an added emphasis on student assessment and mathematical communication. We also discuss the future of the IMMC at the University of Iowa.
Year: 2010
Name: Darin Mohr
Institution: University of Iowa
Subject area(s):
Title of Talk: The Iowa Mathematical Modeling Challenge: Modeling in an Experimental Learning Setting
Abstract: We discuss the recent success of the third annual Iowa Mathematical Modeling Challenge (IMMC). The IMMC is a twenty-four hour contest similar to COMAP's Mathematical Contest in Modeling, but with an added emphasis on student assessment and mathematical communication. We also discuss the future of the IMMC at the University of Iowa.
ID:
358
Year: 2013
Name: Paul Muhly
Institution: University of Iowa
Subject area(s): pedagogy
Title of Talk: TeX in the Classroom
Abstract: In this talk I will advocate for and share my experiences when requiring students to write their homework in LaTeX. The experiences I have had when requiring students to TeX their homework have been surprisingly positive. I will explain what I have done and offer suggestions, especially suggestions about how to get students started using TeX.
Year: 2013
Name: Paul Muhly
Institution: University of Iowa
Subject area(s): pedagogy
Title of Talk: TeX in the Classroom
Abstract: In this talk I will advocate for and share my experiences when requiring students to write their homework in LaTeX. The experiences I have had when requiring students to TeX their homework have been surprisingly positive. I will explain what I have done and offer suggestions, especially suggestions about how to get students started using TeX.
ID:
476
Year: 2017
Name: Sabah Munir
Institution: Wartburg College
Subject area(s): Biostatistics
Title of Talk: Genetic Risk Factors for Preterm Birth
Abstract: Preterm birth, which affects 5-18% of pregnancies worldwide, occurs when an infant is born before 37 weeks of gestation. Studying the factors associated with preterm birth is important, for it is the leading cause of death in children under five years old. Besides many environmental factors, genetics also dictate the risk of preterm birth. This current research project is based upon the sequenced exomes of 93 pairs and 2 trios of sisters from Denmark who have a history of preterm birth. The goals of this project were to (1) develop gene burden tests to analyze the experimental data against the general population data obtained from the Exome Aggregation Consortium, (2) identify rare variants that may contribute to the risk of preterm birth, and (3) compare the two methods of statistical analysis that we developed. Gene burden tests collapse all variants on the same gene together, and then analyze each gene as a whole by determining the significance of its impact on preterm birth. Through R language, we developed a count-based method based on the Poisson distribution and a weighted version using the normal distribution. The genes producing the smallest p-values were examined further, which led to the identification of several promising variants to be studied more in future research.
Year: 2017
Name: Sabah Munir
Institution: Wartburg College
Subject area(s): Biostatistics
Title of Talk: Genetic Risk Factors for Preterm Birth
Abstract: Preterm birth, which affects 5-18% of pregnancies worldwide, occurs when an infant is born before 37 weeks of gestation. Studying the factors associated with preterm birth is important, for it is the leading cause of death in children under five years old. Besides many environmental factors, genetics also dictate the risk of preterm birth. This current research project is based upon the sequenced exomes of 93 pairs and 2 trios of sisters from Denmark who have a history of preterm birth. The goals of this project were to (1) develop gene burden tests to analyze the experimental data against the general population data obtained from the Exome Aggregation Consortium, (2) identify rare variants that may contribute to the risk of preterm birth, and (3) compare the two methods of statistical analysis that we developed. Gene burden tests collapse all variants on the same gene together, and then analyze each gene as a whole by determining the significance of its impact on preterm birth. Through R language, we developed a count-based method based on the Poisson distribution and a weighted version using the normal distribution. The genes producing the smallest p-values were examined further, which led to the identification of several promising variants to be studied more in future research.
ID:
212
Year: 2007
Name: Siu-Hung (Richard) Ng
Institution: Iowa State University
Subject area(s):
Title of Talk: Counting the number of solutions in a finite group
Abstract: The notion of Frobenius-Schur (FS)-indicators of a finite group representation has been developed for more than a century. These indicators can be obtained by counting the number of solutions x of the equation x^n=g in a finite group. Moreover, the second indicators can be used to construct topological invariants of surfaces. It was not known until recently that they are invariants of the tensor categories of finite group representations. In the talk, we will give a brief history of these indicators and their new developments.
Year: 2007
Name: Siu-Hung (Richard) Ng
Institution: Iowa State University
Subject area(s):
Title of Talk: Counting the number of solutions in a finite group
Abstract: The notion of Frobenius-Schur (FS)-indicators of a finite group representation has been developed for more than a century. These indicators can be obtained by counting the number of solutions x of the equation x^n=g in a finite group. Moreover, the second indicators can be used to construct topological invariants of surfaces. It was not known until recently that they are invariants of the tensor categories of finite group representations. In the talk, we will give a brief history of these indicators and their new developments.
ID:
481
Year: 2017
Name: Alex Nowak
Institution: Iowa State University
Subject area(s): quasigroups, universal algebra, design theory
Title of Talk: Semisymmetric quasigroups
Abstract: Specified by Latin squares, quasigroups, often referred to as the ``nonassociative groups," seem, on the surface at least, to be objects of strictly combinatorial interest. However, quasigroups may also be specified as type (2, 2, 2) algebras satisfying equational identities, thus forming a variety in the universal algebraic sense. After introducing quasigroups through basic definitions and examples, we'll move into a discussion of the class of semisymmetric quasigroups. This class provides some nice illustrations of the interplay between algebra, combinatorics (in particular, design theory), and geometry that is provoked by quasigroup theory.
Year: 2017
Name: Alex Nowak
Institution: Iowa State University
Subject area(s): quasigroups, universal algebra, design theory
Title of Talk: Semisymmetric quasigroups
Abstract: Specified by Latin squares, quasigroups, often referred to as the ``nonassociative groups," seem, on the surface at least, to be objects of strictly combinatorial interest. However, quasigroups may also be specified as type (2, 2, 2) algebras satisfying equational identities, thus forming a variety in the universal algebraic sense. After introducing quasigroups through basic definitions and examples, we'll move into a discussion of the class of semisymmetric quasigroups. This class provides some nice illustrations of the interplay between algebra, combinatorics (in particular, design theory), and geometry that is provoked by quasigroup theory.
ID:
482
Year: 2017
Name: Alex Nowak
Institution: Iowa State University
Subject area(s):
Title of Talk: Semisymmetric quasigroups
Abstract: Specified by Latin squares, quasigroups, often referred to as the ``nonassociative groups," seem, on the surface at least, to be objects of strictly combinatorial interest. However, quasigroups may also be specified as type (2, 2, 2) algebras satisfying equational identities, thus forming a variety in the universal algebraic sense. After introducing quasigroups through basic definitions and examples, we'll move into a discussion of the class of semisymmetric quasigroups. This class provides some nice illustrations of the interplay between algebra, combinatorics (in particular, design theory), and geometry that is provoked by quasigroup theory.
Year: 2017
Name: Alex Nowak
Institution: Iowa State University
Subject area(s):
Title of Talk: Semisymmetric quasigroups
Abstract: Specified by Latin squares, quasigroups, often referred to as the ``nonassociative groups," seem, on the surface at least, to be objects of strictly combinatorial interest. However, quasigroups may also be specified as type (2, 2, 2) algebras satisfying equational identities, thus forming a variety in the universal algebraic sense. After introducing quasigroups through basic definitions and examples, we'll move into a discussion of the class of semisymmetric quasigroups. This class provides some nice illustrations of the interplay between algebra, combinatorics (in particular, design theory), and geometry that is provoked by quasigroup theory.
ID:
230
Year: 2008
Name: Greg Ongie
Institution: Coe College
Subject area(s): Analysis, Measure Theory, Orthogonal Polynomials
Title of Talk: Orthogonal Polynomials on the Cantor Set
Abstract: The middle-thirds Cantor set is an uncountable set of Lebesgue measure zero. The Cantor measure is defined such that it assigns the Cantor set measure one, and has the Cantor set as its support. An orthogonal polynomial sequence (OPS) is traditionally defined by means of Riemann integration, but more generally an OPS can be defined by means of integration with respect to a measure. First we construct the Cantor measure and show it satisfies the properties of a measure. Then, we verify the existence of an associated OPS by examining the positivity of its moment matrix. Finally, using the Gram-Schmidt method we construct the OPS, and derive various properties of the polynomials based on results for classical orthogonal polynomials.
Year: 2008
Name: Greg Ongie
Institution: Coe College
Subject area(s): Analysis, Measure Theory, Orthogonal Polynomials
Title of Talk: Orthogonal Polynomials on the Cantor Set
Abstract: The middle-thirds Cantor set is an uncountable set of Lebesgue measure zero. The Cantor measure is defined such that it assigns the Cantor set measure one, and has the Cantor set as its support. An orthogonal polynomial sequence (OPS) is traditionally defined by means of Riemann integration, but more generally an OPS can be defined by means of integration with respect to a measure. First we construct the Cantor measure and show it satisfies the properties of a measure. Then, we verify the existence of an associated OPS by examining the positivity of its moment matrix. Finally, using the Gram-Schmidt method we construct the OPS, and derive various properties of the polynomials based on results for classical orthogonal polynomials.