Difference between revisions of "User:Jma69"

From PrattWiki
Jump to navigation Jump to search
 
(3 intermediate revisions by the same user not shown)
Line 2: Line 2:
  
 
Here's a cool article about personalized medicine:
 
Here's a cool article about personalized medicine:
[http://www.genengnews.com/gen-articles/making-personalized-medicine-a-reality/2316/ Making Personalized Medicine a Reality],Genetic Engineering and Biotechnology News, accessed 5 September 2012 (Personalized Medicine)
+
 
 +
[http://www.genengnews.com/gen-articles/making-personalized-medicine-a-reality/2316/ Making Personalized Medicine a Reality],Lisa A. Haile, Genetic Engineering & Biotechnology News, updated 1 January 2008, accessed 5 September 2012
 +
 
 +
My favorite Matlab Demo is the Traveling Salesman.  At first, this title conjured images of Willy Loman, the protagonist of Arthur Miller's "Death of a Salesman."  Alas, this was not the topic of the demo.  Instead, this demo shows how matlab calculates the shortest closed-circuit path between a given set of points (or travel itinerary across a certain set of cities).  After setting the amount of cities/points in the circuit, one gets to physically watch matlab cycle through the possibilities and slowly refine its answer.  In the end, the answer is always a polygon (the circuit never crosses itself), which I found particularly insightful.

Latest revision as of 04:20, 6 September 2012

Hello, everybody. My name is Jason. I'm from Miami Beach, FL and am a huge sports fan, so I love my Heat, Dolphins, and Marlins. I live in Blackwell. I'm thinking BME, but who knows?

Here's a cool article about personalized medicine:

Making Personalized Medicine a Reality,Lisa A. Haile, Genetic Engineering & Biotechnology News, updated 1 January 2008, accessed 5 September 2012

My favorite Matlab Demo is the Traveling Salesman. At first, this title conjured images of Willy Loman, the protagonist of Arthur Miller's "Death of a Salesman." Alas, this was not the topic of the demo. Instead, this demo shows how matlab calculates the shortest closed-circuit path between a given set of points (or travel itinerary across a certain set of cities). After setting the amount of cities/points in the circuit, one gets to physically watch matlab cycle through the possibilities and slowly refine its answer. In the end, the answer is always a polygon (the circuit never crosses itself), which I found particularly insightful.