Difference between revisions of "User:Bc105"
| Line 7: | Line 7: | ||
[http://sequestration.mit.edu/pdf/EST_web_article.pdf What Future for Carbon Capture and Sequestration?], Howard J. Herzog, American Chemical Society, created 1 April 2001, accessed 19 September 2011 (Develop Carbon Sequestration Methods) | [http://sequestration.mit.edu/pdf/EST_web_article.pdf What Future for Carbon Capture and Sequestration?], Howard J. Herzog, American Chemical Society, created 1 April 2001, accessed 19 September 2011 (Develop Carbon Sequestration Methods) | ||
| + | |||
| + | ==Name Pronunciation== | ||
| + | |||
| + | Brandon Chao | ||
| + | (BRAN-duhn CHOW) | ||
| + | |||
| + | ==MATLAB Demonstrations== | ||
| + | |||
| + | My favorite demo that I watched was the Traveling Salesman Demo where the program went through all the random cities and found the shortest distance closed circuit loop to travel to all of them. It was interesting watching the program keep adjusting until it found the best route. The program went through all the calculations for the distance and changed accordingly until it went through all the possibilities so quickly. He code is pretty impressive as it tells the program what to try next and them compare it to the previous distance and then try again if its not shorter. | ||
Latest revision as of 23:08, 19 September 2011
About Me
I am a student in the Pratt School of Engineering with an intended major in Biomedical Engineering. I'm from Houston, TX and part of the class of 2015 at Duke.
Grand Challenge
What Future for Carbon Capture and Sequestration?, Howard J. Herzog, American Chemical Society, created 1 April 2001, accessed 19 September 2011 (Develop Carbon Sequestration Methods)
Name Pronunciation
Brandon Chao (BRAN-duhn CHOW)
MATLAB Demonstrations
My favorite demo that I watched was the Traveling Salesman Demo where the program went through all the random cities and found the shortest distance closed circuit loop to travel to all of them. It was interesting watching the program keep adjusting until it found the best route. The program went through all the calculations for the distance and changed accordingly until it went through all the possibilities so quickly. He code is pretty impressive as it tells the program what to try next and them compare it to the previous distance and then try again if its not shorter.
