Difference between revisions of "User:Gcm9"
Jump to navigation
Jump to search
(One intermediate revision by the same user not shown) | |||
Line 1: | Line 1: | ||
==About Me== | ==About Me== | ||
My name is Graham Miller. I'm originally from Northern California. | My name is Graham Miller. I'm originally from Northern California. | ||
+ | === Name Pronunciation === | ||
+ | GRAM MILL-er | ||
+ | |||
== Current Activities == | == Current Activities == | ||
*Academics | *Academics | ||
Line 9: | Line 12: | ||
I found this interesting article concerning the challenge to secure cyberspace: | I found this interesting article concerning the challenge to secure cyberspace: | ||
*[http://techland.time.com/2011/09/20/hackers-target-japanese-weapons-maker-nuclear-power-plants/ Hackers Target Japanese Weapons Maker, Nuclear Power Plants], Matt Peckham, Time, created 20 September 2011, accessed 20 September 2011 (Grand Challenge) | *[http://techland.time.com/2011/09/20/hackers-target-japanese-weapons-maker-nuclear-power-plants/ Hackers Target Japanese Weapons Maker, Nuclear Power Plants], Matt Peckham, Time, created 20 September 2011, accessed 20 September 2011 (Grand Challenge) | ||
+ | == MATLAB == | ||
+ | === MATLAB Demonstrations === | ||
+ | My favorite demonstration was by far that of the "Traveling Salesman." To me at least, it seems very impressive that someone could write a program that not only finds the most efficient rout between a given number of cities but also displays it graphically in this way. |
Latest revision as of 22:22, 20 September 2011
Contents
About Me
My name is Graham Miller. I'm originally from Northern California.
Name Pronunciation
GRAM MILL-er
Current Activities
- Academics
- Soccer
- Work Study
- Parkour
Grand Challenges for Engineering
I found this interesting article concerning the challenge to secure cyberspace:
- Hackers Target Japanese Weapons Maker, Nuclear Power Plants, Matt Peckham, Time, created 20 September 2011, accessed 20 September 2011 (Grand Challenge)
MATLAB
MATLAB Demonstrations
My favorite demonstration was by far that of the "Traveling Salesman." To me at least, it seems very impressive that someone could write a program that not only finds the most efficient rout between a given number of cities but also displays it graphically in this way.