Difference between revisions of "User:Afa10"
| (4 intermediate revisions by the same user not shown) | |||
| Line 2: | Line 2: | ||
== About Me == | == About Me == | ||
| + | [[File:HC 12.jpg|right|180px|thumb|[[Austin Anthis]]]] | ||
Hi my name is '''Austin Anthis''' and I am a student at Duke University! I am currently interested in pursuing either Mechanical or Civil Engineering. I love to play lacrosse and tennis, sing and be involved in Christian fellowship. I am from Katy, Texas, which is just west of Houston. I also lived in Nigeria from 2003-2006 when my parents served as medical missionaries. I have three younger sisters and two great parents! Go Blue Devils! | Hi my name is '''Austin Anthis''' and I am a student at Duke University! I am currently interested in pursuing either Mechanical or Civil Engineering. I love to play lacrosse and tennis, sing and be involved in Christian fellowship. I am from Katy, Texas, which is just west of Houston. I also lived in Nigeria from 2003-2006 when my parents served as medical missionaries. I have three younger sisters and two great parents! Go Blue Devils! | ||
| Line 21: | Line 22: | ||
This article contains a project in the same field I want to pursue as a career: | This article contains a project in the same field I want to pursue as a career: | ||
*[http://www.sfgate.com/education/article/BERKELEY-Engineering-students-make-it-easy-2497340.php BERKELEY / Engineering students make it easy, low-tech / Solving the problem of clean water for poor communities], Rick DelVecchio, San Francisco Chronicle, created 13 May 2006, accessed 12 September 2013 | *[http://www.sfgate.com/education/article/BERKELEY-Engineering-students-make-it-easy-2497340.php BERKELEY / Engineering students make it easy, low-tech / Solving the problem of clean water for poor communities], Rick DelVecchio, San Francisco Chronicle, created 13 May 2006, accessed 12 September 2013 | ||
| + | |||
| + | == [[MATLAB]] Demonstration == | ||
| + | My favorite MATLAB demonstration was the "Travelling Salesman" example. Given a certain number of randomly placed cities on continental U.S. the program provides a closed circuit route which visits all of the cities in the shortest distance. The coolest part about the program was it begins with a long route and systematically changes the path until it finds the shortest one. Watching the code in progress was fascinating. | ||
== Signature == | == Signature == | ||
[[User:Afa10|Afa10]] ([[User talk:Afa10|talk]]) 13:36, 12 September 2013 (EDT) | [[User:Afa10|Afa10]] ([[User talk:Afa10|talk]]) 13:36, 12 September 2013 (EDT) | ||
Latest revision as of 20:22, 15 September 2013
Contents
About Me
Hi my name is Austin Anthis and I am a student at Duke University! I am currently interested in pursuing either Mechanical or Civil Engineering. I love to play lacrosse and tennis, sing and be involved in Christian fellowship. I am from Katy, Texas, which is just west of Houston. I also lived in Nigeria from 2003-2006 when my parents served as medical missionaries. I have three younger sisters and two great parents! Go Blue Devils!
Courses
This Fall I am enrolled in:
- EGR103: Computational Methods in Engineering
- Math 212: Multi-variable Calculus
- Chemistry 101: Core Concepts in Chemistry
- Writing 101: Humanitarian Aid
- Engineering 90l: Introduction to Engineering
Extracurricular Activities
I just joined CRU which is a Christian fellowship on campus. I am also a part of the "Something Borrowed, Something Blue" A Capella group and a new member of Duke Motorsports.
Grand Challenges for Engineering Article
This article contains a project in the same field I want to pursue as a career:
- BERKELEY / Engineering students make it easy, low-tech / Solving the problem of clean water for poor communities, Rick DelVecchio, San Francisco Chronicle, created 13 May 2006, accessed 12 September 2013
MATLAB Demonstration
My favorite MATLAB demonstration was the "Travelling Salesman" example. Given a certain number of randomly placed cities on continental U.S. the program provides a closed circuit route which visits all of the cities in the shortest distance. The coolest part about the program was it begins with a long route and systematically changes the path until it finds the shortest one. Watching the code in progress was fascinating.
