Mail: IDEA MATH, P.O. Box 338
Exeter, NH 03833-0338
Mobile Phone: (603)686-1706
Location: Carnegie Mellon University
Date: July 3 - July 19, 2013
Residential students will arrive on Wednesday, July 3, 2013 and departure on Friday, July 19, 2013 by 12 Noon.
Class dates: July 4-8 (5 days in this period), July 10 - 13, July 15 - 18 (13 days of academic activities).
Who*: Students entering grades 6 to 12 (13 years of age by the first date residing in the dormitory) in school year 2013 - 2014.
Why? We apply seminar-style teaching in our classes. we believe students learn best by discovering, rather than simply memorizing, essential theorems and techniques. Our process puts students at the center of the classes, as students work together to develop their ideas. Our instructors lead this processes by teaching vital ideas and giving meaningful examples, then guiding students through the problem-solving process.
Math courses: 2012 Curriculum
Computer mini courses:
Probabilistic model checking Instructor: Ligia Nistor
Probabilistic model checking is a formal technique for analyzing systems that exhibit probabilistic behavior. Examples include randomized algorithms, communication and security protocols, computer networks, biological signaling pathways, and many others. The course provides an introduction to these techniques, covering both the underlying theory (Markov chains, Markov decision processes, temporal logics) and its practical application (using the state-of-the art probabilistic checking tool PRISM, developed at the University of Oxford). The methods used will be illustrated through some real-life case studies, e.g. the Bluetooth/FireWire protocols and algorithms for power management.
Convex optimization Instructor: Erik Zawadzki
Optimization problems occur whenever we try to organize, design, or act in the best possible way. Some of these
optimization problems are easy for modern algorithms to solve, while other problems are impossible. In this mini
course will describe perhaps the most important tractable problem class: convex optimization. Convex optimization will
turn out to be broadly useful, but also have a rich theory associated with it.
We will touch on the geometry of convex sets, linear programming, duality, Lagrange multipliers, and gradient descent.
Prerequisite: Linear algebra, basic multivariable calculus.
Sorting and searching Instructor: Ashiqur Rahman Khudabukhsh
Sorting a list of items puts them in a given order. We encounter sorting tasks in everyday life, be it ranking students by grades or ranking items on Amazon by user ratings. While manual sorting might work in the former, it is impossible in the latter case. Similarly, the documents in a folder on your computer are sorted based either on their names, file sizes, or the dates of last modification. A much related problem is to search for an element in a given list. Again, searching is encountered fairly commonly in everyday life, be it looking up if a seat is available on a flight or searching for a person through massive amounts of data on Facebook. An example involving both sorting and searching is what goes on when we enter something on Google - the search results are sorted according to their relevance. Amazon seems to do a similar job, but on an entirely different class of items and a different objective. Clearly, automation is very necessary for these problems, for user experience of the above mentioned applications and also for many other critical applications with limited resources. Depending on the nature of the problem and the amount of computational time and memory available, different approaches can be taken to tackle these problems. In this course, we will present several techniques to automatically perform sorting and searching. We will touch upon the notion of computational complexity in the context of these problems. We will also briefly address NP-complete problems and searching through the solution space of combinatorial hard problems.
Algorithm Design and Programming Competitions Instructor: Dong Zhou
Program = Data Strucuture + Algorithm. An algorithm is the procedure or the method to solve a problem. This mini-course
will introduce several important ideas in algorithm design, including enumeration, greedy algorithm, divide & conquer etc.
These ideas will be explained through concretate problems from various programming competitions. Moreover, I will briefly
introduce how could you take part in major proramming competitions and how to prepare for them.
Prerequisite: Basic programming knowledge.
|7:30 A.M. - 8:45 A.M.||Breakfast|
|8:30 A.M. - 9:00 A.M.||Day students arrive|
|9:00 A.M. - 12:15 P.M.||Morning Math class|
|12:15 P.M. - 2:00 P.M.||Lunch and free time|
|2:00 P.M. - 5:15 P.M.||Afternoon Math class|
|5:15 P.M. - 7:15 P.M.||Dinner and supervised activities|
|5:15 P.M. - 6:00 P.M.||Day students depart|
|7:30 P.M. - 9:30 P.M.||Computer Science Class|
|9:30 P.M.- 10:30 P.M.||Social gathering|
|10:45 P.M.||Lights out|
Day students who wish to attend evening computer science classes at the Carnegie Mellon program may do so for an additional fee, the cost will be $400 (including dinner and mini courses)
Application back to top
An application will consist of the following:
- Online register
- *Student Short Essay - Write a page on a topic or an activity that you are passionate about.
- *A Letter of Recommendation from a Math teacher
- A check/money order for the application fee ($30)
* Only new students need recommendation letter and essay.
|Application Due||Tuition Due||Residential Tuition||Day Student Tuition|
|Early Application||March 15, 2013||April 21, 2013||$2985||$1785|
|Regular Application||May 15, 2013||May 30, 2013||$3350||$1985|
We offer a discounts of $200 for residential or $100 for day students who are 2012 or 2013 USA(J)MO qualifiers
or 2013 MathCounts National contestants and have completed their application by May 15, 2013.
( Please note the discounts can not be combined)
Admitted students can adjust their tuition payment accordingly and submit the adjusted tuition payment with a copy of the document supporting the adjustment.
Please make all checks payable to IDEA MATH.
All application materials and tution should be submitted to:
P.O. Box 338
Exeter, NH 03833-0338
Please contact us (email to firstname.lastname@example.org) (603)686-1706, if you have any questions regarding the application process.
Refund policy back to top
The $30 Application fee is non-refundable. A cancellation request must be made in writing. For a cancellation request made before May 18, a full refund (except for an administrative charge of $100) will be issued. For a cancellation made after May 18 and before June 5, 50% of paid tuition will be issued. For a cancellation made after June 5, no refund will be issued unless the student cannot come to our summer program due to medical reasons and has appropriate documentation from a physician - in this case, the full refund is issued less an administration fee of $100. A request made during the camp will be considered similarly to a request made after June 5.