AMATYC contest will be offered 10/21-11/7 2014 in the MLC. The official time is 10/22, 12-2 PM. Math Club plans to organize prep sessions on Fridays 3:30-4:30 OC3607.

## Tuesday, August 26, 2014

## Thursday, December 8, 2011

### Math club is streaming Donald Knuth's lecture today!

Hi,

we will be streaming the Christmas tree lecture by Donald Knuth, Stanford, tonight 12/8/2011 from 6:30-7:30PM at OC4611.

"Description:

Bayesian trees and BDDs

Professor Knuth will present his 17th Annual Christmas Tree Lecture on Thursday, December 8, 2011 at 6:30 pm in NVIDIA Auditorium in the new Huang Engineering Center, 475 Via Ortega, Stanford University . For those unable to come to Stanford, the lecture will be broadcast online as a free webinar. If you would like to view the live broadcast, please register so that we can send you the link prior to the event.

Prepare to experience Professor Knuth's sense of humor and unique perspective on computer science.

"Formally speaking, a Bayesian network based on an n-node binary tree is a way of assigning probabilities to each state x of the entire tree, where x is an n-bit vector whose jth bit is the state of node j. The overall probability of state x is proportional to the product, over all pairs of nodes j and k with j the parent of k, of a given weight function that depends only on the current states of nodes j and k. This local weight function can be different at each pair of adjacent nodes. Standard methods of belief propagation are able to compute the global probability of simple events such as "node x is in state 0", without doing much work. But more complicated events, such as "the sum of all individual states is m", cannot be handled efficiently by traditional techniques. The speaker will explain how to apply elementary BDD technology so that the probability of such events (and many others) can be computed in polynomial time.

– Don Knuth

Professor Knuth is the Professor Emeritus of the Art of Computer Programming at Stanford University. Dr. Knuth's classic programming texts include his seminal work The Art of Computer Programming, Volumes 1-3, widely considered to be among the best scientific writings of the century. "

We hope to see you tonight,

Math Club

we will be streaming the Christmas tree lecture by Donald Knuth, Stanford, tonight 12/8/2011 from 6:30-7:30PM at OC4611.

"Description:

Bayesian trees and BDDs

Professor Knuth will present his 17th Annual Christmas Tree Lecture on Thursday, December 8, 2011 at 6:30 pm in NVIDIA Auditorium in the new Huang Engineering Center, 475 Via Ortega, Stanford University . For those unable to come to Stanford, the lecture will be broadcast online as a free webinar. If you would like to view the live broadcast, please register so that we can send you the link prior to the event.

Prepare to experience Professor Knuth's sense of humor and unique perspective on computer science.

"Formally speaking, a Bayesian network based on an n-node binary tree is a way of assigning probabilities to each state x of the entire tree, where x is an n-bit vector whose jth bit is the state of node j. The overall probability of state x is proportional to the product, over all pairs of nodes j and k with j the parent of k, of a given weight function that depends only on the current states of nodes j and k. This local weight function can be different at each pair of adjacent nodes. Standard methods of belief propagation are able to compute the global probability of simple events such as "node x is in state 0", without doing much work. But more complicated events, such as "the sum of all individual states is m", cannot be handled efficiently by traditional techniques. The speaker will explain how to apply elementary BDD technology so that the probability of such events (and many others) can be computed in polynomial time.

– Don Knuth

Professor Knuth is the Professor Emeritus of the Art of Computer Programming at Stanford University. Dr. Knuth's classic programming texts include his seminal work The Art of Computer Programming, Volumes 1-3, widely considered to be among the best scientific writings of the century. "

We hope to see you tonight,

Math Club

## Wednesday, November 2, 2011

## Thursday, October 20, 2011

## Wednesday, October 5, 2011

We will hold meetings starting this Friday October 7 and every other Friday after that date from 2:15PM to 4PM in the Temescal room located inside the Student Center building of the Oceanside campus.

At the meetings please bring questions to ask, suggestions, math related material you find interesting.

For this month let us concentrate on preparation for the AMATYC contest which will be held October 14 through October 29. The contest can be taken once each semester and consists of questions that requires knowledge up to Precalculus, although you are not expected to be able to solve everything.

http://www.miracosta.edu/instruction/mathematics/amatyc.html

At the bottom of this link read the contest directions.

Use this link to do the 2010 Fall AMATYC questions. We will review this one at our first meeting so please bring your solutions to the meeting.

## Sunday, September 4, 2011

## Sunday, February 27, 2011

### AMATYC Review Sessions

OK everyone, here are the dates for the AMATYC review sessions:

Both review sessions will be help by Prof. Perovic on the second floor of the library in room 1250.

The first will be tomorrow 2/28/11 from 4:00 to 5:00pm.

The second will be Wednesday 3/2/11 from 4:30 to 5:30pm.

If anyone is planning on taking the AMATYC test this semester make sure you do not miss these review sessions, they are going to be geat!

Thanks and best of luck on the AMATYC.

Both review sessions will be help by Prof. Perovic on the second floor of the library in room 1250.

The first will be tomorrow 2/28/11 from 4:00 to 5:00pm.

The second will be Wednesday 3/2/11 from 4:30 to 5:30pm.

If anyone is planning on taking the AMATYC test this semester make sure you do not miss these review sessions, they are going to be geat!

Thanks and best of luck on the AMATYC.

Subscribe to:
Posts (Atom)