Difference between revisions of "User:Ph82"
Jump to navigation
Jump to search
| (5 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| + | == About Me == | ||
| + | My name is Peter Hoang and I am 18 years. I plan on majoring in biomedical engineering here at Duke and potentially be on a premed track. I am originally from California and have one brother. My interests include sports, reading, and music. | ||
| + | |||
| + | == Grand Challenges for Engineering Article == | ||
| + | |||
[http://www.grandprix.com/ft/ft21102.html Formula 1's virtual reality], Joe Saward, Grandprix, updated 14 January 2009, accessed 1 September 2013 | [http://www.grandprix.com/ft/ft21102.html Formula 1's virtual reality], Joe Saward, Grandprix, updated 14 January 2009, accessed 1 September 2013 | ||
| + | |||
| + | == Favorite Matlab Demonstration == | ||
| + | |||
| + | The Traveling Salesman demonstration was one of my favorite ones in Matlab because it tries to achieve the most efficient route to travel between a certain number of cities. As a person who likes to travel, I found this interesting and useful. The graphical output is easy to read and shows the best way to travel between every city once without overlapping. | ||
Latest revision as of 18:35, 15 September 2013
About Me
My name is Peter Hoang and I am 18 years. I plan on majoring in biomedical engineering here at Duke and potentially be on a premed track. I am originally from California and have one brother. My interests include sports, reading, and music.
Grand Challenges for Engineering Article
Formula 1's virtual reality, Joe Saward, Grandprix, updated 14 January 2009, accessed 1 September 2013
Favorite Matlab Demonstration
The Traveling Salesman demonstration was one of my favorite ones in Matlab because it tries to achieve the most efficient route to travel between a certain number of cities. As a person who likes to travel, I found this interesting and useful. The graphical output is easy to read and shows the best way to travel between every city once without overlapping.
