Andrea Isabelle Lincoln's Resume

I attend MIT.  I am currently a math major (course 18), but I am thinking about double majoring with EECS (course 6).

My academic interests lie in computer science and math. At the moment I find distributed systems very interesting.

I also enjoy water polo, drawing, ink painting, books, movies and sudoku.

Here are some of my paintings: Project.

 My favorite:

-Number: i

-Mathematician: Euler

- Method of Proof: proof by contradiction or induction 

- Book(s): Catch22, i,Robot , Lirael

-Movie: Monty Python and the Holy Grail 

-Artist(s):  Leonardo da Vinci, Salvador Dali

Publications:
  • Fault Tolerance of Node Failures in a Stochastic Localization Algorithm for Wireless Sensor Networks Paper
    • This paper has been accepted for publication in the IJCA journal.
    • This paper has been selected as best paper in the Second International Conference on Sensor Networks and Applications 2010.
    • Siemens Competition in Math, Science & Technology Semifinalist was awarded for this paper.
    • I did my research at Boston University in the lab of Yannis Paschalidis.
Selected MIT Classes (yellow=current classes)
(GPA 4.875) (Technical GPA 5.0):
  • 6.875 Cryptography and Cryptanalysis
  • 6.851 Advanced Data Structures
  • 6.033 Computer Systems Engineering
  • 6.004 Computation Structures
  • 18.702 Abstract Algebra II
  • 6.046 Intermediate Algorithms (A)
  • 6.006 Intro to Algorithms (A)
  • 18.701 Abstract Algebra I (P)
  • 6.034 Artificial Intelligence (A)
  • 6.186 Mobile Autonomous Systems Lab (MASLAB) (P)
  • 6.337 Parallel Computing (A)
  • 18.100B Analysis (A)
  • 6.01 Intro to Computer Science (A)
UROPS:
  • UROP Summer 2011
    • Professor: Muriel Médard
    • Graduate Student: Jason Cloud
    • Lab: Research Lab for Electronics (RLE)
    • Current Work: Characterizing the number of claws in geometrically generated conflict graphs.
    • Previous Work: I implemented Minty's algorithm for finding a maximum independent set in claw free graphs with the correction suggested by Nakamura. I also did some math with erdos random graphs to find the expected value of the number of claw free graphs.
Languages:
  1. English (My first language, I learned it at home from my parents)
  2. Java (from AP Computer Science, work on building the simulation for my Fault Tolerance on Wireless Sensor Networks (WSNs) paper)
  3. French (Mild proficiency, learned from French classes in high school)
  4. C
  5. Basic
  6. FORTRAN
  7. Python (6.01, 6.006)
  8. MATLAB (UROP Summer 2011)
Experience:
  • 6.01 Advanced Lab Assistant: In conjunction with taking 6.01 I am also a Lab Assistant for the Design Labs.
  • Circuits: logic gates, Karnaugh maps and the quest for truth tables
    • I designed and taught this class for Splash! 2010 
    • We begin our journey with transistors. From these transistors we build logic gates (NOT, OR, AND, XOR, etc). From these logic gates we build circuits. We use Karnaugh maps to go from a truth table to a circuit.
Extra-curricular hilarity:
  • Built a 4bit computer physically (ie on a breadboard)
  • FIRST Robotics Team 1072: Harker Robotics Team (approximately 30 people a year on the team)
    • Senior Year: President of team
    • Junior Year: Head of mechanical
    • Sophomore Year: Head of manipulator
  • Junior Engineering Technical Society JETS (6 people a year on the team)
    • I was team captain freshmen to junior year. We placed first in the nation in junior varsity my sophomore year. We placed second regionally in varsity my junior year. We placed first regionally in varsity my senior year. National results for senior year still pending.

||. ||||||| | |||||||| || |||||||| | |||||||| || |||||||| |||| ||||| ||||||||| - |||| ||||| || ||| ||||| ||| |||||| - || |||||||| |||||||