You are invited to the Mathematics Colloquium at CCSU scheduled for
Friday, December 4, from 2:00 to 3:00 PM in Maria Sanford Hall Room 101.
Speaker: Partha Srinivasan, Cleveland State University.
Title: Extracting information from NMR experiments presented as an inverse problem.
Abstract: We begin by presenting the basics of Nuclear Magnetic Resonance (NMR) for samples in solution. We will show how to extract information that is useful in obtaining protein structures using these experiments, and describe how this extraction of information can be presented as an inverse problem in an appropriate system of ordinary differential equations. In the case of NMR of solids, the information that is present is much more abundant, and it is much more challenging to isolate and obtain the information of interest. We will just outline the role of NMR of solids in structural biology, and only address a few basic techniques used in this experimental method.
This colloquium is sponsored by the Math Club at CCSU.
For directions to CCSU, or for information for past or future
colloquia presentations, please visit the website of our Colloquium:
http://www.math.ccsu.edu/gotchev/colloquium/
Ivan Gotchev, Ph.D., Professor of Mathematics, Mathematical Sciences Department, Central Connecticut State University
Monday, November 23, 2009
Monday, November 16, 2009
You are invited to the Mathematics Colloquium at CCSU scheduled for
Friday, November 20, from 2:00 to 3:00 PM in Maria Sanford Hall Room 101.
Speaker: Darius M. Dziuda, CCSU.
Title: A novel approach to identification of stable and biologically interpretable genomic and proteomic biomarkers.
Abstract: Various supervised learning algorithms can be used to identify parsimonious multivariate biomarkers. While such biomarkers may contain information sufficient for quite efficient classification of new cases, they are often unstable and do not necessarily provide insight into biological processes underlying class differentiation.
In this talk, we will define two concepts – the Informative Set of Genes and the modified bagging schema – and present a method utilizing them for identification of robust biomarkers and for elucidation of biological processes associated with class differences.
Using the modified bagging schema, hundreds or thousands of classifiers are built from the Informative Set of Genes. Each of these classifiers is a result of independent feature selection process. By examining the distribution of genes among the classifiers and by analyzing gene expression patterns represented in the Informative Set of Genes, we identify primary sets of informative genes. These primary sets can be used to identify robust multivariate biomarkers. They also represent the optimal amount of information allowing biological interpretation of class differences.
Keywords: Biomarker Discovery, Personalized Medicine, Multivariate Biomarkers, Ensemble Classifiers, Data Mining, Bioinformatics, Genomics, Proteomics, Differential Diagnosis, Drug Discovery, Classification and Prediction Systems.
This colloquium is sponsored by the Kenneth G. Fuller endowment.
For directions to CCSU, or for information for past or future
colloquia presentations, please visit the website of our Colloquium:
http://www.math.ccsu.edu/gotchev/colloquium/
Ivan Gotchev, Ph.D., Professor of Mathematics, Mathematical Sciences Department, Central Connecticut State University.
Friday, November 20, from 2:00 to 3:00 PM in Maria Sanford Hall Room 101.
Speaker: Darius M. Dziuda, CCSU.
Title: A novel approach to identification of stable and biologically interpretable genomic and proteomic biomarkers.
Abstract: Various supervised learning algorithms can be used to identify parsimonious multivariate biomarkers. While such biomarkers may contain information sufficient for quite efficient classification of new cases, they are often unstable and do not necessarily provide insight into biological processes underlying class differentiation.
In this talk, we will define two concepts – the Informative Set of Genes and the modified bagging schema – and present a method utilizing them for identification of robust biomarkers and for elucidation of biological processes associated with class differences.
Using the modified bagging schema, hundreds or thousands of classifiers are built from the Informative Set of Genes. Each of these classifiers is a result of independent feature selection process. By examining the distribution of genes among the classifiers and by analyzing gene expression patterns represented in the Informative Set of Genes, we identify primary sets of informative genes. These primary sets can be used to identify robust multivariate biomarkers. They also represent the optimal amount of information allowing biological interpretation of class differences.
Keywords: Biomarker Discovery, Personalized Medicine, Multivariate Biomarkers, Ensemble Classifiers, Data Mining, Bioinformatics, Genomics, Proteomics, Differential Diagnosis, Drug Discovery, Classification and Prediction Systems.
This colloquium is sponsored by the Kenneth G. Fuller endowment.
For directions to CCSU, or for information for past or future
colloquia presentations, please visit the website of our Colloquium:
http://www.math.ccsu.edu/gotchev/colloquium/
Ivan Gotchev, Ph.D., Professor of Mathematics, Mathematical Sciences Department, Central Connecticut State University.
Friday, November 13, 2009
Eureka! Who knew math was riveting?
When Marshfield math teacher Jean Kelley suggested last year that her friend Spring Sirkin produce a play about mathematics, Sirkin was skeptical.
Full story: http://www.boston.com/news/education/k_12/articles/2009/11/12/eureka_a_touring_play_makes_math_dramatic_for_middle__and_high_schoolers/
Full story: http://www.boston.com/news/education/k_12/articles/2009/11/12/eureka_a_touring_play_makes_math_dramatic_for_middle__and_high_schoolers/
Monday, November 9, 2009
Speaker and Topic for November 13 Colloquium
You are invited to the Mathematics Colloquium at CCSU scheduled for
Friday, November 13, from 2:00 to 3:00 PM in Maria Sanford Hall Room 101.
Speaker: Zheng Huang, College of Staten Island.
Title: Forcing terms in some PDEs and problems in geometry.
Abstract: I will speak on several variations of the mean curvature flow (MCF) equations and the quest of constant mean curvature (CMC) (hyper)surfaces in various spaces.
This colloquium is sponsored by the Math Club at CCSU.
For directions to CCSU, or for information for past or future
colloquia presentations, please visit the website of our Colloquium:
http://www.math.ccsu.edu/gotchev/colloquium/
Ivan Gotchev, Ph.D., Professor of Mathematics, Mathematical Sciences Department, Central Connecticut State University
Friday, November 13, from 2:00 to 3:00 PM in Maria Sanford Hall Room 101.
Speaker: Zheng Huang, College of Staten Island.
Title: Forcing terms in some PDEs and problems in geometry.
Abstract: I will speak on several variations of the mean curvature flow (MCF) equations and the quest of constant mean curvature (CMC) (hyper)surfaces in various spaces.
This colloquium is sponsored by the Math Club at CCSU.
For directions to CCSU, or for information for past or future
colloquia presentations, please visit the website of our Colloquium:
http://www.math.ccsu.edu/gotchev/colloquium/
Ivan Gotchev, Ph.D., Professor of Mathematics, Mathematical Sciences Department, Central Connecticut State University
Monday, November 2, 2009
Speaker and Topic for Nov. 6 Colloquium
You are invited to the Mathematics Colloquium at CCSU scheduled for
Friday, November 6, from 2:00 to 3:00 PM in Maria Sanford Hall Room 101.
Speaker: Wai Kiu Chan, Wesleyan University.
Title: Quadratic forms: from local to global.
Abstract: An integral quadratic form is called regular if it represents all integers which cannot be ruled out by congruence consideration. Examples are the sum of four squares and the other universal quadratic forms. The goal of this talk is to first review the local-global principle of Hasse and Minkowki, and then describe some of the recent advances on the study of regular quadratic forms and generalizations, with emphasis put on various finiteness results.
This colloquium is sponsored by the NSF – STEM Scholarship Program at CCSU; therefore all recipients of the scholarship are urged to attend.
For directions to CCSU, or for information for past or future
colloquia presentations, please visit the website of our Colloquium:
http://www.math.ccsu.edu/gotchev/colloquium/
Ivan Gotchev, Ph.D., Professor of Mathematics, Mathematical Sciences Department, Central Connecticut State University
Friday, November 6, from 2:00 to 3:00 PM in Maria Sanford Hall Room 101.
Speaker: Wai Kiu Chan, Wesleyan University.
Title: Quadratic forms: from local to global.
Abstract: An integral quadratic form is called regular if it represents all integers which cannot be ruled out by congruence consideration. Examples are the sum of four squares and the other universal quadratic forms. The goal of this talk is to first review the local-global principle of Hasse and Minkowki, and then describe some of the recent advances on the study of regular quadratic forms and generalizations, with emphasis put on various finiteness results.
This colloquium is sponsored by the NSF – STEM Scholarship Program at CCSU; therefore all recipients of the scholarship are urged to attend.
For directions to CCSU, or for information for past or future
colloquia presentations, please visit the website of our Colloquium:
http://www.math.ccsu.edu/gotchev/colloquium/
Ivan Gotchev, Ph.D., Professor of Mathematics, Mathematical Sciences Department, Central Connecticut State University
Monday, October 26, 2009
Speaker and Topic for October 30 Colloquium
You are invited to the Mathematics Colloquium at CCSU scheduled for
Friday, October 30, from 2:00 to 3:00 PM in Maria Sanford Hall Room 101.
Speaker: Krishna K. Saha, CCSU.
Title: Profile Likelihood Based Confidence Interval for the Dispersion Parameter in Count Data.
Abstract: The dispersion parameter is an important and versatile measure in the analysis of
one-way layout of count data in biological studies. Many authors have examined the
bias and efficiency of different estimators of the dispersion parameter for finite data
sets, but little attention has been paid to the accuracy of its confidence interval. In this
talk we compare the small-sample coverage probabilities of four different approaches
for computing the confidence intervals of the dispersion parameter in counts based on a
parametric model as well as the models that are specified by only the first two moments
of the counts. We strongly recommended that one of these be used in practice. Finally,
these methods are applied to a set of biological data. I will start my talk with the basic
concepts of the confidence interval methods, along with all basic definitions related with
this topic.
For directions to CCSU, or for information for past or future
colloquia presentations, please visit the website of our Colloquium:
http://www.math.ccsu.edu/gotchev/colloquium/
Ivan Gotchev, Ph.D.Professor of MathematicsMathematical Sciences DepartmentCentral Connecticut State University
Friday, October 30, from 2:00 to 3:00 PM in Maria Sanford Hall Room 101.
Speaker: Krishna K. Saha, CCSU.
Title: Profile Likelihood Based Confidence Interval for the Dispersion Parameter in Count Data.
Abstract: The dispersion parameter is an important and versatile measure in the analysis of
one-way layout of count data in biological studies. Many authors have examined the
bias and efficiency of different estimators of the dispersion parameter for finite data
sets, but little attention has been paid to the accuracy of its confidence interval. In this
talk we compare the small-sample coverage probabilities of four different approaches
for computing the confidence intervals of the dispersion parameter in counts based on a
parametric model as well as the models that are specified by only the first two moments
of the counts. We strongly recommended that one of these be used in practice. Finally,
these methods are applied to a set of biological data. I will start my talk with the basic
concepts of the confidence interval methods, along with all basic definitions related with
this topic.
For directions to CCSU, or for information for past or future
colloquia presentations, please visit the website of our Colloquium:
http://www.math.ccsu.edu/gotchev/colloquium/
Ivan Gotchev, Ph.D.Professor of MathematicsMathematical Sciences DepartmentCentral Connecticut State University
Monday, October 12, 2009
Speaker and Topic for Oct. 16 Colloquium
You are invited to the Mathematics Colloquium at CCSU scheduled for
Friday, October 16, from 2:00 to 3:00 PM in Maria Sanford Hall Room 101.
Speaker: Robert V. Devaney, Boston University.
Title: The Fractal Geometry of the Mandelbrot Set.
Abstract: In this lecture we describe several folk theorems concerning the Mandelbrot set.
While this set is extremely complicated from a geometric point of view, we will show
that, as long as you know how to add and how to count, you can understand this
geometry completely. We will encounter many famous mathematical objects in the
Mandelbrot set, like the Farey tree and the Fibonacci sequence. And we will find many
soon-to-be-famous objects as well, like the "Devaney" sequence. There might even be a
joke or two in the talk.
This colloquium is sponsored by the Math Club at CCSU.
For directions to CCSU, or for information for past or future
colloquia presentations, please visit the website of our Colloquium
http://www.math.ccsu.edu/gotchev/colloquium/
Ivan Gotchev, Ph.D., Professor of Mathematics, Mathematical Sciences Department, Central Connecticut State University
Friday, October 16, from 2:00 to 3:00 PM in Maria Sanford Hall Room 101.
Speaker: Robert V. Devaney, Boston University.
Title: The Fractal Geometry of the Mandelbrot Set.
Abstract: In this lecture we describe several folk theorems concerning the Mandelbrot set.
While this set is extremely complicated from a geometric point of view, we will show
that, as long as you know how to add and how to count, you can understand this
geometry completely. We will encounter many famous mathematical objects in the
Mandelbrot set, like the Farey tree and the Fibonacci sequence. And we will find many
soon-to-be-famous objects as well, like the "Devaney" sequence. There might even be a
joke or two in the talk.
This colloquium is sponsored by the Math Club at CCSU.
For directions to CCSU, or for information for past or future
colloquia presentations, please visit the website of our Colloquium
http://www.math.ccsu.edu/gotchev/colloquium/
Ivan Gotchev, Ph.D., Professor of Mathematics, Mathematical Sciences Department, Central Connecticut State University
Subscribe to:
Posts (Atom)
