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 141-160 of 471 results.
Sort by:
ID:
376
Year: 2014
Name: Kenneth Price
Institution: University of Wisconsin Oshkosh
Subject area(s):
Title of Talk: Arrowgrams: Tips and Pointers
Abstract: An arrowgram is a type of puzzle based on the transitive relation, directed graphs, and groups. To solve the puzzle a group element is assigned to each arrow of a directed graph. This is called a grading and the group element assigned to an arrow is called its grade. Grades for some arrows are given. The rest of the arrows are assigned grades using a rule which is based on transitivity. Arrowgrams also contain secret messages. The words are formed by pairs of letters which stand for the arrows. The puzzle is solved when every arrow is graded and the secret message is revealed. We answer some mathematical questions related to constructing and solving arrowgrams. How many arrows have to be given grades? Which arrows can be used? Can the same set of arrows be used for different groups?
Year: 2014
Name: Kenneth Price
Institution: University of Wisconsin Oshkosh
Subject area(s):
Title of Talk: Arrowgrams: Tips and Pointers
Abstract: An arrowgram is a type of puzzle based on the transitive relation, directed graphs, and groups. To solve the puzzle a group element is assigned to each arrow of a directed graph. This is called a grading and the group element assigned to an arrow is called its grade. Grades for some arrows are given. The rest of the arrows are assigned grades using a rule which is based on transitivity. Arrowgrams also contain secret messages. The words are formed by pairs of letters which stand for the arrows. The puzzle is solved when every arrow is graded and the secret message is revealed. We answer some mathematical questions related to constructing and solving arrowgrams. How many arrows have to be given grades? Which arrows can be used? Can the same set of arrows be used for different groups?
ID:
541
Year: 2019
Name: Christina Pospisil
Institution: University of Massachusetts Boston
Subject area(s):
Title of Talk: Generalization Theory for Linear Algebra I: An Embedding Algorithm and an appropriate Inverse for non-injective mappings in one dimension
Abstract: An algorithm for multiplying and adding matrices regardless of dimensions via an embedding is presented. An equivalent embedding for a general determinant theory is also investigated (Part I: Appropriate Inverses for non-injective mappings in one dimension are presented). In future work there will be applications to physics and other natural sciences be explored.
Year: 2019
Name: Christina Pospisil
Institution: University of Massachusetts Boston
Subject area(s):
Title of Talk: Generalization Theory for Linear Algebra I: An Embedding Algorithm and an appropriate Inverse for non-injective mappings in one dimension
Abstract: An algorithm for multiplying and adding matrices regardless of dimensions via an embedding is presented. An equivalent embedding for a general determinant theory is also investigated (Part I: Appropriate Inverses for non-injective mappings in one dimension are presented). In future work there will be applications to physics and other natural sciences be explored.
ID:
256
Year: 2009
Name: Donald Peterson
Institution: Iowa State University
Subject area(s): Encryption, Number Theory
Title of Talk: The 1/P Pseudo-Random Number Generator
Abstract: Seemingly suitable for encryption, the 1/P pseudo-random number generator quickly outputs a long, well-distributed sequence of digits from a small seed. However, without any prior knowledge of the seed, it can be determined and the sequence can be predicted both forwards and backwards by careful examination of 2|P| + 1 digits of the sequence. This article examines how to develop the generator, and more importantly given a small bit of any sequence, how to predict the remaining sequence.
Year: 2009
Name: Donald Peterson
Institution: Iowa State University
Subject area(s): Encryption, Number Theory
Title of Talk: The 1/P Pseudo-Random Number Generator
Abstract: Seemingly suitable for encryption, the 1/P pseudo-random number generator quickly outputs a long, well-distributed sequence of digits from a small seed. However, without any prior knowledge of the seed, it can be determined and the sequence can be predicted both forwards and backwards by careful examination of 2|P| + 1 digits of the sequence. This article examines how to develop the generator, and more importantly given a small bit of any sequence, how to predict the remaining sequence.
ID:
345
Year: 2012
Name: Ivars Peterson
Institution: MAA
Subject area(s): Mathematical Art & Geometry
Title of Talk: Geometreks
Abstract: Few people expect to encounter mathematics on a visit to an art gallery or even a walk down a city street (or across campus). When we explore the world around us with mathematics in mind, however, we see the many ways in which mathematics can manifest itself, in streetscapes, sculptures, paintings, architectural structures, and more. This illustrated presentation offers illuminating glimpses of mathematics, from Euclidean geometry and normal distributions to Riemann sums and M_bius strips, as seen in a variety of structures and artworks in Washington, D.C., Philadelphia, Toronto, Ottawa, Montreal, New Orleans, and many other locales.
Year: 2012
Name: Ivars Peterson
Institution: MAA
Subject area(s): Mathematical Art & Geometry
Title of Talk: Geometreks
Abstract: Few people expect to encounter mathematics on a visit to an art gallery or even a walk down a city street (or across campus). When we explore the world around us with mathematics in mind, however, we see the many ways in which mathematics can manifest itself, in streetscapes, sculptures, paintings, architectural structures, and more. This illustrated presentation offers illuminating glimpses of mathematics, from Euclidean geometry and normal distributions to Riemann sums and M_bius strips, as seen in a variety of structures and artworks in Washington, D.C., Philadelphia, Toronto, Ottawa, Montreal, New Orleans, and many other locales.
ID:
346
Year: 2012
Name: Ivars Peterson
Institution: MAA
Subject area(s): Mathematical Counting
Title of Talk: Pancake Sorting, Prefix Reversals, and DNA Rearrangements
Abstract: The seemingly simple problem of sorting a stack of differently sized pancakes has become a staple of theoretical computer science and led to insights into the evolution of species. First proposed in The American Mathematical Monthly, the problem attracted the attention of noted mathematicians and computer scientists. It now plays an important role in the realm of molecular biology for making sense of DNA rearrangements.
Year: 2012
Name: Ivars Peterson
Institution: MAA
Subject area(s): Mathematical Counting
Title of Talk: Pancake Sorting, Prefix Reversals, and DNA Rearrangements
Abstract: The seemingly simple problem of sorting a stack of differently sized pancakes has become a staple of theoretical computer science and led to insights into the evolution of species. First proposed in The American Mathematical Monthly, the problem attracted the attention of noted mathematicians and computer scientists. It now plays an important role in the realm of molecular biology for making sense of DNA rearrangements.
ID:
288
Year: 2010
Name: Travis Peters
Institution: Iowa State University
Subject area(s):
Title of Talk: Minimum rank, maximum nullity and zero forcing number for selected graph families
Abstract: The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity is taken over the same set of matrices. The zero forcing number is the minimum size of a zero forcing set of vertices and bounds the maximum nullity from above. This talk discusses the graph families ciclos and estrellas. In particular, these families provide the examples showing that the maximum nullity of a graph and its dual may differ, and similarly for zero forcing number.
Year: 2010
Name: Travis Peters
Institution: Iowa State University
Subject area(s):
Title of Talk: Minimum rank, maximum nullity and zero forcing number for selected graph families
Abstract: The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity is taken over the same set of matrices. The zero forcing number is the minimum size of a zero forcing set of vertices and bounds the maximum nullity from above. This talk discusses the graph families ciclos and estrellas. In particular, these families provide the examples showing that the maximum nullity of a graph and its dual may differ, and similarly for zero forcing number.
ID:
305
Year: 2011
Name: Travis Peters
Institution: Iowa State University
Subject area(s):
Title of Talk: Zero forcing number, maximum nullity, and path cover number of complete edge subdivision graphs
Abstract: The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity is taken over the same set of matrices. The zero forcing number is the minimum size of a zero forcing set of vertices and bounds the maximum nullity from above. The path cover number is the fewest number of vertex disjoint induced paths that cover all the vertices of the graph. We study the effect of edge subdivisions of a graph on the zero forcing number, maximum nullity, and path cover number.
Year: 2011
Name: Travis Peters
Institution: Iowa State University
Subject area(s):
Title of Talk: Zero forcing number, maximum nullity, and path cover number of complete edge subdivision graphs
Abstract: The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity is taken over the same set of matrices. The zero forcing number is the minimum size of a zero forcing set of vertices and bounds the maximum nullity from above. The path cover number is the fewest number of vertex disjoint induced paths that cover all the vertices of the graph. We study the effect of edge subdivisions of a graph on the zero forcing number, maximum nullity, and path cover number.
ID:
282
Year: 2010
Name: Brian Patterson
Institution: Iowa State University
Subject area(s): Real Analysis, Computability Theory
Title of Talk: Multi-Resolution Cellular Automata for Real Computation
Abstract: We will first briefly review cellular automata and why representing and computing with real numbers with a computer is problematic. Then we will discuss a new approach that uses the concept of fissioning cells to approximate real-valued regions. I will close with a brief explanation of my simulator.
Year: 2010
Name: Brian Patterson
Institution: Iowa State University
Subject area(s): Real Analysis, Computability Theory
Title of Talk: Multi-Resolution Cellular Automata for Real Computation
Abstract: We will first briefly review cellular automata and why representing and computing with real numbers with a computer is problematic. Then we will discuss a new approach that uses the concept of fissioning cells to approximate real-valued regions. I will close with a brief explanation of my simulator.
ID:
417
Year: 2015
Name: Catherine Patterson
Institution: University of Iowa
Subject area(s): Mathematical biology, applied math, modeling
Title of Talk: Modeling the Effects of Multiple Myeloma Bone Disease
Abstract: Cancer is a lot like a hurricane; you can see it coming, but you don't know exactly where it will go or how much damage it will do. However, by combining a mathematical model with patient data, we can make predictions about the development of a patient's cancer. My research focuses on multiple myeloma, a plasma cell cancer that disrupts the bone remodeling process. In multiple myeloma patients, bone destruction outpaces bone replacement, producing bone lesions. This talk will describe the cell dynamics that regulate bone remodeling and explain how they are impacted by multiple myeloma. I will then discuss techniques used to model this system, including Savageau's power law approximations.
Year: 2015
Name: Catherine Patterson
Institution: University of Iowa
Subject area(s): Mathematical biology, applied math, modeling
Title of Talk: Modeling the Effects of Multiple Myeloma Bone Disease
Abstract: Cancer is a lot like a hurricane; you can see it coming, but you don't know exactly where it will go or how much damage it will do. However, by combining a mathematical model with patient data, we can make predictions about the development of a patient's cancer. My research focuses on multiple myeloma, a plasma cell cancer that disrupts the bone remodeling process. In multiple myeloma patients, bone destruction outpaces bone replacement, producing bone lesions. This talk will describe the cell dynamics that regulate bone remodeling and explain how they are impacted by multiple myeloma. I will then discuss techniques used to model this system, including Savageau's power law approximations.
ID:
343
Year: 2012
Name: Mary Therese Padberg
Institution: University of Iowa
Subject area(s): Mathematical Biology
Title of Talk: The Twisted Tale of Protein-bound DNA
Abstract: DNA is important for our cells to function and grow, but it cannot accomplish this alone. DNA is just the blueprint and its information must be read and expressed by proteins. Understanding the shape of DNA when protein has bound to it (protein-bound DNA) is important for biological and medical research. Laboratory techniques exist which allow scientists to find the geometric structure for some protein-bound DNA complexes. When these techniques fail, we can often experimentally determine a topology for the complex, but topology alone is not enough. In order to understand the structure of protein-bound DNA at a scientifically useful level we need to know the geometry of the structure. In this talk we will create a mathematical model based on the DNA topology from laboratory experiments to describe the geometry of the DNA. We will discuss the flexibility of this model to accept user modifications in order to model the protein-bound DNA sample under variable conditions. Thus, by combining geometric and topological solutions we will be able to more accurately describe the shape of large protein-bound DNA complexes.
Year: 2012
Name: Mary Therese Padberg
Institution: University of Iowa
Subject area(s): Mathematical Biology
Title of Talk: The Twisted Tale of Protein-bound DNA
Abstract: DNA is important for our cells to function and grow, but it cannot accomplish this alone. DNA is just the blueprint and its information must be read and expressed by proteins. Understanding the shape of DNA when protein has bound to it (protein-bound DNA) is important for biological and medical research. Laboratory techniques exist which allow scientists to find the geometric structure for some protein-bound DNA complexes. When these techniques fail, we can often experimentally determine a topology for the complex, but topology alone is not enough. In order to understand the structure of protein-bound DNA at a scientifically useful level we need to know the geometry of the structure. In this talk we will create a mathematical model based on the DNA topology from laboratory experiments to describe the geometry of the DNA. We will discuss the flexibility of this model to accept user modifications in order to model the protein-bound DNA sample under variable conditions. Thus, by combining geometric and topological solutions we will be able to more accurately describe the shape of large protein-bound DNA complexes.
ID:
398
Year: 2014
Name: Olena Ostapyuk
Institution: University of Northern Iowa
Subject area(s): Mathematics Education
Title of Talk: How can i be more than Imaginary for Future HIgh School Mathematics Teachers
Abstract: High school teachers introduce i as a solution to the equation x^2=-1 without understanding the geometry of complex numbers. This results in students not understanding the role of complex numbers in other contexts. The purpose of this talk is to share an introduction to complex numbers used in a mathematics course for future secondary mathematics teachers to demystify i and provide a rationale for its use in both pure and applied mathematics.
Year: 2014
Name: Olena Ostapyuk
Institution: University of Northern Iowa
Subject area(s): Mathematics Education
Title of Talk: How can i be more than Imaginary for Future HIgh School Mathematics Teachers
Abstract: High school teachers introduce i as a solution to the equation x^2=-1 without understanding the geometry of complex numbers. This results in students not understanding the role of complex numbers in other contexts. The purpose of this talk is to share an introduction to complex numbers used in a mathematics course for future secondary mathematics teachers to demystify i and provide a rationale for its use in both pure and applied mathematics.
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.
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:
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:
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:
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:
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:
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:
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