Difference between revisions of "User:Feng Yuansong"
| (6 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| + | =About Me= | ||
My current location: Duke University | My current location: Duke University | ||
| + | |||
| + | |||
| + | =Grand Challenges for Engineering= | ||
| + | '''Grand Challenges for Engineering''' | ||
| + | *first project | ||
| + | ::[http://www.popularmechanics.com/science/energy/a8914/why-dont-we-have-fusion-power-15480435/ Why don't we have fusion energy?], Rachel Feltman, Popular Mechanics, updated 16 May 2013, accessed 12 September 2015 (Provide Energy From Fusion) | ||
| + | |||
| + | |||
| + | =Matlab Examples= | ||
| + | '''Traveling Salesman''' | ||
| + | |||
| + | My favourite demonstration in Matlab is ''the Traveling Salesman Problem''. It automatically determine the best route for the salesman to take given a specific number of cities to visit. The interesting point about this program is that it doesn't yield the result, which is the most efficient sequence, at the first glance. In the opposite, it starts with a random combination of connections, and then evolves towards better solution. In other words, the program reaches the answer to different situation on its own, thanks to its internally flexible code. Although there is some details in the code that I have not yet fully understood, I guess that the tricks and the line of thoughts are definitely applicable to some larger fields, like artificial intelligence. | ||
Latest revision as of 04:09, 13 September 2015
About Me
My current location: Duke University
Grand Challenges for Engineering
Grand Challenges for Engineering
- first project
- Why don't we have fusion energy?, Rachel Feltman, Popular Mechanics, updated 16 May 2013, accessed 12 September 2015 (Provide Energy From Fusion)
Matlab Examples
Traveling Salesman
My favourite demonstration in Matlab is the Traveling Salesman Problem. It automatically determine the best route for the salesman to take given a specific number of cities to visit. The interesting point about this program is that it doesn't yield the result, which is the most efficient sequence, at the first glance. In the opposite, it starts with a random combination of connections, and then evolves towards better solution. In other words, the program reaches the answer to different situation on its own, thanks to its internally flexible code. Although there is some details in the code that I have not yet fully understood, I guess that the tricks and the line of thoughts are definitely applicable to some larger fields, like artificial intelligence.
