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 81-100 of 471 results.
Sort by:
ID:
490
Year: 2017
Name: Deanna Haunsperger
Institution: Carleton College
Subject area(s):
Title of Talk: Does Your Vote Count?
Abstract: Are you frustrated that your candidate never wins? Does it seem like your vote doesn’t count? Maybe it doesn’t. Or at least not as much as the voting method with which you choose to tally the votes. Together we’ll take a glimpse into the important, interesting, paradoxical world of the mathematics behind tallying elections.
Year: 2017
Name: Deanna Haunsperger
Institution: Carleton College
Subject area(s):
Title of Talk: Does Your Vote Count?
Abstract: Are you frustrated that your candidate never wins? Does it seem like your vote doesn’t count? Maybe it doesn’t. Or at least not as much as the voting method with which you choose to tally the votes. Together we’ll take a glimpse into the important, interesting, paradoxical world of the mathematics behind tallying elections.
ID:
489
Year: 2017
Name: Deanna Haunsperger
Institution: Carleton College
Subject area(s):
Title of Talk: A Glimpse at the Horizon
Abstract: What do a square-wheeled bicycle, a 17th-century French painting, and the Indiana legislature all have in common? They appear among the many bright stars on the mathematical horizon, or, um, in Math Horizons. Math Horizons, the undergraduate magazine started by the MAA in 1994, publishes articles to introduce students to the world of mathematics outside the classroom. Some of mathematics’ best expositors have written for MH over the years; here is an idiosyncratic tour of the first ten years of Horizons.
Year: 2017
Name: Deanna Haunsperger
Institution: Carleton College
Subject area(s):
Title of Talk: A Glimpse at the Horizon
Abstract: What do a square-wheeled bicycle, a 17th-century French painting, and the Indiana legislature all have in common? They appear among the many bright stars on the mathematical horizon, or, um, in Math Horizons. Math Horizons, the undergraduate magazine started by the MAA in 1994, publishes articles to introduce students to the world of mathematics outside the classroom. Some of mathematics’ best expositors have written for MH over the years; here is an idiosyncratic tour of the first ten years of Horizons.
ID:
488
Year: 2017
Name: Jacob Heidenreich
Institution: Loras College
Subject area(s): teaching college math
Title of Talk: Using Games in the Classroom
Abstract: In this talk, Dr. Heidenreich will demonstrate several games he's developed to teach various mathematical concepts. The games investigate the ideas of increasing and decreasing functions, concavity, asymptotes and limits, and would be suitable for College Algebra through Calculus I. Electronic versions of the games will be share with any attendee interested.
Year: 2017
Name: Jacob Heidenreich
Institution: Loras College
Subject area(s): teaching college math
Title of Talk: Using Games in the Classroom
Abstract: In this talk, Dr. Heidenreich will demonstrate several games he's developed to teach various mathematical concepts. The games investigate the ideas of increasing and decreasing functions, concavity, asymptotes and limits, and would be suitable for College Algebra through Calculus I. Electronic versions of the games will be share with any attendee interested.
ID:
487
Year: 2017
Name: Jacob Heidenreich
Institution: Loras College
Subject area(s): teaching college math
Title of Talk: Using Games in the Classroom
Abstract: In this talk, Dr. Heidenreich will be presenting several games he's developed to teach various concepts in his classroom. Included would be games usable in College Algebra, Pre-Calculus, and Calculus, involving the concepts of increasing and decreasing, concave up and concave down, limits and asymptotes. Attendees can get electronic versions of all the games shared at this talk.
Year: 2017
Name: Jacob Heidenreich
Institution: Loras College
Subject area(s): teaching college math
Title of Talk: Using Games in the Classroom
Abstract: In this talk, Dr. Heidenreich will be presenting several games he's developed to teach various concepts in his classroom. Included would be games usable in College Algebra, Pre-Calculus, and Calculus, involving the concepts of increasing and decreasing, concave up and concave down, limits and asymptotes. Attendees can get electronic versions of all the games shared at this talk.
ID:
486
Year: 2017
Name: Jong Hoon Bae
Institution: Grinnell College
Subject area(s):
Title of Talk: Cauldron: An IDE for Modular Development of Chemical Reaction Networks
Abstract: Chemical reaction networks (CRNs) are widely used in the physical sciences to model reactions between molecules, and they are closely related to Petri nets and population protocols. Although the CRN model is equivalent in power to modern programming languages, it does not naturally support important software engineering principles such as abstraction and reuse. As a result, CRNs are challenging to debug, verify, extend, reuse, and maintain. In this talk we introduce Cauldron, an integrated development environment (IDE) for modular CRN development. Cauldron supports three new CRN design methods introduced by Klinge, Lathrop, and Lutz in 2016: (1) Input/output CRNs, (2) closed-sub CRNS, and (3) extension operators. I/O CRNs extend the CRN model to allow receiving external input signals. A closed sub-CRN encapsulates a behavior within an existing CRN in a way that is self-contained. Extension operators are used to automatically add functionality to a CRN without affecting its original behavior. By making these methods practical to developers, Cauldron naturally supports modular CRN design. For example, users can divide a CRN into independent sub-CRNs, test them separately, and reuse them in other CRNs. Furthermore, users can mark species as inputs and specify them with common elementary functions, by drawing a function, or by connecting them to another CRN. Many commonly used CRNs and extension operators are also included as libraries in Cauldron.
Year: 2017
Name: Jong Hoon Bae
Institution: Grinnell College
Subject area(s):
Title of Talk: Cauldron: An IDE for Modular Development of Chemical Reaction Networks
Abstract: Chemical reaction networks (CRNs) are widely used in the physical sciences to model reactions between molecules, and they are closely related to Petri nets and population protocols. Although the CRN model is equivalent in power to modern programming languages, it does not naturally support important software engineering principles such as abstraction and reuse. As a result, CRNs are challenging to debug, verify, extend, reuse, and maintain. In this talk we introduce Cauldron, an integrated development environment (IDE) for modular CRN development. Cauldron supports three new CRN design methods introduced by Klinge, Lathrop, and Lutz in 2016: (1) Input/output CRNs, (2) closed-sub CRNS, and (3) extension operators. I/O CRNs extend the CRN model to allow receiving external input signals. A closed sub-CRN encapsulates a behavior within an existing CRN in a way that is self-contained. Extension operators are used to automatically add functionality to a CRN without affecting its original behavior. By making these methods practical to developers, Cauldron naturally supports modular CRN design. For example, users can divide a CRN into independent sub-CRNs, test them separately, and reuse them in other CRNs. Furthermore, users can mark species as inputs and specify them with common elementary functions, by drawing a function, or by connecting them to another CRN. Many commonly used CRNs and extension operators are also included as libraries in Cauldron.
ID:
485
Year: 2017
Name: Jong Hoon Bae
Institution: Grinnell College
Subject area(s):
Title of Talk: Cauldron: An IDE for Modular Development of Chemical Reaction Networks
Abstract: Chemical reaction networks (CRNs) are widely used in the physical sciences to model reactions between molecules, and they are closely related to Petri nets and population protocols. Although the CRN model is equivalent in power to modern programming languages, it does not naturally support important software engineering principles such as abstraction and reuse. As a result, CRNs are challenging to debug, verify, extend, reuse, and maintain. In this talk we introduce Cauldron, an integrated development environment (IDE) for modular CRN development. Cauldron supports three new CRN design methods introduced by Klinge, Lathrop, and Lutz in 2016: (1) Input/output CRNs, (2) closed-sub CRNS, and (3) extension operators. I/O CRNs extend the CRN model to allow receiving external input signals. A closed sub-CRN encapsulates a behavior within an existing CRN in a way that is self-contained. Extension operators are used to automatically add functionality to a CRN without affecting its original behavior. By making these methods practical to developers, Cauldron naturally supports modular CRN design. For example, users can divide a CRN into independent sub-CRNs, test them separately, and reuse them in other CRNs. Furthermore, users can mark species as inputs and specify them with common elementary functions, by drawing a function, or by connecting them to another CRN. Many commonly used CRNs and extension operators are also included as libraries in Cauldron.
Year: 2017
Name: Jong Hoon Bae
Institution: Grinnell College
Subject area(s):
Title of Talk: Cauldron: An IDE for Modular Development of Chemical Reaction Networks
Abstract: Chemical reaction networks (CRNs) are widely used in the physical sciences to model reactions between molecules, and they are closely related to Petri nets and population protocols. Although the CRN model is equivalent in power to modern programming languages, it does not naturally support important software engineering principles such as abstraction and reuse. As a result, CRNs are challenging to debug, verify, extend, reuse, and maintain. In this talk we introduce Cauldron, an integrated development environment (IDE) for modular CRN development. Cauldron supports three new CRN design methods introduced by Klinge, Lathrop, and Lutz in 2016: (1) Input/output CRNs, (2) closed-sub CRNS, and (3) extension operators. I/O CRNs extend the CRN model to allow receiving external input signals. A closed sub-CRN encapsulates a behavior within an existing CRN in a way that is self-contained. Extension operators are used to automatically add functionality to a CRN without affecting its original behavior. By making these methods practical to developers, Cauldron naturally supports modular CRN design. For example, users can divide a CRN into independent sub-CRNs, test them separately, and reuse them in other CRNs. Furthermore, users can mark species as inputs and specify them with common elementary functions, by drawing a function, or by connecting them to another CRN. Many commonly used CRNs and extension operators are also included as libraries in Cauldron.
ID:
484
Year: 2017
Name: Angela Kohlhaas
Institution: Loras College
Subject area(s):
Title of Talk: Math in Art and Music Revised and Revisited
Abstract: Last January term, I taught Math in Art and Music for a second time. In this talk, I will share some of the revisions I made and some of my favorite projects from the course. Highlights include using GeoGebra for spatial reasoning, creating axiomatic art, and constructing musical fractal compositions.
Year: 2017
Name: Angela Kohlhaas
Institution: Loras College
Subject area(s):
Title of Talk: Math in Art and Music Revised and Revisited
Abstract: Last January term, I taught Math in Art and Music for a second time. In this talk, I will share some of the revisions I made and some of my favorite projects from the course. Highlights include using GeoGebra for spatial reasoning, creating axiomatic art, and constructing musical fractal compositions.
ID:
483
Year: 2017
Name: Matt Rissler
Institution: Loras College
Subject area(s): Linear Algebra, Sports Analytics, Computing
Title of Talk: Ranking teams, predicting outcomes, tuning parameters and getting stuck
Abstract: I have been ranking sports for the last couple years, using a combination of a Markov Chain for determining the quality of a win based on the margin of victory, and a Markov Chain for aggregating results across the network of games. From this information, I've started predicting the outcome of games, however, this raises an interesting eigenvector problem that I have yet to solve. In this talk, I'll describe my rankings, give some rankings/predictions, describe the problems I've run into, and describe the future plans for improving my rankings.
Year: 2017
Name: Matt Rissler
Institution: Loras College
Subject area(s): Linear Algebra, Sports Analytics, Computing
Title of Talk: Ranking teams, predicting outcomes, tuning parameters and getting stuck
Abstract: I have been ranking sports for the last couple years, using a combination of a Markov Chain for determining the quality of a win based on the margin of victory, and a Markov Chain for aggregating results across the network of games. From this information, I've started predicting the outcome of games, however, this raises an interesting eigenvector problem that I have yet to solve. In this talk, I'll describe my rankings, give some rankings/predictions, describe the problems I've run into, and describe the future plans for improving my rankings.
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:
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:
480
Year: 2017
Name: Robert Calcaterra
Institution: University of Wisconsin - Platteville
Subject area(s): real analysis
Title of Talk: Jordan's Proof of the Fundamental Theorem of Algebra
Abstract: The most common proofs of the Fundamental Theorem of Algebra rely on either Galois Theory or complex variables. This talk will present a proof of this theorem that primarily employs real analysis and DeMoivre's Theorem that appeared in Jordan's text from nineteenth century. Undergraduate mathematics majors who have had an undergraduate real analysis course should be able follow the talk.
Year: 2017
Name: Robert Calcaterra
Institution: University of Wisconsin - Platteville
Subject area(s): real analysis
Title of Talk: Jordan's Proof of the Fundamental Theorem of Algebra
Abstract: The most common proofs of the Fundamental Theorem of Algebra rely on either Galois Theory or complex variables. This talk will present a proof of this theorem that primarily employs real analysis and DeMoivre's Theorem that appeared in Jordan's text from nineteenth century. Undergraduate mathematics majors who have had an undergraduate real analysis course should be able follow the talk.
ID:
479
Year: 2017
Name: Jake Weber
Institution: University of Northern Iowa
Subject area(s):
Title of Talk: Exploration of Counter Examples of Balance Sets
Abstract: With large data sets, one might ask if substructure exists, and if so, how large should the data subset be in order to guarantee this substructure. We investigated data subsets of Zp × Zp which are on the boundary, just short of enough data to guarantee substructure, specifically categorizing the data subsets that don’t have substruc- ture. First by brute force checking, we determined the counter examples (graphs with no substructure) for Z5 × Z5. These exam- ples guided our search into Zp × Zp where p ≥ 7. From there, we proved there are four categories of counter examples that do not have a balanced subset in Zp × Zp.
Year: 2017
Name: Jake Weber
Institution: University of Northern Iowa
Subject area(s):
Title of Talk: Exploration of Counter Examples of Balance Sets
Abstract: With large data sets, one might ask if substructure exists, and if so, how large should the data subset be in order to guarantee this substructure. We investigated data subsets of Zp × Zp which are on the boundary, just short of enough data to guarantee substructure, specifically categorizing the data subsets that don’t have substruc- ture. First by brute force checking, we determined the counter examples (graphs with no substructure) for Z5 × Z5. These exam- ples guided our search into Zp × Zp where p ≥ 7. From there, we proved there are four categories of counter examples that do not have a balanced subset in Zp × Zp.
ID:
478
Year: 2017
Name: Diego Rojas
Institution: Iowa State University
Subject area(s): Computability Theory, Analysis
Title of Talk: Differentiation of Functions on the Cantor Space and Connections to Real-Valued Functions
Abstract: The notion of online functions of the Cantor space $2^{\mathbb{N}}$, and more generally, of continuous and of computable functions on $2^{\mathbb{N}}$, have been studied recently in connection with algorithmic randomness. In this talk, we present a notion of the derivative of functions on $2^{\mathbb{N}}$, and we establish some connections between functions and their derivatives on $2^{\mathbb{N}}$ and on $\mathbb{R}$, where we can represent real-valued functions as functions acting on the dyadic representation of real numbers. This is joint work with Douglas Cenzer.
Year: 2017
Name: Diego Rojas
Institution: Iowa State University
Subject area(s): Computability Theory, Analysis
Title of Talk: Differentiation of Functions on the Cantor Space and Connections to Real-Valued Functions
Abstract: The notion of online functions of the Cantor space $2^{\mathbb{N}}$, and more generally, of continuous and of computable functions on $2^{\mathbb{N}}$, have been studied recently in connection with algorithmic randomness. In this talk, we present a notion of the derivative of functions on $2^{\mathbb{N}}$, and we establish some connections between functions and their derivatives on $2^{\mathbb{N}}$ and on $\mathbb{R}$, where we can represent real-valued functions as functions acting on the dyadic representation of real numbers. This is joint work with Douglas Cenzer.
ID:
477
Year: 2017
Name: Theron Hitchman
Institution: University of Northern Iowa
Subject area(s): topology - knot theory
Title of Talk: A Naive Computational Approach to Bridge Index for Knots
Abstract: The bridge index of a knot is a classical geometric invariant introduced by Schubert in the 1930's. It is difficult to compute, in general. But a naive approach with pencil and paper will easily produce upper bounds. In this joint work with MA student Genevieve Johnson, we implement a version of this naive approach in Python, and compute the bridge index for all prime knots in Rolfsen's table with no more than 12 crossings.
Year: 2017
Name: Theron Hitchman
Institution: University of Northern Iowa
Subject area(s): topology - knot theory
Title of Talk: A Naive Computational Approach to Bridge Index for Knots
Abstract: The bridge index of a knot is a classical geometric invariant introduced by Schubert in the 1930's. It is difficult to compute, in general. But a naive approach with pencil and paper will easily produce upper bounds. In this joint work with MA student Genevieve Johnson, we implement a version of this naive approach in Python, and compute the bridge index for all prime knots in Rolfsen's table with no more than 12 crossings.
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:
475
Year: 2017
Name: Brian Birgen
Institution: Wartburg College
Subject area(s):
Title of Talk: What is Financial Math?
Abstract: One of the early Actuary Exams is titled Financial Math. What does that mean? What does that include? This talk will discuss the content covered on this exam.
Year: 2017
Name: Brian Birgen
Institution: Wartburg College
Subject area(s):
Title of Talk: What is Financial Math?
Abstract: One of the early Actuary Exams is titled Financial Math. What does that mean? What does that include? This talk will discuss the content covered on this exam.
ID:
474
Year: 2017
Name: Aqeeb Sabree
Institution: University of Iowa
Subject area(s): Advanced Calculus would be helpful
Title of Talk: Research Topics from Reproducing Kernel Hilbert Spaces
Abstract: Reproducing Kernel Hilbert Spaces (RKHS) have applications to statistics, machine learning, differential equations, and more. The goal of this presentation is to introduce the concept of a RKHS, and discuss it’s applications to many research areas. The amazing thing about this research area is that there are many research questions/topics for dissertations or undergraduate research experiences. I will give a brief history of RKHSs, highlighting where it has appeared and how it has been applied. Then I will present the theoretical foundation(s) of the subject; from here I will go into its applications. Below, you will find highlights of the theory that I will present, and some highlights of its application. You can discuss the existence of RKHSs in different ways: one, you can prove that the evaluation functional is bounded; or, two, you can prove that (given a Hilbert space) the Hilbert space has a reproducing kernel function. A nice property of the reproducing kernel is that it is unique. Thus, every RKHS has exactly one reproducing kernel; furthermore, every reproducing kernel is the reproducing kernel for a unique RKHS (Moore--Aronszajn). The process of recreating the RKHS from the kernel function is termed the it reconstruction problem, and is an interesting research area. The usefulness of the theory of RKHSs can be seen in the fact that the finite energy Fourier, Hankel, sine, and cosine transformed band-limited signals are specific realizations of the abstract reproducing kernel Hilbert space (RKHS). Sampling Theory: Sampling theory deals with the reconstruction of functions (or signals) from their values (or samples) on an appropriate set of points. When given a reproducing kernel Hilbert space, H; one asks: What are some (suitable) sets of points which reproduce (or interpolate) the full values of functions from H? And when given points in a set S, one asks: What are the RKHSs for which S is a complete set of sample points? Meaning the values of functions from H are reproduced by interpolation from S.
Year: 2017
Name: Aqeeb Sabree
Institution: University of Iowa
Subject area(s): Advanced Calculus would be helpful
Title of Talk: Research Topics from Reproducing Kernel Hilbert Spaces
Abstract: Reproducing Kernel Hilbert Spaces (RKHS) have applications to statistics, machine learning, differential equations, and more. The goal of this presentation is to introduce the concept of a RKHS, and discuss it’s applications to many research areas. The amazing thing about this research area is that there are many research questions/topics for dissertations or undergraduate research experiences. I will give a brief history of RKHSs, highlighting where it has appeared and how it has been applied. Then I will present the theoretical foundation(s) of the subject; from here I will go into its applications. Below, you will find highlights of the theory that I will present, and some highlights of its application. You can discuss the existence of RKHSs in different ways: one, you can prove that the evaluation functional is bounded; or, two, you can prove that (given a Hilbert space) the Hilbert space has a reproducing kernel function. A nice property of the reproducing kernel is that it is unique. Thus, every RKHS has exactly one reproducing kernel; furthermore, every reproducing kernel is the reproducing kernel for a unique RKHS (Moore--Aronszajn). The process of recreating the RKHS from the kernel function is termed the it reconstruction problem, and is an interesting research area. The usefulness of the theory of RKHSs can be seen in the fact that the finite energy Fourier, Hankel, sine, and cosine transformed band-limited signals are specific realizations of the abstract reproducing kernel Hilbert space (RKHS). Sampling Theory: Sampling theory deals with the reconstruction of functions (or signals) from their values (or samples) on an appropriate set of points. When given a reproducing kernel Hilbert space, H; one asks: What are some (suitable) sets of points which reproduce (or interpolate) the full values of functions from H? And when given points in a set S, one asks: What are the RKHSs for which S is a complete set of sample points? Meaning the values of functions from H are reproduced by interpolation from S.
ID:
473
Year: 2017
Name: Kevin Bombardier
Institution: University of Iowa
Subject area(s): cryptography, algebra, number theory
Title of Talk: Cryptography - Secure Communication
Abstract: Essential to our modern technological world, cryptography is the study of secure communication. In this talk we will discuss some of the basic ideas in cryptography, explain the differences between symmetric and asymmetric-key cryptosystems, and explore some basic examples of cryptosystems. As an illustration of the mathematics involved, we will do a simplified computational example by computing keys using the RSA algorithm. This talk will be self-contained; no prior knowledge of cryptography will be assumed.
Year: 2017
Name: Kevin Bombardier
Institution: University of Iowa
Subject area(s): cryptography, algebra, number theory
Title of Talk: Cryptography - Secure Communication
Abstract: Essential to our modern technological world, cryptography is the study of secure communication. In this talk we will discuss some of the basic ideas in cryptography, explain the differences between symmetric and asymmetric-key cryptosystems, and explore some basic examples of cryptosystems. As an illustration of the mathematics involved, we will do a simplified computational example by computing keys using the RSA algorithm. This talk will be self-contained; no prior knowledge of cryptography will be assumed.
ID:
472
Year: 2017
Name: Corissa Goertzen
Institution: University of Dubuque
Subject area(s):
Title of Talk: STEMulating Activities
Abstract: With the emphasis on STEM in the K-12 grades, colleges are stepping up to hold STEM related events. We will discuss the activities we have used at STEM festivals and how we encouraged college students to get involved. Time will allow for sharing of ideas.
Year: 2017
Name: Corissa Goertzen
Institution: University of Dubuque
Subject area(s):
Title of Talk: STEMulating Activities
Abstract: With the emphasis on STEM in the K-12 grades, colleges are stepping up to hold STEM related events. We will discuss the activities we have used at STEM festivals and how we encouraged college students to get involved. Time will allow for sharing of ideas.
ID:
471
Year: 2017
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: Mathfest and Beyond!
Abstract: In this talk, Dr. Matson will be sharing insights she picked up at Mathfest and welcome participants to also share teaching tidbits/professional advice they gleaned from attending Mathfest.
Year: 2017
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: Mathfest and Beyond!
Abstract: In this talk, Dr. Matson will be sharing insights she picked up at Mathfest and welcome participants to also share teaching tidbits/professional advice they gleaned from attending Mathfest.