Difference between revisions of "User:Smc44"
| (6 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| + | |||
==About Me== | ==About Me== | ||
| − | |||
| + | Hey I'm Susanna! I'm from Portland, OR and am excited to be at Duke. I play lacrosse and I'm planning on majoring in either BME or ME. | ||
| + | |||
| + | ==Name Pronunciation== | ||
| + | Susanna Cai (SUE-'''ZAN'''-A KAI) | ||
==Grand Challenges Article== | ==Grand Challenges Article== | ||
| − | '''Engineering Better Medicines''': [http://www.atp.nist.gov/focus/tissue.htm| Tissue Engineering], National Institute of Standards and Technology, April 12, 2005, August 31, 2010 (Engineering better medicines) | + | '''Engineering Better Medicines''': [http://www.atp.nist.gov/focus/tissue.htm | Tissue Engineering], National Institute of Standards and Technology, April 12, 2005, August 31, 2010 (Engineering better medicines) |
| + | |||
| + | ==Matlab Demos== | ||
| + | |||
| + | My favorite Matlab Demo was the Traveling Salesman Demo. During high school, I actually did a long-term math project on solving a similar traveling salesman problem for 19 cities throughout Europe. Looking back, it would have been extremely helpful to know that Matlab could have easily mapped out the fastest route! I thought the Demo was also cool because you could see the work in progress. After the chosen number of cities were picked at random, you could physically see Matlab working to making the shortest closed circuit possible. | ||
Latest revision as of 14:04, 20 September 2010
About Me
Hey I'm Susanna! I'm from Portland, OR and am excited to be at Duke. I play lacrosse and I'm planning on majoring in either BME or ME.
Name Pronunciation
Susanna Cai (SUE-ZAN-A KAI)
Grand Challenges Article
Engineering Better Medicines: | Tissue Engineering, National Institute of Standards and Technology, April 12, 2005, August 31, 2010 (Engineering better medicines)
Matlab Demos
My favorite Matlab Demo was the Traveling Salesman Demo. During high school, I actually did a long-term math project on solving a similar traveling salesman problem for 19 cities throughout Europe. Looking back, it would have been extremely helpful to know that Matlab could have easily mapped out the fastest route! I thought the Demo was also cool because you could see the work in progress. After the chosen number of cities were picked at random, you could physically see Matlab working to making the shortest closed circuit possible.
