<?xml version="1.0" encoding="UTF-8"?>
<!--Generated by Squarespace Site Server v5.11.81 (http://www.squarespace.com/) on Fri, 24 Feb 2012 06:11:33 GMT--><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rss="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:cc="http://web.resource.org/cc/"><rss:channel rdf:about="http://www.jacobporter.com/blog/"><rss:title>Blog</rss:title><rss:link>http://www.jacobporter.com/blog/</rss:link><rss:description></rss:description><dc:language>en-US</dc:language><dc:date>2012-02-24T06:11:33Z</dc:date><admin:generatorAgent rdf:resource="http://www.squarespace.com/">Squarespace Site Server v5.11.81 (http://www.squarespace.com/)</admin:generatorAgent><rss:items><rdf:Seq><rdf:li rdf:resource="http://www.jacobporter.com/blog/2012/1/10/programming-languages-in-retrospect.html"/><rdf:li rdf:resource="http://www.jacobporter.com/blog/2012/1/10/new-stanford-online-classes.html"/><rdf:li rdf:resource="http://www.jacobporter.com/blog/2011/10/16/fall-classes.html"/><rdf:li rdf:resource="http://www.jacobporter.com/blog/2011/8/17/website-up.html"/></rdf:Seq></rss:items></rss:channel><rss:item rdf:about="http://www.jacobporter.com/blog/2012/1/10/programming-languages-in-retrospect.html"><rss:title>Programming Languages In Retrospect</rss:title><rss:link>http://www.jacobporter.com/blog/2012/1/10/programming-languages-in-retrospect.html</rss:link><dc:creator>Jacob Porter</dc:creator><dc:date>2012-01-10T13:24:33Z</dc:date><dc:subject></dc:subject><content:encoded><![CDATA[<p>The following are some of the things that I've done with programming languages in the past.</p>
<p><strong>Java</strong><br />data structures (lists, graphs, hashtables, sets, heaps, priority queue, queue)<br />typical algorithms (Kruskal, Dijkstra, BFS, DFS, merge sort, quicksort, insertion sort)<br />made modifications to Neighbor-Joining type algorithms (Computational Biology)<br />database access<br />file I/O<br />XML parsing<br />thread programming (computer science class)<br />scheduler algorithms (computer science class)</p>
<p><strong>Python<br /></strong>typical data types: dictionaries, lists, tuples, strings, ints, floats, etc.<br />logic: for, if-then<br />class hierarchy<br />regular expression matching<br />file I/O<br />web page parsing&nbsp;<br />compilation algorithms (earley parser, lexers, context-free grammars)<br />numerical algorithms (numpy, optimization)<br />Django (basic tutorial)<br />wxPython (really really basic tutorial)&nbsp;<br />computational biology algorithms (protein knot-finding, gene searching, etc.)</p>
<p><strong>C/C++<br /></strong>worked with machine structures and memory allocation in the class CS 61C&nbsp;<br />modified software called MJOIN to experiment on it&nbsp;<br />parallel computation with OpenMP at the UC Berkeley parallel computing boot camp&nbsp;</p>
<p><strong>Javascript</strong><br />created a compiler in Python for Javascript with a context-free grammar for a computer science class</p>
<p><strong>XML, SQL, XPath, XQuery</strong><br />searches, sorts, access, inserts, deletes, views, updates, triggers, etc.</p>
<p><strong>Octave/Matlab<br /></strong>basic data types and logic<br />numerical linear algebra algorithms (Lanczos process, eigenvalue estimation, grad school class)<br />worked with machine learning algorithms from a Stanford online class (i.e. linear regression, logistic regression, artificial neural networks, support vector machines)<br />statistical modeling using singular value decomposition<br />some optimization algorithms&nbsp;</p>
<p><strong>Perl</strong><br />implemented the Smith-Waterman edit distance algorithm<strong>&nbsp;</strong></p>
<p><strong>R</strong><br />implemented simulated annealing algorithm,&nbsp;statistical calculation on phylogentic trees, and a protein-protein docking algorithm&nbsp;</p>
<p><strong>Maple</strong><br />computed phylogenetic invariants<br />matrix algebra<strong>&nbsp;</strong></p>
<p><strong>MIPS</strong></p>
<p><strong>TI-89 Basic (Hooray for High School)</strong><br />created calculation programs for pre-calculus and algebra<strong>&nbsp;</strong>such as the quadratic equation, parabola properties, conic section properties<br />wrote and developed text based adventure games</p>]]></content:encoded></rss:item><rss:item rdf:about="http://www.jacobporter.com/blog/2012/1/10/new-stanford-online-classes.html"><rss:title>New Stanford Online Classes</rss:title><rss:link>http://www.jacobporter.com/blog/2012/1/10/new-stanford-online-classes.html</rss:link><dc:creator>Jacob Porter</dc:creator><dc:date>2012-01-10T13:09:15Z</dc:date><dc:subject></dc:subject><content:encoded><![CDATA[<p>Stanford is offering several online classes once again starting late January. &nbsp;There is one on <a href="http://www.pgm-class.org/">probabilistic graph models</a>, which is a subject relevant to machine learning. &nbsp;You can scroll down to the bottom of a class to see other course offerings. &nbsp;They are geared towards undergraduates, and this semester there are several interesting classes in cryptography, business, <a href="http://www.security-class.org/">computer security</a>, and econometric game theory among others. &nbsp;They are unaccredited. &nbsp;I intend to take or audit a few of these, time permitting. &nbsp;The computer security class is offered in C++, and I hope to learn more about the language from it. &nbsp;The probabilistic graph models class is relevant to research that I've done in computational biology, and it should enhance my understanding of machine learning and statistics.</p>]]></content:encoded></rss:item><rss:item rdf:about="http://www.jacobporter.com/blog/2011/10/16/fall-classes.html"><rss:title>Fall Classes</rss:title><rss:link>http://www.jacobporter.com/blog/2011/10/16/fall-classes.html</rss:link><dc:creator>Jacob Porter</dc:creator><dc:date>2011-10-16T21:07:51Z</dc:date><dc:subject>School</dc:subject><content:encoded><![CDATA[<p>I'm taking Stanford Online classes in Computer Science this "fall".&nbsp; I'm taking the database class (<a href="http://www.db-class.com">db-class.com</a>), the machine learning class (<a href="http://www.ml-class.com">ml-class.com</a>), and the artificial intelligence (AI) class (<a href="http://www.ai-class.com">ai-class.com</a>).&nbsp; These are all high quality classes, and I'm happy for the opportunity to take them.&nbsp; With both machine learning and databases, I'm taking the advanced track with homeworks and assignments.&nbsp; With the AI class, I'm just taking the lectures,&nbsp;the Basic version, since I need time to do other things.&nbsp; AI is useful for stuff I might do, and there are many algorithms that I haven't seen before;&nbsp;however, machine learning is more relevant.&nbsp; Learning some new algorithms from AI shouldn't be too challenging since I'm more&nbsp;of an algorithm/theory person anyhow.&nbsp; Learning&nbsp;about databases in more depth will be helpful and is something that I might not do on my own.&nbsp; So far, the machine learning class isn't very challenging since it reviewed ordinary least squares, which&nbsp;I already know about.&nbsp; The database class, on the other hand, is challenging since&nbsp;I'm not an expert&nbsp;on SQL (Standard Query Language), and writing queries can be tricky.</p>]]></content:encoded></rss:item><rss:item rdf:about="http://www.jacobporter.com/blog/2011/8/17/website-up.html"><rss:title>Website up</rss:title><rss:link>http://www.jacobporter.com/blog/2011/8/17/website-up.html</rss:link><dc:creator>Jacob Porter</dc:creator><dc:date>2011-08-17T16:04:31Z</dc:date><dc:subject></dc:subject><content:encoded><![CDATA[<p>My website went up around August 05, 2011.</p>]]></content:encoded></rss:item></rdf:RDF>
