Print Page

# News and Events

### Math & CS Chat - Tuesday, April 3rd @ Noon in Tome 115

Alissa Crans, Loyola Marymount University, will present "Curious Catalan Numbers" on Tuesday, April 3rd from 12-pm in Tome 115.  Free pizza & everyone welcome!

Abstract: We are all familiar with Fibonacci's famous sequence that begins 1, 1, 2, 3, 5, 8, ... as well as other popular sequences such as the perfect squares 1, 4, 9, 16, 25 ... or the triangular numbers 1, 3, 6, 10, 15 .... But what about the sequence 1, 1, 2, 5, 14, ... ?  These are the Catalan numbers, named after the Belgian mathematician Eugene Catalan (1814-1894), despite having been described by Leonhard Euler 100 years earlier.  It turns out these numbers take a variety of different guises as they provide the solution to numerous combinatorial problems!  After introducing this sequence, we will explore some of the many ways in which the Catalan numbers are hidden throughout mathematics.

### Math & CS Chat - Monday, April 2nd @ 12:30 pm in Tome 117

David Crombecque, Gettysburg College, will present "Knots, Colors and Polynomials" at the Math/CS Chat on Monday, April 2nd at 12:30 pm in Tome 117.  Free pizza & everyone welcome to attend.

Abstract: Take a string or a rope and tie it, you get a knot.  There are different types of knots.  If you are into sailing or rock climbing you may know of the SQUARE KNOT or the GRANNY KNOT.  A more basic knot is the one you start with as you tie your shoes, it is the TREFOIL knot.  A natural question is how to distinguish knots.  After all, when you tie a knot around your waist and climb a wall, you want to make sure that the knot is not going to untie itself!  We will first use colors (3 to be exact) to differentiate knots.  Quickly, we will realize that TRICOLORABILITY is not a very efficient way to distinguish knots.  We will then associate POLYNOMIALS to knots.

### Math & CS Chat - Friday, March 30th @ 12:30 pm in Tome 117

Join us on Friday, March 30th at 12:30 pm in Tome 117 for our Math/CS Chat.  Tracy McKay, Iowa State University, will present "The Erdos-Faber-Lovasz Conjecture: A Question of Tea Parties and Seating Arrangements".  Free pizza - everyone welcome!

### Math & CS Chat - Thursday, March 29th @ Noon in Tome 117

Join us for a Math/CS Chat on Thursday, March 29th at Noon in Tome 117.  Jasmine Ng, Washington University in St. Louis, will present "[1] + [1] = [0]: A Discussion on Modular Arithmetic".  Pizza will be provided.  Everyone welcome.

### Katherine Veil & Tony Wang to present at Posters on Capitol Hill

Katherine Veil & Tony Wang will present posters on their research at the state capitol on Tuesday, March 27th. This is the Posters on the Hill session that is intended for state legislators and their staff.

### Math/CS Chat - Tuesday, March 20th @ Noon in Tome 115

Jim Glenn, Loyola University of Maryland, will present "Algorithms and Artificial Intelligence for Acyclic Games of Chance" on Tuesday, March 20th at Noon in Tome 115.  Free pizza & everyone welcome.

### Math/CS Chat - Thursday, March 22nd @ Noon in Tome 115

Michelle Lastrina, Iowa State University, will present "Probability Theory and the Birthday Paradox" on Thursday, March 22nd at Noon in Tome 115.

Abstract: In a group of n randomly chosen people, what is the probability that at least two of these people will have the same birthday?  This is known as the Birthday Problem, or Birthday Paradox, in probability theory.  We will discuss this interesting result, as well as look at some basics of probability theory that will be needed to describe the solution.

Pizza will be provided.

### Mark your calendars for Math/CS BBQ - May 9th @ Noon

Mark your calendars now!  The Math/CS BBQ will be held on Wednesday, May 9th from 12-2pm on the KW Lawn (near the volleyball net).  The rain location will be Tome Hall 2nd floor lobby.  The Math/CS professors will be grilling hotdogs, hamburgers & veggie burgers.  They will also provide side dishes & desserts.

### 12th Annual Dickinson College Spring Programming Contest

Students from ten nearby colleges and universities will compete in the 12th annual Dickinson College Spring Programming Contest on Saturday, March 24th in Tome Hall.  Each team of three students will attempt to out-program the others by coding solutions to an array of challenging problems.  The team solving the most problems in the shortest amount of time with the fewest errors wins!  For more information, email braught@dickinson.edu.

### Math/CS Chat - Thursday, March 8th at Noon in Tome 115

Kristen Walcott-Justice, University of Virginia, will be presenting "Testing in Resource Constrained Environments" on Thursday, March 8th at Noon in Tome 115.  Free pizza - everyone welcome.

Abstract: Testing is a critical and expensive part of the software development life cycle.  Often, test suites grow in size to the extent that they may take days, weeks, or months to excute.  Because the time to test is limited, test cases are selected and prioritized. More effective prioritizations can be created when the constrained resources, such as time or power, are considered.  By prioritizing with constraints in mind, the final test case prioritization will yield a higher average percent of faults detected than more naive prioritization approaches.

One challenge of prioritizing and selecting test cases is in estimating the fault finding ability of the tests.  This is traditionally performed through test coverage analysis.

The overhead of test coverage analysis is dominated by monitoring the application, which is traditionally performed using instrumentation.  However, instrumentation can prohibitively increase the time overhead and code growth of an application.  As an alternative to instrumentation, we explore how recent hardware advances can be leveraged to improve the overheads of test coverage analysis.  These hardware advances include hardware performance monitors and multicore technology.

In this talk, she will be presenting our system, THeME (Testing by Hardware Monitoring Events), a testing framework that replaces instrumentation with hardware monitoring. THeME consists of a runtime system that takes advantage of hardware mechanisms and multiple cores and a static component to further extend the coverage derived from hardware event sampling.  The results show that up to 90% of the actual coverage can be determined with less time overhead and negligible code growth compared to instrumentation, making it particularly applicable for use in resource constrained environments.

### Math Subject GRE Study Group

Professor Bryant has organized a Math Subject GRE Study Group that meets every Friday afternoon from 3-4pm in the Tome Hall Library.  Any student who has finished the calculus sequence and linear algebra and is interested in taking the Math GRE is welcome to attend.  For more information, please contact Professor Bryant directly at bryants@dickinson.edu.

 << March 2012 >>
Sun Mon Tue Wed Thu Fri Sat
1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30 31