Difference between revisions of "User:Mgs26"
Jump to navigation
Jump to search
| (4 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
Hi I'm Morgan. I'm from New York and am a freshman at Duke in the Pratt School of Engineering | Hi I'm Morgan. I'm from New York and am a freshman at Duke in the Pratt School of Engineering | ||
| − | + | == Grand Challenges of Engineering Article == | |
| − | + | [http://online.wsj.com/article/SB10001424052748704107204575039330758722368.html A Future for Fusion?], Leia Parker, The Wall Street Journal, created 22 February 2010, accessed 21 September 2011 (Provide Energy from Fusion) | |
| − | + | == Phonetic Pronunciation of My Name == | |
| − | |||
| − | + | Morgan Simons (MORE-gan SIGH-mons) | |
| − | + | == Matlab Demo == | |
| − | |||
My Favorite Matlab Demo was the Traveling Salesman because I was able to watch as the computer sorted itself out and tried to find the best route from city to city for the salesman to take. I made it into a sort of game, where I would look for an area where the travel path was not optimal and then see how quickly the computer would recognize this and fix it. | My Favorite Matlab Demo was the Traveling Salesman because I was able to watch as the computer sorted itself out and tried to find the best route from city to city for the salesman to take. I made it into a sort of game, where I would look for an area where the travel path was not optimal and then see how quickly the computer would recognize this and fix it. | ||
Latest revision as of 17:38, 22 September 2011
Hi I'm Morgan. I'm from New York and am a freshman at Duke in the Pratt School of Engineering
Grand Challenges of Engineering Article
A Future for Fusion?, Leia Parker, The Wall Street Journal, created 22 February 2010, accessed 21 September 2011 (Provide Energy from Fusion)
Phonetic Pronunciation of My Name
Morgan Simons (MORE-gan SIGH-mons)
Matlab Demo
My Favorite Matlab Demo was the Traveling Salesman because I was able to watch as the computer sorted itself out and tried to find the best route from city to city for the salesman to take. I made it into a sort of game, where I would look for an area where the travel path was not optimal and then see how quickly the computer would recognize this and fix it.
