Student Talk Series: John Klobusicky, Geisinger Health Systems, February 5th, Olin 268 @ noon

JosephKlobusicky_web_000

Title: Piecewise Deterministic Markov Processes and Metal Grain Coarsening

Abstract: In material science, individual metal grains obey surprisingly simple rules.  However, geometric considerations can create difficulties when attempting to analyze the bulk properties of metals.  In this talk, we’ll describe a mean field model using piecewise deterministic Markov processes which converts the geometric problem of grain evolution to one of analysis and stochastic processes.  In particular, we’ll show that densities of grains approach a law of large numbers described by a partial differential equation.

Joint Talk with Management: Anne Robinson and John Williamson, Verizon Wireless, February 5th, Rooke CHEM 116 @ 3pm

79172d095cded4fb672151d97c36ea7c6e7241db_large

Title: How Analytics Professionals Make the World Go Round

Abstract:

It’s hard to open a business magazine, walk through an airport or even participate in an executive meeting and NOT see or hear reference to analytics. Recognized as the currency of business, mathematics or analytics are empowering decision-making at new levels. A trend that started with CIOs is spreading throughout the C-Suite – Everyone wants ANALYTICS!

 

What exactly are these analytics professionals doing? What types of real-world problems are they solving? Are they actually applying the math, statistics and operations research tools they learned in their courses? What other skills or certifications do they have?  What opportunities are there for graduate studies in analytics?
Hear from Anne Robinson and John Williamson of Verizon Wireless.  Anne Robinson holds a Ph.D. in Industrial Engineering from Stanford University and served as President of INFORMS, the largest professional organization for both practitioners and academics in the field of Analytics/Operations Research.  John Williamson holds a M.B.A. in Supply Chain Management from Penn State University.  There will be an opportunity to speak with the presenters following the talk.

Student Talk Series: Tracy Sweet, University of Maryland, January 22nd, Olin 268 @ noon

Sweet

Title: Hierarchical Social Network Models with Applications in the Social Sciences

Abstract: The term “social network analysis” includes most quantitative methods for analyzing relational data and these methods are both exploratory and inferential. For inference, there are a variety of social network statistical models to represent the stochastic nature of network relationships.  In this talk, I will present social network models that are written as Hierarchical Bayes models and describe how these generative models can be used in the social sciences which often involve multiple partially exchangeable networks.

Research opportunities

Bucknell Program for Undergraduate Research: see campus www.bucknell.edu/x1713.xml proposals due in early February

Research Experiences for Undergraduates (REUs): see www.ams.org/programs/students/undergrad/emp-reu deadlines February – March

Lawrence Berkeley National Laboratory: see http://cs.lbl.gov/careers/summer-student-program/rising-seniors

MIT Lincoln Laboratory: see www.ll.mit.edu/college/summerprogram.html rising seniors; must be U.S. citizen

National Security Agency: Director’s Summer Program, Mathematics Summer Employment Program; must be U.S. citizen; applications accepted September 7 – October 15 of each year; see http://www.nsa.gov/careers/opportunities_4_u/students/undergraduate/

Summer Undergraduate Research Fellowship (SURF) at National Institute of Standards and Technology (NIST): see www.nist.gov/surfgaithersburg/ deadline February 15.

National Renewable Energy Laboratory’s Research Participant Program: must be U.S. citizen or permanent resident; rising juniors and above; see www.nrel.gov/rpp/student_internships.html

U.S. Department of Energy Science Undergraduate Laboratory Internships (SULI); applications due January 10, 2012; see science.energy.gov/wdts/suli

Oak Ridge National Laboratory: see http://www.orau.org/ornl/undergraduates/default.htm

Sandia National Laboratory: see www.sandia.gov/careers/students_postdocs/

Dordt College in Sioux City, Iowa summer research program in statistical genetics and biostatistics; undergraduate students with prior coursework in statistics are invited to apply; application deadline; January 31, 2012; see http://www.dordt.edu/academics/programs/math/statgen/

 

Statistics and Biostatistics Opportunities:

Summer Institute for Training in Biostatistics (http://www.nhlbi.nih.gov/research/training/summer-institute-biostatistics-t15)

Mayo Clinic: http://www.mayoclinic.org/jobs/internships.html

Census bureau: http://www.census.gov/hrd/www/jobs/stu_temp.html

U.S. Government: http://www.usajobs.gov

Dordt College in Sioux City, Iowa: summer research program in statistical genetics and biostatistics; undergraduate students with prior coursework in statistics are invited to apply; application deadline; January 31, 2012; see http://www.dordt.edu/academics/programs/math/statgen/

Student Talk Series: Erik Bollt, Clarkson University, December 4th, Olin 268 @ noon

bollt-at-work

 

Title:  Diseases, Fame and Merit – Various Outbreaks on Social Networks

 

Abstract: Dynamical Systems, Chaos theory and Complex Systems theory has some useful mathematical tools to bring to bear on problems that are very familiar to our own lives.  Furthermore, social media has some really relevant large scaled data that also lends toward a modern discussion of what happens when people socially contact.

Distinguished Visiting Professor Talk Series: Sergi Elizalde, Dartmouth College, November 24th @4pm in Olin 372

Title: Consecutive patterns in permutations

 

Abstract: An occurrence of a consecutive pattern sigma in a permutation pi
is a subsequence of adjacent entries of pi in the same relative
order as the entries of sigma. For example, occurrences of the
consecutive pattern 21 are descents, and alternating permutations
are those that avoid the consecutive patterns 123 and 321. The
systematic study of consecutive patterns in permutations started over
a decade ago.  More recently, consecutive patterns have become
relevant in the study of one-dimensional dynamical systems, and they
are useful in creating tests to distinguish random from deterministic
time series.

We show that the number of permutations avoiding the consecutive
pattern 12…m —that is, containing no m adjacent entries in
increasing order— is asymptotically larger than the number of
permutations avoiding any other consecutive pattern of length m. At
the other end of the spectrum, the number of permutations avoiding
12… (m-2)m(m-1) is asymptotically smaller than for any other
consecutive pattern.