diff --git a/config.json b/config.json
new file mode 100644
index 0000000..b6a89fa
--- /dev/null
+++ b/config.json
@@ -0,0 +1,11 @@
+{
+	"server": {
+		"url": "127.0.0.1",
+		"port": 8000
+	},
+	"database":{
+		"name": "moocrank",
+		"url": "localhost",
+		"port": 27017
+	}
+}
\ No newline at end of file
diff --git a/data/coursera.json b/data/coursera.json
new file mode 100644
index 0000000..4d065ee
--- /dev/null
+++ b/data/coursera.json
@@ -0,0 +1 @@
+{"unis":[{"name":"Stanford University","short_name":"stanford","favicon":"https://coursera-university-assets.s3.amazonaws.com/dc/581cda352d067023dcdcc0d9efd36e/favicon-stanford.ico","home_link":"http://online.stanford.edu/","id":1,"display":true},{"name":"University of Michigan","short_name":"umich","favicon":"https://coursera-university-assets.s3.amazonaws.com/50/52265d555e7bf0b0b86f7a1a07a183/favicon-umich.ico","home_link":"","id":3,"display":true},{"name":"Princeton University","short_name":"princeton","favicon":"https://coursera-university-assets.s3.amazonaws.com/d4/29daf4b768e1aa467202d4d2dcf8d8/favicon-princeton.ico","home_link":null,"id":4,"display":true},{"name":"University of Pennsylvania","short_name":"penn","favicon":"https://coursera-university-assets.s3.amazonaws.com/f3/2ca37fd0d5d009a94e0ba7f284c860/favicon-penn.ico","home_link":null,"id":6,"display":true},{"name":"Duke University","short_name":"duke","favicon":"https://coursera-university-assets.s3.amazonaws.com/cc/500c9f41731d797a0e108a4edd8bc1/favicon-duke.ico","home_link":null,"id":7,"display":true},{"name":"Johns Hopkins University","short_name":"jhu","favicon":"https://coursera-university-assets.s3.amazonaws.com/80/d81353ccd0bab30962a5770d7aec97/favicon-jhu.ico","home_link":null,"id":8,"display":true},{"name":"Georgia Institute of Technology","short_name":"gatech","favicon":"https://coursera-university-assets.s3.amazonaws.com/88/4d9c7e8a6ad0e787553d8b9d77d450/favicon-gatech.ico","home_link":null,"id":9,"display":true},{"name":"University of California, San Francisco","short_name":"ucsf","favicon":"https://coursera-university-assets.s3.amazonaws.com/0c/2907cc15f65f9357cbaadd020c7949/favicon-ucsf.ico","home_link":null,"id":10,"display":true},{"name":"University of Toronto","short_name":"utoronto","favicon":"https://coursera-university-assets.s3.amazonaws.com/8e/773801b870a0cb946698134a77417d/favicon-utoronto.ico","home_link":null,"id":11,"display":true},{"name":"California Institute of Technology","short_name":"caltech","favicon":"https://coursera-university-assets.s3.amazonaws.com/1c/237c842c020ea0a3a6c9647d5cbd66/favicon-caltech.ico","home_link":null,"id":12,"display":true},{"name":"Rice University","short_name":"rice","favicon":"https://coursera-university-assets.s3.amazonaws.com/cc/17ce4ffdaddcc4aab941da137ddbbf/favicon-rice.ico","home_link":"","id":13,"display":true},{"name":"The University of Edinburgh","short_name":"edinburgh","favicon":"https://coursera-university-assets.s3.amazonaws.com/d3/bcdd33b2d979d2bea9467b17f9bbbb/favicon-edinburgh.ico","home_link":null,"id":14,"display":true},{"name":"University of Washington","short_name":"uw","favicon":"https://coursera-university-assets.s3.amazonaws.com/98/7480c1f9271144aa75fe024a1ad5a0/favicon-uw.ico","home_link":null,"id":15,"display":true},{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","short_name":"epfl","favicon":"https://coursera-university-assets.s3.amazonaws.com/ba/142188830b51c8c51b95cc25e5dbf3/epflfav.png","home_link":null,"id":16,"display":true},{"name":"University of Illinois at Urbana-Champaign","short_name":"illinois","favicon":"https://coursera-university-assets.s3.amazonaws.com/2b/57d79bc1eb5b081e6a1b3729782566/favicon.png","home_link":"","id":17,"display":true},{"name":"University of Virginia","short_name":"uva","favicon":"https://coursera-university-assets.s3.amazonaws.com/ba/8cf6b18a752fa9ba66be05d904571d/favicon-uva.ico","home_link":null,"id":18,"display":true},{"name":"Indian Institute of Technology Delhi","short_name":"iitd","favicon":"https://coursera-university-assets.s3.amazonaws.com/93/8531f10a9edadb75ba98db75fb5ad4/favicon-iitd.ico","home_link":"http://www.iitd.ac.in/","id":19,"display":false},{"name":"Berklee College of Music","short_name":"berklee","favicon":"https://coursera-university-assets.s3.amazonaws.com/10/bb37f439a00f92524143611e504b27/favicon.png","home_link":"","id":21,"display":true},{"name":"Brown University","short_name":"brown","favicon":"https://coursera-university-assets.s3.amazonaws.com/54/51fc6594a22ce0fcd31168f109900f/5_brown_icon_coursera.jpg","home_link":null,"id":22,"display":true},{"name":"Emory University","short_name":"emory","favicon":"https://coursera-university-assets.s3.amazonaws.com/a2/835a1009fc4245f378dd8add26dabc/Shield_280.jpg","home_link":null,"id":23,"display":true},{"name":"Hebrew University of Jerusalem","short_name":"huji","favicon":"https://coursera-university-assets.s3.amazonaws.com/48/7cac159746dca5674234142a147d0f/HebrewSmallIcon2.png","home_link":null,"id":24,"display":true},{"name":"Universiteit Leiden","short_name":"leiden","favicon":"https://coursera-university-assets.s3.amazonaws.com/ee/d18f6f5f5a5372c55cac5bc7f42b2a/ul_icon.gif","home_link":"","id":25,"display":true},{"name":"University of London International Programmes","short_name":"london","favicon":"https://coursera-university-assets.s3.amazonaws.com/b9/7737f6a77362b5ef13cb10fd1aeaa0/uol.ico","home_link":null,"id":26,"display":true},{"name":"Icahn School of Medicine at Mount Sinai","short_name":"mssm","favicon":"https://coursera-university-assets.s3.amazonaws.com/6e/050cc941c1081a711d979b25b7b108/Course_catalog_page_16x16.png","home_link":null,"id":27,"display":true},{"name":"The Ohio State University","short_name":"osu","favicon":"https://coursera-university-assets.s3.amazonaws.com/ae/1201e9f6249cafd6a532170780de3a/favicon-osu.png","home_link":null,"id":28,"display":true},{"name":"The University of British Columbia","short_name":"ubc","favicon":"https://coursera-university-assets.s3.amazonaws.com/d1/159770b1b64f0bb3736e0a1ad5144b/favicon.ico","home_link":null,"id":29,"display":true},{"name":"University of California, Irvine","short_name":"uci","favicon":"https://coursera-university-assets.s3.amazonaws.com/21/fe2ddd0d8a37bbb16033878eac3d75/16x16_uci.png","home_link":null,"id":30,"display":true},{"name":"University of Florida","short_name":"ufl","favicon":"https://coursera-university-assets.s3.amazonaws.com/a5/befae42322a4a691d65af982093ea8/favicon.png","home_link":null,"id":31,"display":true},{"name":"University of Maryland, College Park","short_name":"umd","favicon":"https://coursera-university-assets.s3.amazonaws.com/98/81bc9a607b97fadd8a2fdd6b66bfc2/favicon_16x16.ico","home_link":"","id":32,"display":true},{"name":"University of Melbourne","short_name":"unimelb","favicon":"https://coursera-university-assets.s3.amazonaws.com/c2/fc137263568a25c66e2cc5f98ca899/UOM_16x16pxLogo.png","home_link":null,"id":33,"display":true},{"name":"Wesleyan University","short_name":"wesleyan","favicon":"https://coursera-university-assets.s3.amazonaws.com/03/3d1139223689f57de761dd6783d8c3/6-wesleyan_small_icon.gif","home_link":null,"id":34,"display":true},{"name":"The Hong Kong University of Science and Technology","short_name":"hkust","favicon":"https://coursera-university-assets.s3.amazonaws.com/cb/c8497eeb219091d34206d663f73f27/ust_logo_16x16.png","home_link":null,"id":35,"display":true},{"name":"University of Pittsburgh","short_name":"pitt","favicon":"https://coursera-university-assets.s3.amazonaws.com/00/ee7a228aa46a231152d55b9bb9d0ae/logo_16x16.png","home_link":null,"id":36,"display":true},{"name":"Vanderbilt University","short_name":"vanderbilt","favicon":"https://coursera-university-assets.s3.amazonaws.com/76/5bf77c95f3afdcd6ff0c88fbf95693/vanderbilt_16x16_b.png","home_link":null,"id":37,"display":true},{"name":"Columbia University","short_name":"columbia","favicon":"https://coursera-university-assets.s3.amazonaws.com/72/c9b56e3ff66fa6e1ca52bdea9440ae/ColumbialittleLOGO4.png","home_link":null,"id":40,"display":true},{"name":"Mt. San Jacinto College","short_name":"msjc","favicon":"","home_link":"http://www.msjc.edu/Pages/default.aspx","id":44,"display":false},{"name":"The Chinese University of Hong Kong","short_name":"cuhk","favicon":"https://coursera-university-assets.s3.amazonaws.com/62/ee9401253f01a2b6446e8811865472/icon.png","home_link":null,"id":45,"display":true},{"name":"National University of Singapore","short_name":"nus","favicon":"","home_link":null,"id":47,"display":true},{"name":"University of Geneva","short_name":"unige","favicon":"https://coursera-university-assets.s3.amazonaws.com/2d/ced013338cdff809fbdde5a24f3354/UNIGE-SmallIcon-16x16.png","home_link":null,"id":49,"display":true},{"name":"University of Minnesota","short_name":"minnesota","favicon":"https://coursera-university-assets.s3.amazonaws.com/f2/c0c3766390def44d6704f82d4d7955/favicon.ico","home_link":null,"id":50,"display":true},{"name":"Pennsylvania State University","short_name":"psu","favicon":"https://coursera-university-assets.s3.amazonaws.com/be/4a6da97cb18e3f0543e11305aeec3b/psu_favicon.png","home_link":null,"id":51,"display":true},{"name":"University of California, San Diego ","short_name":"ucsd","favicon":"","home_link":null,"id":53,"display":true},{"name":"Northwestern University","short_name":"northwestern","favicon":"","home_link":null,"id":54,"display":true},{"name":"University of California, Santa Cruz","short_name":"ucsc","favicon":"","home_link":null,"id":56,"display":true},{"name":"Technical University of Denmark (DTU)","short_name":"dtu","favicon":"https://coursera-university-assets.s3.amazonaws.com/8b/1ab7b5448abdcd28732eb55226c501/DTUlogoSmall_nobg.png","home_link":null,"id":57,"display":true},{"name":"Universidad Nacional Aut\u00f3noma de M\u00e9xico","short_name":"unam","favicon":"","home_link":null,"id":58,"display":true},{"name":"California Institute of the Arts","short_name":"calarts","favicon":"","home_link":null,"id":59,"display":true},{"name":"University of Rochester","short_name":"rochester","favicon":"","home_link":null,"id":60,"display":true},{"name":"IE Business School","short_name":"ie","favicon":"https://coursera-university-assets.s3.amazonaws.com/18/9c556b9d2a5990ef6cb2839a0c5dc3/1university_logo.png","home_link":null,"id":61,"display":true},{"name":"Tecnol\u00f3gico de Monterrey","short_name":"tecdemonterrey","favicon":"","home_link":null,"id":62,"display":true},{"name":"University of Copenhagen","short_name":"ucph","favicon":"https://coursera-university-assets.s3.amazonaws.com/55/45a9eafa2bfdb29d961f8472a0b7fa/favicon_fa.ico","home_link":null,"id":63,"display":true},{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen (LMU)","short_name":"lmu","favicon":"https://coursera-university-assets.s3.amazonaws.com/0e/9145506f8bafba7c4c29fdde573a60/Unbenannt-4.png","home_link":null,"id":64,"display":true},{"name":"University of Wisconsin\u2013Madison","short_name":"wisconsin","favicon":"https://coursera-university-assets.s3.amazonaws.com/e4/4fd5046adaccc8414bb742946bcdba/uwcrest_web_sm_shado.png","home_link":null,"id":65,"display":true},{"name":"\u00c9cole Polytechnique","short_name":"ep","favicon":"https://coursera-university-assets.s3.amazonaws.com/9e/afbf6718f5c81f1e31d11aa1b47dff/logo_POLYTECHNIQUE_16X16px.png","home_link":null,"id":66,"display":true},{"name":"Rutgers University","short_name":"rutgers","favicon":"","home_link":null,"id":67,"display":true},{"name":"Case Western Reserve University","short_name":"casewestern","favicon":"","home_link":null,"id":68,"display":true},{"name":"University of Colorado Boulder","short_name":"boulder","favicon":"","home_link":null,"id":71,"display":true},{"name":"Sapienza University of Rome","short_name":"sapienza","favicon":"https://coursera-university-assets.s3.amazonaws.com/4f/07577f978824782011a597f14f2bdf/favicon-16x16-png.png","home_link":null,"id":74,"display":true},{"name":"National Taiwan University","short_name":"taiwan","favicon":"","home_link":null,"id":75,"display":true},{"name":"The University of Tokyo","short_name":"todai","favicon":"","home_link":null,"id":76,"display":true},{"name":"The University of North Carolina at Chapel Hill","short_name":"unc","favicon":"","home_link":null,"id":77,"display":true},{"name":"Technische Universit\u00e4t M\u00fcnchen (TUM)","short_name":"tum","favicon":"","home_link":null,"id":78,"display":true},{"name":"Curtis Institute of Music","short_name":"curtis","favicon":"","home_link":null,"id":79,"display":true},{"name":"Universitat Aut\u00f2noma de Barcelona","short_name":"uab","favicon":"","home_link":null,"id":80,"display":true},{"name":"American Museum of Natural History","short_name":"amnh","favicon":"https://coursera-university-assets.s3.amazonaws.com/78/6a808ab06c1ffef534768de3a0e8a2/icon_logo.png","home_link":"","id":100,"display":true},{"name":"New Teacher Center","short_name":"ntc","favicon":"https://coursera-university-assets.s3.amazonaws.com/33/168213375fa6e522c6e373a457566b/favicon.png","home_link":"","id":103,"display":true},{"name":"Relay Graduate School of Education","short_name":"relay","favicon":"https://coursera-university-assets.s3.amazonaws.com/c1/8aa8e4ca6c35946b8f91513912604a/Relay_favicon_16x16.png","home_link":"","id":104,"display":true},{"name":"Match Teacher Residency","short_name":"mtr","favicon":"","home_link":"","id":105,"display":true},{"name":"Commonwealth Education Trust","short_name":"cet1886","favicon":"https://coursera-university-assets.s3.amazonaws.com/9d/6339cee6ef32f274cc50dd912e84d4/favicon.png","home_link":"","id":106,"display":true},{"name":"The Museum of Modern Art","short_name":"moma","favicon":"https://coursera-university-assets.s3.amazonaws.com/2d/3ce9358bedaecb4792e2f14a0651cc/coursera_180x180.png","home_link":"","id":107,"display":true},{"name":"Exploratorium","short_name":"exploratorium","favicon":"","home_link":"","id":108,"display":true},{"name":"Yale University","short_name":"yale","favicon":"","home_link":"","id":109,"display":true},{"name":"Tel Aviv University","short_name":"telaviv","favicon":"https://coursera-university-assets.s3.amazonaws.com/be/47ef4e542b6cf91426d91b3325a4eb/image001.png","home_link":"","id":110,"display":true},{"name":"Technion - Israel Institute of Technology","short_name":"technion","favicon":"","home_link":"","id":129,"display":true}],"topics":{"2":{"insts":[1244],"language":"en","name":"Machine Learning","short_name":"ml","order_idx":0,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/ml/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/ml/large-icon.png","cats":[16,17],"unis":[1],"id":2},"3":{"insts":[1257],"language":"en","name":"Probabilistic Graphical Models","short_name":"pgm","order_idx":1,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/pgm/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/pgm/large-icon.png","cats":[17],"unis":[1],"id":3},"6":{"insts":[1250],"language":"en","name":"Human-Computer Interaction","short_name":"hci","order_idx":2,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/hci/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/hci/large-icon.png","cats":[4,12],"unis":[1],"id":6},"7":{"insts":[775,68850],"language":"en","name":"Natural Language Processing","short_name":"nlp","order_idx":3,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/nlp/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/nlp/large-icon.png","cats":[17],"unis":[1],"id":7},"8":{"insts":[768],"language":"en","name":"Algorithms: Design and Analysis, Part 1","short_name":"algo","order_idx":4,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/algo/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/algo/large-icon.png","cats":[1],"unis":[1],"id":8},"9":{"insts":[774],"language":"en","name":"Cryptography I","short_name":"crypto","order_idx":5,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/crypto/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/crypto/large-icon.png","cats":[1,11],"unis":[1],"id":9},"11":{"insts":[785],"language":"en","name":"Model Thinking","short_name":"modelthinking","order_idx":6,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/modelthinking/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/modelthinking/large-icon.png","cats":[2,6],"unis":[3],"id":11},"12":{"insts":[1196954],"language":"en","name":"Introduction to Databases","short_name":"db","order_idx":7,"self_service_course_id":32,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/cb/61b70b13451469aa582fc91d020f64/dbLogo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c9/643d403b593b865b40c64b0f6cc33c/dbLogo.jpg","cats":[11,12],"unis":[1],"id":12},"13":{"insts":[1267],"language":"en","name":"Computer Science 101","short_name":"cs101","order_idx":8,"self_service_course_id":380,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/cs101/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/cs101/large-icon.png","cats":[12],"unis":[1],"id":13},"14":{"insts":[1271],"language":"en","name":"Automata","short_name":"automata","order_idx":9,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/automata/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/automata/large-icon.png","cats":[1],"unis":[1],"id":14},"15":{"insts":[1460],"language":"en","name":"Introduction to Logic","short_name":"intrologic","order_idx":10,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/intrologic/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/intrologic/large-icon.png","cats":[1,5],"unis":[1],"id":15},"16":{"insts":[221514],"language":"en","name":"Compilers","short_name":"compilers","order_idx":11,"self_service_course_id":378,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/compilers/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/compilers/large-icon.png","cats":[11,12],"unis":[1],"id":16},"19":{"insts":[774,95,1039793],"language":"en","name":"Computer Security","short_name":"security","order_idx":12,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/40/89e1c7e5b1209fd587aae6fe8615af/more-height_2.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/16/14c599959bd3d6e7b0a710e7d4eb5f/more-height_2.png","cats":[11],"unis":[1],"id":19},"20":{"insts":[174814,1252,1251],"language":"en","name":"Game Theory","short_name":"gametheory","order_idx":13,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/gametheory/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/gametheory/large-icon.png","cats":[1,2,17],"unis":[1,29],"id":20},"22":{"insts":[224886],"language":"en","name":"Modern & Contemporary American Poetry","short_name":"modernpoetry","order_idx":14,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/modernpoetry/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/modernpoetry/large-icon.png","cats":[6,22],"unis":[6],"id":22},"23":{"insts":[239857],"language":"en","name":"Introduction to Sociology","short_name":"soc101","order_idx":15,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/soc101/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/soc101/large-icon.png","cats":[20],"unis":[4],"id":23},"24":{"insts":[419989],"language":"en","name":"Computer Architecture","short_name":"comparch","order_idx":16,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/comparch/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/comparch/large-icon.png","cats":[11,15],"unis":[4],"id":24},"25":{"insts":[419984],"language":"en","name":"Statistics One","short_name":"stats1","order_idx":17,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/04/95377c7b544250674cd4fb40792a6f/course-logo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/7c/7f9a5ca0231d151c230f3feb8f3c38/course-logo.png","cats":[16],"unis":[4],"id":25},"26":{"insts":[246867,250165],"language":"en","name":"Algorithms, Part I","short_name":"algs4partI","order_idx":18,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/algs4partI/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/algs4partI/large-icon.png","cats":[1,12],"unis":[4],"id":26},"27":{"insts":[246867,250165],"language":"en","name":"Algorithms, Part II","short_name":"algs4partII","order_idx":19,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/algs4partII/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/algs4partII/large-icon.png","cats":[1,12],"unis":[4],"id":27},"28":{"insts":[235007],"language":"en","name":"Listening to World Music","short_name":"worldmusic","order_idx":20,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/worldmusic/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/worldmusic/large-icon.png","cats":[6,18],"unis":[6],"id":28},"29":{"insts":[422471],"language":"en","name":"Greek and Roman Mythology","short_name":"mythology","order_idx":21,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/mythology/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/mythology/large-icon.png","cats":[6],"unis":[6],"id":29},"30":{"insts":[227062],"language":"en","name":"Calculus: Single Variable","short_name":"calcsing","order_idx":22,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/90/f1e8b1866fc2c8ab40a94b89bddef0/new-logo-CSV.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/dc/38555ec0e850c23a5efa3184982242/new-logo-CSV.jpg","cats":[5],"unis":[6],"id":30},"31":{"insts":[555881],"language":"en","name":"Networked Life","short_name":"networks","order_idx":23,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/networks/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/networks/large-icon.png","cats":[4,17],"unis":[6],"id":31},"32":{"insts":[226710],"language":"en","name":"Gamification","short_name":"gamification","order_idx":24,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/gamification/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/gamification/large-icon.png","cats":[4,13],"unis":[6],"id":32},"33":{"insts":[1806984],"language":"en","name":"Health Policy and the Affordable Care Act","short_name":"healthpolicy","order_idx":25,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/healthpolicy/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/healthpolicy/large-icon.png","cats":[2,8],"unis":[6],"id":33},"34":{"insts":[654632],"language":"en","name":"Vaccines","short_name":"vaccines","order_idx":26,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/vaccines/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/vaccines/large-icon.png","cats":[3,8],"unis":[6],"id":34},"35":{"insts":[471278],"language":"en","name":"Fundamentals of Pharmacology","short_name":"pharm101","order_idx":27,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/pharm101/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/pharm101/large-icon.png","cats":[3],"unis":[6],"id":35},"36":{"insts":[2666347,237513],"language":"en","name":"Cardiac Arrest, Hypothermia, and Resuscitation Science","short_name":"cardiacarrest","order_idx":28,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/cardiacarrest/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/cardiacarrest/large-icon.png","cats":[3],"unis":[6],"id":36},"37":{"insts":[2666366],"language":"en","name":"Basic Behavioral Neurology","short_name":"neurobehavior","order_idx":29,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/neurobehavior/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/neurobehavior/large-icon.png","cats":[3,10],"unis":[6],"id":37},"38":{"insts":[123682],"language":"en","name":"Social Network Analysis","short_name":"sna","order_idx":30,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/sna/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/sna/large-icon.png","cats":[4,17],"unis":[3],"id":38},"39":{"insts":[715252],"language":"en","name":"Securing Digital Democracy","short_name":"digitaldemocracy","order_idx":31,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/digitaldemocracy/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/digitaldemocracy/large-icon.png","cats":[4,11],"unis":[3],"id":39},"40":{"insts":[209008],"language":"en","name":"Introduction to Finance","short_name":"introfinance","order_idx":32,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/introfinance/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/introfinance/large-icon.png","cats":[2,13],"unis":[3],"id":40},"41":{"insts":[806928],"language":"en","name":"Fantasy and Science Fiction: The Human Mind, Our Modern World","short_name":"fantasysf","order_idx":33,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/fantasysf/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/fantasysf/large-icon.png","cats":[6],"unis":[3],"id":41},"42":{"insts":[122340],"language":"en","name":"Internet History, Technology, and Security","short_name":"insidetheinternet","order_idx":34,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/insidetheinternet/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/insidetheinternet/large-icon.png","cats":[4,11],"unis":[3],"id":42},"43":{"insts":[2666324,2666329],"language":"en","name":"Computer Vision: From 3D Reconstruction to Visual Recognition","short_name":"computervision","order_idx":35,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/computervision/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/computervision/large-icon.png","cats":[17],"unis":[1,3],"id":43},"44":{"insts":[471335,1320449],"language":"en","name":"Experimental Genome Science","short_name":"genomescience","order_idx":36,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/genomescience/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/genomescience/large-icon.png","cats":[10],"unis":[6],"id":44},"45":{"insts":[419843],"language":"en","name":"A History of the World since 1300","short_name":"wh1300","order_idx":37,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/wh1300/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/wh1300/large-icon.png","cats":[6],"unis":[4],"id":45},"48":{"insts":[423879],"language":"en","name":"Networks: Friends, Money, and Bytes","short_name":"friendsmoneybytes","order_idx":38,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/friendsmoneybytes/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/friendsmoneybytes/large-icon.png","cats":[2,4,11],"unis":[4],"id":48},"50":{"insts":[435103],"language":"en","name":"Neuroethics","short_name":"neuroethics","order_idx":39,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/neuroethics/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/neuroethics/large-icon.png","cats":[8],"unis":[6],"id":50},"51":{"insts":[1806984],"language":"en","name":"Rationing and Allocating Scarce Medical Resources","short_name":"rationing","order_idx":40,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/rationing/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/rationing/large-icon.png","cats":[8],"unis":[6],"id":51},"53":{"insts":[932645],"language":"en","name":"Bioelectricity: A Quantitative Approach","short_name":"bioelectricity","order_idx":41,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/bioelectricity/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/bioelectricity/large-icon.png","cats":[10,23],"unis":[7],"id":53},"54":{"insts":[963741,972090],"language":"en","name":"Healthcare Innovation and Entrepreneurship","short_name":"healthcareinnovation","order_idx":42,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/healthcareinnovation/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/healthcareinnovation/large-icon.png","cats":[8,13],"unis":[7],"id":54},"55":{"insts":[868977,920567],"language":"en","name":"Introductory Human Physiology","short_name":"humanphysio","order_idx":43,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/humanphysio/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/humanphysio/large-icon.png","cats":[3,10],"unis":[7],"id":55},"56":{"insts":[884310],"language":"en","name":"Introduction to Genetics and Evolution","short_name":"geneticsevolution","order_idx":44,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/geneticsevolution/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/geneticsevolution/large-icon.png","cats":[10],"unis":[7],"id":56},"57":{"insts":[638605],"language":"en","name":"Introduction to Astronomy","short_name":"introastro","order_idx":45,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/introastro/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/introastro/large-icon.png","cats":[23],"unis":[7],"id":57},"58":{"insts":[932346,935146],"language":"en","name":"Think Again: How to Reason and Argue","short_name":"thinkagain","order_idx":46,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/thinkagain/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/thinkagain/large-icon.png","cats":[6],"unis":[7],"id":58},"59":{"insts":[901314],"language":"en","name":"Medical Neuroscience","short_name":"medicalneuro","order_idx":47,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/medicalneuro/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/medicalneuro/large-icon.png","cats":[3,10],"unis":[7],"id":59},"60":{"insts":[681795,682843],"language":"en","name":"Learn to Program: The Fundamentals","short_name":"programming1","order_idx":48,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/programming1/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/programming1/large-icon.png","cats":[12],"unis":[11],"id":60},"61":{"insts":[694443],"language":"en","name":"Data Analysis","short_name":"dataanalysis","order_idx":49,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/48/86bad71cff7e0534af3a389fff7fe5/data.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f1/07934f1dada74bcd7d61c79041843e/data.jpg","cats":[8,16],"unis":[8],"id":61},"62":{"insts":[681157],"language":"en","name":"Principles of Obesity Economics","short_name":"obesityecon","order_idx":50,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/16/bfb25309f862d1ed63485c52081ed0/obesity_new.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/0d/3ab208ef03bb73a6f86734aaa64530/obesity_new.png","cats":[2,8,19],"unis":[8],"id":62},"63":{"insts":[685384],"language":"en","name":"Computing for Data Analysis","short_name":"compdata","order_idx":51,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/7c/4217ec129f44745919bec2e990e012/computing.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c6/0b6be777b4a4f1d26c879fa4a2c4e2/computing.jpg","cats":[8,16],"unis":[8],"id":63},"65":{"insts":[883324],"language":"en","name":"Clinical Problem Solving","short_name":"clinprobsolv","order_idx":52,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/clinprobsolv/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/clinprobsolv/large-icon.png","cats":[3],"unis":[10],"id":65},"66":{"insts":[681795,682843],"language":"en","name":"Learn to Program: Crafting Quality Code","short_name":"programming2","order_idx":53,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/programming2/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/programming2/large-icon.png","cats":[12],"unis":[11],"id":66},"67":{"insts":[994329],"language":"en","name":"Nutrition for Health Promotion and Disease Prevention","short_name":"nutrition","order_idx":54,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/nutrition/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/nutrition/large-icon.png","cats":[2,3,8,19],"unis":[10],"id":67},"68":{"insts":[688901],"language":"en","name":"Mathematical Biostatistics Boot Camp","short_name":"biostats","order_idx":55,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f9/07bcfc8529d60df8dcadbd77cbd1a5/bootcamp.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/6a/c2d2a4237871d4d7651d9bd88bd5eb/bootcamp.jpg","cats":[5,8,10,16],"unis":[8],"id":68},"69":{"insts":[868795],"language":"en","name":"Contraception: Choices, Culture and Consequences","short_name":"contraception","order_idx":56,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/contraception/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/contraception/large-icon.png","cats":[3,8],"unis":[10],"id":69},"70":{"insts":[874189],"language":"en","name":"Aboriginal Worldviews and Education","short_name":"aboriginaled","order_idx":57,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/aboriginaled/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/aboriginaled/large-icon.png","cats":[6,14],"unis":[11],"id":70},"71":{"insts":[693038],"language":"en","name":"Health for All Through Primary Health Care","short_name":"healthforall","order_idx":58,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/e3/4d0373cf2c2dc5c7b70603dce172fb/HealthForAll_3.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ca/dca34788554ed6ddff6113b9c0388a/HealthForAll_3.png","cats":[3,8],"unis":[8],"id":71},"72":{"insts":[687518,2286634],"language":"en","name":"An Introduction to the U.S. Food System: Perspectives from Public Health","short_name":"foodsys","order_idx":59,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/67/9759547d462a7edf0a42eb82bc553b/food_new.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/1b/d070451e6274d1f82a4a6830443459/food_new.png","cats":[8,19],"unis":[8],"id":72},"74":{"insts":[660062],"language":"en","name":"Community Change in Public Health","short_name":"communitychange","order_idx":60,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/78/a1678398f6c403c05f2481f192a5fc/community.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ca/b94bda74a7a5686674861cbb9eeaba/community.jpg","cats":[8],"unis":[8],"id":74},"77":{"insts":[831097],"language":"en","name":"Neural Networks for Machine Learning","short_name":"neuralnets","order_idx":61,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/neuralnets/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/neuralnets/large-icon.png","cats":[16,17],"unis":[11],"id":77},"78":{"insts":[598777,603309],"language":"en","name":"Vaccine Trials: Methods and Best Practices","short_name":"vacctrials","order_idx":62,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/59/a02689da9d26c589fff4f4f786c6e2/vaccine_2-02.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/96/d2c9b76077f473bdf7a2bf4eb141b3/vaccine_2-02.png","cats":[3,8],"unis":[8],"id":78},"80":{"insts":[882099],"language":"en","name":"The Social Context of Mental Health and Illness","short_name":"mentalhealth","order_idx":63,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/mentalhealth/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/mentalhealth/large-icon.png","cats":[8],"unis":[11],"id":80},"81":{"insts":[685941],"language":"en","name":"Galaxies and Cosmology","short_name":"cosmo","order_idx":64,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/cosmo/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/cosmo/large-icon.png","cats":[23],"unis":[12],"id":81},"82":{"insts":[459667],"language":"en","name":"Principles of Economics for Scientists","short_name":"econ1scientists","order_idx":65,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/econ1scientists/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/econ1scientists/large-icon.png","cats":[2],"unis":[12],"id":82},"83":{"insts":[640696],"language":"en","name":"Drugs and the Brain","short_name":"drugsandbrain","order_idx":66,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/drugsandbrain/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/drugsandbrain/large-icon.png","cats":[3,10],"unis":[12],"id":83},"84":{"insts":[2225883,247285],"language":"en","name":"Control of Mobile Robots","short_name":"conrob","order_idx":67,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/conrob/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/conrob/large-icon.png","cats":[15,17],"unis":[9],"id":84},"85":{"insts":[862822,2225883],"language":"en","name":"Energy 101","short_name":"energy101","order_idx":68,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/energy101/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/energy101/large-icon.png","cats":[25],"unis":[9],"id":85},"86":{"insts":[861614,2225883],"language":"en","name":"Computational Investing, Part I","short_name":"compinvesting1","order_idx":69,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/compinvesting1/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/compinvesting1/large-icon.png","cats":[2,17],"unis":[9],"id":86},"87":{"insts":[868530,2225883],"language":"en","name":"Computational Photography","short_name":"compphoto","order_idx":70,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/compphoto/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/compphoto/large-icon.png","cats":[4,17],"unis":[9],"id":87},"88":{"insts":[527518,726142,530929,695900],"language":"en","name":"An Introduction to Interactive Programming in Python","short_name":"interactivepython","order_idx":71,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/interactivepython/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/interactivepython/large-icon.png","cats":[12],"unis":[13],"id":88},"89":{"insts":[861494,2225883],"language":"en","name":"Fundamentals of Online Education: Planning and Application","short_name":"foe","order_idx":72,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/foe/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/foe/large-icon.png","cats":[4,14],"unis":[9],"id":89},"90":{"insts":[557195],"language":"en","name":"Fundamentals of Electrical Engineering","short_name":"eefun","order_idx":73,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/eefun/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/eefun/large-icon.png","cats":[15],"unis":[13],"id":90},"91":{"insts":[2280464],"language":"en","name":"Analytical Chemistry / Instrumental Analysis","short_name":"analyticalchem","order_idx":74,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/analyticalchem/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/analyticalchem/large-icon.png","cats":[24],"unis":[13],"id":91},"92":{"insts":[2666905],"language":"en","name":"Chemistry: Concept Development and Application","short_name":"genchem1","order_idx":75,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/genchem1/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/genchem1/large-icon.png","cats":[24],"unis":[13],"id":92},"93":{"insts":[2280464,2666907],"language":"en","name":"Nanotechnology: The Basics","short_name":"nanotech","order_idx":76,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/nanotech/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/nanotech/large-icon.png","cats":[15,23,24],"unis":[13],"id":93},"94":{"insts":[585759,895139],"language":"en","name":"Artificial Intelligence Planning","short_name":"aiplan","order_idx":77,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/aiplan/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/aiplan/large-icon.png","cats":[17],"unis":[14],"id":94},"95":{"insts":[1506477],"language":"en","name":"Building an Information Risk Management Toolkit","short_name":"inforisk","order_idx":78,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/56/3d5827c565edde379dabc12ba8f36c/small-icon.hover.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/bc/1b1da1510430626d00a99244019e0a/small-icon.hover.png","cats":[4,11],"unis":[15],"id":95},"96":{"insts":[2666846],"language":"en","name":"Computational Methods for Data Analysis","short_name":"compmethods","order_idx":79,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/36/2ef3cdd658ded09646057a0e57e74a/large-icon.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/67/87122bcf2af464883dfa168482ea58/large-icon.png","cats":[16],"unis":[15],"id":96},"97":{"insts":[1522272,1282559],"language":"en","name":"Computational Neuroscience","short_name":"compneuro","order_idx":80,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/compneuro/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/compneuro/large-icon.png","cats":[10,17],"unis":[15],"id":97},"98":{"language":"en","name":"Astrobiology and the Search for Extraterrestrial Life","short_name":"astrobio","order_idx":81,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/astrobio/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/astrobio/large-icon.png","insts":[796896],"unis":[14],"id":98},"100":{"insts":[2865239],"language":"en","name":"Designing and Executing Information Security Strategies","short_name":"infosec","order_idx":82,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/84/ce92a9ce848f5862c4d6d02c27c669/graphic.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/25/ee713c3571eb24f91c8e4ccdb40f11/graphic.png","cats":[4,11],"unis":[15],"id":100},"102":{"insts":[2666846],"language":"en","name":"Scientific Computing","short_name":"scientificcomp","order_idx":83,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/scientificcomp/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/scientificcomp/large-icon.png","cats":[16],"unis":[15],"id":102},"103":{"insts":[1506477],"language":"en","name":"Information Security and Risk Management in Context","short_name":"inforiskman","order_idx":84,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/inforiskman/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/inforiskman/large-icon.png","cats":[4,11],"unis":[15],"id":103},"105":{"insts":[517478,525208,1020740],"language":"en","name":"Computer Networks","short_name":"comnetworks","order_idx":85,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/comnetworks/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/comnetworks/large-icon.png","cats":[4,11,15],"unis":[15],"id":105},"106":{"insts":[999946],"language":"en","name":"Introduction to Data Science","short_name":"datasci","order_idx":86,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/datasci/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/datasci/large-icon.png","cats":[4,11,12,16],"unis":[15],"id":106},"108":{"insts":[1604596,1935119,1935226,1935218,1935223,1935212,1935209],"language":"en","name":"Introduction to Philosophy","short_name":"introphil","order_idx":87,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/introphil/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/introphil/large-icon.png","cats":[6],"unis":[14],"id":108},"110":{"insts":[1604583],"language":"en","name":"Equine Nutrition","short_name":"equinenutrition","order_idx":88,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/equinenutrition/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/equinenutrition/large-icon.png","cats":[3],"unis":[14],"id":110},"114":{"insts":[920057,1016886],"language":"en","name":"Critical Thinking in Global Challenges","short_name":"criticalthinking","order_idx":89,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/criticalthinking/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/criticalthinking/large-icon.png","cats":[8,10,25],"unis":[14],"id":114},"115":{"insts":[950832,306499,1862154,1292208,1301316],"language":"en","name":"E-learning and Digital Cultures","short_name":"edc","order_idx":90,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/edc/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/edc/large-icon.png","cats":[14],"unis":[14],"id":115},"116":{"insts":[672627],"language":"en","name":"Functional Programming Principles in Scala","short_name":"progfun","order_idx":91,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/progfun/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/progfun/large-icon.png","cats":[12],"unis":[16],"id":116},"117":{"insts":[873260],"language":"en","name":"Programming Languages","short_name":"proglang","order_idx":92,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/proglang/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/proglang/large-icon.png","cats":[12],"unis":[15],"id":117},"119":{"insts":[1320364],"language":"en","name":"High Performance Scientific Computing","short_name":"scicomp","order_idx":93,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/00/621b9b2597807229ed0fa605f96cdc/HighPerformanceComputingIma.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/7b/3247a51d254d7f0c68062147957e53/HighPerformanceComputingIma.jpg","cats":[4,16],"unis":[15],"id":119},"121":{"insts":[676340,2141686],"language":"en","name":"Digital Signal Processing","short_name":"dsp","order_idx":94,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/dsp/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/dsp/large-icon.png","cats":[15],"unis":[16],"id":121},"122":{"insts":[2602091,1562358],"language":"en","name":"The Hardware/Software Interface","short_name":"hwswinterface","order_idx":95,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/hardware/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/hardware/large-icon.png","cats":[11],"unis":[15],"id":122},"123":{"insts":[680709],"language":"en","name":"A Beginner's Guide to Irrational Behavior","short_name":"behavioralecon","order_idx":96,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/behavioralecon/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/behavioralecon/large-icon.png","cats":[2,6],"unis":[7],"id":123},"124":{"insts":[587683],"language":"en","name":"Introduction to Mathematical Thinking","short_name":"maththink","order_idx":97,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/maththink/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/maththink/large-icon.png","cats":[5],"unis":[1],"id":124},"125":{"insts":[1349478],"language":"en","name":"An Introduction to Operations Management","short_name":"operations","order_idx":98,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/operations/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/operations/large-icon.png","cats":[13],"unis":[6],"id":125},"126":{"insts":[341966],"language":"en","name":"Design: Creation of Artifacts in Society","short_name":"design","order_idx":99,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/design/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/design/large-icon.png","cats":[4,13,15,22],"unis":[6],"id":126},"127":{"insts":[774],"language":"en","name":"Cryptography II","short_name":"crypto2","order_idx":100,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/crypto2/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/crypto2/large-icon.png","cats":[1,11],"unis":[1],"id":127},"128":{"insts":[768],"language":"en","name":"Algorithms: Design and Analysis, Part 2","short_name":"algo2","order_idx":101,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/algo2/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/algo2/large-icon.png","cats":[1],"unis":[1],"id":128},"129":{"insts":[917653],"language":"en","name":"Heterogeneous Parallel Programming","short_name":"hetero","order_idx":102,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/hetero/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/hetero/large-icon.png","cats":[11,12],"unis":[17],"id":129},"130":{"insts":[887472],"language":"en","name":"VLSI CAD:  Logic to Layout","short_name":"vlsicad","order_idx":103,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/vlsicad/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/vlsicad/large-icon.png","cats":[11,15],"unis":[17],"id":130},"131":{"insts":[902954],"language":"en","name":"Creative, Serious and Playful Science of Android Apps","short_name":"androidapps101","order_idx":104,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/androidapps101/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/androidapps101/large-icon.png","cats":[12],"unis":[17],"id":131},"132":{"insts":[2135893],"language":"en","name":"The Modern World: Global History since 1760","short_name":"modernworld","order_idx":105,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/42/08338b124dd8165f27ea86fc99f569/Flag-Globe.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/d2/0daecfe0161d8305452f9650ea2eaf/Flag-Globe.png","cats":[6],"unis":[18],"id":132},"135":{"insts":[988020],"language":"en","name":"Grow to Greatness: Smart Growth for Private Businesses, Part I","short_name":"growtogreatness","order_idx":106,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/growtogreatness/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/growtogreatness/large-icon.png","cats":[13],"unis":[18],"id":135},"136":{"insts":[901931],"language":"en","name":"Introduction to Sustainability","short_name":"sustain","order_idx":107,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/sustain/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/sustain/large-icon.png","cats":[25],"unis":[17],"id":136},"137":{"insts":[901980],"language":"en","name":"Planet Earth","short_name":"earth","order_idx":108,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/earth/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/earth/large-icon.png","cats":[25],"unis":[17],"id":137},"138":{"insts":[884324],"language":"en","name":"Microeconomics Principles","short_name":"microecon","order_idx":109,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/microecon/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/microecon/large-icon.png","cats":[2],"unis":[17],"id":138},"139":{"insts":[903698,907436,938149],"language":"en","name":"Introductory Organic Chemistry - Part 1","short_name":"orgchem1a","order_idx":110,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/orgchem1a/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/orgchem1a/large-icon.png","cats":[24],"unis":[17],"id":139},"140":{"insts":[903698,907436,938149],"language":"en","name":"Introductory Organic Chemistry - Part 2","short_name":"orgchem1b","order_idx":111,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/orgchem1b/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/orgchem1b/large-icon.png","cats":[24],"unis":[17],"id":140},"141":{"insts":[903698,907436],"language":"en","name":"Intermediate Organic Chemistry - Part 1","short_name":"orgchem2a","order_idx":112,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/orgchem2a/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/orgchem2a/large-icon.png","cats":[24],"unis":[17],"id":141},"143":{"insts":[903698,907436,938149],"language":"en","name":"Intermediate Organic Chemistry - Part 2","short_name":"orgchem2b","order_idx":113,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/orgchem2b/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/orgchem2b/large-icon.png","cats":[24],"unis":[17],"id":143},"144":{"insts":[1074054,1116355,1345762],"language":"fr","name":"Introduction \u00e0 la programmation orient\u00e9e objet (en Java)","short_name":"java-fr","order_idx":114,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/b3/eab749947a1a90468fa53d0e066aea/IMG_1580_2_2_4.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/2e/32c22e658344980fb3bd62e64f4171/IMG_1580_2_2_4.jpg","cats":[12],"unis":[16],"id":144},"145":{"insts":[107347],"language":"en","name":"Web Intelligence and Big Data","short_name":"bigdata","order_idx":115,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/bigdata/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/bigdata/large-icon.png","cats":[17],"unis":[19],"id":145},"147":{"insts":[1139667],"language":"en","name":"Organizational Analysis","short_name":"organalysis","order_idx":116,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/organalysis/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/organalysis/large-icon.png","cats":[13],"unis":[1],"id":147},"148":{"insts":[1118525],"language":"en","name":"Introduction to Computational Finance and Financial Econometrics","short_name":"compfinance","order_idx":117,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/compfinance/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/compfinance/large-icon.png","cats":[2],"unis":[15],"id":148},"153":{"insts":[729871],"language":"en","name":"Image and video processing: From Mars to Hollywood with a stop at the hospital","short_name":"images","order_idx":118,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/images/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/images/large-icon.png","cats":[5,15,17],"unis":[7],"id":153},"154":{"insts":[988020],"language":"en","name":"Grow to Greatness: Smart Growth for Private Businesses, Part II","short_name":"GTG","order_idx":119,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/7c/9268909c2ef573dedeec650adbd3b5/Faded-logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/75/fd5853cdf1752a1e01d69da5e8cf73/Faded-logo.jpg","cats":[13],"unis":[18],"id":154},"157":{"insts":[1367410],"language":"en","name":"Writing in the Sciences","short_name":"sciwrite","order_idx":120,"self_service_course_id":null,"small_icon_hover":"https://s3.amazonaws.com/coursera/topics/sciwrite/small-icon.hover.png","has_full_data":false,"large_icon":"https://s3.amazonaws.com/coursera/topics/sciwrite/large-icon.png","cats":[6,10],"unis":[1],"id":157},"160":{"insts":[2306102,2225883],"language":"en","name":"Health Informatics in the Cloud","short_name":"healthinformatics","order_idx":121,"self_service_course_id":null,"small_icon_hover":"http://coursera-course-photos.s3.amazonaws.com/58/fc257127332a300b5032649fe8e26d/logo.png","has_full_data":false,"large_icon":"http://coursera-course-photos.s3.amazonaws.com/6d/c15fdc2bc0dbbe0050b39724c7c77a/logo.png","cats":[8],"unis":[9],"id":160},"161":{"insts":[1280592,2606081],"language":"en","name":"AccountableTalk\u00ae: Conversation that Works","short_name":"accountabletalk","order_idx":122,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/42/9fd4e90a25a59232b5b07955f2b6cd/MP900422122.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/69/0a711fed1987504aec1e1adcf06094/MP900422122.jpg","cats":[6,26],"unis":[36],"id":161},"162":{"insts":[2595360,2595632],"language":"en","name":"Nutrition and Physical Activity for Health","short_name":"nutritionforhealth","order_idx":123,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/be/85a530cd01a05ba40e5a0991b3ff3a/NewNutrition-LARGE.gif","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/bb/8bbed1dc0544194f60e3cc38bec918/NewNutrition-LARGE.gif","cats":[3,19],"unis":[36],"id":162},"163":{"insts":[1564078],"language":"en","name":"A Look at Nuclear Science and Technology","short_name":"nuclearscience","order_idx":124,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/e4/95a6a83793e3a0a9162150f57c259f/MP900437258.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e4/ba69a6615c945e9e311be8fb07ce6e/MP900437258.jpg","cats":[15,23,24],"unis":[36],"id":163},"164":{"insts":[2258110,1600503],"language":"en","name":"Clinical Terminology for International and U.S. Students","short_name":"clinicalterminology","order_idx":125,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/af/07603c92e620bc12654f68844d0ae5/MP900433088.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/73/74dc188fa6f388c28b67e74362ce0f/MP900433088.jpg","cats":[3],"unis":[36],"id":164},"165":{"insts":[1722827],"language":"en","name":"Disaster Preparedness","short_name":"disasterprep","order_idx":126,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/3c/7386d7914d0c4e872a68b809d1f3d1/MP900401427.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/30/288f2ce285db9e912a165a75a55cca/MP900401427.jpg","cats":[3],"unis":[36],"id":165},"167":{"insts":[1474140],"language":"en","name":"Women and the Civil Rights Movement","short_name":"womencivilrights","order_idx":127,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/9d/f8195cb776a2108bb5d7bba9be0523/banner_brown_lines.gif","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/72/8f6b8e2502675fa81c81013293b562/banner_brown_lines.gif","cats":[6],"unis":[32],"id":167},"168":{"insts":[1312728],"language":"en","name":"Developing Innovative Ideas for New Companies: The 1st Step in Entrepreneurship","short_name":"innovativeideas","order_idx":128,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/86/eff310c9f5ab16a770c3ca6c13bef3/green_courselogo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/d8/00883e52f93c47a05684f49a610437/green_courselogo.jpg","cats":[13],"unis":[32],"id":168},"170":{"insts":[324786,724736],"language":"en","name":"Exploring Quantum Physics","short_name":"eqp","order_idx":129,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/10/c8ba4de9077e632a9bd311f5323787/Preliminary_Draft_Logo_Clark_Galitski2.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c4/1c545de180c31595a29dd0f38bd7cf/Preliminary_Draft_Logo_Clark_Galitski2.png","cats":[23],"unis":[32],"id":170},"171":{"insts":[996548],"language":"en","name":"Machine Learning","short_name":"machlearning","order_idx":130,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c7/85dbfadc3808b314c25be1cb54f37a/machinelearninglogo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/29/eb5373729abeccb17eea7081421d90/machinelearninglogo.jpg","cats":[16,17],"unis":[15],"id":171},"172":{"insts":[979695,1343266],"language":"en","name":"Animal Behaviour","short_name":"animalbehav","order_idx":131,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/01/7e6485c20a9eac0e9a92c5432e8404/peacock-spider-2.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/da/9a23ca374a5d18631c8f4d6b0c49d4/peacock-spider-2.jpg","cats":[10],"unis":[33],"id":172},"173":{"insts":[1288295],"language":"en","name":"Epigenetic Control of Gene Expression","short_name":"epigenetics","order_idx":132,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/a3/d40a84374147e6dcb20dc0cd458f10/Big480x270_withcopyright.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/74/92c169ff99f49dfb3136297330ccb0/Big480x270_withcopyright.jpg","cats":[3,10],"unis":[33],"id":173},"174":{"insts":[1289035],"language":"en","name":"Discrete Optimization","short_name":"optimization","order_idx":133,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/45/44e0a84be0d543937212bed01ac226/DiscreetOptimisation_logo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ca/4376935da5551984f133199185b62a/DiscreetOptimisation_logo.png","cats":[17],"unis":[33],"id":174},"175":{"insts":[937126],"language":"en","name":"Principles of Macroeconomics","short_name":"macroeconomics","order_idx":134,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/bd/5e0555c58ef27ead3a5efaccf00dca/macro_eco.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/a5/b5eac21583f1e5d7bcdb072739cea2/macro_eco.png","cats":[2],"unis":[33],"id":175},"176":{"insts":[1743955],"language":"en","name":"Software Defined Networking","short_name":"sdn","order_idx":135,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/cb/20d0eea4812003fc404b006dbe5ba0/feamstercourseimage.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e6/4d733cddcea2b35a060be49dde143f/feamstercourseimage.png","cats":[11,12],"unis":[9],"id":176},"177":{"insts":[804990],"language":"en","name":"The Modern and the Postmodern","short_name":"modernpostmodern","order_idx":136,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/40/e01a7194c35f414f37235a1a4a96e9/The-Bar-at-the-Folies-Bergeres-by-Edouard-Manet.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e5/cdbf24bfcaacee34eac286619c822b/The-Bar-at-the-Folies-Bergeres-by-Edouard-Manet.jpg","cats":[6],"unis":[34],"id":177},"178":{"insts":[1325616],"language":"en","name":"Introduction to Systems Biology","short_name":"sysbio","order_idx":137,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/73/6cd405d11bc3ff4878da9481bfc4f1/Introduction_SB_logo_460X270_v2.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b9/e9ad4b94d9f77264646f5a07436f5d/Introduction_SB_logo_460X270_v2.png","cats":[10],"unis":[27],"id":178},"179":{"insts":[1305172],"language":"en","name":"Network Analysis in Systems Biology","short_name":"netsysbio","order_idx":138,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ea/5fd940fc642a384fa660e012ee8fdf/coursera_image_maayan.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c7/e692242fb5e98d2bb83b330b6115b8/coursera_image_maayan.png","cats":[10,16,17],"unis":[27],"id":179},"181":{"insts":[1325618],"language":"en","name":"Dynamical Modeling Methods for Systems Biology","short_name":"dynamicalmodeling","order_idx":139,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/67/cd059d678aea29903129739e27addf/Dynamical_modeling_Logo_460X270_v2.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c9/6d1f5b8584be57df13528aab65576e/Dynamical_modeling_Logo_460X270_v2.png","cats":[5,10],"unis":[27],"id":181},"182":{"insts":[1297453],"language":"en","name":"Introduction to Tissue Engineering","short_name":"tissue101","order_idx":140,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/78/368a149dbfc7eaf5c69ce5164191de/husinusoid.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/72/9eb633c97aeeb24e86a3a70167bf40/husinusoid.png","cats":[10,15],"unis":[24],"id":182},"184":{"insts":[2666862,2666864,2666866,1297886,1295661],"language":"en","name":"Climate Change","short_name":"climatechange","order_idx":141,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/6f/090e9db35bd6f072a336d02e9d6794/climate_montage.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/11/a8c4ccbd5e53770228170c6ef6692a/climate_montage.jpg","cats":[2,6,25],"unis":[33],"id":184},"185":{"insts":[1298506],"language":"en","name":"Generating the Wealth of Nations","short_name":"wealthofnations","order_idx":142,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f9/1a51d965713f75f47999059c992a3d/industrial-revolution-1.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ae/74409ddd8ac19b2deab9012d03041a/industrial-revolution-1.jpg","cats":[2],"unis":[33],"id":185},"186":{"insts":[1300189],"language":"en","name":"Exercise Physiology: Understanding the Athlete Within","short_name":"exphys","order_idx":143,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/88/fcbb1591d350736d9d83e66b5a8d78/MUS-PHOTO2.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b3/ded9ebdfdc70f44c67054abc3dc572/MUS-PHOTO2.jpg","cats":[3,10],"unis":[33],"id":186},"188":{"insts":[1121232],"language":"en","name":"Passion Driven Statistics","short_name":"pdstatistics","order_idx":144,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/09/ecd4e2b562e56d0499c8fadba7aa1f/passion_driven_statistics2orig.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c6/abd0e647445b20a913405180a4ebc7/passion_driven_statistics2orig.jpg","cats":[16],"unis":[34],"id":188},"189":{"insts":[1293473],"language":"en","name":"Introduction to Pharmacy","short_name":"intropharma","order_idx":145,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/78/c6efa8cac6a6f725c7ae9097e9c6bf/intro-pharm.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/27/08088f582e6ff1739181f5683a473c/intro-pharm.png","cats":[3,8],"unis":[28],"id":189},"190":{"insts":[1334447],"language":"en","name":"Principles of Public Health","short_name":"publichealth","order_idx":146,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/96/b4073c6a86832dfcd5c3ad5f3a4fac/iStock_000011822057XSmall.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/01/796e8a34fcb8d5dd688b5b3883952a/iStock_000011822057XSmall.jpg","cats":[3,8],"unis":[30],"id":190},"192":{"insts":[1293448],"language":"en","name":"Generation Rx: The Science Behind Prescription Drug Abuse","short_name":"genrx","order_idx":147,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/d9/21b6e95dc477cf495a34ea5cf5ec58/generation-rx.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/14/ad01c8627e79287de2becbda7bb474/generation-rx.png","cats":[3,8],"unis":[28],"id":192},"193":{"insts":[802670],"language":"en","name":"The Ancient Greeks","short_name":"ancientgreeks","order_idx":148,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c2/a9fe83a156d3fff4e32c6cd9caa0e5/ancientgreek.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/0e/fc442ac5d032b9e36b07b42c97ed8f/ancientgreek.jpg","cats":[6],"unis":[34],"id":193},"196":{"insts":[1292607],"language":"en","name":"Modern European Mysticism and Psychological Thought","short_name":"mysticthought","order_idx":149,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/58/e29cfad54ad288ec6c8898f29ea694/ThinkLogo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/19/eb4e2328e003742b4091e6161f8e1d/ThinkLogo.jpg","cats":[6],"unis":[24],"id":196},"197":{"insts":[1213805],"language":"en","name":"Synapses, Neurons and Brains ","short_name":"bluebrain","order_idx":150,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/1e/5f58fd74b7279b8e606d28902ad85c/logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/5c/33e98a3dbe5d21b0acc299a0a319c6/logo.jpg","cats":[10],"unis":[24],"id":197},"198":{"insts":[1234717],"language":"en","name":"Coding the Matrix: Linear Algebra through Computer Science Applications","short_name":"matrix","order_idx":151,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c9/8b3a8357fe29791971ece8cc8fb35b/460_259_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/6c/ffdfc097878bc0f8115148d7ee6826/460_259_logo.jpg","cats":[1,5,16,17],"unis":[22],"id":198},"200":{"insts":[710240],"language":"en","name":"Introduction to Digital Sound Design","short_name":"digitalsounddesign","order_idx":152,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/98/a9faec3b69463938e7c7ce660e15f6/electronic_music-nologo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/16/436e7cb262ffe2571c49411810d568/electronic_music-nologo.png","cats":[18],"unis":[23],"id":200},"201":{"insts":[1324701],"language":"en","name":"Citizenship and U.S. Immigration","short_name":"immigration","order_idx":153,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/0b/5c05a126bf361e9e01b526e334bd06/immigration-nologo-2.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f7/f0a44adaf0265611da7ed6816d32b5/immigration-nologo-2.png","cats":[6],"unis":[23],"id":201},"202":{"insts":[1319386],"language":"en","name":"AIDS","short_name":"aids","order_idx":154,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/7f/1ec88b36be9d908c96352c2d85da36/hiv-nologo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c7/e4f79928ef655eb6abc239078451b7/hiv-nologo.png","cats":[3,8,10],"unis":[23],"id":202},"203":{"insts":[1291950],"language":"en","name":"The Language of Hollywood: Storytelling, Sound, and Color","short_name":"hollywood","order_idx":155,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/6f/432b74de4f54bbb075c033cb9f0513/Coursera-Color-Crop.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/53/449906dea839da9dcecab59b42d8ac/Coursera-Color-Crop.jpg","cats":[6,18],"unis":[34],"id":203},"204":{"insts":[1314970],"language":"en","name":"The Fiction of Relationship","short_name":"relationship","order_idx":156,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/90/6e08b99ecc07abd5547eb019447dda/fictionimage_weinstein_rev.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/3f/b40640ec5e587fae24709f71824e9a/fictionimage_weinstein_rev.jpg","cats":[6],"unis":[22],"id":204},"205":{"insts":[1321950],"language":"en","name":"Science from Superheroes to Global Warming","short_name":"scientificthinking","order_idx":157,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/59/17e42d97116e10fe25dc71b0b2787f/460px_x_259px_female_superhero_used_for_Physics_Coursera.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/56/fbfabd3679d122b17ad4696ece54c8/460px_x_259px_female_superhero_used_for_Physics_Coursera.jpg","cats":[25],"unis":[30],"id":205},"206":{"insts":[543459],"language":"en","name":"Useful Genetics","short_name":"usefulgenetics","order_idx":158,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/3f/aab8e97db2c6c051b96d07b1c01128/Icon5cropped2.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/91/1df761aaed6186f47bd741dd34cda0/Icon5cropped2.jpg","cats":[8,10],"unis":[29],"id":206},"207":{"insts":[1224295],"language":"en","name":"Archaeology's Dirty Little Secrets","short_name":"secrets","order_idx":159,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/28/d188b00f12b824cbef922191521431/archaeology-course.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/25/f5dc1d6f2eb02041e27c0f59359bab/archaeology-course.jpg","cats":[6,9,20,22,25],"unis":[22],"id":207},"208":{"insts":[1350643,1499033],"language":"en","name":"Algebra","short_name":"algebra","order_idx":160,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/bb/952409da2b5f4a9951bf89bbda646c/algebra-course-logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e0/ced6a8800e6a8eb621940ee4d03dfa/algebra-course-logo.jpg","cats":[5],"unis":[30],"id":208},"210":{"insts":[1350643,1499033],"language":"en","name":"Pre-Calculus","short_name":"precalculus","order_idx":161,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c1/32121a42fb56a015b6485d4dc37155/math1b-course-logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e5/03280804e50fee3058d12b69011a91/math1b-course-logo.jpg","cats":[5],"unis":[30],"id":210},"211":{"insts":[1324755,2598741],"language":"en","name":"Preparation for Introductory Biology: DNA to Organisms","short_name":"introbiology","order_idx":162,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/71/504df9780b5f9a22a27e64950081f8/intro-image4.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b5/35076dc6979307af0df264cafe4c15/intro-image4.jpg","cats":[10],"unis":[30],"id":211},"214":{"insts":[1466681],"language":"en","name":"Science, Technology, and Society in China I: Basic Concepts","short_name":"stschina1","order_idx":163,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/2c/3be2e63e464ca4af11330febf219dc/Naubahar-Course-Banner.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/52/0e28865ff8f0114a1558a79a1a6a26/Naubahar-Course-Banner.jpg","cats":[20],"unis":[35],"id":214},"215":{"insts":[1159084],"language":"en","name":"Sports and Society","short_name":"sports","order_idx":164,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/87/41ebab38c138ab07b95e57ae258d47/starn_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/52/64009649231929d5d7919b570b8a27/starn_logo.jpg","cats":[6,20],"unis":[7],"id":215},"216":{"insts":[1343630,1358517],"language":"en","name":"The Science of Gastronomy","short_name":"scigast","order_idx":165,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/1f/29cbc89d90f5c354bc5db353832fad/KingYeung-Course-Banner.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/d2/605f63b0878b813ed3c6c1a28ec867/KingYeung-Course-Banner.jpg","cats":[10,19],"unis":[35],"id":216},"217":{"insts":[1465513,1311294],"language":"en","name":"A New History for a New China, 1700-2000: New Data and New Methods, Part 1","short_name":"newchinahistory1","order_idx":166,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ea/835cfd8a78494dee77c26da6dccdc8/James-Course-Banner.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ec/ea4ffe0283325bef7f65e9d22612ec/James-Course-Banner.jpg","cats":[6,20],"unis":[35],"id":217},"218":{"insts":[1338423],"language":"en","name":"Introduction to Improvisation","short_name":"improvisation","order_idx":167,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/38/498a30768dadc2f431b4e906ce2d92/jazz-large.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/bb/dd4a127c81a87d90665a71334b88c0/jazz-large.jpg","cats":[18],"unis":[21],"id":218},"219":{"insts":[1338222],"language":"en","name":"Introduction to Guitar","short_name":"guitar","order_idx":168,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ee/e6e3cb2cd2ea22f792fd5126d98f7b/guitar-large.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/65/df272436bfad82debc760cb5c90ce5/guitar-large.jpg","cats":[18],"unis":[21],"id":219},"220":{"insts":[1340080],"language":"en","name":"Songwriting","short_name":"songwriting","order_idx":169,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/0c/ec10bb4adb3831a5fbbacf5ad4b47a/songwriting-large.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/24/77aee99d2b34a08a8423bc4a6178e6/songwriting-large.jpg","cats":[18],"unis":[21],"id":220},"221":{"insts":[1321389],"language":"en","name":"Property and Liability: An Introduction to Law and Economics","short_name":"lawandecon","order_idx":170,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/69/5a79fb00587dbeadb42b6dc7671ead/Smokestacks_3958.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/fc/5a1e6df000135e39d0ea2231d2ce74/Smokestacks_3958.jpg","cats":[2,6,21],"unis":[34],"id":221},"222":{"insts":[703888],"language":"en","name":"Introduction to Music Production","short_name":"musicproduction","order_idx":171,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c4/c514758cc151d86f66c9b853ec52aa/production-large.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/fe/015ba2a0d465c31b47ac36670098ea/production-large.jpg","cats":[18],"unis":[21],"id":222},"223":{"insts":[1323227],"language":"en","name":"Linear and Discrete Optimization","short_name":"linearopt","order_idx":172,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c6/0e72a56dfccc14d37aa099fac6ed12/logo_big.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/4e/c1b71842848763186f164486340b59/logo_big.png","cats":[1,5],"unis":[16],"id":223},"224":{"insts":[1325435,1325459],"language":"en","name":"Financial Engineering and Risk Management","short_name":"fe","order_idx":173,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/45/ea8f262d79710092b829d48ed3c8e1/FinacialEngLogo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/11/3ec018c6c2c88b27c587d2636462e4/FinacialEngLogo.jpg","cats":[2,16],"unis":[40],"id":224},"225":{"insts":[1325520],"language":"en","name":"Natural Language Processing","short_name":"nlangp","order_idx":174,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c5/42ab154bbf6f76f51b74b8347deab5/iStock_000020359734_Small.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/7e/0150790f6c92c48d03bf6178ea9193/iStock_000020359734_Small.jpg","cats":[17],"unis":[40],"id":225},"226":{"insts":[1342536,1989083],"language":"en","name":"Climate Literacy: Navigating Climate Change Conversations","short_name":"climateliteracy","order_idx":175,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/4a/b338570d11468050d0b64bac0adf83/Climate_Literacy-coursera-460pixels.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ec/65ea228b96d945a2bc954323b22fe3/Climate_Literacy-coursera-460pixels.jpg","cats":[20,25],"unis":[29],"id":226},"228":{"insts":[1620951,1960981,1961937],"language":"en","name":"Creative Programming for Digital Media & Mobile Apps","short_name":"digitalmedia","order_idx":176,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/6c/03b0bdb108509a7972ed079ed806c2/GoldComputing3.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/24/63a093e763b307dc9420e796aeb06a/GoldComputing3.jpg","cats":[4,12],"unis":[26],"id":228},"229":{"insts":[1330818],"language":"en","name":"Leading Strategic Innovation in Organizations","short_name":"innovation","order_idx":177,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/a5/b85c10bac7478a36397c366cff1946/Coursera-logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/21/44a0a37507298ea04382dfed448393/Coursera-logo.jpg","cats":[13],"unis":[37],"id":229},"232":{"insts":[1347691],"language":"en","name":"Malicious Software and its Underground Economy: Two Sides to Every Story","short_name":"malsoftware","order_idx":178,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/d4/edab6f88cb29582e8215774b2fa19e/cavallaro-logo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e8/06553aa034970e31d0c6372c02822e/cavallaro-logo.png","cats":[11,12],"unis":[26],"id":232},"233":{"insts":[359948],"language":"en","name":"Introduction to Systematic Program Design - Part 1","short_name":"programdesign","order_idx":179,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/35/e8609391fde9df1c434fb9ac0ee1c4/IntroSystematic_1280x720.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/78/95379b3e2298c62886f84192aaf6ee/IntroSystematic_1280x720.jpg","cats":[12],"unis":[29],"id":233},"234":{"insts":[1337829],"language":"en","name":"Pattern-Oriented Software Architectures for Concurrent and Networked Software","short_name":"posa","order_idx":180,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/6b/353126287516432c828eb1bbdb6c44/foos.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c8/1ad9b05582057b1c1caa7f9d7755fd/foos.jpg","cats":[4,11,12],"unis":[37],"id":234},"235":{"insts":[1331704],"language":"en","name":"Nutrition, Health, and Lifestyle: Issues and Insights","short_name":"lifenutr","order_idx":181,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/3d/a135768b03a37ec380ac3879dccf55/Food-icon.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/25/9fd44583ded07585d2f8ef7dad3228/Food-icon.jpg","cats":[10,19],"unis":[37],"id":235},"236":{"insts":[2330496],"language":"en","name":"Fundamentals of Human Nutrition","short_name":"humannutrition","order_idx":182,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c1/e005886ea3c68559ac0074fe7cf254/HEADHumanNutrition.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/a1/86ec691495ef1f26a1a11ba11c6f88/HEADHumanNutrition.jpg","cats":[8,10,19],"unis":[31],"id":236},"237":{"insts":[2593281],"language":"en","name":"Global Sustainable Energy: Past, Present and Future","short_name":"globalenergy","order_idx":183,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/94/1cd18dd3397e344546c0c16dbda75b/Global-Sustainable-Energy.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/4c/834e8d08a3ed98ee9ce1cec47738f0/Global-Sustainable-Energy.jpg","cats":[25],"unis":[31],"id":237},"239":{"language":"en","name":"How Music Works","short_name":"howmusicworks","order_idx":184,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/d9/dd4a66ce178e49dfd42f5728a04e53/How-Music-Works.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f9/07101b8d51ccac4ebd282d80ad8260/How-Music-Works.jpg","cats":[18],"unis":[31],"id":239},"240":{"insts":[1626852],"language":"en","name":"Sustainable Agricultural Land Management ","short_name":"sustainableag","order_idx":185,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/80/4027bdd5638b8127c2d3781317433c/Sustainable-Agriculture.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/97/a9c81f64a9c2ca4b9669df0cf8d4c3/Sustainable-Agriculture.jpg","cats":[13,19],"unis":[31],"id":240},"242":{"insts":[240569,1347429,1653154],"language":"en","name":"Data Management for Clinical Research","short_name":"datamanagement","order_idx":186,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/26/75eec287db254ae99745688463e452/data-sm.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/68/4bd7bd90bd0c84612df8a586fa1ff3/data-sm.jpg","cats":[4,16],"unis":[37],"id":242},"243":{"insts":[2603322],"language":"en","name":"Why We Need Psychology","short_name":"needpsych","order_idx":187,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/8b/337444f603516aa5f5310afc17fdae/V-multicoloured-brain.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/10/8a14cf1b5a50871e52bdd909e3612c/V-multicoloured-brain.jpg","cats":[6],"unis":[26],"id":243},"244":{"insts":[2625760],"language":"en","name":"The Camera Never Lies","short_name":"lyingcamera","order_idx":188,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/29/3c537c433a5fee786223016f6e75bf/Flag-raising-on-Iwo-Jima.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/85/c2487d4e09deb077032305464194bb/Flag-raising-on-Iwo-Jima.jpg","cats":[6,18],"unis":[26],"id":244},"245":{"insts":[2603342,3680947],"language":"en","name":"English Common Law: Structure and Principles","short_name":"engcomlaw","order_idx":189,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ce/e67b298a5c43704b0858105cc06fc0/new-logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f2/b470f53d7519ddf8511555b7cb639f/new-logo.jpg","cats":[6,21],"unis":[26],"id":245},"246":{"insts":[272543],"language":"en","name":"Online Games: Literature, New Media, and Narrative","short_name":"onlinegames","order_idx":190,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/72/9bd590fa5d2bf9bdddea3a24ad112d/Cheeryble-by-moonlight.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/50/aab96f7f0af359c5f946a1f37f2290/Cheeryble-by-moonlight.jpg","cats":[6,22],"unis":[37],"id":246},"247":{"insts":[2102206],"language":"en","name":"Economic Issues, Food & You","short_name":"ecfoodandyou","order_idx":191,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/6a/245b83c3f6e302cb3757b54fa94c1d/Eco-Issues-Food-and-You.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/55/8603642b3c5dbb3437ee5ec7e9cac0/Eco-Issues-Food-and-You.jpg","cats":[2,19],"unis":[31],"id":247},"254":{"insts":[1400787],"language":"en","name":"Foundations of Business Strategy","short_name":"strategy101","order_idx":192,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/62/ef8cb460fab1e7ed3f6ba658331ae9/Lenox-Foundations-of-Business-Strategy-460x259.gif","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/fc/bdc15b244c8a3b1c54e984576342f3/Lenox-Foundations-of-Business-Strategy-460x259.gif","cats":[13],"unis":[18],"id":254},"260":{"insts":[1292489],"language":"en","name":"MOS Transistors","short_name":"mosfet","order_idx":193,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/9d/6cb1f3b5464fc65758df02e78548cb/Logo1large_b.gif","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/cd/b5dbc0f43f48a3b814c3f6177c0f66/Logo1large_b.gif","cats":[15],"unis":[40],"id":260},"268":{"insts":[1571429],"language":"en","name":"Surviving Disruptive Technologies","short_name":"sdt","order_idx":194,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ba/e3da75bef8d155a36ddb3d468b5b9f/lucas_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/cd/0c55405f6202a69f2d715e74c733b6/lucas_logo.jpg","cats":[4,13],"unis":[32],"id":268},"277":{"insts":[248242],"language":"en","name":"Principles of Microeconomics","short_name":"steinmicro","order_idx":195,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/25/a4d4bafdf99a50b9b0912510f47d42/DS_tax.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/27/9b9866d34641e63662e14bb00abdc8/DS_tax.png","cats":[2],"unis":[6],"id":277},"278":{"insts":[1127341],"language":"en","name":"Social Psychology","short_name":"socialpsychology","order_idx":196,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/e1/d3059dd666773914baa9d41fc13183/Course-Image3200x1800.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c2/67237e82ad37a8f9db40225c36935f/Course-Image3200x1800.png","cats":[8,13,14,20],"unis":[34],"id":278},"282":{"insts":[1667833],"language":"en","name":"Calculus One","short_name":"calc1","order_idx":197,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/29/7babc8e901f719a87b96d201944fd6/calculus1.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/fc/f9ebbb37faa8980a6279915601ef5b/calculus1.png","cats":[5],"unis":[28],"id":282},"285":{"insts":[2096804],"language":"en","name":"Virology I: How Viruses Work","short_name":"virology","order_idx":198,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/2a/0f2ffa0cd6cff3b083c485b94d54d7/virology_coursera.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/df/1aefaf4328c2a4ad469d8d4be6422d/virology_coursera.jpg","cats":[3,10],"unis":[40],"id":285},"288":{"insts":[1900891,2225883],"language":"en","name":"Introduction to Engineering Mechanics","short_name":"statics1","order_idx":199,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/71/4bd882b647ad3d4985c344e3bc88d3/whiteman-coursera-icon.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b2/a4e474c49efcb11c441189b12a36dc/whiteman-coursera-icon.jpg","cats":[15],"unis":[9],"id":288},"289":{"insts":[1819928],"language":"en","name":"The Law of the European Union: An Introduction","short_name":"introeulaw","order_idx":200,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/b8/1a384e65c5fc87b2383c7ec27f5f66/logo-for-the-class.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/3d/6a143d847c8040a7cb547423d6205a/logo-for-the-class.jpg","cats":[6,20,21],"unis":[25],"id":289},"290":{"insts":[1757953],"language":"fr","name":"Analyse Num\u00e9rique pour Ing\u00e9nieurs","short_name":"analysenumerique","order_idx":201,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/7c/f7e490339a46553df8119142f12ad6/coursera.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c9/6b456c6bbc740fffa5f180f4276763/coursera.jpg","cats":[5,16],"unis":[16],"id":290},"292":{"insts":[1804614],"language":"en","name":"A Brief History of Humankind","short_name":"humankind","order_idx":202,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/b7/f1c2dd78e1eee4d1255aba2ac62bea/LOGO-hands-cave.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c9/598923eb2c6911166d8156eff414e3/LOGO-hands-cave.jpg","cats":[6],"unis":[24],"id":292},"293":{"insts":[2700511],"language":"en","name":"New Models of Business in Society","short_name":"bizsociety","order_idx":203,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/a4/0a3039ff90c6af9888005a3afe6cdd/Coursera-New-Models-logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ea/1871452cbd0796ceedf7e34b9ce9ab/Coursera-New-Models-logo.jpg","cats":[13,20],"unis":[18],"id":293},"295":{"insts":[1820338,1820329],"language":"en","name":"Genes and the Human Condition (From Behavior to Biotechnology)","short_name":"genes","order_idx":204,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/47/dbc72025125b1fcf426aedc02be1b4/Genes.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/a1/136c177d13b81a589adeb2bcd6f994/Genes.jpg","cats":[3,8,10],"unis":[32],"id":295},"297":{"insts":[1460],"language":"en","name":"General Game Playing","short_name":"ggp","order_idx":205,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/9b/eee7cc8c0872c5e69bd0d6b7b6d81b/ggp.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/52/22e65c2ecc820ff1e6b0b42b789ab5/ggp.jpg","cats":[1,5,17],"unis":[1],"id":297},"300":{"insts":[1845856,1853352],"language":"en","name":"Startup Engineering","short_name":"startup","order_idx":206,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f0/4fba1627b59c96672c9c067eed24c0/logo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/6d/36b377d4ad926485cb6342444f6743/logo.png","cats":[12,13,16],"unis":[1],"id":300},"304":{"insts":[1843870,1847439],"language":"en","name":"TechniCity","short_name":"techcity","order_idx":207,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/47/18866ac47bfe0ab4dc32b45a943837/RealTimeCity.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/27/affaf1a8cbc3f53468766a99acd35b/RealTimeCity.jpg","cats":[4],"unis":[28],"id":304},"307":{"insts":[2982963,2225883],"language":"en","name":"Introductory Physics I with Laboratory","short_name":"phys1","order_idx":208,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/9c/e16ae6a09f329e67c6a0c1322d1d9f/Hero-Logo-Yellow.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/fc/88b225abb2aa2992eb147b0e23f030/Hero-Logo-Yellow.png","cats":[9,15,23,26],"unis":[9],"id":307},"311":{"insts":[1077292,2225883],"language":"en","name":"Survey of Music Technology","short_name":"musictech","order_idx":209,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/b4/a0686f1601a2634d230c4b47ffb5f9/freeman-icon.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e5/0d77b616fc55b86c82e6508cf6efa0/freeman-icon.jpg","cats":[18],"unis":[9],"id":311},"312":{"insts":[1074054,1116355,1345762],"language":"fr","name":"Initiation \u00e0 la programmation (en Java)","short_name":"intro-java-fr","order_idx":210,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/38/a24ea80f388452d9a92d0cc119295e/IMG_1575_4_3_4.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c3/fdb7ad2aca9ab2023be34c0d5bc61c/IMG_1575_4_3_4.jpg","cats":[12],"unis":[16],"id":312},"313":{"insts":[1116355,1345762,1074054],"language":"fr","name":"Initiation \u00e0 la programmation (en C++)","short_name":"intro-cpp-fr","order_idx":211,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/41/c05a717c0efe8aeaf17e7a49ec4eaf/IMG_1565_4_5.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/34/05fae9c412b2005e0b9ec12d956017/IMG_1565_4_5.jpg","cats":[12],"unis":[16],"id":313},"314":{"insts":[1074054,1116355,1345762],"language":"fr","name":"Introduction \u00e0 la programmation orient\u00e9e objet (en C++)","short_name":"cpp-fr","order_idx":212,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ce/fbc94504d53fbb5a70aa20fcad7b34/IMG_1576_2_2_4.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c8/5909f63e233b0a7fb3e10bccd85edb/IMG_1576_2_2_4.jpg","cats":[12],"unis":[16],"id":314},"315":{"insts":[2666378,2996815],"language":"en","name":"\"Pay Attention!!\" ADHD Through the Lifespan","short_name":"adhd","order_idx":213,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ce/f2950e11c1c191eaffcbf4f4cfc213/ADHD_brain.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/57/7dbae9df0fca1b8f216d9ae6f127ec/ADHD_brain.jpg","cats":[3],"unis":[6],"id":315},"322":{"insts":[2606554,2225883],"language":"en","name":"Introduction to Psychology as a Science","short_name":"psy","order_idx":214,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/15/9c0d5abfbc092928a2e53de58e901c/smith-course-icon.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/09/a86f1d8786b6c5bb04b5920b174f84/smith-course-icon.png","cats":[20],"unis":[9],"id":322},"327":{"insts":[1462466],"language":"en","name":"English Composition I: Achieving Expertise","short_name":"composition","order_idx":215,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/30/858861451d5799f69c4c41629034f2/wordlemap.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/d7/0b0fec4bac0eb2c60314224f8b53a1/wordlemap.png","cats":[6,14,20],"unis":[7],"id":327},"328":{"insts":[1915980],"language":"en","name":"Introduction to Psychology","short_name":"intropsych","order_idx":216,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/a7/8e50c11598003ad1a2fd27999ec76f/iStock_000002041388_ExtraSmall.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/93/0ff63800e8b878da89ca45006bd392/iStock_000002041388_ExtraSmall.jpg","cats":[20],"unis":[11],"id":328},"329":{"insts":[1084582,2068199],"language":"en","name":"Statistics: Making Sense of Data","short_name":"introstats","order_idx":217,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/b6/72346c65a58cb9796713fe3bcdee3f/introstatslogocropped.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b3/bbb02469fea71f12557d5258cccd5a/introstatslogocropped.jpg","cats":[16],"unis":[11],"id":329},"333":{"insts":[2468250,2225883],"language":"en","name":"Games without Chance: Combinatorial Game Theory ","short_name":"cgt","order_idx":218,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/87/625c24789637a36ebdb36f0927702d/morley-icon.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f7/101b7bc269afd0575ad20bcef8fcc7/morley-icon.jpg","cats":[5],"unis":[9],"id":333},"334":{"insts":[2594168],"language":"en","name":"Corporate Finance","short_name":"finance","order_idx":219,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/74/3653210f1dfc9c38af58f171127860/coursera_finance_460x259.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b3/83961fd6f3d1c2f820fafed3f75b7a/coursera_finance_460x259.png","cats":[2,13],"unis":[6],"id":334},"337":{"insts":[2093911],"language":"en","name":"Big Data in Education","short_name":"bigdata-edu","order_idx":220,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/0f/daf5f9cde97c3372fdbcc5a4d44a26/chico-compy-v2.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f3/82573d90d69ae4a51c2c4ce8d6ba3c/chico-compy-v2.jpg","cats":[14,16],"unis":[40],"id":337},"347":{"insts":[1505164,2041603,1957524,2029839,1893981],"language":"en","name":"Writing II: Rhetorical Composing","short_name":"writing2","order_idx":221,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/6b/d0dcfdbd4dbdde7216fc9d67c2b6d4/Writing2-Rhetorical-Composing.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f9/2565dae921183950deb6b9194c060d/Writing2-Rhetorical-Composing.jpg","cats":[6,14],"unis":[28],"id":347},"354":{"insts":[1894245],"language":"en","name":"The Global Business of Sports","short_name":"globalsportsbusiness","order_idx":222,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/9d/d10a1390c031cd40168543b8d3dae8/GBS.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/74/81ca08db4507957f5824f13052615c/GBS.jpg","cats":[13,20],"unis":[6],"id":354},"356":{"insts":[1937011],"language":"en","name":"An Introduction to Financial Accounting","short_name":"accounting","order_idx":223,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/a8/ba23a7f13d9e874afa6bdb57eabc3c/coursera_accounting_460x259.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/81/df41595ce06513117e550aca792344/coursera_accounting_460x259.png","cats":[2,13],"unis":[6],"id":356},"357":{"insts":[3237389],"language":"en","name":"Caries Management by Risk Assessment (CAMBRA)","short_name":"cariesmanagement","order_idx":224,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/e1/ef87539b4b04d28363c65aa39aa741/newlogo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/21/7006dc0e394b4cd80a7d1283ab9d87/newlogo.jpg","cats":[3,8,10],"unis":[10],"id":357},"367":{"insts":[2526797],"language":"en","name":"Computational Molecular Evolution","short_name":"molevol","order_idx":225,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/4c/7b8be574c6d1d4eecbf766fb41ce9a/green_lime4.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/3b/f49feb83ae9131afb90d59db8a37cf/green_lime4.png","cats":[10,16],"unis":[57],"id":367},"368":{"insts":[2589497,2589622],"language":"zh-Hant","name":"The Beauty of Kunqu Opera | \u5d11\u66f2\u4e4b\u7f8e","short_name":"kunqu","order_idx":226,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ba/739cf02190b08eb02167959e636649/banner_kq.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/47/3dbae8eb937b30a97e47b15eb384ea/banner_kq.jpg","cats":[22],"unis":[45],"id":368},"369":{"insts":[2589075,2589701],"language":"zh-Hant","name":"Classics of Chinese Humanities: Guided Readings | \u4e2d\u570b\u4eba\u6587\u7d93\u5178: \u5927\u5e2b\u5c0e\u8b80","short_name":"chinesehumanities","order_idx":227,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/be/65d767d3d99cb577636f93b54b7ff2/humanities.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e5/66d0de2e961f1e3b9787e892e85495/humanities.jpg","cats":[6],"unis":[45],"id":369},"371":{"insts":[2789426,2947873],"language":"en","name":"Growing Old Around the Globe","short_name":"oldglobe","order_idx":228,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/53/36cef703d4a37e05a571326d4e7d98/Kagan-Intro-fancy-back-16.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e4/dab967e22d1600a37c14a4558eb802/Kagan-Intro-fancy-back-16.png","cats":[3,8],"unis":[6],"id":371},"376":{"insts":[640270],"language":"en","name":"Introduction to Classical Music","short_name":"introtoclassical","order_idx":229,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c3/41d8a7942b594d66989479c9c9bb20/introtoclassical_Logo_3.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/76/90e1775c6495b5d260e24780837e61/introtoclassical_Logo_3.jpg","cats":[18],"unis":[3],"id":376},"378":{"insts":[289468,2480111],"language":"en","name":"Drug Discovery, Development & Commercialization ","short_name":"drugdiscovery","order_idx":230,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/7f/df3d33134a11d893ea8dc861ff0b88/IR.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/83/66951066de213da55bf8eb5ef234ae/IR.jpg","cats":[3,10],"unis":[53],"id":378},"380":{"insts":[2605293],"language":"en","name":"Social Epidemiology","short_name":"socialepi","order_idx":231,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/e5/d83d65ee86e54f915a1b211cbe2d76/Final-Social-Epidemiology-.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/d1/356a4ab3519b9b7bab0f1bc9c9813b/Final-Social-Epidemiology-.jpg","cats":[8,20],"unis":[50],"id":380},"381":{"insts":[2601001],"language":"en","name":"Statistical Molecular Thermodynamics","short_name":"thermodynamics","order_idx":232,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/50/edb5a49f0b862b982b945e54e4406e/Final-Train.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/3d/2829770e40c961a1b3b7c7e7fbbae0/Final-Train.png","cats":[24],"unis":[50],"id":381},"382":{"insts":[2608269],"language":"en","name":"Interprofessional Healthcare Informatics","short_name":"newwayhealthcare","order_idx":233,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/49/392534d539814315e4ac197f672980/Final-Health-Informatics.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/41/a5f93b29848fe1bcb8ee8c30bbdd1f/Final-Health-Informatics.jpg","cats":[4,8,20],"unis":[50],"id":382},"383":{"insts":[2570343],"language":"en","name":"Sustainability of Food Systems: A Global Life Cycle Perspective","short_name":"globalfoodsystems","order_idx":234,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/72/020dd47bdf806d546cd7d9553fa18f/large.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/44/e431f018d3e315b325966667622c56/large.jpg","cats":[2,19,25],"unis":[50],"id":383},"384":{"insts":[2042576],"language":"en","name":"Introduction to Thermodynamics: Transferring Energy from Here to There","short_name":"introthermodynamics","order_idx":235,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f2/ddf57c345af5127a678f07275430a3/bigstockphoto_Gas_Energy_Flames_209173_EDIT.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/64/d7db712c29c68f4db6970f5073d972/bigstockphoto_Gas_Energy_Flames_209173_EDIT.jpg","cats":[15,25],"unis":[3],"id":384},"385":{"insts":[2408877,2604148,2513105,2590461],"language":"fr","name":"Calvin - Histoire et R\u00e9ception d'une R\u00e9forme","short_name":"calvin","order_idx":236,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/dc/f06ad4d4410fb8b0f8a75004f7e393/Calvin.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/9b/74b1b58f6ad5183a369ef568aaad29/Calvin.jpg","cats":[6],"unis":[49],"id":385},"386":{"insts":[2566087],"language":"en","name":"An Introduction to Global Health","short_name":"globalhealthintro","order_idx":237,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/29/2943e86130339267b8e0212a6b2f60/global_health.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/60/b605b8984a47079e220eda9c2a6527/global_health.jpg","cats":[3,8,19,20],"unis":[63],"id":386},"391":{"insts":[323100],"language":"es","name":"Ser m\u00e1s creativos","short_name":"creatividad","order_idx":238,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/86/a32252dc32bc8456ce54b23d86afdf/20130416.elefante_ser_creativo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/47/7040d863b423ee131be97317f830f9/20130416.elefante_ser_creativo.jpg","cats":[4,6,14,20],"unis":[58],"id":391},"393":{"insts":[2606384],"language":"en","name":"Canine Theriogenology for Dog Enthusiasts","short_name":"theriogenology","order_idx":239,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/87/69cc05ef12e4982b4d90b053661f73/Therio-logo.gif","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/6b/522d9d2e33a8aad60cef459d284d10/Therio-logo.gif","cats":[3,8,10],"unis":[50],"id":393},"394":{"insts":[1252],"language":"en","name":"Social and Economic Networks:  Models and Analysis","short_name":"networksonline","order_idx":240,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/1a/0fd0bcaded566342c65e16db568094/Logo1.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/1c/38d188bf97105025168a55aebc634a/Logo1.jpg","cats":[1,2,5,16,20],"unis":[1],"id":394},"398":{"insts":[2566181],"language":"en","name":"Constitutional Struggles in the Muslim World","short_name":"muslimworld","order_idx":241,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/3e/22a29f09a881794a9ac7fa82451aaf/muslim_democracy.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/45/ae92b8fc5d4629a785785e01599a9d/muslim_democracy.jpg","cats":[6,20,21],"unis":[63],"id":398},"399":{"insts":[2579174,2558013],"language":"en","name":"Diabetes - a Global Challenge","short_name":"diabetes","order_idx":242,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/22/ac401bc393817f41889a8579a05646/diabetes.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/63/d179e5336202b41c3132363fef3854/diabetes.jpg","cats":[3,8,10],"unis":[63],"id":399},"400":{"insts":[2500042],"language":"en","name":"Scandinavian Film and Television","short_name":"scanfilmtv","order_idx":243,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/76/691bbbbdc23d7d44bdad9fda989993/scandinavian_film.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ba/3c3c20f06dcd7b998519c5ed9925ce/scandinavian_film.jpg","cats":[6,18],"unis":[63],"id":400},"401":{"insts":[2566619],"language":"en","name":"Measuring Causal Effects in the Social Sciences","short_name":"causaleffects","order_idx":244,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ff/c2d28733fdbdfefcd5f7eb5330fe42/social_science.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/bf/793760af781056e40aa8cc0598c991/social_science.jpg","cats":[20],"unis":[63],"id":401},"402":{"insts":[2619522],"language":"en","name":"S\u00f8ren Kierkegaard - Subjectivity, Irony and the Crisis of Modernity","short_name":"kierkegaard","order_idx":245,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/bb/98b4193b2f80f2773d9308992cb490/kirkegaard.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b4/dd0b26c2c7f9464fb54a52a9061579/kirkegaard.jpg","cats":[6],"unis":[63],"id":402},"403":{"insts":[2428255],"language":"en","name":"Origins - Formation of the Universe, Solar System, Earth and Life","short_name":"origins","order_idx":246,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f4/f504a44e76b468dc3633411e751534/origins.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/73/6f85b09ed59dcb2ab9b257d9741e0a/origins.jpg","cats":[10,23],"unis":[63],"id":403},"404":{"insts":[2569351],"language":"en","name":"The New Nordic Diet - from Gastronomy to Health ","short_name":"newnordicdiet","order_idx":247,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/b4/44fcff14303f44e26f62f66889acf3/nordic_food.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/86/1810f425e9ef884db01f81c65b8995/nordic_food.jpg","cats":[8,10,19],"unis":[63],"id":404},"405":{"insts":[2600270,2600267],"language":"en","name":"The Role of the Renminbi in the International Monetary System","short_name":"renminbi","order_idx":248,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c8/b199d583361630a91b76d8db680daa/renminbi.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/35/1e610f6d0e35718df80bb74d9a16b4/renminbi.jpg","cats":[2],"unis":[45],"id":405},"407":{"insts":[2600275],"language":"en","name":"Information Theory","short_name":"informationtheory","order_idx":249,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/fc/e01b933fb99fc2bec4e9a9b4a4e9eb/informationtheory.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/92/9a1dd0e06140d3c9cd15748f7e5290/informationtheory.jpg","cats":[4],"unis":[45],"id":407},"408":{"insts":[1177458],"language":"es","name":"Tecnolog\u00edas de informaci\u00f3n y comunicaci\u00f3n en la educaci\u00f3n","short_name":"ticyeducacion","order_idx":250,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/16/543cadb9465e61a6bb14fa5cf6099c/20130214.logo.curso.tic.en.educacin.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b6/4b34e36ceed9df4163b9fb5d54607c/20130214.logo.curso.tic.en.educacin.jpg","cats":[14],"unis":[58],"id":408},"409":{"insts":[2320972],"language":"en","name":"C++ For C Programmers","short_name":"cplusplus4c","order_idx":251,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/a8/5c08c3733378cb0084b2d43366edd3/Cplusplus_pic.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/fa/d7bcd2453f7664b9dd47c6f4c78c91/Cplusplus_pic.jpg","cats":[12],"unis":[56],"id":409},"410":{"insts":[625560],"language":"en","name":"Children Acquiring Literacy Naturally","short_name":"childliteracy","order_idx":252,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/02/a05c0435a3c4d6c96d4b627fcb5e1c/Slide1.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/6c/a791d9fcf4f0d1afdfbd3b93e198b7/Slide1.jpg","cats":[4,14,20],"unis":[56],"id":410},"411":{"insts":[2395490],"language":"en","name":"Child Nutrition and Cooking","short_name":"childnutrition","order_idx":253,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/9f/77585588b3e0b1e7fab3a643888652/Just-Cook-Logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/45/16242684977f84465bfbb83aebc1b2/Just-Cook-Logo.jpg","cats":[3,8,14,19],"unis":[1],"id":411},"413":{"insts":[2533383],"language":"es","name":"Pensamiento Cient\u00edfico","short_name":"ciencia","order_idx":254,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/5c/84603b32f215814dd5b0ab63cd4738/20130218.logo.curso.pensamiento.cientfico.amarillo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/6a/126151ccb882df4e97b11745919882/20130218.logo.curso.pensamiento.cientfico.amarillo.jpg","cats":[6,10],"unis":[58],"id":413},"415":{"insts":[2683483],"language":"en","name":"International Organizations Management","short_name":"interorg","order_idx":255,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/d4/f80d67c9ef2aac0c8ce9982f95e43f/IO-Management.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/3b/0dc41ff85d3597adfe26119754dc4e/IO-Management.jpg","cats":[13],"unis":[49],"id":415},"417":{"insts":[2650854],"language":"en","name":"Introduction to Art: Concepts & Techniques","short_name":"art","order_idx":256,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/89/44276eb7cf6defe93fdf57dff28b28/art10_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/a4/4b9e1c8f528199e60e6240e8e76721/art10_logo.jpg","cats":[6,22],"unis":[51],"id":417},"418":{"insts":[2560495],"language":"en","name":"Maps and the Geospatial Revolution","short_name":"maps","order_idx":257,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/8e/07b7e6bc9d0b1e178eebcf939c1172/MapsGR_Logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/5d/d09bd4de6f923c96083e1fe8d91075/MapsGR_Logo.jpg","cats":[4,16,20],"unis":[51],"id":418},"419":{"insts":[1924714,2644910,2631338],"language":"en","name":"Creativity, Innovation, and Change","short_name":"cic","order_idx":258,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/7f/56693aa548f9e1e83f3e4fb231b799/CIC_MOOC_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ce/45bcd7952fd6a4170188f0c9056e0a/CIC_MOOC_logo.jpg","cats":[4,13,14,15,20],"unis":[51],"id":419},"420":{"insts":[72633,2687735,2687745,2687752,2687763,2687771,2687778,2687782],"language":"en","name":"Epidemics - the Dynamics of Infectious Diseases","short_name":"epidemics","order_idx":259,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/d7/f83ea9bd261a073200c05bd894d6cf/infectiousdisease-MOOC.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f2/36713ca852484ffad471b5d22e2efd/infectiousdisease-MOOC.png","cats":[8,10],"unis":[51],"id":420},"421":{"insts":[2645422],"language":"en","name":"Energy, the Environment, and Our Future","short_name":"energy","order_idx":260,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/94/0f7575f2bc66c8f2f8ee1a540e095e/alley_energy_course_graphic.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c9/2d9784b2f32b5280bf5fc352dfaee9/alley_energy_course_graphic.jpg","cats":[25],"unis":[51],"id":421},"422":{"insts":[2589160,2588904],"language":"en","name":"The Holocaust","short_name":"holocaust","order_idx":261,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/79/6f09ed01c62a32881de83b58ba7a0a/g31j.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/20/0159d0b81938d4828dc0f13cbd1d6d/g31j.jpg","cats":[6],"unis":[56],"id":422},"425":{"insts":[2605756],"language":"en","name":"Human Evolution: Past and Future","short_name":"humanevolution","order_idx":262,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/4c/de0fc51308f7dedd6a3e06012cc61f/amud-ohalo-vienna.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/4a/14fb96da2a865e6b4f71fe8beb1181/amud-ohalo-vienna.jpg","cats":[10,20],"unis":[65],"id":425},"426":{"insts":[2605719,2605744],"language":"en","name":"Videogames and Learning","short_name":"videogameslearning","order_idx":263,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/bd/0b35c09d33803063c664ea185ea121/games_learn.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/70/300d2249f91fd85aedc2a1ea49ba9c/games_learn.jpg","cats":[4,14],"unis":[65],"id":426},"427":{"insts":[2605731,2687823],"language":"en","name":"Globalizing Higher Education and Research for the \u2018Knowledge Economy\u2019","short_name":"globalhighered","order_idx":264,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/18/51bebaa24f4e80852f271d5498d998/TwitterAvatar.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ca/74dfc7e9fe83fc00f4f37878a6e030/TwitterAvatar.jpg","cats":[4,14,20],"unis":[65],"id":427},"428":{"insts":[2605772],"language":"en","name":"Markets with Frictions","short_name":"marketswithfrictions","order_idx":265,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/b3/5e4552e4555556067af9aed4aa98c5/markets.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e4/133081d7a5a15c59c924ce20160da6/markets.jpg","cats":[2,13],"unis":[65],"id":428},"429":{"insts":[2276941],"language":"en","name":"Case-Based Introduction to Biostatistics","short_name":"casebasedbiostat","order_idx":266,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/bb/b6ac6b15812763f392fd0d4b60fb4c/case_based_mag_glass-01.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/43/6f96f6c5e26cfe862b3acb6da4591e/case_based_mag_glass-01.png","cats":[8,16],"unis":[8],"id":429},"430":{"insts":[2511245,2894378,3096301,2581715,2590328,2918070],"language":"en","name":"Global Health: Interdisciplinary Overview","short_name":"globalhealthoverview","order_idx":267,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/fa/f06d98e0b774e79a3607b6d6802969/GlobalHealth.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/44/56963ae7fbfa6e19ecb56ad20ed4e3/GlobalHealth.jpg","cats":[3,8],"unis":[49],"id":430},"431":{"insts":[2359335,2204104],"language":"en","name":"Fundamentals of Audio and Music Engineering: Part 1 Musical Sound & Electronics","short_name":"audiomusicengpart1","order_idx":268,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ba/359ae379570a70ecc45e6efcc49447/FundamentalsSound_ImageLogo-3.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/1d/b3aaaad0e4ab67581f1e4b664efc6c/FundamentalsSound_ImageLogo-3.jpg","cats":[15,18],"unis":[60],"id":431},"432":{"insts":[2512709,2582502],"language":"en","name":"Introduction to Mathematical Philosophy","short_name":"mathphil","order_idx":269,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/27/0c882ed4049498e49834ff054421b6/LogoMathPhil11.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/46/73a43c2b90d50c70a211d868a46f22/LogoMathPhil11.jpg","cats":[5,6],"unis":[64],"id":432},"433":{"insts":[2582522],"language":"en","name":"Programmed cell death","short_name":"pcd","order_idx":270,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/77/9eb8e03c1d2ccc33d0bd44ee826db2/pcd-001-Logo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/61/d69590aa893335e7c9f568ffd39c8e/pcd-001-Logo.png","cats":[3,10],"unis":[64],"id":433},"434":{"insts":[2602668],"language":"zh-Hant","name":"\u6a5f\u7387","short_name":"prob","order_idx":271,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/03/830f868afe29991b76b62550f00e0c/iStock_000000248160_Small.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b2/b093a008006adfe6424db3a1b17869/iStock_000000248160_Small.jpg","cats":[5,15],"unis":[75],"id":434},"435":{"insts":[2599979],"language":"en","name":"History of Rock, Part One","short_name":"historyofrock1","order_idx":272,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/46/c0d3b9366726f25f501b4815bfffdb/HistoryofRockLogo2pt1.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/1c/3ac4701bb77ecf9be973ae7a07dfd8/HistoryofRockLogo2pt1.jpg","cats":[18],"unis":[60],"id":435},"436":{"insts":[2506410],"language":"en","name":"Design Thinking for Business Innovation","short_name":"designbiz","order_idx":273,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f8/0fda7e21538899bc3f48391f72f1d2/DatD_Coursera.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/5b/e90b07f9b99d0b23f23d9c949ad68d/DatD_Coursera.png","cats":[13],"unis":[18],"id":436},"438":{"insts":[2580055,2593202],"language":"fr","name":"Initiation \u00e0 la th\u00e9orie des distributions","short_name":"distributions","order_idx":274,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/76/e5970454f7eb2a6d3c9f07d29f755a/logg.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/9d/722d663f5f711fa3a61c8f7db89deb/logg.jpg","cats":[5],"unis":[66],"id":438},"439":{"insts":[2333330],"language":"en","name":"Foundations of Virtual Instruction","short_name":"virtualinstruction","order_idx":275,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c3/2210e94025c8da7f8072890c9b40ad/Virtual-Instruction-Logo_Correct-Size.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/1d/809b47eec770ec1ec8bcc871b8423e/Virtual-Instruction-Logo_Correct-Size.jpg","cats":[4,14,26],"unis":[30],"id":439},"440":{"insts":[2599979],"language":"en","name":"History of Rock, Part Two","short_name":"historyofrock2","order_idx":276,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/8c/8e98e44a27a0a6dc0d25393c73bf57/HistoryofRockLogo2pt2.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/de/a1fa5dad47723b1b1523cba8f9adb2/HistoryofRockLogo2pt2.jpg","cats":[18],"unis":[60],"id":440},"441":{"insts":[2089332],"language":"en","name":"Live!:  A History of Art for Artists, Animators and Gamers","short_name":"livearthistory","order_idx":277,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/3d/8f940bd5406c96550d54e2825afb3c/JEANNENE_P.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/58/351265b97720115d956670f3bb1794/JEANNENE_P.jpg","cats":[6,18,22],"unis":[59],"id":441},"442":{"insts":[2531752],"language":"en","name":"Creating Site-Specific Dance and Performance Works","short_name":"sitedance","order_idx":278,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/d7/9d7d396bfc35bdf06530423edcdcca/STEPHAN_K.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e9/bfb17bca07d0a30a12ac5c31774aed/STEPHAN_K.jpg","cats":[22],"unis":[59],"id":442},"443":{"insts":[2660238],"language":"en","name":"Introduction to Programming for Musicians and Digital Artists","short_name":"chuck101","order_idx":279,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/da/e6b40618a9d340bce35221ad5f17a9/logo.gif","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/15/f9b67ffb18278fe22f34c30d4c780d/logo.gif","cats":[12,18,22],"unis":[59],"id":443},"445":{"insts":[981331],"language":"zh-Hans","name":"Structural Equation Model and its Applications | \u7ed3\u6784\u65b9\u7a0b\u6a21\u578b\u53ca\u5176\u5e94\u7528","short_name":"sem","order_idx":280,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/20/d1c7f9eb983b85924159a121793121/banner_n.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/4a/044557d6c10a674cf89ec22699d02e/banner_n.jpg","cats":[14,16,20],"unis":[45],"id":445},"446":{"insts":[2423001,1622801],"language":"fr","name":"Conception et mise en oeuvre d'algorithmes.","short_name":"algoprog","order_idx":281,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/71/ffe71b46e9a30beeb03cd38cdd6450/logo3.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/58/919b5d0ca0f0b15ef00cc985b2dfaf/logo3.jpg","cats":[1],"unis":[66],"id":446},"447":{"insts":[1914201,2593255],"language":"fr","name":"Al\u00e9atoire : une Introduction aux Probabilit\u00e9s ","short_name":"probas","order_idx":282,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c9/ba837facca9cd9d4f5636600ea2910/logo-0.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ab/adb7827745efc2137c916d1f4ac75fe8/logo-0.jpg","cats":[5],"unis":[66],"id":447},"448":{"insts":[2635797,2642321],"language":"en","name":"Law and the Entrepreneur ","short_name":"law","order_idx":283,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/11/d6c0b84697d4df4b37b58e081c0548/lawmooc-image.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/16/91f9f9999e708b3da8ea89cfe4ee96/lawmooc-image.jpg","cats":[13,21],"unis":[54],"id":448},"449":{"insts":[1166989],"language":"en","name":"Antimicrobial Stewardship: Optimization of Antibiotic Practices","short_name":"antimicrobial","order_idx":284,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/fd/1229a4ddcdf524e45be633e899eb5b/penicillin-vials_small.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/d3/26b05232873dabe4672f5778943a28/penicillin-vials_small.jpg","cats":[3],"unis":[1],"id":449},"450":{"insts":[2633312],"language":"en","name":"Recovering the Humankind Past and Saving the Universal Heritage","short_name":"recoveringthepast","order_idx":285,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/8f/1fb089cd8f28b9e7a8f3cc80b2cb05/Matthiae_Ebla.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/eb/36301e697e4cf40cbfc73dafd118be/Matthiae_Ebla.jpg","cats":[6],"unis":[74],"id":450},"451":{"insts":[2641217],"language":"en","name":"Terrorism and Counterterrorism: Comparing Theory and Practice","short_name":"terrorism","order_idx":286,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/37/25873c28b5a43aa53d454cba0dbf75/Terrorism-and-Counterterrorism.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/69/64180fe480055ce3b330c20ffc91f8/Terrorism-and-Counterterrorism.jpg","cats":[6,20],"unis":[25],"id":451},"453":{"insts":[2691794],"language":"en","name":"Understanding Einstein: The Special Theory of Relativity","short_name":"einstein","order_idx":287,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/7f/cf6ce352318cad440898a2be0b138a/iStock_000018822031Small.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c5/cbbe26c2d530d744a4b04f2f41cae8/iStock_000018822031Small.jpg","cats":[6,23],"unis":[1],"id":453},"455":{"insts":[2644105],"language":"zh-Hant","name":"\u4e2d\u570b\u53e4\u4ee3\u6b77\u53f2\u8207\u4eba\u7269\uff0d\uff0d\u79e6\u59cb\u7687","short_name":"chinesehistory","order_idx":288,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/86/d330001204e7140582f65a9e6e9478/A.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/0c/b9777acfb9354116c24f5c6c0c8a85/A.jpg","cats":[6],"unis":[75],"id":455},"456":{"insts":[2645301,2645318],"language":"en","name":"Soul Beliefs: Causes and Consequences","short_name":"soulbeliefs","order_idx":289,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/71/222b0df7612fb28c3fd36cfebf1957/BD_Mummy_and_Ba.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/73/a6fe18dbaaba26c95aa2ea00b0be1a/BD_Mummy_and_Ba.jpg","cats":[6,20],"unis":[67],"id":456},"457":{"insts":[2340295],"language":"en","name":"Confronting The Big Questions: Highlights of Modern Astronomy","short_name":"astronomy","order_idx":290,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/bd/49a04294a993b0141690788ab2f6f2/HighlightsAstronomyLogo-2.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/4d/b707024cb3250d4f55399fac84ee96/HighlightsAstronomyLogo-2.jpg","cats":[23],"unis":[60],"id":457},"458":{"insts":[2645257,2645262],"language":"es","name":"Innovaci\u00f3n educativa con recursos abiertos","short_name":"innovacionrea","order_idx":291,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/7b/3529cd506ad9017acebd6e251de26c/coursera_001_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b9/28895749944f002a0fd6d42f8716e9/coursera_001_logo.jpg","cats":[14],"unis":[62],"id":458},"459":{"insts":[2573718],"language":"en","name":"Competitive Strategy","short_name":"compstrategy","order_idx":292,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/41/569c7574095ce7f5ec3b012380709f/tic_tac_toe_iStock_Natasha-Japp-Photography_webl.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ac/57b21e8a5cc489a45ebfc4200aaf1e/tic_tac_toe_iStock_Natasha-Japp-Photography_webl.png","cats":[2,13],"unis":[64],"id":459},"460":{"insts":[2595276],"language":"en","name":"Understanding economic policymaking","short_name":"econpolicy","order_idx":293,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/67/ccafab4a7fb4608a5bfa179d1edecb/5course_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/5b/f936f9d62617bd33b6ac7f9f704161/5course_logo.jpg","cats":[2],"unis":[61],"id":460},"461":{"insts":[2633310],"language":"it","name":"La visione del mondo della Relativit\u00e0 e della Meccanica Quantistica","short_name":"rqm","order_idx":294,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ca/fdede07dfdc8736b57af429144682d/logo-RQM-4-1-liv.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/7b/726abddcdeb722eb183057e5109a01/logo-RQM-4-1-liv.jpg","cats":[6,23],"unis":[74],"id":461},"462":{"insts":[2650348],"language":"en","name":"Analyzing the Universe","short_name":"analyze","order_idx":295,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/22/26e686620527dc5aa46036d2915047/supernova-black-hole.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e0/0ca6c0356518a9bb53d5de418c54db/supernova-black-hole.jpg","cats":[23],"unis":[67],"id":462},"463":{"insts":[2075897],"language":"en","name":"Inspiring Leadership through Emotional Intelligence","short_name":"lead-ei","order_idx":296,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ec/846ea70a3c01d0b3ae27ad125023f3/147669568.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/27/fd5ca575e9b7dde1ba926b5b8546aa/147669568.jpg","cats":[13,14,20],"unis":[68],"id":463},"464":{"language":"es","name":"El ABC del emprendimiento esbelto ","short_name":"abcemprendimiento","order_idx":297,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/cd/4887d61f3cc9c8a8d88a830ad46f37/coursera_002_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b9/402975b12d04fee63b14accf290816/coursera_002_logo.jpg","insts":[2645282,3231512,2747070],"unis":[62],"id":464},"465":{"insts":[2602095],"language":"en","name":"Volcanic Eruptions: a material science.","short_name":"volcano","order_idx":298,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/4a/dfa944049fdefa48235e1017c08cbb/vulkan_ammit_istock_webl.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ed/9ad5267c53b591430153ba14138982/vulkan_ammit_istock_webl.png","cats":[9,25],"unis":[64],"id":465},"466":{"insts":[2527015],"language":"en","name":"Introduction to International Criminal Law","short_name":"intlcriminallaw","order_idx":299,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/79/2f60b9be37a48e95889e4bde705b0b/Untitled.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/cd/0aa55e6a5e2f7280d4e32064c81199/Untitled.png","cats":[21],"unis":[68],"id":466},"467":{"insts":[2633305],"language":"en","name":"Early Renaissance Architecture in Italy: from Alberti to Bramante","short_name":"renaissancearchitect","order_idx":300,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/9a/6e4051c4442cd25c8e448634d18c04/77650945.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/73/c17dacf21ef571074062b31b6de890/77650945.jpg","cats":[6,22],"unis":[74],"id":467},"469":{"insts":[2653254,2653304,2191978],"language":"en","name":"Crafting an Effective Writer: Tools of the Trade","short_name":"basicwriting","order_idx":301,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/06/41cc053e58c65b59e03e3b67c1e30b/msjc.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/bd/c650a4feea8765e09f7045f205649b/msjc.jpg","cats":[6],"unis":[44],"id":469},"471":{"insts":[1540981,2658887,3542322],"language":"en","name":"Bioinformatics Algorithms (Part 1) ","short_name":"bioinformatics","order_idx":302,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/58/fc2352270af701c467c03792e93a5b/Bioinf.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c7/be0dd407562e5c562e97a0f3b79a6e/Bioinf.png","cats":[1,10],"unis":[53],"id":471},"472":{"insts":[2656811],"language":"en","name":"Critical Perspectives on Management","short_name":"criticalmanagement","order_idx":303,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/b9/c82d88b9a0aa3b024d98cbf7cfa9b7/managemen_logot.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/4b/3da2bbd8abdaeb9907476a6c4d82f5/managemen_logot.jpg","cats":[13],"unis":[61],"id":472},"474":{"insts":[2657356],"language":"en","name":"Understanding Media by Understanding Google","short_name":"googlemedia","order_idx":304,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/9d/32ba053bf45ecdf427b9c640820585/photo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/15/47950012e5694839aca29b8d5dbb30/photo.jpg","cats":[2,4,13],"unis":[54],"id":474},"475":{"insts":[2659612],"language":"en","name":"Introduction to Power Electronics","short_name":"powerelectronics","order_idx":305,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/1b/40b383b0d0d0dfbe9eed8008649a61/image.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/1c/110aebe42e22a214b71f2b2a3a2529/image.jpg","cats":[15],"unis":[71],"id":475},"476":{"insts":[2645293],"language":"en","name":"Latin American Culture","short_name":"latinamericanculture","order_idx":306,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/7a/c25b15b1e04fe5224d2d97cfd0411e/coursera_003_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/dd/5bb05a4f43c860638d065f0131d9d1/coursera_003_logo.jpg","cats":[6,20],"unis":[62],"id":476},"477":{"insts":[2644404],"language":"en","name":"How Green Is That Product? An Introduction to Environmental Life Cycle Assessment","short_name":"introtolca","order_idx":307,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/29/7f2aa812cc8b3fe20ddf1a7d4fd139/tree-logo-600x340.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/57/47b01348dd0747aae23180b3d6a8cf/tree-logo-600x340.jpg","cats":[15,16,25],"unis":[54],"id":477},"478":{"insts":[2660182],"language":"es","name":"Continuidad y desarrollo de la empresa familiar","short_name":"empresafamiliar","order_idx":308,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/d8/8054d6a2afce99d38bc283d93179e1/coursera_004_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/fb/98a0cd8a7881d5bce0157816adb84f/coursera_004_logo.jpg","cats":[2,13,20],"unis":[62],"id":478},"480":{"insts":[2673267,3543489],"language":"en","name":"Linear and Integer Programming","short_name":"linearprogramming","order_idx":309,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/36/fc3ac9d321e5e628016bfeb089e91d/lpLogo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/2e/414d8161b8ce374fc7c61d4853a9d6/lpLogo.png","cats":[1,15],"unis":[71],"id":480},"482":{"insts":[2674007],"language":"en","name":"Conditions of War and Peace","short_name":"warandpeace","order_idx":310,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/aa/5fe6a7ced4076a09e05e11490e041b/warandpeace_image.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/5b/e2cb4790128c5b69ac7b84f407f21d/warandpeace_image.jpg","cats":[20],"unis":[76],"id":482},"483":{"insts":[2673437],"language":"en","name":"From the Big Bang to Dark Energy","short_name":"bigbang","order_idx":311,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/86/dbd8db147e5031a005c3e0dcae59a9/Hubble_Ultra_Deep_Field_part_d_high.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/d4/192a92d619bfb50a16ad035f5f7f2d/Hubble_Ultra_Deep_Field_part_d_high.jpg","cats":[9,23],"unis":[76],"id":483},"484":{"insts":[2696515],"language":"en","name":"The Diversity of Exoplanets","short_name":"extrasolarplanets","order_idx":312,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/21/e3615ff6475b89079e4d83d026a1eb/exoplanet07.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/eb/8419ebf39f0f674254f4d23a54d5f2/exoplanet07.jpg","cats":[23],"unis":[49],"id":484},"485":{"insts":[2643309],"language":"en","name":"Fundamentals of Digital Image and Video Processing","short_name":"digital","order_idx":313,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/bf/d1a80b022b8abf215d1f977c071c2f/logo_aggelos.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/6d/c49bbac1cbaecf9a2ff557e517634c/logo_aggelos.jpg","cats":[4,15,17],"unis":[54],"id":485},"486":{"insts":[2688952],"language":"en","name":"Introduction to Environmental Law and Policy","short_name":"environlaw","order_idx":314,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/67/269c534ed21a7ffd71a32a591a872c/dons-icon.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/0e/b19a9b92f14b52fb80de02a2aafe63/dons-icon.jpg","cats":[21],"unis":[77],"id":486},"487":{"insts":[2677973],"language":"en","name":"Physics 1 for Physical Science Majors","short_name":"physics1","order_idx":315,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/79/91c94b68cf01a3340b49b2516112ff/CourseraLogo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/6d/f6613e9892e60add07be5d4876cf2d/CourseraLogo.jpg","cats":[23],"unis":[71],"id":487},"488":{"insts":[2685273,2685251,2685315,2685318,1841753,2685264,3307276,2685240,2685294,2685310,2685284],"language":"en","name":"Content Strategy for Professionals: Engaging Audiences for Your Organization","short_name":"contentstrategy","order_idx":316,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/a2/5eebe5eaecd87d6eb07304cbd9ef0f/Content-Strategy-logo2.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/2e/b6ffdd5174cc93bb9b6dbe83b19879/Content-Strategy-logo2.jpg","cats":[4,13],"unis":[54],"id":488},"489":{"insts":[2679701],"language":"en","name":"Comic Books and Graphic Novels","short_name":"comics","order_idx":317,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c8/39a91068003dd6743aff935688f0a8/Comics-and-Graphic-Novels.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/d6/ba3d951f9beb0c015cc6fd9d453851/Comics-and-Graphic-Novels.png","cats":[6,22],"unis":[71],"id":489},"492":{"insts":[2658770],"language":"en","name":"Everything is the Same: Modeling Engineered Systems","short_name":"modelsystems","order_idx":318,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/50/2bb57d916637f0773343036f7639d0/TDMurpheyCourseraLogo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/90/130e81b0efc6b67dd2d3b6d2b0cd95/TDMurpheyCourseraLogo.jpg","cats":[15],"unis":[54],"id":492},"493":{"insts":[2675440],"language":"en","name":"Exploring Beethoven\u2019s Piano Sonatas","short_name":"beethovensonatas","order_idx":319,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c4/474f16f71c8b518170ff1db947ccaf/coursera-lvb.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/1a/3306f9e902fd6a5a87d3a98696b643/coursera-lvb.jpg","cats":[6,18],"unis":[79],"id":493},"494":{"insts":[2675437,2654261],"language":"en","name":"From the Repertoire: Western Music History through Performance","short_name":"musichistoryperforms","order_idx":320,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/3d/a668e537d3847c895fc257624190e6/Guido-2.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/64/87fc4cb7eef570216c117145f46e79/Guido-2.jpg","cats":[6,18],"unis":[79],"id":494},"495":{"insts":[2694569],"language":"en","name":"Fundamentals of Rehearsing Music Ensembles","short_name":"music-ensembles","order_idx":321,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/b3/ac69eb858bbbc114edda6b6397d13b/music-logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f4/46af8ac9c104b8c7214412c4619f53/music-logo.jpg","cats":[18],"unis":[77],"id":495},"496":{"insts":[2690251],"language":"en","name":"Metadata: Organizing and Discovering Information","short_name":"metadata","order_idx":322,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/04/d1670669938ca4cb20c95828b0ba4b/meta1.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e4/d3deb5a22a1cbdef456382afcf18cf/meta1.jpg","cats":[4],"unis":[77],"id":496},"497":{"insts":[704621,2694658],"language":"en","name":"Epidemiology: The Basic Science of Public Health","short_name":"epidemiology","order_idx":323,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/4c/ca334e7b2d5c68de312a2a7eb91819/epid-mooc.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/91/eb6fa07bd62fd195025eded9cd998b/epid-mooc.jpg","cats":[8],"unis":[77],"id":497},"498":{"insts":[2688754,2688759,2688762],"language":"es","name":"Desarrollo r\u00e1pido de productos innovadores para mercados emergentes","short_name":"innovacion","order_idx":324,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/03/b25513bc9a3cde275d5fed817454a1/coursera_008_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/27/4fd27f6fa4c00ff5f56f3c114d2836/coursera_008_logo.jpg","cats":[2,13],"unis":[62],"id":498},"499":{"insts":[2295274],"language":"en","name":"Democratic Development","short_name":"democraticdev","order_idx":325,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/98/94645c11c97cf6da3a58bc75fc7fce/Icon_DualColor_Lg.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/3c/7cfe29a042bf613e495b7780d6b0fe/Icon_DualColor_Lg.png","cats":[6,20],"unis":[1],"id":499},"500":{"insts":[2683051],"language":"en","name":"Write Like Mozart: An Introduction to Classical Music Composition","short_name":"classicalcomp","order_idx":326,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/07/e6dd62eb34b47ac9831f8cad3e0074/coursera_icon-01.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/48/8be8515df990780962786c48259675/coursera_icon-01.png","cats":[18],"unis":[47],"id":500},"501":{"insts":[2683047],"language":"en","name":"Unpredictable? Randomness, Chance and Free Will","short_name":"randomness","order_idx":327,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c8/c0aecde616f776e58a9f6bc2d72205/RANDOMNESS.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/a1/53393d5b9ddd4a54962ae8a99d55fa/RANDOMNESS.jpg","cats":[16,23],"unis":[47],"id":501},"503":{"insts":[2672777],"language":"es","name":"Matem\u00e1ticas y movimiento","short_name":"precalculo","order_idx":328,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/98/cc0ec76869899685021844e16062f9/coursera_006_logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/1c/756d238ff1950d07b8c5203556345e/coursera_006_logo.jpg","cats":[5],"unis":[62],"id":503},"504":{"insts":[2690314,2690319],"language":"es","name":"Egiptolog\u00eda (Egyptology)","short_name":"egypt","order_idx":329,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/10/ebb0f9bd4ecb39769a1ddb714c49f2/Egiptologia.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/82/b052da328c5393fdcaade9b5f09b4d/Egiptologia.jpg","cats":[6],"unis":[80],"id":504},"505":{"insts":[2690311,118364,3189498],"language":"es","name":"Pre-Calculus","short_name":"precalc","order_idx":330,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f5/c3d1686ad339bac88817f6458f3002/precalculo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/a9/059f96ce31e9e8934d95e59c828a16/precalculo.png","cats":[5],"unis":[80],"id":505},"506":{"insts":[2690307],"language":"es","name":"Histolog\u00eda b\u00e1sica: los cuatro tejidos fundamentales ","short_name":"histologia","order_idx":331,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f3/0bcd476a45e63292f3aeff5552ba96/histologia_logo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/10/b599a9b167904fb7f8c306bb406150/histologia_logo.png","cats":[8,10],"unis":[80],"id":506},"508":{"insts":[2693792],"language":"de","name":"Einf\u00fchrung in Computer Vision","short_name":"compvision","order_idx":332,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/58/2d3041eb65a7d499fb670d86d0d934/Course_Logo_Computer_Vision.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/3f/cb4a7c3ce0e6ac6a504ed714fcf59f/Course_Logo_Computer_Vision.jpg","cats":[17],"unis":[78],"id":508},"509":{"insts":[2695162],"language":"en","name":"The Future of Humankind","short_name":"humankindfuture","order_idx":333,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/7b/48fb8d834051e6baac0c6756c3773a/MC900071032.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/17/857704657c1e0c7721d860f550c7de/MC900071032.jpg","cats":[6],"unis":[67],"id":509},"512":{"insts":[2255684],"language":"en","name":"Introduction to Public Speaking","short_name":"publicspeak","order_idx":334,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/4d/361d70127232029166fdc007f578dc/Public-Speaking.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/08/78d611614345d3448aa02bee32e789/Public-Speaking.jpg","cats":[6,13,14,22],"unis":[15],"id":512},"524":{"insts":[3471976],"language":"en","name":"Globalization and You","short_name":"globalization","order_idx":335,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/43/3763723917a62729305ab23043ed7f/GlobalizationWordleBanner2.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/50/945bed87d1f8745ec38aeb2090f644/GlobalizationWordleBanner2.jpg","cats":[2,6,20],"unis":[15],"id":524},"526":{"insts":[2075104,1164831,2083331,2083347],"language":"en","name":"Guinea Pigs, Heroes & Desperate Patients: The History & Ethics of Human Research","short_name":"humanresearch","order_idx":336,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/39/8c435446f27af68b1b7ad531e692ca/GuineaPigsHeroesPatients_Logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e3/b656f1c64eb69615dc1af6e6e0641d/GuineaPigsHeroesPatients_Logo.jpg","cats":[3,6,8,10,20],"unis":[8],"id":526},"527":{"insts":[2722532,3145522],"language":"en","name":"The Science of Safety in Healthcare","short_name":"healthcaresafety","order_idx":337,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/6d/bc038aff1da5c8c5c2294277118e76/healthcare_safety.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b7/d7601296287fba65cfe263bb54abc3/healthcare_safety.jpg","cats":[3,8],"unis":[8],"id":527},"537":{"insts":[3011727,2225883],"language":"en","name":"First-Year Composition 2.0","short_name":"gtcomp","order_idx":338,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/5b/34fea429e8a72bb6c4478b88b8a88a/LMC-icon5.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f3/ca7e818d789237fb52a3726f97ed04/LMC-icon5.png","cats":[6],"unis":[9],"id":537},"566":{"insts":[3408612,3693651],"language":"en","name":"Diabetes: Diagnosis, Treatment, and Opportunities","short_name":"ucsfdiabetes","order_idx":339,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/d3/043b263cc3da09fb0713ae8b4f7720/iStock_000011432889Small.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/89/e0f66467b37e22f10cbaffd1652d63/iStock_000011432889Small.jpg","cats":[3,8],"unis":[10],"id":566},"582":{"insts":[2705795],"language":"en","name":"Instructional Methods in Health Professions Education","short_name":"instructmethodshpe","order_idx":340,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f9/e0e9229696a4179e24c322d4d2534e/carens_Course_Logo_053113a.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/4b/a08f079c6db3497faef5438abde609/carens_Course_Logo_053113a.jpg","cats":[3,8,14],"unis":[3],"id":582},"584":{"insts":[3229025],"language":"en","name":"Practical tips to improve Asian American participation in cancer clinical trials","short_name":"clinicaltrials","order_idx":341,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/b3/068a613fce53c3de094abf25422474/cme.clinicaltrials.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/d5/1ed45f0db320a812c5e49bf292becf/cme.clinicaltrials.jpg","cats":[3],"unis":[1],"id":584},"591":{"insts":[3287070,3204080],"language":"en","name":"The Fall and Rise of Jerusalem","short_name":"jerusalem","order_idx":342,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/ca/833f4600de66e9d64737cd3cab4a4d/Courses.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/bc/922cc4fe440e85f02021af11dc8385/Courses.jpg","cats":[6],"unis":[110],"id":591},"592":{"insts":[3287177,3708694],"language":"en","name":"What a Plant Knows (and other things you didn\u2019t know about plants)","short_name":"plantknows","order_idx":343,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/d3/e2f2a24c37aa64a9e16ac38387301b/Courses2.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ce/518719e523f99ab19de9e49e6a832a/Courses2.jpg","cats":[10],"unis":[110],"id":592},"594":{"insts":[3297297],"language":"en","name":"Genetics and Society: A Course for Educators","short_name":"amnhgenetics","order_idx":344,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f5/79afd5ae4c7ee37a7dc60bd9f65485/course_genetics.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/c1/a2948ad7001e855d2eb35f7c1d2827/course_genetics.jpg","cats":[8,10,14,26],"unis":[100],"id":594},"595":{"insts":[3300435],"language":"en","name":"Evolution: A Course for Educators","short_name":"amnhevolution","order_idx":345,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/6f/d4ff754f3530e0985bcca09a9c029e/course_evolution.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/60/02168b68a625e79e39db8433bdff14/course_evolution.jpg","cats":[10,14,26],"unis":[100],"id":595},"596":{"insts":[3297304,3298066],"language":"en","name":"The Dynamic Earth: A Course for Educators","short_name":"amnhearth","order_idx":346,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/71/2ca964b5ba3a061565b88e95d7ad39/earth_option1.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f4/1b12e45800bd0954e9efcb07cba332/earth_option1.jpg","cats":[9,14,26],"unis":[100],"id":596},"598":{"insts":[1466681],"language":"en","name":"Science, Technology, and Society in China II: History of S&T in Chinese Society","short_name":"stschina2","order_idx":347,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/d3/bedb174f3df59199e472323c1b753e/stschina2-course-logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b9/dba6086a4f56801c91e72b708230e5/stschina2-course-logo.jpg","cats":[20],"unis":[35],"id":598},"599":{"insts":[1466681],"language":"en","name":"Science, Technology, and Society in China III: The Present & Policy Implications","short_name":"stschina3","order_idx":348,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/20/973743f49f8c578b13708b3d38467b/stschina3-course-logo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/3e/111c8ebdef8aab24ef1c1aa685ede2/stschina3-course-logo.jpg","cats":[20],"unis":[35],"id":599},"600":{"insts":[3289416,3289263],"language":"en","name":"Student Thinking at the Core","short_name":"corethink","order_idx":349,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/a5/9e8dc25b6296434147e2ea73d16025/leverging-student-thinking.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b8/9431452cf8470b4b4767a7924b84e8/leverging-student-thinking.png","cats":[14,26],"unis":[37],"id":600},"607":{"insts":[3219339],"language":"en","name":"Art and Inquiry: Museum Teaching Strategies For Your Classroom ","short_name":"artinquiry","order_idx":350,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/66/a4444bbdf75ce9b19a1199b6bfd9b2/Coursera_240x135.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/dc/85bdee318e41f2bb4f99034a2e1587/Coursera_240x135.jpg","cats":[6,14,22,26],"unis":[107],"id":607},"613":{"insts":[3332104],"language":"en","name":"Teaching Character                and Creating Positive Classrooms ","short_name":"teachingcharacter","order_idx":351,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f0/c09133e1cd65d9861ac15e97dcb977/54_Frank-01015216.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/73/5f37a47ea52014c85b0d97d516e17f/54_Frank-01015216.jpg","cats":[14,26],"unis":[104],"id":613},"614":{"insts":[3260920,3260925,3260930,3228961],"language":"en","name":"Tinkering Fundamentals: Integrating Making Activities into Your STEM Classroom","short_name":"tinkering","order_idx":352,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/9b/4b317d2ba7c924654136e19139ad76/Tinkering_logo_with_dots_black_tm_RGB.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/38/558b86175666ce9002d79895f499bf/Tinkering_logo_with_dots_black_tm_RGB.png","cats":[9,14,26],"unis":[108],"id":614},"616":{"insts":[3332466,3164319,3343186,3343192],"language":"en","name":"Integrating Engineering Into Your Science Classroom","short_name":"teachengineering","order_idx":353,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/34/fe8df9aa2840176a343a541ebac8d0/TI-Builders.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/a3/cf20f6ca30287f4a1aa8c88aa9d678/TI-Builders.jpg","cats":[14,15,26],"unis":[108],"id":616},"620":{"insts":[2327335,3361949,3365638,3368459],"language":"en","name":"Effective Classroom Interactions: Supporting Young Children\u2019s Development","short_name":"earlychildhood","order_idx":354,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/66/600b8525621d0f8fdb4e59ef305baf/CourseLogo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/6e/6a5fc6ea45cf14031527787c0e660f/CourseLogo.jpg","cats":[14,26],"unis":[18],"id":620},"621":{"insts":[1676603,3401945],"language":"en","name":"Emerging Trends & Technologies in the Virtual K-12 Classroom","short_name":"k12virtualtrends","order_idx":355,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/93/1a9178b88191db1e90d7defb67d675/Older-and-younger-fingers-on-Tablet.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/70/9ce4cc8692a33b7a7eb1920ddbbb85/Older-and-younger-fingers-on-Tablet.jpg","cats":[4,14,26],"unis":[30],"id":621},"622":{"insts":[3219450],"language":"en","name":"Surviving Your Rookie Year of Teaching: 3 Key Ideas & High Leverage Techniques","short_name":"rookieteaching","order_idx":356,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/67/1ca7631d2f36413226dffd996da015/Teacher-Brain_crop.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/a6/37f1223efbd5f11869ca976ca1acf9/Teacher-Brain_crop.png","cats":[14,26],"unis":[105],"id":622},"623":{"insts":[3360910,611232],"language":"en","name":"First Year Teaching (Elementary Grades) - Success from the Start","short_name":"start1styearteaching","order_idx":357,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/5e/8a981ca051fd07407ffe711e9f2357/success-from-start-3.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/0c/b0f70883762e0204cf4a6e4371906f/success-from-start-3.jpg","cats":[14,26],"unis":[103],"id":623},"624":{"insts":[3219450],"language":"en","name":"Coaching Teachers: Promoting Changes that Stick ","short_name":"coachingteachers","order_idx":358,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/76/97675033e93a4e6aa0110c31c8f1a8/coaching.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/79/40743767350110b045f4ee6aa99dd7/coaching.jpg","cats":[14,26],"unis":[105],"id":624},"631":{"insts":[3366373],"language":"en","name":"Foundations of Teaching for Learning 1: Introduction","short_name":"teach1","order_idx":359,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/38/5045d8c1ee6131ec3b4603cadbf948/CET-Updated-H264-720p1.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/01/082721c2f77eeae2d6909bb1e3e901/CET-Updated-H264-720p1.png","cats":[14,26],"unis":[106],"id":631},"632":{"insts":[3366383],"language":"en","name":"Foundations of Teaching for Learning 2: Being a Teacher","short_name":"teach2","order_idx":360,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/72/7d771c2d8a9af5d500c0081b55c4ab/CET-Updated-H264-720p2.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/6b/1f73fe278d5d4d2f2beeec9eec8614/CET-Updated-H264-720p2.png","cats":[14,26],"unis":[106],"id":632},"633":{"insts":[3366390],"language":"en","name":"Foundations of Teaching for Learning 3: Learners and Learning","short_name":"teach3","order_idx":361,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/e3/9bb0e4cb941dbbf0b5cea4adbccced/CET-Updated-H264-720p3.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e4/cd4ec19c6827bc94cde9a14fa10ff3/CET-Updated-H264-720p3.png","cats":[14,26],"unis":[106],"id":633},"634":{"insts":[3366404],"language":"en","name":"Foundations of Teaching for Learning 4: Curriculum","short_name":"teach4","order_idx":362,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/c9/b2c4c29f93b87a224a194c55a08d35/CET-Updated-H264-720p4.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/0e/7d234155a80e1a5a76a7e7dcf64a2a/CET-Updated-H264-720p4.png","cats":[14,26],"unis":[106],"id":634},"635":{"insts":[3397716],"language":"en","name":"Structure Standing Still: The Statics of Everyday Objects","short_name":"staticsofobjects","order_idx":363,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/0a/71b67d86efdb976c1ede792955a003/Structure-Standing-Still.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ee/204629a81c72d42f8b84a73fd1c226/Structure-Standing-Still.jpg","cats":[15],"unis":[31],"id":635},"636":{"insts":[3219450],"language":"en","name":"On the Hunt for Feedback: Self-Directed Teacher Improvement","short_name":"teacherfeedback","order_idx":364,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/8e/74b450ba3151f79358ff8ad6290d05/feedback_bluered.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/03/891fd8a10083562450d8939eb3afa4/feedback_bluered.png","cats":[14,26],"unis":[105],"id":636},"637":{"insts":[3376806],"language":"en","name":"The Brain-Targeted Teaching\u00ae Model for 21st Century Schools","short_name":"braintargeted","order_idx":365,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/e1/57bbe4cf8922fbb5a256e4eb628de6/BTTmodel.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/21/5568251fb72559764d7f6f806dcac1/BTTmodel.png","cats":[14,26],"unis":[8],"id":637},"639":{"insts":[3360857],"language":"en","name":"Common Core in Action: Literacy Across Content Areas","short_name":"ccss-literacy1","order_idx":366,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/80/42fb869a201f7841c31a0fef9d1288/literacy.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/6e/76a0120e653506dbb90cec15419020/literacy.jpg","cats":[14,26],"unis":[103],"id":639},"640":{"insts":[3360852],"language":"en","name":"Common Core in Action: Math Formative Assessment","short_name":"ccss-math1","order_idx":367,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/9a/4179c4a607601ef9e796db94ad80d6/mathteacher-student-whiteboard.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/bd/5fb8ed244974860205389315c4bbbc/mathteacher-student-whiteboard.jpg","cats":[5,14,26],"unis":[103],"id":640},"641":{"insts":[3227866],"language":"en","name":"Foundations of Teaching for Learning 5: Planning for Teaching and Learning","short_name":"teach5","order_idx":368,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/3a/bbc23f42de9d241e1b14d04f5c4875/CET-Updated-H264-720p5.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/48/d1de57407232e6c7eb8043a4c68d73/CET-Updated-H264-720p5.png","cats":[14,26],"unis":[106],"id":641},"642":{"insts":[3227866],"language":"en","name":"Foundations of Teaching for Learning 6: Introduction to Student Assessment","short_name":"teach6","order_idx":369,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/7a/0a3b56493fd899c98791c6f4ed10ec/CET-Updated-H264-720p6.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/a9/1caa5beef6ed117cc6a338469bc925/CET-Updated-H264-720p6.png","cats":[14,26],"unis":[106],"id":642},"643":{"insts":[3227866],"language":"en","name":"Foundations of Teaching for Learning 7: Being a Professional","short_name":"teach7","order_idx":370,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/aa/dbfc8a76513c16175b233561eca4e8/CET-Updated-H264-720p7.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/f8/197aaefefe50921ee413b2e480517d/CET-Updated-H264-720p7.png","cats":[14,26],"unis":[106],"id":643},"644":{"insts":[3227866],"language":"en","name":"Foundations of Teaching for Learning 8: Developing Relationships","short_name":"teach8","order_idx":371,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/a3/e2e3693c675e3568509c533badb338/CET-Updated-H264-720p8.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/4c/53c10e76b84001ce146287fe61d73d/CET-Updated-H264-720p8.png","cats":[14,26],"unis":[106],"id":644},"655":{"insts":[3395219],"language":"en","name":"Engaging Students through Cooperative Learning","short_name":"cooperativelearning","order_idx":372,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/a6/228fe8e8f4477258e1f38e0be9d603/DSC_6912.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/eb/df0bc9f5c358cb11dbcbbfa3394b12/DSC_6912.jpg","cats":[14,26],"unis":[8],"id":655},"669":{"insts":[3467705,3596990],"language":"en","name":"The Emergence of the Modern Middle East","short_name":"modernmiddleeast","order_idx":373,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/04/db41d119652a4790055fa53303a29c/Courses3.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/13/4cfd5ec3afa81337d12348f2c79c66/Courses3.jpg","cats":[6],"unis":[110],"id":669},"677":{"insts":[423879,599445],"language":"en","name":"Networks Illustrated: Principles without Calculus","short_name":"ni","order_idx":374,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/1d/48a762629d12419a7c75a5272693a5/ni-logo2.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/0b/221f5f08b7e39b1c5d5a2ea65fa239/ni-logo2.png","cats":[2,4,11],"unis":[4],"id":677},"678":{"insts":[3498945],"language":"en","name":"Roman Architecture","short_name":"romanarchitecture","order_idx":375,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/bf/6e901d4a18040693ebec348c841725/deek_courselogo.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/d8/96bb86b6f727c154bb07d83cf2674c/deek_courselogo.jpg","cats":[6,22],"unis":[109],"id":678},"679":{"insts":[3510175,565747,3510185,386687],"language":"en","name":"Inquiry Science Learning: Perspectives and Practices 1 - Science Leadership","short_name":"scileadership","order_idx":376,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/93/c8f57ea67affc265f72baebf4e45b4/courseraLogo1.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/45/ef62b46517da6fa6b8db0adb855655/courseraLogo1.png","cats":[14,26],"unis":[13],"id":679},"684":{"insts":[1513337],"language":"en","name":"Moralities of Everyday Life","short_name":"moralities","order_idx":377,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f5/34d1914360cd2ff2e756b121363854/shutterstock_45601228-sized.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/ee/efa58e71e9cb68079b66b54e08965f/shutterstock_45601228-sized.jpg","cats":[6,20],"unis":[109],"id":684},"685":{"insts":[3543921],"language":"en","name":"Financial Markets","short_name":"financialmarkets","order_idx":378,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/bc/2d7279280551371b4d855593fec29d/ECON252.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/9c/b9aa82b5f1b7c258da20398458d2e7/ECON252.jpg","cats":[2,13],"unis":[109],"id":685},"686":{"insts":[3544181],"language":"en","name":"Constitutional Law","short_name":"conlaw","order_idx":379,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/9f/fd496c103aac54416374f62e901a1b/ConLaw_Coursera_1200x680.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/e0/b203dbc0f0ad61320e026e7f1e73ac/ConLaw_Coursera_1200x680.jpg","cats":[20,21],"unis":[109],"id":686},"688":{"insts":[250165],"language":"en","name":"Analysis of Algorithms","short_name":"aofa","order_idx":380,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/45/e34eeed7950dbc63909ad29a7ffbce/aofa-logo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/dc/595ad15d7c62645b62e5f55852d47b/aofa-logo.png","cats":[1,5],"unis":[4],"id":688},"689":{"insts":[250165],"language":"en","name":"Analytic Combinatorics","short_name":"ac","order_idx":381,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/06/012812ead1a867cb838eef53a6f171/ac-logo.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/56/2605df3beb9ec5e5b2ae1f00e1e55d/ac-logo.png","cats":[1,5],"unis":[4],"id":689},"699":{"insts":[3360910,611232],"language":"en","name":"First Year Teaching (Secondary Grades) - Success from the Start","short_name":"1styearteachingms-hs","order_idx":382,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/33/9f07cb35428f62a048f5390754de9a/success-from-the-start-2.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/85/87ff00ec3eca2faa5ae1cf46d4d5ae/success-from-the-start-2.jpg","cats":[14,26],"unis":[103],"id":699},"703":{"insts":[3510175,565747,3510185,386687],"language":"en","name":"Inquiry Science Learning: Perspectives and Practices 2 - Techniques for Success","short_name":"inquirytechniques","order_idx":383,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/80/124f729735e5a34a7bdb1d78a695a4/courseraLogo2.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/2f/f77f8b19d31daa2dfba4b04e151112/courseraLogo2.png","cats":[14,26],"unis":[13],"id":703},"704":{"insts":[3510175,565747,3510185,386687],"language":"en","name":"Inquiry Science Learning: Perspectives and Practices 3 - Science Content Survey","short_name":"scicontentsurvey","order_idx":384,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/03/ddc7e886bf4b2d024bf42fc4490e79/courseraLogo3.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/72/d36c078edf6a0848369ef5257259af/courseraLogo3.png","cats":[14,26],"unis":[13],"id":704},"705":{"insts":[3510175,565747,3510185,386687],"language":"en","name":"Inquiry Science Learning: Perspectives & Practices 4 - Student-Centered Inquiry","short_name":"scistudentinquiry","order_idx":385,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/f2/30a62f5aa86e46b758cbc806d48ce2/courseraLogo4.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/09/fcc8276511c97249f13b7e5f531127/courseraLogo4.png","cats":[14,26],"unis":[13],"id":705},"706":{"insts":[3675391],"language":"en","name":"Using The Next Generation Science Standards for Students\u2019 Deeper Understanding ","short_name":"sciframework","order_idx":386,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/38/79fcd1e6df7955027deda75b02444a/courseraLogoFramework.png","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/b6/e0111148454133ce2dc2f156998313/courseraLogoFramework.png","cats":[14,26],"unis":[13],"id":706},"729":{"insts":[3491158],"language":"en","name":"Analysis of a Complex Kind","short_name":"complexanalysis","order_idx":387,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/6e/0740b9ba7219f054052d4b129837db/Slide1.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/a2/a156dfe552fa42b9a2732eeea5784d/Slide1.jpg","cats":[5],"unis":[34],"id":729},"755":{"insts":[2444381],"language":"en","name":"NANOTECHNOLOGY AND NANOSENSORS","short_name":"nanosensors","order_idx":388,"self_service_course_id":null,"small_icon_hover":"https://coursera-course-photos.s3.amazonaws.com/be/80424b58b61cb24f531cb256a5a5a3/sensor-1.jpg","has_full_data":false,"large_icon":"https://coursera-course-photos.s3.amazonaws.com/27/97d64d53bdfdad0a6dbbe715f4429f/sensor-1.jpg","cats":[10,15,24],"unis":[129],"id":755}},"cats":[{"id":1,"short_name":"cs-theory","name":"Computer Science: Theory"},{"id":2,"short_name":"economics","name":"Economics & Finance"},{"id":3,"short_name":"medicine","name":"Medicine"},{"id":4,"short_name":"infotech","name":"Information, Tech & Design"},{"id":5,"short_name":"math","name":"Mathematics"},{"id":6,"short_name":"humanities","name":"Humanities "},{"id":8,"short_name":"health","name":"Health & Society"},{"id":9,"short_name":"physical","name":"Physical & Earth Sciences"},{"id":10,"short_name":"biology","name":"Biology & Life Sciences"},{"id":11,"short_name":"cs-systems","name":"Computer Science: Systems & Security"},{"id":12,"short_name":"cs-programming","name":"Computer Science: Software Engineering"},{"id":13,"short_name":"business","name":"Business & Management"},{"id":14,"short_name":"education","name":"Education"},{"id":15,"short_name":"ee","name":"Engineering"},{"id":16,"short_name":"stats","name":"Statistics and Data Analysis"},{"id":17,"short_name":"cs-ai","name":"Computer Science: Artificial Intelligence"},{"id":18,"short_name":"music","name":"Music, Film, and Audio"},{"id":19,"short_name":"food","name":"Food and Nutrition"},{"id":20,"short_name":"socsci","name":"Social Sciences"},{"id":21,"short_name":"law","name":"Law"},{"id":22,"short_name":"arts","name":"Arts"},{"id":23,"short_name":"physics","name":"Physics"},{"id":24,"short_name":"chemistry","name":"Chemistry"},{"id":25,"short_name":"energy","name":"Energy & Earth Sciences"},{"id":26,"short_name":"teacherpd","name":"Teacher Professional Development"}],"insts":[{"first_name":"Daphne","last_name":"Koller","middle_name":"","short_name":null,"instructor_id":1257,"id":223},{"first_name":"Dan","last_name":"Boneh","middle_name":"","short_name":null,"instructor_id":774,"id":85},{"first_name":"Nick","last_name":"Parlante","middle_name":"","short_name":null,"instructor_id":1267,"id":217},{"first_name":"Alex","last_name":"Aiken","middle_name":"","short_name":null,"instructor_id":221514,"id":28},{"first_name":"Gautam","last_name":"Kaul","middle_name":"","short_name":null,"instructor_id":209008,"id":187},{"first_name":"Mohamed","last_name":"Noor","middle_name":"","short_name":null,"instructor_id":884310,"id":241},{"first_name":"Jennifer","last_name":"Campbell","middle_name":"","short_name":null,"instructor_id":681795,"id":61},{"first_name":"Paul","last_name":"Gries","middle_name":"","short_name":null,"instructor_id":682843,"id":260},{"first_name":"Geoffrey","last_name":"Hinton","middle_name":"","short_name":null,"instructor_id":831097,"id":154},{"first_name":"Don","last_name":"Johnson","middle_name":"H.","short_name":null,"instructor_id":557195,"id":102},{"first_name":"Keith","last_name":"Devlin","middle_name":"","short_name":null,"instructor_id":587683,"id":99},{"first_name":"Wen-mei","last_name":"Hwu","middle_name":"W.","short_name":"wen-meihwu","instructor_id":917653,"id":226},{"first_name":"Lawrence","last_name":"Angrave","middle_name":"","short_name":"lawrenceangrave","instructor_id":902954,"id":36},{"first_name":"Jos\u00e9","last_name":"V\u00e1zquez-Cognet","middle_name":"J.","short_name":"josevazquez-cognet","instructor_id":884324,"id":228},{"first_name":"Daniel","last_name":"McFarland","middle_name":"A.","short_name":null,"instructor_id":1139667,"id":14},{"first_name":"Jonathan","last_name":"Garb","middle_name":"","short_name":null,"instructor_id":1292607,"id":283},{"first_name":"Hank","last_name":"Lucas","middle_name":"C.","short_name":null,"instructor_id":1571429,"id":155},{"first_name":"Jim","last_name":"Fowler","middle_name":"","short_name":"jimfowler","instructor_id":1667833,"id":127},{"first_name":"Steve","last_name":"Everett","middle_name":"","short_name":"steveeverett","instructor_id":710240,"id":146},{"first_name":"David","last_name":"Wentzlaff ","middle_name":"","short_name":null,"instructor_id":419989,"id":212},{"first_name":"Mitchell","last_name":"Duneier","middle_name":"","short_name":null,"instructor_id":239857,"id":213},{"first_name":"Mung","last_name":"Chiang","middle_name":"","short_name":null,"instructor_id":423879,"id":69},{"first_name":"Jeff","last_name":"Ullman","middle_name":"","short_name":null,"instructor_id":1271,"id":215},{"first_name":"Dan","last_name":"Jurafsky","middle_name":"","short_name":null,"instructor_id":775,"id":221},{"first_name":"Christopher","last_name":"Manning","middle_name":"","short_name":null,"instructor_id":68850,"id":222},{"first_name":"Jeff","last_name":"Borland","middle_name":"","short_name":null,"instructor_id":1298506,"id":251},{"first_name":"Martin","last_name":"Odersky","middle_name":"","short_name":null,"instructor_id":672627,"id":275},{"first_name":"Charles","last_name":"Cockell","middle_name":"","short_name":null,"instructor_id":796896,"id":60},{"first_name":"Kristina","last_name":"Castel-Roberts","middle_name":"von","short_name":null,"instructor_id":2330496,"id":65},{"first_name":"Eric","last_name":"Zivot","middle_name":"","short_name":null,"instructor_id":1118525,"id":123},{"first_name":"Pedro","last_name":"Domingos","middle_name":"","short_name":null,"instructor_id":996548,"id":330},{"first_name":"John","last_name":"Hogenesch","middle_name":"","short_name":null,"instructor_id":471335,"id":156},{"first_name":"John ","last_name":"Murray","middle_name":"Isaac ","short_name":null,"instructor_id":1320449,"id":174},{"first_name":"Emma","last_name":"Meagher","middle_name":"Anne","short_name":null,"instructor_id":471278,"id":114},{"first_name":"Carol","last_name":"Muller","middle_name":"","short_name":null,"instructor_id":235007,"id":62},{"first_name":"Jonathan","last_name":"Moreno","middle_name":"D.","short_name":null,"instructor_id":435103,"id":350},{"first_name":"Paul","last_name":"Offit","middle_name":"A.","short_name":null,"instructor_id":654632,"id":353},{"first_name":"Elsa","last_name":"Brown","middle_name":"Barkley","short_name":null,"instructor_id":1474140,"id":108},{"first_name":"Catherine","last_name":"Lucey","middle_name":"R.","short_name":null,"instructor_id":883324,"id":66},{"first_name":"Michael","last_name":"Collins","middle_name":"","short_name":null,"instructor_id":1325520,"id":312},{"first_name":"Marilyn","last_name":"Lombardi","middle_name":"M.","short_name":null,"instructor_id":963741,"id":239},{"first_name":"Bob","last_name":"Barnes","middle_name":"","short_name":null,"instructor_id":972090,"id":55},{"first_name":"Vincent","last_name":"Lepetit","middle_name":"","short_name":"vincent","instructor_id":1074054,"id":390},{"first_name":"Jean-C\u00e9dric","last_name":"Chappelier","middle_name":"","short_name":"jcchappelier","instructor_id":1116355,"id":391},{"first_name":"Jamila","last_name":"Sam","middle_name":"","short_name":"jamilasam","instructor_id":1345762,"id":171},{"first_name":"Marco","last_name":"Picasso","middle_name":"","short_name":null,"instructor_id":1757953,"id":276},{"first_name":"Guillermo","last_name":"Sapiro","middle_name":"","short_name":null,"instructor_id":729871,"id":602},{"first_name":"Franklin","last_name":"Allen","middle_name":"","short_name":null,"instructor_id":2594168,"id":382},{"first_name":"George","last_name":"Hochmuth","middle_name":"J.","short_name":"hochmuth","instructor_id":1626852,"id":372},{"first_name":"Barbara","last_name":"Endicott-Popovsky","middle_name":"","short_name":null,"instructor_id":1506477,"id":115},{"first_name":"Roy","last_name":"Hamilton","middle_name":"","short_name":null,"instructor_id":2666366,"id":614},{"first_name":"Nathan","last_name":"Kutz","middle_name":"","short_name":null,"instructor_id":2666846,"id":618},{"first_name":"Antonio","last_name":"Rangel","middle_name":"","short_name":null,"instructor_id":459667,"id":287},{"first_name":"Friedrich","last_name":"Eisenbrand","middle_name":"","short_name":null,"instructor_id":1323227,"id":129},{"first_name":"Mark","last_name":"Hargreaves","middle_name":"","short_name":null,"instructor_id":1300189,"id":257},{"first_name":"Dave","last_name":"Ward","middle_name":"","short_name":null,"instructor_id":1604596,"id":90},{"first_name":"Duncan","last_name":"Pritchard","middle_name":"","short_name":null,"instructor_id":1935119,"id":296},{"first_name":"Michela","last_name":"Massimi","middle_name":"","short_name":null,"instructor_id":1935226,"id":298},{"first_name":"Suilin","last_name":"Lavelle","middle_name":"","short_name":null,"instructor_id":1935218,"id":295},{"first_name":"Matthew","last_name":"Chrisman","middle_name":"","short_name":null,"instructor_id":1935223,"id":297},{"first_name":"Allan","last_name":"Hazlett","middle_name":"","short_name":null,"instructor_id":1935212,"id":299},{"first_name":"Alasdair","last_name":"Richmond","middle_name":"","short_name":null,"instructor_id":1935209,"id":300},{"first_name":"Jennifer","last_name":"Clark","middle_name":"","short_name":"jclark","instructor_id":2102206,"id":320},{"first_name":"Zuzana","last_name":"Bic","middle_name":"","short_name":null,"instructor_id":1334447,"id":265},{"first_name":"Henry","last_name":"Lester","middle_name":"A.","short_name":null,"instructor_id":640696,"id":17},{"first_name":"Michael","last_name":"Kearns","middle_name":"","short_name":null,"instructor_id":555881,"id":349},{"first_name":"Michael","last_name":"Scharf","middle_name":"","short_name":"michaelscharf","instructor_id":2527015,"id":203},{"first_name":"Ira","last_name":"Pohl","middle_name":"","short_name":null,"instructor_id":2320972,"id":339},{"first_name":"Ou Fan Leo","last_name":"Lee","middle_name":"","short_name":"leeoufan","instructor_id":2589075,"id":362},{"first_name":"Wai","last_name":"Tsui","middle_name":"","short_name":"tsuiwai","instructor_id":2589701,"id":365},{"first_name":"Kit Tai","last_name":"Hau","middle_name":"","short_name":"kthau","instructor_id":981331,"id":358},{"first_name":"Hsien-yung Kenneth","last_name":"Pai","middle_name":"","short_name":"paihsienyung","instructor_id":2589497,"id":363},{"first_name":"Wei","last_name":"Hua","middle_name":"","short_name":"huawei","instructor_id":2589622,"id":364},{"first_name":"Ib","last_name":"Bondebjerg","middle_name":"","short_name":null,"instructor_id":2500042,"id":184},{"first_name":"Jens","last_name":"Holst","middle_name":"Juul","short_name":null,"instructor_id":2579174,"id":334},{"first_name":"Signe","last_name":"Torekov","middle_name":"S\u00f8rensen ","short_name":"torekov","instructor_id":2558013,"id":291},{"first_name":"Anders","last_name":"Holm","middle_name":"","short_name":null,"instructor_id":2566619,"id":308},{"first_name":"Arne","last_name":"Astrup","middle_name":"","short_name":null,"instructor_id":2569351,"id":309},{"first_name":"Bernardo","last_name":"Castellano","middle_name":"","short_name":"bcastellano","instructor_id":2690307,"id":684},{"first_name":"Peter","last_name":"Edwards","middle_name":"","short_name":null,"instructor_id":2683051,"id":653},{"first_name":"Robert","last_name":"Erickson","middle_name":"","short_name":"erickson","instructor_id":2659612,"id":628},{"first_name":"Paolo","last_name":"Matthiae","middle_name":"","short_name":"pmatthiae","instructor_id":2633312,"id":538},{"first_name":"Aggelos","last_name":"Katsaggelos","middle_name":"","short_name":null,"instructor_id":2643309,"id":566},{"first_name":"Esther","last_name":"Barron","middle_name":"","short_name":null,"instructor_id":2635797,"id":547},{"first_name":"Steve","last_name":"Reed","middle_name":"","short_name":null,"instructor_id":2642321,"id":565},{"first_name":"\u8449\u4e19\u6210 Ping-Cheng ","last_name":"Yeh (Benson)","middle_name":"","short_name":"benson","instructor_id":2602668,"id":527},{"first_name":"James","last_name":"Martin","middle_name":"","short_name":"jmartin","instructor_id":2695162,"id":696},{"first_name":"Gayle","last_name":"Allard","middle_name":"","short_name":"gayleallard","instructor_id":2595276,"id":383},{"first_name":"Dominic","last_name":"Massaro","middle_name":"William","short_name":null,"instructor_id":625560,"id":337},{"first_name":"Jo-Anne","last_name":"Murray","middle_name":"","short_name":null,"instructor_id":1604583,"id":11},{"first_name":"Margaret","last_name":"Root","middle_name":"V.","short_name":"peggyroot","instructor_id":2606384,"id":523},{"first_name":"Jeanne","last_name":"Liedtka","middle_name":"M.","short_name":"liedtka01","instructor_id":2506410,"id":205},{"first_name":"Scott","last_name":"Higgins","middle_name":"","short_name":null,"instructor_id":1291950,"id":236},{"first_name":"John","last_name":"Covach","middle_name":"","short_name":"johncovach","instructor_id":2599979,"id":506},{"first_name":"Flemming","last_name":"Konradsen","middle_name":"","short_name":null,"instructor_id":2566087,"id":306},{"first_name":"Fran\u00e7ois ","last_name":"Golse","middle_name":"","short_name":"francoisgolse","instructor_id":2580055,"id":335},{"first_name":"Yvan","last_name":"Martel","middle_name":"","short_name":"yvanmartel","instructor_id":2593202,"id":370},{"first_name":"\u5442\u4e16\u6d69 Shih-Hao","last_name":"Lu","middle_name":"","short_name":"lushihhao","instructor_id":2644105,"id":569},{"first_name":"Philip","last_name":"Zelikow","middle_name":"","short_name":null,"instructor_id":2135893,"id":249},{"first_name":"Kimberley","last_name":"Hagen","middle_name":"Sessions","short_name":"kbs.hagen","instructor_id":1319386,"id":210},{"first_name":"Paolo","last_name":"Prandoni","middle_name":"","short_name":null,"instructor_id":676340,"id":181},{"first_name":"Martin","last_name":"Vetterli","middle_name":"","short_name":null,"instructor_id":2141686,"id":182},{"first_name":"Michael","last_name":"Lenox","middle_name":"J.","short_name":null,"instructor_id":1400787,"id":246},{"first_name":"Jeffrey","last_name":"Moore","middle_name":"S. ","short_name":"jeffreymoore","instructor_id":903698,"id":178},{"first_name":"Michael","last_name":"Evans","middle_name":"","short_name":"michaelevans","instructor_id":907436,"id":122},{"first_name":"Jonathan","last_name":"Tomkin","middle_name":"","short_name":"jonathantomkin","instructor_id":901931,"id":227},{"first_name":"Wendell","last_name":"Porter","middle_name":"A.","short_name":"porter","instructor_id":2593281,"id":373},{"first_name":"Jon","last_name":"Barnett","middle_name":"","short_name":null,"instructor_id":2666862,"id":619},{"first_name":"John","last_name":"Freebairn","middle_name":"","short_name":null,"instructor_id":2666864,"id":620},{"first_name":"David","last_name":"Jamieson","middle_name":"","short_name":null,"instructor_id":2666866,"id":621},{"first_name":"Maurizio","last_name":"Toscano","middle_name":"","short_name":null,"instructor_id":1297886,"id":254},{"first_name":"Rachel","last_name":"Webster","middle_name":"","short_name":null,"instructor_id":1295661,"id":255},{"first_name":"Kristin","last_name":"Sainani","middle_name":"","short_name":null,"instructor_id":1367410,"id":225},{"first_name":"Michael","last_name":"Dennin","middle_name":"","short_name":null,"instructor_id":1321950,"id":266},{"first_name":"Nicholas","last_name":"Llewellyn","middle_name":"M.","short_name":"nicholasllewellyn","instructor_id":938149,"id":179},{"first_name":"Vicki","last_name":"Colvin","middle_name":"","short_name":null,"instructor_id":2280464,"id":79},{"first_name":"Daniel","last_name":"Mittleman","middle_name":"","short_name":null,"instructor_id":2666907,"id":625},{"first_name":"Henning","last_name":"Haack","middle_name":"","short_name":null,"instructor_id":2428255,"id":310},{"first_name":"Terry","last_name":"Matilsky","middle_name":"A.","short_name":null,"instructor_id":2650348,"id":586},{"first_name":"Stephen","last_name":"Marshak","middle_name":"","short_name":"stephenmarshak","instructor_id":901980,"id":229},{"first_name":"Michael","last_name":"Dubson","middle_name":"","short_name":"mdubson","instructor_id":2677973,"id":643},{"first_name":"Valerio","last_name":"Scarani","middle_name":"","short_name":"valerioscarani","instructor_id":2683047,"id":654},{"first_name":"Roger","last_name":"Barr","middle_name":"","short_name":null,"instructor_id":932645,"id":238},{"first_name":"Adam","last_name":"Frank","middle_name":"","short_name":"adamfrank","instructor_id":2340295,"id":562},{"first_name":"S.","last_name":"Djorgovski","middle_name":"George","short_name":null,"instructor_id":685941,"id":139},{"first_name":"Ronen","last_name":"Plesser","middle_name":"","short_name":null,"instructor_id":638605,"id":240},{"first_name":"Sian","last_name":"Bayne","middle_name":"","short_name":"sianbayne","instructor_id":950832,"id":200},{"first_name":"Jeremy","last_name":"Knox","middle_name":"","short_name":null,"instructor_id":306499,"id":165},{"first_name":"Hamish","last_name":"Macleod","middle_name":"A.","short_name":null,"instructor_id":1862154,"id":8},{"first_name":"Jen","last_name":"Ross","middle_name":"","short_name":null,"instructor_id":1292208,"id":201},{"first_name":"Christine ","last_name":"Sinclair","middle_name":"","short_name":null,"instructor_id":1301316,"id":73},{"first_name":"Adrienne","last_name":"Williams","middle_name":"","short_name":"awilliams","instructor_id":1324755,"id":25},{"first_name":"Diane","last_name":"O'Dowd","middle_name":"","short_name":null,"instructor_id":2598741,"id":386},{"first_name":"Matthew","last_name":"Jackson","middle_name":"O.","short_name":"jacksonm","instructor_id":1252,"id":166},{"first_name":"Pat","last_name":"Pattison","middle_name":"","short_name":null,"instructor_id":1340080,"id":326},{"first_name":"Dominique","last_name":"Rossin","middle_name":"","short_name":"dominiquerossin","instructor_id":2423001,"id":290},{"first_name":"Benjamin","last_name":"Werner","middle_name":"","short_name":"bwerner","instructor_id":1622801,"id":277},{"first_name":"Rob","last_name":"Rutenbar","middle_name":"A.","short_name":"robrutenbar","instructor_id":887472,"id":230},{"first_name":"Loudon","last_name":"Stearns","middle_name":"","short_name":null,"instructor_id":703888,"id":325},{"first_name":"David ","last_name":"Owens","middle_name":"A.","short_name":null,"instructor_id":1330818,"id":92},{"first_name":"John","last_name":"Hutchinson","middle_name":"Steven","short_name":null,"instructor_id":2666905,"id":624},{"first_name":"Carlo","last_name":"Cosmelli","middle_name":"","short_name":"ccosmelli","instructor_id":2633310,"id":539},{"first_name":"Yannis","last_name":"Tsividis","middle_name":"","short_name":null,"instructor_id":1292489,"id":190},{"first_name":"Dawn","last_name":"Song","middle_name":"","short_name":"dawnsong","instructor_id":95,"id":93},{"first_name":"John","last_name":"Mitchell","middle_name":"C","short_name":"jcmitchell","instructor_id":1039793,"id":719},{"first_name":"Mike","last_name":"Simon","middle_name":"","short_name":"mikesimon","instructor_id":2865239,"id":730},{"first_name":"St\u00e9phane","last_name":"Udry","middle_name":"","short_name":"udrys","instructor_id":2696515,"id":698},{"first_name":"Lisa","last_name":"Dierker","middle_name":"","short_name":null,"instructor_id":1121232,"id":233},{"first_name":"Raoul","last_name":"Mulder","middle_name":"","short_name":null,"instructor_id":979695,"id":252},{"first_name":"Mark","last_name":"Elgar","middle_name":"","short_name":null,"instructor_id":1343266,"id":253},{"first_name":"Gerhard","last_name":"Wickler","middle_name":"","short_name":"gwickler","instructor_id":585759,"id":131},{"first_name":"Austin","last_name":"Tate","middle_name":"","short_name":"austintate","instructor_id":895139,"id":20},{"first_name":"John","last_name":"Hawks","middle_name":"","short_name":"johnhawks","instructor_id":2605756,"id":516},{"first_name":"","last_name":"","middle_name":"","short_name":null,"instructor_id":2225883,"id":490},{"first_name":"Magnus","last_name":"Egerstedt","middle_name":"","short_name":"egerstedt","instructor_id":247285,"id":367},{"first_name":"Marcel","last_name":"Salath\u00e9","middle_name":"","short_name":"msalathe","instructor_id":72633,"id":556},{"first_name":"Ottar","last_name":"Bjornstad","middle_name":"N.","short_name":"objornstad","instructor_id":2687735,"id":666},{"first_name":"Andrew","last_name":"Read","middle_name":"","short_name":"areed","instructor_id":2687745,"id":667},{"first_name":"Rachel","last_name":"Smith","middle_name":"A.","short_name":"rsmith","instructor_id":2687752,"id":669},{"first_name":"Mary","last_name":"Poss","middle_name":"L.","short_name":"mposs","instructor_id":2687763,"id":670},{"first_name":"David","last_name":"Hughes","middle_name":"P.","short_name":"dhughes","instructor_id":2687771,"id":671},{"first_name":"Peter","last_name":"Hudson","middle_name":"","short_name":"phudson","instructor_id":2687778,"id":672},{"first_name":"Matthew","last_name":"Ferrari","middle_name":"","short_name":"mferrari","instructor_id":2687782,"id":673},{"first_name":"Kevin","last_name":"Wayne","middle_name":"","short_name":null,"instructor_id":246867,"id":204},{"first_name":"Robert","last_name":"Sedgewick","middle_name":"","short_name":null,"instructor_id":250165,"id":211},{"first_name":"Charles","last_name":"Clark","middle_name":"W.","short_name":null,"instructor_id":324786,"id":68},{"first_name":"Victor","last_name":"Galitski","middle_name":"","short_name":null,"instructor_id":724736,"id":272},{"first_name":"Mark","last_name":"Braunstein","middle_name":"L.","short_name":"braunstein","instructor_id":2306102,"id":371},{"first_name":"Tom ","last_name":"Morley","middle_name":"","short_name":"morley","instructor_id":2468250,"id":375},{"first_name":"Tucker","last_name":"Balch","middle_name":"","short_name":"balch","instructor_id":861614,"id":286},{"first_name":"Wayne","last_name":"Whiteman","middle_name":"","short_name":"whiteman","instructor_id":1900891,"id":374},{"first_name":"Sarah","last_name":"Eichhorn","middle_name":"","short_name":null,"instructor_id":1350643,"id":262},{"first_name":"Rachel","last_name":"Lehman","middle_name":"Cohen","short_name":null,"instructor_id":1499033,"id":263},{"first_name":"Brian","last_name":"Bushee","middle_name":"J","short_name":null,"instructor_id":1937011,"id":58},{"first_name":"Raymond W.","last_name":"Yeung","middle_name":"","short_name":"raymondyeung","instructor_id":2600275,"id":497},{"first_name":"Alison","last_name":"Gibbs","middle_name":"","short_name":"alisongibbs","instructor_id":1084582,"id":31},{"first_name":"Jeffrey","last_name":"Rosenthal","middle_name":"","short_name":null,"instructor_id":2068199,"id":261},{"first_name":"Raymond","last_name":"Leger","middle_name":"J. St.","short_name":null,"instructor_id":1820338,"id":273},{"first_name":"Tammatha","last_name":"O'Brien","middle_name":"","short_name":null,"instructor_id":1820329,"id":274},{"first_name":"Richard","last_name":"Adelstein","middle_name":"","short_name":null,"instructor_id":1321389,"id":234},{"first_name":"Arturo","last_name":"Molina Guti\u00e9rrez ","middle_name":"","short_name":"arturomolina","instructor_id":2688754,"id":675},{"first_name":"David ","last_name":"Romero D\u00edaz","middle_name":"","short_name":"davidromero","instructor_id":2688759,"id":676},{"first_name":"Pedro","last_name":"Ponce Cruz","middle_name":"","short_name":"pedroponce","instructor_id":2688762,"id":677},{"first_name":"Denise","last_name":"Comer","middle_name":"","short_name":null,"instructor_id":1462466,"id":80},{"first_name":"Constance","last_name":"Steinkuehler","middle_name":"","short_name":"steinkuehler","instructor_id":2605719,"id":512},{"first_name":"Kurt","last_name":"Squire","middle_name":"","short_name":"kurtsquire","instructor_id":2605744,"id":513},{"first_name":"Patricia","last_name":"Salinas Mart\u00ednez","middle_name":"","short_name":"patysalinas","instructor_id":2672777,"id":685},{"first_name":"Richard","last_name":"Alley","middle_name":"B.","short_name":"richard","instructor_id":2645422,"id":587},{"first_name":"Douglas","last_name":"Schmidt","middle_name":"C.","short_name":null,"instructor_id":1337829,"id":84},{"first_name":"Ezekiel","last_name":"Emanuel","middle_name":"J.","short_name":null,"instructor_id":1806984,"id":525},{"first_name":"Gautam","last_name":"Shroff","middle_name":"","short_name":null,"instructor_id":107347,"id":137},{"first_name":"Edward","last_name":"Hess","middle_name":"D.","short_name":null,"instructor_id":988020,"id":10},{"first_name":"Jean-Paul","last_name":"Restoule","middle_name":"","short_name":null,"instructor_id":874189,"id":259},{"first_name":"Anthony","last_name":"Rostain","middle_name":"L.","short_name":null,"instructor_id":2666378,"id":615},{"first_name":"","last_name":"","middle_name":"","short_name":null,"instructor_id":2996815,"id":767},{"first_name":"Nilss","last_name":"Olekalns","middle_name":"","short_name":null,"instructor_id":937126,"id":258},{"first_name":"Avi","last_name":"Ma\u2019ayan","middle_name":"","short_name":"avimaayan","instructor_id":1305172,"id":41},{"first_name":"Eric","last_name":"Sobie","middle_name":"","short_name":null,"instructor_id":1325618,"id":116},{"first_name":"Leonard","last_name":"White","middle_name":"E.","short_name":null,"instructor_id":901314,"id":242},{"first_name":"Sam","last_name":"Shelton","middle_name":"","short_name":"shelton","instructor_id":862822,"id":368},{"first_name":"Michael","last_name":"Genesereth","middle_name":"","short_name":null,"instructor_id":1460,"id":138},{"first_name":"Daniel","last_name":"Ogilvie","middle_name":"M.","short_name":"ogilvie","instructor_id":2645301,"id":573},{"first_name":"Leonard","last_name":"Hamilton","middle_name":"W.","short_name":"soulbeliefs","instructor_id":2645318,"id":574},{"first_name":"Murray","last_name":"Baumgarten","middle_name":"","short_name":null,"instructor_id":2589160,"id":499},{"first_name":"Peter","last_name":"Kenez","middle_name":"","short_name":null,"instructor_id":2588904,"id":498},{"first_name":"Francesco ","last_name":"Fiore","middle_name":"Paolo","short_name":"f.p.fiore","instructor_id":2633305,"id":540},{"first_name":"Fernando ","last_name":"Sandoval Arzaga","middle_name":"","short_name":"fsandoval","instructor_id":2660182,"id":608},{"first_name":"Kiichi","last_name":"Fujiwara","middle_name":"","short_name":"kiichifujiwara","instructor_id":2674007,"id":634},{"first_name":"Kris","last_name":"Olds","middle_name":"","short_name":"krisolds","instructor_id":2605731,"id":517},{"first_name":"Susan","last_name":"Robertson","middle_name":"L.","short_name":"susanrobertson","instructor_id":2687823,"id":668},{"first_name":"Idan","last_name":"Segev","middle_name":"","short_name":null,"instructor_id":1213805,"id":160},{"first_name":"Ajay","last_name":"Kapur","middle_name":"","short_name":"ajaykapur","instructor_id":2660238,"id":609},{"first_name":"Gilbert","last_name":"Probst","middle_name":"","short_name":"probst","instructor_id":2683483,"id":655},{"first_name":"Larry","last_name":"Lagerstrom","middle_name":"Randles","short_name":"larrylagerstrom","instructor_id":2691794,"id":692},{"first_name":"Dan ","last_name":"Grossman","middle_name":"","short_name":null,"instructor_id":873260,"id":104},{"first_name":"Gaetano","last_name":"Borriello","middle_name":"","short_name":null,"instructor_id":2602091,"id":508},{"first_name":"Luis","last_name":"Ceze","middle_name":"","short_name":null,"instructor_id":1562358,"id":387},{"first_name":"Larry","last_name":"Diamond","middle_name":"","short_name":null,"instructor_id":2295274,"id":717},{"first_name":"Karin","last_name":"Yeatts","middle_name":"","short_name":null,"instructor_id":704621,"id":686},{"first_name":"Lorraine","last_name":"Alexander","middle_name":"","short_name":null,"instructor_id":2694658,"id":695},{"first_name":"Eric","last_name":"Masanet","middle_name":"","short_name":"ericmasanet","instructor_id":2644404,"id":570},{"first_name":"Andrew","last_name":"Szegedy-Maszak","middle_name":"","short_name":null,"instructor_id":802670,"id":40},{"first_name":"Walter","last_name":" Sinnott-Armstrong","middle_name":"","short_name":null,"instructor_id":932346,"id":244},{"first_name":"Ram ","last_name":"Neta","middle_name":"","short_name":null,"instructor_id":935146,"id":107},{"first_name":"Robert ","last_name":"Clark","middle_name":"","short_name":"robclark","instructor_id":2359335,"id":379},{"first_name":"Mark ","last_name":"Bocko","middle_name":"","short_name":"markbocko","instructor_id":2204104,"id":380},{"first_name":"Randall","last_name":"Wright","middle_name":"","short_name":"randallwright","instructor_id":2605772,"id":515},{"first_name":"Guadalupe","last_name":"Vadillo","middle_name":"","short_name":"guadalupe","instructor_id":323100,"id":207},{"first_name":"Irfan","last_name":"Essa","middle_name":"","short_name":"irfanessa","instructor_id":868530,"id":500},{"first_name":"Anderson ","last_name":"Smith","middle_name":"D.","short_name":"smith","instructor_id":2606554,"id":522},{"first_name":"Fatimah","last_name":"Wirth","middle_name":"","short_name":"wirth","instructor_id":861494,"id":124},{"first_name":"Williams","last_name":"Ettouati","middle_name":"S.","short_name":"ettouati","instructor_id":289468,"id":173},{"first_name":"Joseph","last_name":"Ma","middle_name":"D.","short_name":null,"instructor_id":2480111,"id":177},{"first_name":"Kevin","last_name":"Korsyn","middle_name":"","short_name":"kevinkorsyn","instructor_id":640270,"id":270},{"first_name":"Michael ","last_name":"Oakes","middle_name":"","short_name":"michaeloakes","instructor_id":2605293,"id":514},{"first_name":"Gregor","last_name":"Kiczales","middle_name":"","short_name":null,"instructor_id":359948,"id":143},{"first_name":"Jeffrey","last_name":"Kahn","middle_name":"","short_name":null,"instructor_id":2075104,"id":185},{"first_name":"Alan","last_name":"Regenberg","middle_name":"C","short_name":"regenberg","instructor_id":1164831,"id":30},{"first_name":"Debra","last_name":"Mathews","middle_name":"JH","short_name":"debramathews","instructor_id":2083331,"id":106},{"first_name":"Joseph","last_name":"Ali","middle_name":"","short_name":"josephali","instructor_id":2083347,"id":167},{"first_name":"Rajesh","last_name":"Rao","middle_name":"P. N.","short_name":null,"instructor_id":1522272,"id":388},{"first_name":"Adrienne","last_name":"Fairhall","middle_name":"","short_name":null,"instructor_id":1282559,"id":389},{"first_name":"Orin","last_name":"Starn","middle_name":"","short_name":null,"instructor_id":1159084,"id":519},{"first_name":"William","last_name":"Kuskin","middle_name":"","short_name":"kuskin","instructor_id":2679701,"id":648},{"first_name":"Yaakov","last_name":"Nahmias","middle_name":"","short_name":"ynahmias","instructor_id":1297453,"id":282},{"first_name":"Jennifer","last_name":"Evans-Cowley","middle_name":"","short_name":"evanscowley","instructor_id":1843870,"id":81},{"first_name":"Thomas ","last_name":"Sanchez","middle_name":"W.","short_name":null,"instructor_id":1847439,"id":319},{"first_name":"Jennifer","last_name":"Widom","middle_name":"","short_name":null,"instructor_id":1196954,"id":220},{"first_name":"James","last_name":"Lee","middle_name":"Z.","short_name":null,"instructor_id":1465513,"id":280},{"first_name":"Byung-Ho ","last_name":"Lee","middle_name":"","short_name":null,"instructor_id":1311294,"id":902},{"first_name":"Carlos","last_name":"Gershenson","middle_name":"","short_name":"carlos","instructor_id":2533383,"id":208},{"first_name":"Maya","last_name":"Adam","middle_name":"","short_name":"madam","instructor_id":2395490,"id":188},{"first_name":"Scott ","last_name":"Klemmer","middle_name":"","short_name":null,"instructor_id":1250,"id":175},{"first_name":"Jon","last_name":"Stewart","middle_name":"","short_name":null,"instructor_id":2619522,"id":541},{"first_name":"Naubahar","last_name":"Sharif","middle_name":"","short_name":null,"instructor_id":1466681,"id":281},{"first_name":"Andrew","last_name":"Conway","middle_name":"","short_name":"andrewconway","instructor_id":419984,"id":5},{"first_name":"Karl ","last_name":"Ulrich","middle_name":"T.","short_name":"ulrich","instructor_id":341966,"id":346},{"first_name":"Christian","last_name":"Terwiesch","middle_name":"","short_name":null,"instructor_id":1349478,"id":345},{"first_name":"Bill","last_name":"Howe","middle_name":"","short_name":null,"instructor_id":999946,"id":51},{"first_name":"Randall","last_name":"LeVeque ","middle_name":"J.","short_name":"leveque","instructor_id":1320364,"id":729},{"first_name":"Mariale ","last_name":"Hardiman","middle_name":"","short_name":"mmhardiman","instructor_id":3376806,"id":920},{"first_name":"Barbara","last_name":"Stengel","middle_name":"S.","short_name":"barbs","instructor_id":3289416,"id":863},{"first_name":"Marcy","last_name":"Singer-Gabella","middle_name":"","short_name":"marcysg","instructor_id":3289263,"id":862},{"first_name":"Dave","last_name":"Levin","middle_name":"","short_name":"davelevin","instructor_id":3332104,"id":885},{"first_name":"Orin ","last_name":"Gutlerner","middle_name":"","short_name":"oringut","instructor_id":3219450,"id":906},{"first_name":"John","last_name":"MacBeath","middle_name":"","short_name":"johnmacbeath","instructor_id":3366373,"id":912},{"first_name":"Dennis","last_name":"Francis","middle_name":"","short_name":"dennisfrancis","instructor_id":3366383,"id":913},{"first_name":"George","last_name":"Oduro","middle_name":"","short_name":"georgeoduro","instructor_id":3366390,"id":914},{"first_name":"Suseela","last_name":"Malakolunthu","middle_name":"","short_name":"suseelamalakolunthu","instructor_id":3366404,"id":915},{"first_name":"Kevin","last_name":"Drinkard","middle_name":"","short_name":"kevindrinkard","instructor_id":3360852,"id":909},{"first_name":"Lisa","last_name":"Mount","middle_name":"","short_name":"lisamount","instructor_id":3360857,"id":908},{"first_name":"Linda","last_name":"Shore","middle_name":" ","short_name":"lindashore","instructor_id":3332466,"id":897},{"first_name":"Eric","last_name":"Muller","middle_name":"","short_name":"ericmuller","instructor_id":3164319,"id":898},{"first_name":"Julie","last_name":"Yu","middle_name":"","short_name":"julieyu","instructor_id":3343186,"id":899},{"first_name":"Paul","last_name":"Doherty","middle_name":"","short_name":"pauldoherty","instructor_id":3343192,"id":900},{"first_name":"Peter","last_name":"Struck","middle_name":"","short_name":null,"instructor_id":422471,"id":348},{"first_name":"Jennifer ","last_name":"Sherer","middle_name":"Zoltners","short_name":null,"instructor_id":1280592,"id":232},{"first_name":"Lauren","last_name":"Resnick","middle_name":"","short_name":null,"instructor_id":2606081,"id":528},{"first_name":"Juan","last_name":"Donaire","middle_name":"Jes\u00fas","short_name":"jjdonaire","instructor_id":2690311,"id":683},{"first_name":"Jaume","last_name":"Pujol","middle_name":"","short_name":"jpujol","instructor_id":118364,"id":826},{"first_name":"Merc\u00e8","last_name":"Villanueva","middle_name":"","short_name":"mvillanueva","instructor_id":3189498,"id":830},{"first_name":"Josep","last_name":"Cervell\u00f3","middle_name":"","short_name":"jcervello","instructor_id":2690314,"id":682},{"first_name":"Jose","last_name":"Lull","middle_name":"","short_name":"jlull","instructor_id":2690319,"id":681},{"first_name":"Commonwealth Education Trust instructor","last_name":"","middle_name":"","short_name":"cet1886","instructor_id":3227866,"id":930},{"first_name":"Steve","last_name":"Joordens","middle_name":"","short_name":null,"instructor_id":1915980,"id":477},{"first_name":"Kevin","last_name":"Leyton-Brown","middle_name":"","short_name":null,"instructor_id":174814,"id":219},{"first_name":"Yoav","last_name":"Shoham","middle_name":"","short_name":null,"instructor_id":1251,"id":218},{"first_name":"Fei-Fei","last_name":"Li","middle_name":"","short_name":null,"instructor_id":2666324,"id":611},{"first_name":"Silvio","last_name":"Savarese","middle_name":"","short_name":null,"instructor_id":2666329,"id":612},{"first_name":"Jamie ","last_name":"Pope","middle_name":"","short_name":null,"instructor_id":1331704,"id":168},{"first_name":"Mike","last_name":"Petrich","middle_name":"","short_name":"mikep","instructor_id":3260920,"id":894},{"first_name":"Karen","last_name":"Wilkinson","middle_name":"","short_name":"karenw","instructor_id":3260925,"id":893},{"first_name":"Luigi","last_name":"Anzivino","middle_name":"","short_name":"luigia","instructor_id":3260930,"id":895},{"first_name":"Bronwyn","last_name":"Bevan","middle_name":"","short_name":"bronwynb","instructor_id":3228961,"id":896},{"first_name":"Simon ","last_name":"Green","middle_name":"","short_name":null,"instructor_id":2603322,"id":503},{"first_name":"Bridget","last_name":"Hamre","middle_name":"K.","short_name":null,"instructor_id":2327335,"id":919},{"first_name":"Grace","last_name":"Funk","middle_name":"W.","short_name":null,"instructor_id":3361949,"id":918},{"first_name":"Allison","last_name":"Leach","middle_name":"P.","short_name":null,"instructor_id":3365638,"id":917},{"first_name":"Kathy","last_name":"Neesen","middle_name":"","short_name":null,"instructor_id":3368459,"id":916},{"first_name":"Paul","last_name":"Miller","middle_name":"D.","short_name":"pmiller","instructor_id":3395219,"id":923},{"first_name":"Rosemary","last_name":"Redfield","middle_name":"","short_name":null,"instructor_id":543459,"id":323},{"first_name":"Andrew","last_name":"Ng","middle_name":"","short_name":null,"instructor_id":1244,"id":35},{"first_name":"Donald","last_name":"Dingwell","middle_name":"Bruce","short_name":null,"instructor_id":2602095,"id":501},{"first_name":"Thaddeus","last_name":"Hogarth","middle_name":"","short_name":null,"instructor_id":1338222,"id":324},{"first_name":"Ravi","last_name":"Iyengar","middle_name":"","short_name":"raviiyengar","instructor_id":1325616,"id":250},{"first_name":"Anna","last_name":"Divinsky","middle_name":"","short_name":"adivinsky","instructor_id":2650854,"id":588},{"first_name":"Susan","last_name":"Delagrange","middle_name":"","short_name":"susandelagrange","instructor_id":1505164,"id":98},{"first_name":"Scott ","last_name":"DeWitt","middle_name":"Lloyd ","short_name":"scottdewitt","instructor_id":2041603,"id":100},{"first_name":"Kay","last_name":"Halasek","middle_name":"","short_name":"kayhalasek","instructor_id":1957524,"id":148},{"first_name":"Ben","last_name":"McCorkle","middle_name":"","short_name":"benmccorkle","instructor_id":2029839,"id":482},{"first_name":"Cynthia","last_name":"Selfe","middle_name":"","short_name":"cynthiaselfe","instructor_id":1893981,"id":476},{"first_name":"R.","last_name":"Freeman","middle_name":"Edward","short_name":"edfreeman","instructor_id":2700511,"id":701},{"first_name":"Michael","last_name":"Schatz","middle_name":"F.","short_name":"schatz","instructor_id":2982963,"id":760},{"first_name":"Sriram","last_name":"Sankaranarayanan","middle_name":"","short_name":"sriram","instructor_id":2673267,"id":629},{"first_name":"Shalom","last_name":"Ruben","middle_name":"D.","short_name":"shalom","instructor_id":3543489,"id":970},{"first_name":"Bob","last_name":"Shiller","middle_name":"","short_name":"bobshiller","instructor_id":3543921,"id":966},{"first_name":"Diana","last_name":"Kleiner","middle_name":"E.E.","short_name":"dianaeekleiner","instructor_id":3498945,"id":950},{"first_name":"Dan","last_name":"Ariely","middle_name":"","short_name":"danariely","instructor_id":680709,"id":88},{"first_name":"Martin","last_name":"Haugh","middle_name":"","short_name":null,"instructor_id":1325435,"id":354},{"first_name":"Garud","last_name":"Iyengar","middle_name":"","short_name":null,"instructor_id":1325459,"id":133},{"first_name":"Karen ","last_name":"Monsen","middle_name":"","short_name":"karenmonsen","instructor_id":2608269,"id":524},{"first_name":"Gary","last_name":"Burton","middle_name":"","short_name":null,"instructor_id":1338423,"id":134},{"first_name":"Jeremy","last_name":"Adelman","middle_name":"","short_name":null,"instructor_id":419843,"id":23},{"first_name":"Sarah","last_name":"Burch","middle_name":"","short_name":null,"instructor_id":1342536,"id":321},{"first_name":"Sara","last_name":"Harris","middle_name":"","short_name":null,"instructor_id":1989083,"id":322},{"first_name":"Christopher","last_name":"Cramer","middle_name":"J. ","short_name":"chriscramer","instructor_id":2601001,"id":510},{"first_name":"Jay","last_name":"Clayton","middle_name":"","short_name":null,"instructor_id":272543,"id":172},{"first_name":"Kevin","last_name":"Werbach","middle_name":"","short_name":null,"instructor_id":226710,"id":347},{"first_name":"Lawrence (Larry)","last_name":"Barkley","middle_name":"","short_name":"larrybarkley","instructor_id":2653254,"id":592},{"first_name":"Ted","last_name":"Blake","middle_name":"","short_name":"tedblake","instructor_id":2653304,"id":593},{"first_name":"Lorrie","last_name":"Ross","middle_name":"","short_name":"lorrieross","instructor_id":2191978,"id":945},{"first_name":"Robert","last_name":"Ghrist","middle_name":"","short_name":null,"instructor_id":227062,"id":140},{"first_name":"Rebecca","last_name":"Stein","middle_name":"","short_name":null,"instructor_id":248242,"id":351},{"first_name":"Joel","last_name":"Cracraft","middle_name":"","short_name":"cracraft","instructor_id":3300435,"id":874},{"first_name":"Rob","last_name":"DeSalle","middle_name":"","short_name":"desalle","instructor_id":3297297,"id":868},{"first_name":"Emmett","last_name":"Sullivan","middle_name":"","short_name":null,"instructor_id":2625760,"id":530},{"first_name":"Edmond","last_name":"Mathez","middle_name":"","short_name":"mathez","instructor_id":3297304,"id":867},{"first_name":"Ro","last_name":"Kinzler","middle_name":"","short_name":"kinzler","instructor_id":3298066,"id":871},{"first_name":"Benjamin","last_name":"Abella","middle_name":"","short_name":null,"instructor_id":2666347,"id":613},{"first_name":"","last_name":"","middle_name":"","short_name":null,"instructor_id":237513,"id":983},{"first_name":"Polly","last_name":"Price","middle_name":"J.","short_name":"pollyprice","instructor_id":1324701,"id":209},{"first_name":"Joseph","last_name":"Yam","middle_name":"","short_name":"josephyam","instructor_id":2600270,"id":496},{"first_name":"Terence Tai-Leung","last_name":"Chong","middle_name":"","short_name":"terencechong","instructor_id":2600267,"id":495},{"first_name":"Nick","last_name":"Feamster","middle_name":"","short_name":"feamster","instructor_id":1743955,"id":376},{"first_name":"Keeve","last_name":"Nachman","middle_name":"","short_name":null,"instructor_id":687518,"id":313},{"first_name":"Robert","last_name":"Lawrence","middle_name":"S.","short_name":null,"instructor_id":2286634,"id":509},{"first_name":"Scott","last_name":"Zeger","middle_name":"L.","short_name":"scottzeger","instructor_id":2276941,"id":518},{"first_name":"William","last_name":"Brieger","middle_name":"","short_name":null,"instructor_id":660062,"id":46},{"first_name":"Roger","last_name":"Peng","middle_name":"","short_name":null,"instructor_id":685384,"id":314},{"first_name":"Jeff","last_name":"Leek","middle_name":"","short_name":null,"instructor_id":694443,"id":315},{"first_name":"Henry","last_name":"Perry","middle_name":"","short_name":null,"instructor_id":693038,"id":152},{"first_name":"Brian","last_name":"Caffo","middle_name":"","short_name":null,"instructor_id":688901,"id":47},{"first_name":"Kevin","last_name":"Frick","middle_name":"","short_name":null,"instructor_id":681157,"id":316},{"first_name":"Marco","last_name":"Gillies","middle_name":"","short_name":"marcogillies","instructor_id":1620951,"id":195},{"first_name":"Matthew","last_name":"Yee-King","middle_name":"","short_name":null,"instructor_id":1960981,"id":196},{"first_name":"Mick","last_name":"Grierson","middle_name":"","short_name":null,"instructor_id":1961937,"id":197},{"first_name":"Akhil","last_name":"Amar","middle_name":"Reed","short_name":"akhilamar","instructor_id":3544181,"id":967},{"first_name":"Arnold","last_name":"Weinstein","middle_name":"","short_name":null,"instructor_id":1314970,"id":6},{"first_name":"Bobby","last_name":"Calder","middle_name":"","short_name":"bobbycalder","instructor_id":2685273,"id":658},{"first_name":"Candy","last_name":"Lee","middle_name":"","short_name":"candylee","instructor_id":2685251,"id":656},{"first_name":"Randy","last_name":"Hlavac","middle_name":"","short_name":"hlavac","instructor_id":2685315,"id":659},{"first_name":"Andrew","last_name":"Gruen","middle_name":"","short_name":"andrewgruen","instructor_id":2685318,"id":660},{"first_name":"John","last_name":"Lavine","middle_name":"","short_name":"johnlavine","instructor_id":1841753,"id":532},{"first_name":"Rachel","last_name":"Mersey","middle_name":"Davis","short_name":"racheldavismersey","instructor_id":2685264,"id":661},{"first_name":"Jeremy","last_name":"Gilbert","middle_name":"","short_name":"gilbert","instructor_id":3307276,"id":879},{"first_name":"Edward","last_name":"Malthouse","middle_name":"","short_name":"malthouse","instructor_id":2685240,"id":657},{"first_name":"Emily","last_name":"Withrow","middle_name":"","short_name":"emilywithrow","instructor_id":2685294,"id":663},{"first_name":"Janice","last_name":"Castro","middle_name":"","short_name":"janicecastro","instructor_id":2685310,"id":664},{"first_name":"Steven","last_name":"Duke","middle_name":"","short_name":"stevenduke","instructor_id":2685284,"id":662},{"first_name":"Sue","last_name":"Alcock","middle_name":"","short_name":null,"instructor_id":1224295,"id":245},{"first_name":"Eric","last_name":"Rabkin","middle_name":"","short_name":null,"instructor_id":806928,"id":120},{"first_name":"David","last_name":"Wetherall","middle_name":"","short_name":null,"instructor_id":517478,"id":105},{"first_name":"Arvind","last_name":"Krishnamurthy","middle_name":"","short_name":"arvind","instructor_id":525208,"id":38},{"first_name":"John","last_name":"Zahorjan","middle_name":"","short_name":null,"instructor_id":1020740,"id":329},{"first_name":"Matthew","last_name":"Sparke","middle_name":"","short_name":"msparke","instructor_id":3471976,"id":938},{"first_name":"Ellen","last_name":"Moir","middle_name":"","short_name":"ellenmoir","instructor_id":3360910,"id":910},{"first_name":"Lynn","last_name":"Kepp","middle_name":"","short_name":"lynnkepp","instructor_id":611232,"id":907},{"first_name":"Hazel","last_name":"Genn","middle_name":"","short_name":null,"instructor_id":2603342,"id":504},{"first_name":"Adam","last_name":"Gearey","middle_name":"","short_name":"adamgearey","instructor_id":3680947,"id":1011},{"first_name":"Enrique","last_name":"Tam\u00e9s","middle_name":"","short_name":"enriquetames","instructor_id":2645293,"id":603},{"first_name":"Stan","last_name":"Deresinski","middle_name":"","short_name":"standeresinski","instructor_id":1166989,"id":558},{"first_name":"Yuval","last_name":"Harari","middle_name":"Noah","short_name":null,"instructor_id":1804614,"id":284},{"first_name":"Mayank","last_name":"Dutia","middle_name":"","short_name":null,"instructor_id":920057,"id":193},{"first_name":"Celine","last_name":"Caquineau","middle_name":"","short_name":null,"instructor_id":1016886,"id":59},{"first_name":"Don","last_name":"Hornstein","middle_name":"","short_name":null,"instructor_id":2688952,"id":674},{"first_name":"Cheryl","last_name":"Dennison Himmelfarb","middle_name":"","short_name":"cheryldennison","instructor_id":2722532,"id":716},{"first_name":"Peter","last_name":"Pronovost","middle_name":"J. ","short_name":"peterpronovost","instructor_id":3145522,"id":821},{"first_name":"Martin","last_name":"Kleinsteuber","middle_name":"","short_name":null,"instructor_id":2693792,"id":693},{"first_name":"Paul","last_name":"Bloom","middle_name":"","short_name":"paulbloom","instructor_id":1513337,"id":965},{"first_name":"Joe","last_name":"Warren","middle_name":"","short_name":null,"instructor_id":527518,"id":327},{"first_name":"Scott","last_name":"Rixner","middle_name":"","short_name":null,"instructor_id":726142,"id":328},{"first_name":"John","last_name":"Greiner","middle_name":"","short_name":null,"instructor_id":530929,"id":144},{"first_name":"Stephen","last_name":"Wong","middle_name":"","short_name":null,"instructor_id":695900,"id":754},{"first_name":"Hannes","last_name":"Leitgeb","middle_name":"","short_name":"hannesleitgeb","instructor_id":2512709,"id":340},{"first_name":"Stephan","last_name":"Hartmann","middle_name":"","short_name":null,"instructor_id":2582502,"id":342},{"first_name":"Sarah","last_name":"Kagan","middle_name":"","short_name":"sarahkagan","instructor_id":2789426,"id":726},{"first_name":"Anne","last_name":"Shoemaker","middle_name":"","short_name":"anneshoe","instructor_id":2947873,"id":756},{"first_name":"Pavel ","last_name":"Pevzner","middle_name":"","short_name":"pavelpevzner","instructor_id":1540981,"id":526},{"first_name":"Phillip","last_name":"Compeau","middle_name":"E. C.","short_name":"phillipcompeau","instructor_id":2658887,"id":610},{"first_name":"Nikolay","last_name":"Vyahhi","middle_name":"","short_name":"vyahhi","instructor_id":3542322,"id":975},{"first_name":"Jerusalem","last_name":"Makonnen","middle_name":"","short_name":null,"instructor_id":868795,"id":278},{"first_name":"Scott","last_name":"Page","middle_name":"E.","short_name":null,"instructor_id":785,"id":268},{"first_name":"Jack","last_name":"Matson","middle_name":"V.","short_name":"jmatson","instructor_id":1924714,"id":552},{"first_name":"Darrell","last_name":"Velegol","middle_name":"","short_name":"dvelegol","instructor_id":2644910,"id":572},{"first_name":"Kathryn","last_name":"Jablokow","middle_name":"W.","short_name":"kjablokow","instructor_id":2631338,"id":546},{"first_name":"Valerie","last_name":"Swigart","middle_name":"","short_name":"valerie","instructor_id":2258110,"id":844},{"first_name":"Michael","last_name":"Gold","middle_name":"","short_name":"mgold","instructor_id":1600503,"id":377},{"first_name":"Sergio","last_name":" Ortiz Vald\u00e9s","middle_name":"","short_name":"sergio","instructor_id":2645282,"id":589},{"first_name":"Dante B.","last_name":"Castro Solano","middle_name":"","short_name":"dbcastro","instructor_id":3231512,"id":1026},{"first_name":"Rafaela","last_name":"Bueckmann Diegoli","middle_name":"","short_name":"rdiegoli","instructor_id":2747070,"id":1025},{"first_name":"Charles","last_name":"Severance","middle_name":"","short_name":null,"instructor_id":122340,"id":82},{"first_name":"Caren","last_name":"Stalburg","middle_name":"","short_name":"carenstalburg","instructor_id":2705795,"id":727},{"first_name":"Michael","last_name":"Beach","middle_name":"","short_name":null,"instructor_id":1722827,"id":378},{"first_name":"Lisa","last_name":"Mazzola","middle_name":"","short_name":"lisamazzola","instructor_id":3219339,"id":892},{"first_name":"Michael","last_name":"Roth","middle_name":"S.","short_name":null,"instructor_id":804990,"id":237},{"first_name":"Owen","last_name":"Youngman","middle_name":"R.","short_name":"youngowen","instructor_id":2657356,"id":596},{"first_name":"Christopher","last_name":"Brinton","middle_name":"","short_name":"cbrinton","instructor_id":599445,"id":982},{"first_name":"Kenneth ","last_name":"Shropshire","middle_name":"L. ","short_name":null,"instructor_id":1894245,"id":352},{"first_name":"Lada","last_name":"Adamic","middle_name":"","short_name":null,"instructor_id":123682,"id":267},{"first_name":"Margaret","last_name":"Wooldridge","middle_name":"","short_name":"margaretwooldridge","instructor_id":2042576,"id":15},{"first_name":"Marnie","last_name":"Blewitt","middle_name":"","short_name":null,"instructor_id":1288295,"id":54},{"first_name":"Kim","last_name":"Rhoads","middle_name":"F.","short_name":"kimrhoads","instructor_id":3229025,"id":840},{"first_name":"Tim","last_name":"Roughgarden","middle_name":"","short_name":null,"instructor_id":768,"id":214},{"first_name":"Ryan","last_name":"Baker","middle_name":"S.J.d.","short_name":"ryanbaker","instructor_id":2093911,"id":484},{"first_name":"Matt","last_name":"McGarrity","middle_name":"","short_name":"mcgarrity","instructor_id":2255684,"id":782},{"first_name":"John","last_name":"Featherstone","middle_name":"","short_name":"johnfeatherstone","instructor_id":3237389,"id":849},{"first_name":"Hitoshi","last_name":"Murayama","middle_name":"","short_name":"murayama","instructor_id":2673437,"id":631},{"first_name":"Larry","last_name":"Foulke","middle_name":"","short_name":null,"instructor_id":1564078,"id":231},{"first_name":"Stephan","last_name":"Koplowitz","middle_name":"","short_name":null,"instructor_id":2531752,"id":303},{"first_name":"Jeannene","last_name":"Przyblyski","middle_name":"","short_name":"jeanneneprzy","instructor_id":2089332,"id":302},{"first_name":"Stefaan","last_name":"Van den Bogaert","middle_name":"","short_name":"stefaanvandenbogaert","instructor_id":1819928,"id":590},{"first_name":"Edwin","last_name":"Bakker","middle_name":"","short_name":"edwinbakker","instructor_id":2641217,"id":564},{"first_name":"Jennifer","last_name":"Carbrey","middle_name":"","short_name":null,"instructor_id":868977,"id":12},{"first_name":"Emma","last_name":"Jakoi","middle_name":"","short_name":null,"instructor_id":920567,"id":13},{"first_name":"Karen","last_name":"Head","middle_name":"","short_name":"khead","instructor_id":3011727,"id":768},{"first_name":"Lam Lung","last_name":"Yeung","middle_name":"","short_name":null,"instructor_id":1343630,"id":76},{"first_name":"King","last_name":"Chow","middle_name":"L.","short_name":null,"instructor_id":1358517,"id":56},{"first_name":"Pascal","last_name":"Van Hentenryck","middle_name":"","short_name":null,"instructor_id":1289035,"id":256},{"first_name":"Amy","last_name":"Rickman","middle_name":"D.","short_name":"arickman","instructor_id":2595360,"id":384},{"first_name":"John","last_name":"Jakicic","middle_name":"M.","short_name":null,"instructor_id":2595632,"id":385},{"first_name":"Tobias","last_name":"Kretschmer","middle_name":"","short_name":"tobiaskretschmer","instructor_id":2573718,"id":336},{"first_name":"Karen","last_name":"Charron","middle_name":"R.","short_name":null,"instructor_id":598777,"id":317},{"first_name":"Amber","last_name":"Cox","middle_name":"Bickford","short_name":null,"instructor_id":603309,"id":22},{"first_name":"Philip","last_name":"Klein","middle_name":"","short_name":null,"instructor_id":1234717,"id":243},{"first_name":"Sylvie","last_name":"M\u00e9l\u00e9ard","middle_name":"","short_name":"sylviemeleard","instructor_id":1914201,"id":714},{"first_name":"Jean-Ren\u00e9","last_name":"Chazottes","middle_name":"","short_name":"jrchazottes","instructor_id":2593255,"id":369},{"first_name":" Rolf ","last_name":"Strom-Olsen ","middle_name":"","short_name":"rolfstromolsen","instructor_id":2656811,"id":595},{"first_name":"Jason","last_name":"Freeman","middle_name":"A.","short_name":"freeman","instructor_id":1077292,"id":529},{"first_name":"Jason","last_name":"Hill","middle_name":"","short_name":"jasonhill","instructor_id":2570343,"id":521},{"first_name":"Lara","last_name":"Arch","middle_name":"","short_name":"laraarch","instructor_id":3510175,"id":951},{"first_name":"Chris","last_name":"Thompson","middle_name":"\"C. J.\"","short_name":"cjthompson","instructor_id":565747,"id":952},{"first_name":"Lisa","last_name":"Webber","middle_name":"","short_name":"lwebber","instructor_id":3510185,"id":953},{"first_name":"Jarrett","last_name":"Whitaker","middle_name":"Reid","short_name":"reidwhitaker","instructor_id":386687,"id":954},{"first_name":"Jeffrey","last_name":"Pomerantz","middle_name":"","short_name":null,"instructor_id":2690251,"id":688},{"first_name":"Evan","last_name":"Feldman","middle_name":"","short_name":null,"instructor_id":2694569,"id":694},{"first_name":"Lorenzo","last_name":"Cavallaro","middle_name":"","short_name":null,"instructor_id":1347691,"id":3},{"first_name":"Asher","last_name":" Susser","middle_name":"","short_name":"ashersusser","instructor_id":3467705,"id":937},{"first_name":"Duygu","last_name":"Atlas","middle_name":"","short_name":"duyguatlas","instructor_id":3596990,"id":977},{"first_name":"Daniel","last_name":"Chamovitz","middle_name":"","short_name":"chamovitz","instructor_id":3287177,"id":861},{"first_name":"Aviva ","last_name":"Katz","middle_name":"","short_name":"akatz","instructor_id":3708694,"id":1018},{"first_name":"Oded","last_name":" Lipschits","middle_name":"","short_name":"lipschits","instructor_id":3287070,"id":860},{"first_name":"Ido","last_name":"Koch","middle_name":"","short_name":"idokoch","instructor_id":3204080,"id":858},{"first_name":"Scott","last_name":"Plous","middle_name":"","short_name":"scottplous","instructor_id":1127341,"id":235},{"first_name":"Hossam","last_name":"Haick","middle_name":"","short_name":"hossamhaick","instructor_id":2444381,"id":1081},{"first_name":"Terry","last_name":"Talley","middle_name":"K.","short_name":"drterrytalley","instructor_id":3675391,"id":1002},{"first_name":"Larisa","last_name":"Enr\u00edquez","middle_name":"","short_name":"larisaev","instructor_id":1177458,"id":338},{"first_name":"Balaji","last_name":"Srinivasan","middle_name":"S.","short_name":"balajis","instructor_id":1845856,"id":45},{"first_name":"Vijay","last_name":"Pande","middle_name":"S.","short_name":"vijaypande","instructor_id":1853352,"id":224},{"first_name":"Barbara","last_name":"Conradt","middle_name":"","short_name":null,"instructor_id":2582522,"id":341},{"first_name":"J.","last_name":"Halderman","middle_name":"Alex","short_name":null,"instructor_id":715252,"id":269},{"first_name":"Ebrahim","last_name":"Afsah","middle_name":"","short_name":"afsah","instructor_id":2566181,"id":307},{"first_name":"Stephany","last_name":"Duda","middle_name":"","short_name":null,"instructor_id":240569,"id":289},{"first_name":"Paul","last_name":"Harris","middle_name":"","short_name":null,"instructor_id":1347429,"id":288},{"first_name":"Firas ","last_name":"Wehbe","middle_name":"","short_name":null,"instructor_id":1653154,"id":125},{"first_name":"Vincent","last_name":"Racaniello","middle_name":"","short_name":null,"instructor_id":2096804,"id":355},{"first_name":"Joseph","last_name":"Guglielmo","middle_name":"","short_name":null,"instructor_id":3408612,"id":929},{"first_name":"Lisa","last_name":"Kroon","middle_name":"A.","short_name":null,"instructor_id":3693651,"id":1032},{"first_name":"Todd","last_name":"Murphey","middle_name":"D.","short_name":"murphey","instructor_id":2658770,"id":599},{"first_name":"Petra","last_name":"Bonfert-Taylor","middle_name":"","short_name":"pbonfert","instructor_id":3491158,"id":1027},{"first_name":"Anders","last_name":"Pedersen","middle_name":"Gorm","short_name":"anders","instructor_id":2526797,"id":202},{"first_name":"Jonathan","last_name":"Biss","middle_name":"","short_name":"jonathanbiss","instructor_id":2675440,"id":636},{"first_name":"Dan","last_name":"Dickrell","middle_name":"","short_name":"dandickrell","instructor_id":3397716,"id":927},{"first_name":"Mar\u00eda Soledad","last_name":"Ram\u00edrez Montoya","middle_name":"","short_name":"solramirez","instructor_id":2645257,"id":575},{"first_name":"Jos\u00e9 Vladimir ","last_name":"Burgos Aguilar","middle_name":"","short_name":"vburgos","instructor_id":2645262,"id":576},{"first_name":"Anthony","last_name":"Robinson","middle_name":"C.","short_name":"arobinson","instructor_id":2560495,"id":531},{"first_name":"Melissa","last_name":"Loble","middle_name":"Joell","short_name":"mloble","instructor_id":1676603,"id":468},{"first_name":"","last_name":"","middle_name":"","short_name":null,"instructor_id":3401945,"id":925},{"first_name":"Cindy ","last_name":"Carbajal","middle_name":"","short_name":"cindyc","instructor_id":2333330,"id":707},{"first_name":"Antoine","last_name":"Geissbuhler","middle_name":"","short_name":"geissbuhler","instructor_id":2511245,"id":191},{"first_name":"Louis","last_name":"Loutan","middle_name":"","short_name":"loutan","instructor_id":2894378,"id":737},{"first_name":"Samantha","last_name":"Battams","middle_name":"","short_name":"battams","instructor_id":3096301,"id":805},{"first_name":"Didier","last_name":"Wernli","middle_name":"","short_name":"wernli","instructor_id":2581715,"id":797},{"first_name":"Slim","last_name":"Slama","middle_name":"","short_name":"slama","instructor_id":2590328,"id":799},{"first_name":"Rafael","last_name":"Ruiz De Castaneda","middle_name":"","short_name":"ruizdecastaneda","instructor_id":2918070,"id":798},{"first_name":"Christophe","last_name":"Chalamet","middle_name":"","short_name":"chalamet","instructor_id":2408877,"id":74},{"first_name":"Fran\u00e7ois","last_name":"Dermange","middle_name":"","short_name":"dermange","instructor_id":2604148,"id":507},{"first_name":"Michel","last_name":"Grandjean","middle_name":"","short_name":"grandjean","instructor_id":2513105,"id":505},{"first_name":"Sarah","last_name":"Nicolet","middle_name":"","short_name":"nicolet","instructor_id":2590461,"id":536},{"first_name":"Richard","last_name":"Boyatzis","middle_name":"","short_name":"richardboyatzis","instructor_id":2075897,"id":199},{"first_name":"Jonathan ","last_name":"Coopersmith","middle_name":"","short_name":"jonathancoopersmith","instructor_id":2675437,"id":635},{"first_name":"David","last_name":"Ludwig","middle_name":"","short_name":"davidludwig","instructor_id":2654261,"id":665},{"first_name":"Al","last_name":"Filreis","middle_name":"","short_name":null,"instructor_id":224886,"id":26},{"first_name":"James","last_name":"Green","middle_name":"V.","short_name":"jvgreen","instructor_id":1312728,"id":271},{"first_name":"Charmaine","last_name":"Williams","middle_name":"","short_name":null,"instructor_id":882099,"id":7},{"first_name":"Kenneth ","last_name":"Hale","middle_name":"M. ","short_name":"kenhale","instructor_id":1293473,"id":149},{"first_name":"Nicole","last_name":"Kwiek","middle_name":"Cartwright","short_name":"nicolekwiek","instructor_id":1293448,"id":318},{"first_name":"Katie","last_name":"Ferraro","middle_name":"","short_name":null,"instructor_id":994329,"id":279}],"courses":[{"start_month":4,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":23,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":2,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":16},{"start_month":5,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":28,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":6,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":18},{"start_month":3,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":12,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":7,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":20},{"start_month":3,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":19,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":3,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":22},{"start_month":3,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":12,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":9,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":24},{"start_month":3,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":12,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":8,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":26},{"start_month":2,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":11,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":30},{"start_month":null,"status":1,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":12,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":32},{"start_month":3,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":19,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":20,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":46},{"start_month":4,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":23,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":13,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":52},{"start_month":4,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":23,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":14,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":54},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":19,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":60},{"start_month":4,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":23,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":15,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":66},{"start_month":4,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":23,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":16,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":76},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":10,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":22,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":80},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":3,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":82},{"start_month":6,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":11,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":8,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":84},{"start_month":1,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":20,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":86},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":7,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":88},{"start_month":6,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":11,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":9,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":90},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":3,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":11,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":94},{"start_month":6,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":11,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":23,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":96},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":17,"duration_string":"14 weeks","signature_track_registration_open":false,"topic_id":45,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":98},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":30,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":24,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":100},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":3,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":25,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":102},{"start_month":8,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":12,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":26,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":104},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":38,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":108},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":3,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":39,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":110},{"start_month":7,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":23,"duration_string":"13 weeks","signature_track_registration_open":false,"topic_id":40,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":112},{"start_month":7,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":23,"duration_string":"14 weeks","signature_track_registration_open":false,"topic_id":41,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":114},{"start_month":7,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":23,"duration_string":"13 weeks","signature_track_registration_open":false,"topic_id":42,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":116},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":43,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":118},{"start_month":7,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":23,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":28,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":120},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":29,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":122},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":"2013-01-07","start_day":7,"duration_string":"13 weeks","signature_track_registration_open":false,"topic_id":30,"signature_track_close_time":"2013-02-27","eligible_for_signature_track":true,"id":124},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":10,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":31,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":126},{"start_month":8,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":27,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":32,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":128},{"start_month":6,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":25,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":33,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":130},{"start_month":6,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":25,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":34,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":132},{"start_month":6,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":25,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":35,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":134},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":20,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":36,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":136},{"start_month":10,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":15,"duration_string":"14 weeks","signature_track_registration_open":false,"topic_id":44,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":138},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"4 - 5 weeks","signature_track_registration_open":false,"topic_id":37,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":140},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":17,"duration_string":"14 weeks","signature_track_registration_open":false,"topic_id":48,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":148},{"start_month":10,"status":1,"start_year":2012,"signature_track_open_time":null,"start_day":1,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":16,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":150},{"start_month":8,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":20,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":2,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":152},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":13,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":154},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":14,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":156},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":15,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":158},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":6,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":164},{"start_month":8,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":27,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":9,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":170},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":8,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":172},{"start_month":9,"status":1,"start_year":2012,"signature_track_open_time":null,"start_day":17,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":124,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":176},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":50,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":178},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-15","start_day":20,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":51,"signature_track_close_time":"2013-06-10","eligible_for_signature_track":true,"id":180},{"start_month":10,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":15,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":88,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":204},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":53,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":216},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":"2013-04-12","start_day":15,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":54,"signature_track_close_time":"2013-05-01","eligible_for_signature_track":true,"id":218},{"start_month":2,"status":0,"start_year":2013,"signature_track_open_time":"2013-02-25","start_day":25,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":55,"signature_track_close_time":"2013-03-25","eligible_for_signature_track":true,"id":220},{"start_month":10,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":10,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":56,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":222},{"start_month":11,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":27,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":57,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":224},{"start_month":11,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":26,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":58,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":226},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":"2013-04-03","start_day":8,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":59,"signature_track_close_time":"2013-04-30","eligible_for_signature_track":true,"id":228},{"start_month":2,"status":0,"start_year":2013,"signature_track_open_time":"2013-02-11","start_day":11,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":65,"signature_track_close_time":"2013-02-26","eligible_for_signature_track":true,"id":230},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":"2013-01-28","start_day":28,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":67,"signature_track_close_time":"2013-02-11","eligible_for_signature_track":true,"id":232},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":69,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":234},{"start_month":10,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":22,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":62,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":238},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":23,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":72,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":246},{"start_month":10,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":29,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":78,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":250},{"start_month":9,"status":1,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":60,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":252},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":66,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":254},{"start_month":10,"status":1,"start_year":2012,"signature_track_open_time":null,"start_day":1,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":77,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":256},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":80,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":258},{"start_month":2,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":70,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":260},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":85,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":262},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":84,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":266},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":12,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":91,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":270},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"10 weeks ","signature_track_registration_open":false,"topic_id":92,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":276},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":93,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":278},{"start_month":2,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":18,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":121,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":280},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":94,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":284},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":114,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":290},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":22,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":61,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":294},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":"2013-01-21","start_day":21,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":90,"signature_track_close_time":"2013-02-22","eligible_for_signature_track":true,"id":296},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":63,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":300},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":68,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":302},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":23,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":71,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":304},{"start_month":10,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":22,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":74,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":306},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":18,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":116,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":308},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":98,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":310},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":110,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":312},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":115,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":314},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":89,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":316},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":119,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":318},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":15,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":122,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":322},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":95,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":324},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":26,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":103,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":326},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":96,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":328},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":19,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":97,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":330},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":100,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":336},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":102,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":340},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":14,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":105,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":344},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":106,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":346},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":14,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":117,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":352},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":81,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":356},{"start_month":1,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":82,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":358},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":123,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":360},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":87,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":362},{"start_month":10,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":22,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":86,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":364},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":108,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":366},{"start_month":10,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":22,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":126,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":368},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":125,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":370},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":23,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":372},{"start_month":12,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":3,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":128,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":374},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":15,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":127,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":376},{"start_month":null,"status":1,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":16,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":378},{"start_month":null,"status":1,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":13,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":380},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":130,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":382},{"start_month":11,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":28,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":129,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":384},{"start_month":1,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":14,"duration_string":"15 weeks","signature_track_registration_open":false,"topic_id":132,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":386},{"start_month":8,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":27,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":136,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":394},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":137,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":396},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":"2013-01-28","start_day":28,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":138,"signature_track_close_time":"2013-02-19","eligible_for_signature_track":true,"id":398},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":131,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":402},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":135,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":408},{"start_month":12,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":1,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":83,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":410},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":139,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":412},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":140,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":414},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":141,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":416},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":143,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":418},{"start_month":2,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":17,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":144,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":422},{"start_month":8,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":27,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":145,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":432},{"start_month":9,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":4,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":148,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":452},{"start_month":9,"status":1,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":147,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":454},{"start_month":1,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":14,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":153,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":462},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":29,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":154,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":468},{"start_month":9,"status":1,"start_year":2012,"signature_track_open_time":null,"start_day":24,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":157,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":472},{"start_month":1,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":160,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970193},{"start_month":2,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":167,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970195},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":168,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970196},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":170,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970197},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":"2013-02-28","start_day":1,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":42,"signature_track_close_time":"2013-03-22","eligible_for_signature_track":true,"id":970198},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":171,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970199},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":24,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":176,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970200},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":33,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970201},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":9,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":189,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970202},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":34,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970205},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":35,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970206},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":28,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970208},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":9,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":192,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970212},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":21,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":205,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970215},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":"2013-01-28","start_day":28,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":208,"signature_track_close_time":"2013-02-25","eligible_for_signature_track":true,"id":970216},{"start_month":2,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":202,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970218},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":26,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":211,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970220},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":179,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970221},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":178,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970222},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":181,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970223},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":"2013-04-24","start_day":29,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":201,"signature_track_close_time":"2013-05-14","eligible_for_signature_track":true,"id":970224},{"start_month":2,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":203,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970225},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":"2013-03-17","start_day":18,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":193,"signature_track_close_time":"2013-04-08","eligible_for_signature_track":true,"id":970226},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":18,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":221,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970227},{"start_month":2,"status":1,"start_year":2013,"signature_track_open_time":"2013-02-04","start_day":4,"duration_string":"14 weeks","signature_track_registration_open":false,"topic_id":177,"signature_track_close_time":"2013-02-27","eligible_for_signature_track":true,"id":970228},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":"2013-03-25","start_day":25,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":188,"signature_track_close_time":"2013-04-09","eligible_for_signature_track":true,"id":970229},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":182,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970230},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":190,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970234},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":22,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":186,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970235},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":29,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":185,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970236},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":12,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":184,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970237},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":173,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970238},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":18,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":174,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970239},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":19,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":172,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970240},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":31,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":175,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970241},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":200,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970242},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":"2013-01-28","start_day":28,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":210,"signature_track_close_time":"2013-02-25","eligible_for_signature_track":true,"id":970243},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":29,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":219,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970244},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":29,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":218,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970245},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":9,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":161,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970246},{"start_month":11,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":164,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970247},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":26,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":165,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970248},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":10,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":163,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970249},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":15,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":162,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970250},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-06-08","start_day":10,"duration_string":"6 weeks","signature_track_registration_open":true,"topic_id":228,"signature_track_close_time":"2013-06-25","eligible_for_signature_track":true,"id":970251},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-15","start_day":20,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":226,"signature_track_close_time":"2013-06-11","eligible_for_signature_track":true,"id":970253},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-07","start_day":1,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":206,"signature_track_close_time":"2013-05-22","eligible_for_signature_track":true,"id":970254},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-06-13","start_day":17,"duration_string":"6 weeks","signature_track_registration_open":true,"topic_id":232,"signature_track_close_time":"2013-07-02","eligible_for_signature_track":true,"id":970255},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-15","start_day":3,"duration_string":"8 weeks","signature_track_registration_open":true,"topic_id":233,"signature_track_close_time":"2013-06-25","eligible_for_signature_track":true,"id":970256},{"start_month":2,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":18,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":223,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970258},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":207,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970259},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":198,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970260},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":204,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970261},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":220,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970262},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":222,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970263},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":"2013-04-29","start_day":30,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":215,"signature_track_close_time":"2013-05-21","eligible_for_signature_track":true,"id":970264},{"start_month":null,"status":1,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":243,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970265},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-06-21","start_day":24,"duration_string":"6 weeks","signature_track_registration_open":true,"topic_id":245,"signature_track_close_time":"2013-07-09","eligible_for_signature_track":true,"id":970266},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-06-21","start_day":24,"duration_string":"6 weeks","signature_track_registration_open":true,"topic_id":244,"signature_track_close_time":"2013-07-09","eligible_for_signature_track":true,"id":970267},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":234,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970268},{"start_month":5,"status":0,"start_year":2013,"signature_track_open_time":"2013-05-07","start_day":6,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":235,"signature_track_close_time":"2013-05-21","eligible_for_signature_track":true,"id":970269},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":196,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970270},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":242,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970271},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":5,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":229,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970272},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":"2013-03-31","start_day":31,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":197,"signature_track_close_time":"2013-04-23","eligible_for_signature_track":true,"id":970273},{"start_month":2,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":24,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":224,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970274},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":9,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":246,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970275},{"start_month":2,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":24,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":225,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970276},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"3 weeks","signature_track_registration_open":false,"topic_id":214,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970277},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":22,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":217,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970278},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":10,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":216,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970279},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":22,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":236,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970281},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":"2013-03-21","start_day":18,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":247,"signature_track_close_time":"2013-04-08","eligible_for_signature_track":true,"id":970282},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":"2013-03-23","start_day":24,"duration_string":"15 weeks","signature_track_registration_open":false,"topic_id":237,"signature_track_close_time":"2013-04-16","eligible_for_signature_track":true,"id":970284},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":239,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970285},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":240,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970286},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":22,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":41,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970287},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"15 weeks","signature_track_registration_open":false,"topic_id":40,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970288},{"start_month":11,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":5,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":9,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970294},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":14,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":9,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970296},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":11,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":260,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970300},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":254,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970301},{"start_month":2,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":26,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970302},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-29","start_day":3,"duration_string":"15 weeks","signature_track_registration_open":true,"topic_id":40,"signature_track_close_time":"2013-06-25","eligible_for_signature_track":true,"id":970308},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":22,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":2,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970311},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":268,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970312},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":"2013-04-01","start_day":1,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":32,"signature_track_close_time":"2013-04-17","eligible_for_signature_track":true,"id":970314},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":24,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":145,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970315},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":219,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970319},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":229,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970329},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":24,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":80,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970330},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":12,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":278,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970336},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":"2013-04-07","start_day":8,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":277,"signature_track_close_time":"2013-04-30","eligible_for_signature_track":true,"id":970344},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":"2013-01-04","start_day":4,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":56,"signature_track_close_time":"2013-02-08","eligible_for_signature_track":true,"id":970351},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":285,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970352},{"start_month":2,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":288,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970353},{"start_month":2,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":18,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":290,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970354},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":10,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":289,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970358},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":"2013-06-18","start_day":7,"duration_string":"20 weeks","signature_track_registration_open":true,"topic_id":292,"signature_track_close_time":"2013-07-16","eligible_for_signature_track":true,"id":970359},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"15 weeks","signature_track_registration_open":false,"topic_id":282,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970360},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":11,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":136,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970361},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":2,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":293,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970362},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":"2013-04-19","start_day":22,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":295,"signature_track_close_time":"2013-05-07","eligible_for_signature_track":true,"id":970365},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":30,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":297,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970370},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":17,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":300,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970374},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":22,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970375},{"start_month":5,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":304,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970380},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":15,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970382},{"start_month":12,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":17,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":148,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970383},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":102,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970386},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":103,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970387},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":20,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":307,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970388},{"start_month":2,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"19 weeks","signature_track_registration_open":false,"topic_id":48,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970389},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":"2013-04-14","start_day":15,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":88,"signature_track_close_time":"2013-05-07","eligible_for_signature_track":true,"id":970391},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":8,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":3,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970393},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":26,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":311,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970399},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":26,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970400},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":17,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":312,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970401},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":17,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":313,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970402},{"start_month":2,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":17,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":314,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970403},{"start_month":1,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":2,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":63,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970404},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":16,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":68,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970405},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":121,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970410},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":18,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":315,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970415},{"start_month":2,"status":1,"start_year":2013,"signature_track_open_time":"2013-02-04","start_day":4,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":53,"signature_track_close_time":"2013-02-25","eligible_for_signature_track":true,"id":970426},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":"2013-03-24","start_day":25,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":322,"signature_track_close_time":"2013-04-16","eligible_for_signature_track":true,"id":970428},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":6,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":328,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970429},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":329,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970433},{"start_month":2,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":333,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970437},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":5,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":337,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970445},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":31,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":6,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970447},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":22,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":74,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970448},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":20,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970449},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":"2013-03-17","start_day":18,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":327,"signature_track_close_time":"2013-04-09","eligible_for_signature_track":true,"id":970454},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":60,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970455},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":116,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970457},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":24,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":78,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970459},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":62,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970460},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":334,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970465},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":"2013-03-08","start_day":4,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":38,"signature_track_close_time":"2013-03-25","eligible_for_signature_track":true,"id":970466},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":"2013-03-01","start_day":4,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":11,"signature_track_close_time":"2013-03-25","eligible_for_signature_track":true,"id":970475},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":27,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970478},{"start_month":2,"status":0,"start_year":2013,"signature_track_open_time":"2013-02-21","start_day":23,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":86,"signature_track_close_time":"2013-03-18","eligible_for_signature_track":true,"id":970485},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"0 weeks","signature_track_registration_open":false,"topic_id":44,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970486},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":"2013-04-24","start_day":29,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":125,"signature_track_close_time":"2013-05-21","eligible_for_signature_track":true,"id":970487},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":"2013-04-15","start_day":29,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":126,"signature_track_close_time":"2013-05-21","eligible_for_signature_track":true,"id":970488},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":"2013-04-15","start_day":22,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":29,"signature_track_close_time":"2013-05-14","eligible_for_signature_track":true,"id":970489},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":31,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970490},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":9,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":356,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970496},{"start_month":3,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":124,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970506},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":22,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":347,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970508},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":200,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970509},{"start_month":2,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":11,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":16,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970514},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"13 weeks","signature_track_registration_open":false,"topic_id":368,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970515},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":5,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":354,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970516},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":10,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":371,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970518},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":376,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970523},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":"2013-04-18","start_day":19,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":378,"signature_track_close_time":"2013-05-10","eligible_for_signature_track":true,"id":970525},{"start_month":6,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":384,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970528},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-29","start_day":3,"duration_string":"11 weeks","signature_track_registration_open":true,"topic_id":41,"signature_track_close_time":"2013-06-25","eligible_for_signature_track":true,"id":970529},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":385,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970530},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":24,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":367,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970534},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":11,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":148,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970535},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":11,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":95,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970536},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":102,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970537},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":96,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970538},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":96,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970539},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":11,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":103,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970540},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":89,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970549},{"start_month":5,"status":0,"start_year":2013,"signature_track_open_time":"2013-05-03","start_day":3,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":393,"signature_track_close_time":"2013-05-17","eligible_for_signature_track":true,"id":970556},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":98,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970558},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":369,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970560},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":405,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970561},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"15 weeks","signature_track_registration_open":false,"topic_id":407,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970563},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":30,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":415,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970567},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":22,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":25,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970574},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":430,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970576},{"start_month":11,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":436,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970577},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":445,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970580},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":417,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970582},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":17,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":418,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970583},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":6,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":413,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970584},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":419,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970585},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":15,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":420,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970586},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":21,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":425,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970588},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":23,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":24,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970589},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":15,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":433,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970590},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":21,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":404,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970591},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":2,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":386,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970592},{"start_month":5,"status":0,"start_year":2013,"signature_track_open_time":"2013-05-17","start_day":20,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":381,"signature_track_close_time":"2013-06-11","eligible_for_signature_track":true,"id":970593},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":459,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970594},{"start_month":2,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":3,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":400,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970595},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":399,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970596},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-17","start_day":20,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":382,"signature_track_close_time":"2013-06-11","eligible_for_signature_track":true,"id":970598},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-28","start_day":31,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":380,"signature_track_close_time":"2013-06-20","eligible_for_signature_track":true,"id":970599},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":402,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970600},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":403,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970601},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":5,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":391,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970602},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":432,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970603},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":16,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":421,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970604},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":30,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":428,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970605},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":20,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":408,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970607},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":401,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970612},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":22,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":465,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970613},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":460,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970614},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-30","start_day":3,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":431,"signature_track_close_time":"2013-06-18","eligible_for_signature_track":true,"id":970615},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":426,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970616},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":21,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":427,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970617},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":14,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":383,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970621},{"start_month":11,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":472,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970622},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":13,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":435,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970623},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":442,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970628},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":8,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":440,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970629},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":434,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970630},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":451,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970633},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":455,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970634},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":471,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970636},{"start_month":11,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":462,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970637},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":441,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970641},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":446,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970642},{"start_month":12,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":2,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":438,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970644},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":21,"duration_string":"","signature_track_registration_open":false,"topic_id":447,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970645},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":467,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970646},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":450,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970647},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":461,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970648},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":484,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970650},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":448,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970651},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":30,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":398,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970652},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":477,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970653},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":2,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":128,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970655},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":488,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970656},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-01","start_day":1,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":463,"signature_track_close_time":"2013-05-15","eligible_for_signature_track":true,"id":970658},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":409,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970660},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":489,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970661},{"start_month":2,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":457,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970662},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":5,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":464,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970663},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":475,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970664},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":2,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":458,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970666},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":10,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":480,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970667},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":487,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970669},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-29","start_day":3,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":476,"signature_track_close_time":"2013-06-18","eligible_for_signature_track":true,"id":970671},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-11","start_day":13,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":478,"signature_track_close_time":"2013-05-28","eligible_for_signature_track":true,"id":970672},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-01","start_day":1,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":466,"signature_track_close_time":"2013-05-22","eligible_for_signature_track":true,"id":970677},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":29,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":71,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970679},{"start_month":12,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":2,"duration_string":"13 weeks","signature_track_registration_open":false,"topic_id":456,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970680},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":492,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970682},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":485,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970685},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-09","start_day":6,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":498,"signature_track_close_time":"2013-05-21","eligible_for_signature_track":true,"id":970687},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":499,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970688},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":500,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970690},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":501,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970692},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":29,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":422,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970696},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":410,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970697},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":12,"duration_string":"14 weeks","signature_track_registration_open":false,"topic_id":503,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970698},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":14,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":504,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970699},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":23,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":505,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970700},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":506,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970701},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":443,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970702},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":494,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970703},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":493,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970704},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":15,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":482,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970705},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":483,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970706},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":508,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970707},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":13,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":94,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970708},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":114,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970709},{"start_month":11,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":115,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970710},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":497,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970711},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":495,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970712},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":30,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":486,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970713},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":496,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970715},{"start_month":12,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":509,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970716},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":110,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970719},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":108,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970720},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":474,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970721},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":8,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":453,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970724},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":30,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":439,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970725},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":439,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970726},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":24,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":512,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970727},{"start_month":4,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":394,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970736},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":53,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970737},{"start_month":4,"status":0,"start_year":2013,"signature_track_open_time":"2013-04-03","start_day":8,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":138,"signature_track_close_time":"2013-04-30","eligible_for_signature_track":true,"id":970742},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":9,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970748},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":129,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970755},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":367,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970758},{"start_month":3,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":11,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":136,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970759},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":72,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970761},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":22,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":429,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970762},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":25,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":524,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970764},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":13,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":469,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970775},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-29","start_day":1,"duration_string":"11 weeks","signature_track_registration_open":true,"topic_id":42,"signature_track_close_time":"2013-06-25","eligible_for_signature_track":true,"id":970777},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-29","start_day":3,"duration_string":"10 weeks","signature_track_registration_open":true,"topic_id":11,"signature_track_close_time":"2013-06-25","eligible_for_signature_track":true,"id":970778},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":38,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970779},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":136,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970780},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":"2013-04-17","start_day":20,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":168,"signature_track_close_time":"2013-06-04","eligible_for_signature_track":true,"id":970786},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":6,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":411,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970788},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":243,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970792},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":179,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970824},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":39,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970825},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":20,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":135,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970826},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":8,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970827},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":526,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970828},{"start_month":4,"status":0,"start_year":2012,"signature_track_open_time":null,"start_day":1,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":81,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970829},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-07","start_day":24,"duration_string":"6 weeks","signature_track_registration_open":true,"topic_id":67,"signature_track_close_time":"2013-07-08","eligible_for_signature_track":true,"id":970830},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":91,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970833},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":347,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970840},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":27,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":537,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970845},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-08","start_day":26,"duration_string":"6 weeks","signature_track_registration_open":true,"topic_id":357,"signature_track_close_time":"2013-09-09","eligible_for_signature_track":true,"id":970846},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":527,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970848},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":3,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":56,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970850},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":24,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":105,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970859},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":117,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970860},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":5,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":582,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970861},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":16,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":203,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970864},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":449,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970868},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":449,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970869},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":449,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970870},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":449,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970871},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":584,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970874},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"3 weeks","signature_track_registration_open":false,"topic_id":598,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970878},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"3 weeks","signature_track_registration_open":false,"topic_id":599,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970879},{"start_month":5,"status":1,"start_year":2013,"signature_track_open_time":"2013-05-09","start_day":24,"duration_string":"13 weeks","signature_track_registration_open":false,"topic_id":30,"signature_track_close_time":"2013-06-13","eligible_for_signature_track":true,"id":970882},{"start_month":9,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":17,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":147,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970888},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":26,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":58,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970892},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"3 weeks","signature_track_registration_open":false,"topic_id":614,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970899},{"start_month":11,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"3 weeks","signature_track_registration_open":false,"topic_id":616,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970901},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":620,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970904},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":29,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":607,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970905},{"start_month":11,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":11,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":621,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970906},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":9,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":594,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970907},{"start_month":11,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":595,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970908},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":596,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970909},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":6,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":623,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970910},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":5,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":631,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970911},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":613,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970912},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":631,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970913},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":632,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970914},{"start_month":2,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":632,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970915},{"start_month":11,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":633,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970916},{"start_month":4,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":633,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970917},{"start_month":2,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":634,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970918},{"start_month":6,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":634,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970919},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":622,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970921},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":639,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970923},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":21,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":640,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970924},{"start_month":4,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":641,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970925},{"start_month":8,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":641,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970926},{"start_month":6,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":642,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970927},{"start_month":10,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":642,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970928},{"start_month":9,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":643,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970929},{"start_month":11,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":644,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970930},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":624,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970931},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":636,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970932},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":27,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":600,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970933},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":15,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":635,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970934},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":655,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970936},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":637,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970937},{"start_month":3,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":10,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":234,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970938},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":63,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970940},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":"2013-06-21","start_day":1,"duration_string":"6 weeks","signature_track_registration_open":true,"topic_id":591,"signature_track_close_time":"2013-10-15","eligible_for_signature_track":true,"id":970947},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":"2013-06-21","start_day":1,"duration_string":"8 weeks","signature_track_registration_open":true,"topic_id":592,"signature_track_close_time":"2013-10-15","eligible_for_signature_track":true,"id":970948},{"start_month":2,"status":1,"start_year":2015,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":643,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970951},{"start_month":4,"status":1,"start_year":2015,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":644,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970952},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":15,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":45,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970953},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":91,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970957},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":1,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":677,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970961},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"15 weeks","signature_track_registration_open":false,"topic_id":678,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970962},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":684,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970968},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":686,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970970},{"start_month":2,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":685,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970971},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":433,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970972},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":228,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970973},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":688,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970974},{"start_month":11,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":689,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970975},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":148,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970978},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":3,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":102,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970979},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":103,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970980},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":95,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970981},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":620,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970985},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":9,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":679,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":970990},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"","signature_track_registration_open":false,"topic_id":679,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":970991},{"start_month":9,"status":0,"start_year":2013,"signature_track_open_time":null,"start_day":2,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":124,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971004},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":6,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":699,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971007},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":41,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971012},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"15 weeks","signature_track_registration_open":false,"topic_id":40,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971013},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":42,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971014},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":11,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971015},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":38,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971016},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":566,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971021},{"start_month":6,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":17,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":9,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971022},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":2,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":254,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971029},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":29,"duration_string":"14 weeks","signature_track_registration_open":false,"topic_id":177,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971037},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"13 weeks","signature_track_registration_open":false,"topic_id":30,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":971039},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":7,"duration_string":"9 weeks","signature_track_registration_open":false,"topic_id":88,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971041},{"start_month":8,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":5,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":55,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971043},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":"2013-06-21","start_day":19,"duration_string":"6 weeks","signature_track_registration_open":true,"topic_id":222,"signature_track_close_time":"2013-08-02","eligible_for_signature_track":true,"id":971044},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":19,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":220,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971045},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":69,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971049},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":21,"duration_string":"6 weeks","signature_track_registration_open":false,"topic_id":729,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971056},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":2,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":193,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971057},{"start_month":11,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":4,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":703,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971063},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":27,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":704,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971064},{"start_month":4,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":7,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":705,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971065},{"start_month":5,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":12,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":706,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971066},{"start_month":1,"status":0,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"5 weeks","signature_track_registration_open":false,"topic_id":190,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971069},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":100,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":971078},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":57,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971082},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":126,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":971091},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":247,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971094},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":300,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":971096},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":499,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971098},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":492,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971099},{"start_month":1,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":755,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971100},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"10 weeks","signature_track_registration_open":false,"topic_id":755,"signature_track_close_time":null,"eligible_for_signature_track":null,"id":971101},{"start_month":10,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":28,"duration_string":"8 weeks","signature_track_registration_open":false,"topic_id":463,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971106},{"start_month":7,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":null,"duration_string":"7 weeks","signature_track_registration_open":false,"topic_id":68,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971111},{"start_month":3,"status":1,"start_year":2014,"signature_track_open_time":null,"start_day":17,"duration_string":"4 weeks","signature_track_registration_open":false,"topic_id":154,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971112},{"start_month":null,"status":0,"start_year":null,"signature_track_open_time":null,"start_day":null,"duration_string":"12 weeks","signature_track_registration_open":false,"topic_id":322,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971115},{"start_month":9,"status":1,"start_year":2013,"signature_track_open_time":null,"start_day":20,"duration_string":"11 weeks","signature_track_registration_open":false,"topic_id":206,"signature_track_close_time":null,"eligible_for_signature_track":false,"id":971123}]}
\ No newline at end of file
diff --git a/data/outcomes.xml b/data/outcomes.xml
new file mode 100644
index 0000000..90dd189
--- /dev/null
+++ b/data/outcomes.xml
@@ -0,0 +1,16812 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<LOCstructure 
+xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://purl.org/net/inloc/" xsi:schemaLocation="http://purl.org/net/inloc/ http://wiki.teria.no/download/attachments/24315835/inloc_schema.xsd" id="http://www.eummena.org/inloc/1330" xml:lang="EN">	<title xml:lang="EN">Computer Science Curricula 2013</title>	<description xml:lang="EN">Following a roughly 10 year cycle, the ACM and IEEE Computer Society jointly sponsor the development of a Computing Curricula volume on Computer Science. These volumes have helped to set international curricular guidelines for undergraduate programs in computing. In the summer of 2010, planning for the next volume in the series, Computer Science 2013 (CS2013), began.</description>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/51"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/52"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/53"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/54"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/55"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/56"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/57"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/58"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/59"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/60"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/61"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/62"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/63"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/64"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/65"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/66"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/67"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/68"></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/by">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/creator"></scheme>
+		<object id="">
+			<label xml:lang="en">The Joint Task Force on Computing Curricula Associ</label></object>
+	</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/1330"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.or/loc/3205"></object>
+	</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/51">
+		<title xml:lang="en">Algorithms and Complexity (AL)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/51"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/70"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/51"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/71"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/51"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/72"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/51"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/73"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/51"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/74"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/51"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/75"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/51"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/76"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/51"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/52">
+		<title xml:lang="en">Architecture and Organization (AR)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/52"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/77"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/52"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/78"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/52"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/79"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/52"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/80"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/52"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/81"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/52"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/82"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/52"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/83"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/52"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/84"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/52"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/53">
+		<title xml:lang="en">Computational Science (CN)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/53"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/85"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/53"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/86"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/53"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/87"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/53"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/88"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/53"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/89"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/53"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/54">
+		<title xml:lang="en">Discrete Structures (DS)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/54"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/90"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/54"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/91"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/54"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/92"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/54"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/93"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/54"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/94"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/54"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/95"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/54"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/55">
+		<title xml:lang="en">Graphics and Visualization (GV)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/55"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/96"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/55"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/97"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/55"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/98"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/55"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/99"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/55"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/100"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/55"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/101"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/55"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/56">
+		<title xml:lang="en">Human-Computer Interaction (HC)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/56"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/102"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/56"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/103"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/56"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/104"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/56"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/105"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/56"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/106"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/56"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/107"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/56"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/108"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/56"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/109"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/56"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/110"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/56"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/111"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/56"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/57">
+		<title xml:lang="en">Information Assurance and Security (IAS)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/57"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/112"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/57"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/113"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/57"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/114"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/57"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/115"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/57"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/116"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/57"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/117"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/57"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/118"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/57"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/119"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/57"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/58">
+		<title xml:lang="en">Information Management (IM)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/120"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/121"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/122"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/123"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/124"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/125"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/126"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/127"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/128"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/129"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/130"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/58"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/59">
+		<title xml:lang="en">Intelligent Systems (IS)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/131"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/132"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/133"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/134"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/135"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/136"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/137"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/138"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/139"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/140"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/141"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/142"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/59"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/60">
+		<title xml:lang="en">Networking and Communication (NC)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/60"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/143"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/60"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/144"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/60"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/145"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/60"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/146"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/60"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/147"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/60"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/148"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/60"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/149"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/60"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/61">
+		<title xml:lang="en">Operating Systems (OS)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/150"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/151"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/152"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/153"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/154"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/155"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/156"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/157"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/158"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/159"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/160"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/161"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/61"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/62">
+		<title xml:lang="en">Platform-Based Development (PBD)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/62"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/162"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/62"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/163"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/62"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/164"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/62"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/165"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/62"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/166"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/62"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/63">
+		<title xml:lang="en">Parallel and Distributed Computing (PD)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/63"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/167"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/63"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/168"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/63"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/169"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/63"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/170"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/63"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/171"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/63"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/172"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/63"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/173"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/63"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/174"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/63"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/64">
+		<title xml:lang="en">Programming Languages (PL)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/175"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/176"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/177"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/178"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/179"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/180"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/181"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/182"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/183"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/184"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/185"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/186"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/187"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/188"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/189"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/190"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/191"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/64"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/65">
+		<title xml:lang="en">Software Development Fundamentals (SDF)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/65"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/192"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/65"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/193"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/65"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/194"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/65"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/195"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/65"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/66">
+		<title xml:lang="en">Software Engineering (SE)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/66"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/196"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/66"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/197"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/66"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/198"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/66"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/199"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/66"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/200"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/66"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/201"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/66"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/202"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/66"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/203"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/66"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/204"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/66"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/205"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/66"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/67">
+		<title xml:lang="en">Systems Fundamentals (SF)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/67"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/206"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/67"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/207"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/67"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/208"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/67"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/209"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/67"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/210"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/67"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/211"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/67"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/212"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/67"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/213"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/67"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/214"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/67"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/68">
+		<title xml:lang="en">Social and Professional Practice (SP)</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/68"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/215"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/68"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/216"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/68"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/217"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/68"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#domain">
+			<label xml:lang="en">Domain</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/70">
+		<title xml:lang="en">AL-Basic Analysis</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/226"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/228"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/229"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/230"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/231"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/232"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/233"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/234"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/235"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/236"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/237"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/70"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/71">
+		<title xml:lang="en">AL-Algorithmic Strategies</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/71"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/238"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/71"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/239"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/71"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/240"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/71"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/241"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/71"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/242"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/71"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/243"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/71"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/244"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/71"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/245"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/71"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/246"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/71"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/72">
+		<title xml:lang="en">AL-Fundamental Data Structures and Algorithms</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/72"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/247"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/72"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/248"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/72"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/249"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/72"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/250"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/72"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/251"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/72"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/252"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/72"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/253"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/72"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/254"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/72"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/255"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/72"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/256"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/72"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/73">
+		<title xml:lang="en">AL-Basic Automata Computability and Complexity</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/73"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/257"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/73"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/258"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/73"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/259"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/73"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/260"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/73"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/261"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/73"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/262"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/73"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/263"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/73"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/74">
+		<title xml:lang="en">AL-Advanced Computational Complexity</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/74"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/264"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/74"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/265"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/74"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Explain the significance of NP-completeness. (Also appears in ALBasic Automata, Computability, and c"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/74"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/267"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/74"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/268"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/74"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/75">
+		<title xml:lang="en">AL-Advanced Automata Theory and Computability</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/75"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/269"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/75"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/270"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/75"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/271"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/75"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/272"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/75"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/273"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/75"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/274"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/75"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/275"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/75"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/76">
+		<title xml:lang="en">AL-Advanced Data Structures Algorithms and Analysis</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/76"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/276"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/76"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/277"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/76"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/278"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/76"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/77">
+		<title xml:lang="en">AR-Digital logic and digital systems</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/77"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/279"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/77"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/280"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/77"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Explain the implications of the power wall in terms of further processor performance improvements an"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/77"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/282"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/77"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/283"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/77"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/284"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/77"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/285"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/77"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/78">
+		<title xml:lang="en">AR-Machine-level representation of data</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/78"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/286"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/78"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/287"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/78"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/288"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/78"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/289"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/78"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/290"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/78"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/291"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/78"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/292"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/78"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/79">
+		<title xml:lang="en">AR-Assembly level machine organization</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/79"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/293"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/79"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/294"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/79"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/295"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/79"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/296"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/79"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/297"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/79"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/298"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/79"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/299"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/79"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/300"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/79"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/302"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/79"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/303"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/79"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/80">
+		<title xml:lang="en">AR-Memory system organization and architecture</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/80"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/304"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/80"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/305"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/80"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/306"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/80"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/307"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/80"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/308"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/80"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/309"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/80"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/81">
+		<title xml:lang="en">AR-Interfacing and communication</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/81"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/310"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/81"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/311"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/81"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/312"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/81"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/313"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/81"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/314"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/81"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/315"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/81"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/82">
+		<title xml:lang="en">AR-Functional organization</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/82"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/316"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/82"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/317"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/82"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/318"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/82"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/319"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/82"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/320"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/82"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/83">
+		<title xml:lang="en">AR-Multiprocessing and alternative architectures</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/83"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/321"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/83"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/322"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/83"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/323"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/83"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/324"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/83"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/325"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/83"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/84">
+		<title xml:lang="en">AR-Performance enhancements</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/84"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/326"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/84"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/327"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/84"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/328"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/84"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/329"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/84"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/330"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/84"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/331"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/84"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/85">
+		<title xml:lang="en">CN-Fundamentals</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/85"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/332"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/85"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/333"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/85"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/334"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/85"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/335"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/85"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/336"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/85"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/337"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/85"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/86">
+		<title xml:lang="en">CN-Modeling and Simulation</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/86"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/338"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/86"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/339"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/86"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/340"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/86"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/341"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/86"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/342"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/86"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/343"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/86"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/344"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/86"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/345"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/86"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/346"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/86"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/347"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/86"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/87">
+		<title xml:lang="en">CN-Processing</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/348"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/349"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/350"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/351"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/352"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/353"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/354"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/355"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/356"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/357"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/358"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/359"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/87"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/88">
+		<title xml:lang="en">CN-Interactive Visualization</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/88"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/360"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/88"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/361"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/88"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/362"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/88"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/363"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/88"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/364"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/88"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/365"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/88"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/89">
+		<title xml:lang="en">CN-Data, Information, and Knowledge</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/89"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/366"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/89"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/367"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/89"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/368"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/89"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/369"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/89"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/370"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/89"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/371"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/89"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/90">
+		<title xml:lang="en">DS-Sets, Relations, and Functions</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/90"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/373"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/90"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/374"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/90"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/375"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/90"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/91">
+		<title xml:lang="en">DS-Basic Logic</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/91"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/376"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/91"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/377"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/91"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/378"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/91"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/379"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/91"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/380"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/91"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/381"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/91"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/92">
+		<title xml:lang="en">DS-Proof Techniques</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/92"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/382"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/92"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/383"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/92"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/384"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/92"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/385"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/92"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Explain the parallels between ideas of mathematical andor structural induction to recursion and recu"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/92"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/387"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/92"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/93">
+		<title xml:lang="en">DS-Basics of Counting</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/93"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/388"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/93"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/389"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/93"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/390"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/93"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/391"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/93"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/392"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/93"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/393"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/93"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/394"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/93"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/94">
+		<title xml:lang="en">DS-Graphs and Trees</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/94"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/395"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/94"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/396"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/94"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/397"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/94"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/398"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/94"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/95">
+		<title xml:lang="en">DS-Discrete Probability</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/95"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/399"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/95"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/400"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/95"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/401"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/95"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/402"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/95"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/403"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/95"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/404"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/95"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/96">
+		<title xml:lang="en">GV-Fundamental Concepts</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/405"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/406"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/407"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/408"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/409"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/410"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Derive linear perspective from similar triangles by converting points (x, y, z) to points (xz, yz, 1"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/412"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/413"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/414"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/415"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/416"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/96"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/97">
+		<title xml:lang="en">GV-Basic Rendering</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/417"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/418"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/419"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/420"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/421"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/422"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/423"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/424"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/425"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/426"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/427"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/97"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/98">
+		<title xml:lang="en">GV-Geometric Modeling</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/98"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/428"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/98"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/429"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/98"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/430"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/98"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/431"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/98"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/432"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/98"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/433"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/98"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/434"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/98"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/435"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/98"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/99">
+		<title xml:lang="en">GV-Advanced Rendering</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/99"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/436"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/99"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/437"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/99"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/438"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/99"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/439"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/99"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/440"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/99"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/441"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/99"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/442"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/99"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/443"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/99"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/100">
+		<title xml:lang="en">GV-Computer Animation</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/100"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/444"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/100"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/445"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/100"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/446"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/100"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/447"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/100"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/448"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/100"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/449"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/100"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/450"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/100"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/451"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/100"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/101">
+		<title xml:lang="en">GV-Visualization</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/101"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/452"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/101"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/453"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/101"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/454"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/101"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/455"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/101"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/456"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/101"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/457"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/101"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/102">
+		<title xml:lang="en">HC-Foundations</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/102"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/458"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/102"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/459"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/102"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/460"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/102"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/461"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/102"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/462"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/102"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/103">
+		<title xml:lang="en">HC-Designing Interaction</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/103"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/463"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/103"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/464"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/103"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/465"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/103"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/104">
+		<title xml:lang="en">HC-Programming Interactive Systems</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/104"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/466"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/104"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/467"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/104"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/468"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/104"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/469"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/104"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/105">
+		<title xml:lang="en">HC-User-centered design and testing  [elective]</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/105"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/470"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/105"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/471"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/105"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/472"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/105"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/473"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/105"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/474"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/105"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/106">
+		<title xml:lang="en">HC-Design for non-mouse interfaces</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/106"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/475"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/106"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/476"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/106"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/477"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/106"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/107">
+		<title xml:lang="en">HC-Collaboration and communication</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/107"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/478"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/107"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/479"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/107"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/480"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/107"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/481"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/107"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/108">
+		<title xml:lang="en">HC-Statistical methods for HCI</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/108"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/482"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/108"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/483"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/108"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/484"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/108"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/109">
+		<title xml:lang="en">HC-Human factors and security</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/109"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/485"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/109"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/486"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/109"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/487"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/109"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/488"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/109"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Analyze a security policy andor procedures to show where they consider, or fail to consider, human f"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/109"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/110">
+		<title xml:lang="en">HC-Design-oriented HCI</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/110"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/490"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/110"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/491"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/110"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/492"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/110"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/111">
+		<title xml:lang="en">HC-Mixed, Augmented and Virtual Reality</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/111"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/493"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/111"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/494"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/111"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/495"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/111"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/496"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/111"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/497"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/111"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/498"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/111"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/112">
+		<title xml:lang="en">IAS-Fundamental Concepts</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/112"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/113">
+		<title xml:lang="en">IAS-Network Security</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/511"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/512"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/513"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/514"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/515"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/516"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/517"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/518"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/519"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/520"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/521"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/522"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/523"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/524"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/525"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/526"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/527"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/528"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/529"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/530"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/531"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/532"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/533"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/534"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/535"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/536"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/537"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/538"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/113"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/114">
+		<title xml:lang="en">IAS-Cryptography</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/114"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/115">
+		<title xml:lang="en">IAS-Risk Management</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/559"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/560"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/561"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/562"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/563"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/564"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/565"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/566"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/567"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/568"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/569"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/570"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Given the value of an asset and the cost of the security controls to mitigate lossdamagedestruction,"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/572"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/573"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/574"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/575"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/115"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/116">
+		<title xml:lang="en">IAS-Security Policy and Governance</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/116"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/576"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/116"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/577"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/116"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/578"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/116"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/579"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/116"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/580"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/116"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/581"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/116"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/117">
+		<title xml:lang="en">IAS- Digital Forensics</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/582"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/583"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/584"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/585"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/586"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/587"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/588"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/589"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/590"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/591"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/592"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/593"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/594"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/595"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/596"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/597"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/117"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/118">
+		<title xml:lang="en">IAS-Security Architecture and Systems Administration</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/598"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/599"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/600"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/601"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/602"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/603"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/604"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/605"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/606"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/607"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/608"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/609"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/610"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/611"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/612"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/613"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/118"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/119">
+		<title xml:lang="en">IAS-Secure Software Design and Engineering</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/614"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/615"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/616"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/617"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/618"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/619"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/620"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/621"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/622"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/623"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/624"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/625"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/626"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/627"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/119"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/120">
+		<title xml:lang="en">IM-Information Management Concepts</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/628"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/629"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/630"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/631"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Critiquedefend a small- to medium-size information application with regard to its satisfying real us"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/633"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/634"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/635"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/636"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/637"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/638"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/120"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/121">
+		<title xml:lang="en">IM-Database Systems</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/121"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/639"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/121"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/640"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/121"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/641"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/121"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/642"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/121"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/643"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/121"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/644"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/121"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Describe how various types of content cover the notions of structure andor of stream (sequence), e.g"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/121"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/122">
+		<title xml:lang="en">IM-Data Modeling</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/122"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/646"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/122"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/647"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/122"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/648"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/122"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/649"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/122"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/650"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/122"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/651"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/122"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/652"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/122"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/653"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/122"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/123">
+		<title xml:lang="en">IM-Indexing</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/123"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/654"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/123"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/655"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/123"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/656"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/123"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/657"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/123"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/658"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/123"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/124">
+		<title xml:lang="en">IM-Relational Databases</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/659"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/660"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/661"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/662"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/663"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/664"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/665"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/666"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Determine whether or not a set of attributes form a superkey andor candidate key for a relation with"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/668"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/669"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/670"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/671"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/672"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/673"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/674"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/124"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/125">
+		<title xml:lang="en">IM-Query Languages</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/125"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/675"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/125"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/676"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/125"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/677"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/125"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/678"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/125"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/679"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/125"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/680"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/125"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/126">
+		<title xml:lang="en">IM-Transaction Processing</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/126"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/681"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/126"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/682"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/126"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/683"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/126"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/684"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/126"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/685"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/126"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/686"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/126"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/127">
+		<title xml:lang="en">IM-Distributed Databases</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/127"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/687"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/127"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/688"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/127"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/689"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/127"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/690"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/127"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/691"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/127"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/128">
+		<title xml:lang="en">IM-Physical Database Design</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/128"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/692"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/128"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/693"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/128"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/694"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/128"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/695"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/128"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/696"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/128"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/697"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/128"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/698"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/128"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/699"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/128"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/700"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/128"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/129">
+		<title xml:lang="en">IM-Data Mining</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/129"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/701"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/129"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/702"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/129"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/703"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/129"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/704"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/129"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/705"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/129"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/706"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/129"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/707"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/129"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/708"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/129"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/130">
+		<title xml:lang="en">IM-Information Storage and Retrieval</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/130"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/709"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/130"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/710"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/130"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/711"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/130"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/712"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/130"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/713"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/130"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/714"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/130"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/131">
+		<title xml:lang="en">IS-Fundamental Issues</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/131"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/715"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/131"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/716"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/131"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/717"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/131"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/132">
+		<title xml:lang="en">IS-Basic Search Strategies</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/132"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/718"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/132"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/719"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/132"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/720"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/132"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/721"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/132"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/722"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/132"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/723"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/132"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/724"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/132"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/725"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/132"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/133">
+		<title xml:lang="en">IS-Basic Knowledge Representation and Reasoning</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/133"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/726"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/133"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/727"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/133"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/728"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/133"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/729"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/133"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/134">
+		<title xml:lang="en">IS-Basic Machine Learning</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/134"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/730"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/134"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/731"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/134"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/732"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/134"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/135">
+		<title xml:lang="en">IS-Advanced Search</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/135"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/733"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/135"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/734"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/135"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/735"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/135"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/736"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/135"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/737"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/135"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/738"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/135"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/136">
+		<title xml:lang="en">IS-Advanced Representation and Reasoning</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/136"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/739"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/136"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/740"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/136"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/741"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/136"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/742"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/136"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/743"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/136"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/744"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/136"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/745"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/136"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/746"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/136"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/747"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/136"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/748"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/136"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/137">
+		<title xml:lang="en">IS-Reasoning Under Uncertainty</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/137"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/749"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/137"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/750"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/137"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/751"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/137"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/752"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/137"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/753"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/137"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/754"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/137"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/755"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/137"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/756"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/137"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/757"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/137"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/758"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/137"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/138">
+		<title xml:lang="en">IS-Agents</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/138"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/759"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/138"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/760"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/138"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/761"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/138"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/762"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/138"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/763"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/138"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/139">
+		<title xml:lang="en">IS-Natural Language Processing</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/139"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/764"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/139"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/765"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/139"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/766"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/139"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/767"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/139"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/768"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/139"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/140">
+		<title xml:lang="en">IS-Advanced Machine Learning</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/140"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/769"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/140"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/770"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/140"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/771"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/140"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/772"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/140"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/773"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/140"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/774"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/140"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/775"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/140"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/141">
+		<title xml:lang="en">IS-Robotics</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/141"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/776"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/141"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/777"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/141"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Program a robot to accomplish simple tasks using deliberative, reactive, andor hybrid control archit"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/141"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/779"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/141"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/780"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/141"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="List the differences among robots representations of their external environment, including their str"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/141"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Compare and contrast at least three strategies for robot navigation within known andor unknown envir"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/141"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/783"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/141"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/142">
+		<title xml:lang="en">IS-Perception and Computer Vision</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/142"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/784"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/142"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/785"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/142"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/786"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/142"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/787"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/142"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/788"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/142"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/789"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/142"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/790"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/142"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/791"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/142"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/792"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/142"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/793"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/142"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/143">
+		<title xml:lang="en">NC-Introduction</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/143"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/794"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/143"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/795"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/143"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/796"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/143"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/797"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/143"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/144">
+		<title xml:lang="en">NC-Networked Applications</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/144"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/798"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/144"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/799"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/144"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/800"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/144"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/145">
+		<title xml:lang="en">NC-Reliable Data Delivery</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/145"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/801"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/145"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/802"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/145"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/803"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/145"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/146">
+		<title xml:lang="en">NC-Routing And Forwarding</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/146"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/804"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/146"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/805"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/146"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/806"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/146"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/147">
+		<title xml:lang="en">NC-Local Area Networks</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/147"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/807"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/147"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/808"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/147"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/809"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/147"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/810"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/147"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/148">
+		<title xml:lang="en">NC-Resource Allocation</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/148"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/811"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/148"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/812"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/148"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/813"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/148"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/149">
+		<title xml:lang="en">NC-Mobility</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/149"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/814"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/149"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/815"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/149"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/150">
+		<title xml:lang="en">OS-Overview of Operating Systems</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/150"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/816"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/150"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/817"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/150"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/818"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/150"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/819"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/150"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/820"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/150"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/151">
+		<title xml:lang="en">OS-Operating System Principles</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/151"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/821"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/151"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/822"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/151"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/823"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/151"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/824"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/151"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/825"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/151"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/826"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/151"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/827"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/151"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/152">
+		<title xml:lang="en">OS-Concurrency</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/152"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/828"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/152"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/829"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/152"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/830"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/152"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/831"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/152"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/832"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/152"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/833"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/152"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/834"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/152"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/153">
+		<title xml:lang="en">OS-Scheduling and Dispatch</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/153"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/835"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/153"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/836"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/153"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/837"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/153"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/838"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/153"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/839"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/153"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/840"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/153"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/841"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/153"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/154">
+		<title xml:lang="en">OS-Memory Management</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/154"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/842"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/154"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/843"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/154"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/844"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/154"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/845"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/154"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/846"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/154"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/847"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/154"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/155">
+		<title xml:lang="en">OS-Security and Protection</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/155"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Defend the need for protection and security in an OS (cross reference IASSecurity Architecture and S"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/155"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/849"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/155"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Explain the mechanisms available in an OS to control access to resources (cross reference IASSecurit"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/155"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/851"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/155"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/156">
+		<title xml:lang="en">OS-Virtual Machines</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/156"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/852"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/156"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/853"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/156"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/854"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/156"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/855"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/156"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/157">
+		<title xml:lang="en">OS-Device Management</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/157"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/856"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/157"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/857"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/157"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/858"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/157"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/859"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/157"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/860"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/157"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/861"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/157"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/862"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/157"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/158">
+		<title xml:lang="en">OS-File Systems</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/158"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/863"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/158"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/864"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/158"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/865"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/158"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/866"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/158"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/159">
+		<title xml:lang="en">OS-Real Time and Embedded Systems</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/159"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/867"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/159"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/868"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/159"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/869"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/159"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/160">
+		<title xml:lang="en">OS-Fault Tolerance</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/160"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/870"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/160"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/871"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/160"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/872"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/160"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/161">
+		<title xml:lang="en">OS-System Performance Evaluation</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/161"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/873"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/161"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/874"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/161"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/162">
+		<title xml:lang="en">PBD-Introduction  </title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/162"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/875"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/162"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/876"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/162"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/877"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/162"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/878"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/162"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/163">
+		<title xml:lang="en">PBD-Web Platforms</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/163"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/879"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/163"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/880"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/163"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/881"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/163"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/882"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/163"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/164">
+		<title xml:lang="en">PBD-Mobile Platforms </title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/164"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/883"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/164"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/884"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/164"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/885"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/164"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/886"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/164"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/165">
+		<title xml:lang="en">PBD-Industrial Platforms</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/165"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/887"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/165"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/888"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/165"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/889"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/165"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/166">
+		<title xml:lang="en">PBD-Game Platforms</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/166"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/890"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/166"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/891"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/166"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/892"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/166"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/167">
+		<title xml:lang="en">PD-Parallelism Fundamentals</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/167"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/893"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/167"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/894"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/167"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/895"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/167"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/168">
+		<title xml:lang="en">PD-Parallel Decomposition</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/168"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/896"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/168"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/897"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/168"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/898"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/168"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/899"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/168"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/169">
+		<title xml:lang="en">PD-Communication and Coordination</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/907"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/908"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/909"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/910"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/911"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/900"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/901"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/902"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/903"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/904"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/905"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/906"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/169"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/170">
+		<title xml:lang="en">PD-Parallel Algorithms, Analysis, and Programming</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/170"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/171">
+		<title xml:lang="en">PD-Parallel Architecture</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/171"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/922"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/171"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/923"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/171"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/924"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/171"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/925"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/171"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/926"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/171"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/927"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/171"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/172">
+		<title xml:lang="en">PD-Parallel Performance</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/172"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/928"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/172"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/929"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/172"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/930"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/172"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/931"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/172"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/932"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/172"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/933"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/172"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/934"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/172"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/173">
+		<title xml:lang="en">PD-Distributed Systems</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/173"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/935"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/173"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/936"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/173"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/937"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/173"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/938"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/173"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/939"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/173"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/940"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/173"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/941"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/173"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/942"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/173"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/943"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/173"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/174">
+		<title xml:lang="en">PD-Formal Models and Semantics</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/174"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/944"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/174"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/945"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/174"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/946"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/174"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/947"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/174"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/948"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/174"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/949"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/174"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/175">
+		<title xml:lang="en">PL-Object-Oriented Programming</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="Compare and contrast (1) the proceduralfunctional approach—defining a function for each operation wi"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/951"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/952"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/953"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/954"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/955"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/956"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/957"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/958"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/959"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/960"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/961"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/962"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/175"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/176">
+		<title xml:lang="en">PL-Functional Programming</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/176"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/177">
+		<title xml:lang="en">PL-Event-Driven and Reactive Programming</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/177"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/178">
+		<title xml:lang="en">PL-Basic Type Systems</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/178"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/179">
+		<title xml:lang="en">PL-Program Representation</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/179"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/180">
+		<title xml:lang="en">PL-Language Translation and Execution</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/180"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/181">
+		<title xml:lang="en">PL-Syntax Analysis</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/181"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1028"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/181"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1029"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/181"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1030"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/181"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/182">
+		<title xml:lang="en">PL-Compiler Semantic Analysis</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/182"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1031"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/182"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/183">
+		<title xml:lang="en">PL-Code Generation</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/183"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1032"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/183"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1033"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/183"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1034"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/183"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/184">
+		<title xml:lang="en">PL-Runtime Systems</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/184"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1035"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/184"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1036"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/184"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1037"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/184"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1038"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/184"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/185">
+		<title xml:lang="en">PL-Static Analysis</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/185"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1039"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/185"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1040"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/185"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1041"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/185"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1042"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/185"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1043"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/185"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/186">
+		<title xml:lang="en">PL-Advanced Programming Constructs</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/186"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1044"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/186"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1045"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/186"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1046"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/186"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/187">
+		<title xml:lang="en">PL-Concurrency and Parallelism</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/187"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1047"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/187"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1048"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/187"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/188">
+		<title xml:lang="en">PL-Type Systems</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/188"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1049"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/188"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1050"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/188"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1051"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/188"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/189">
+		<title xml:lang="en">PL-Formal Semantics</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/189"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1052"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/189"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1053"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/189"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1054"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/189"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/190">
+		<title xml:lang="en">PL-Language Pragmatics</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/190"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1055"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/190"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1056"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/190"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/191">
+		<title xml:lang="en">PL-Logic Programming</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/191"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1057"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/191"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1058"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/191"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/192">
+		<title xml:lang="en">SDF-Algorithms and Design</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1059"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1060"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1061"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1062"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1063"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1064"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1065"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1066"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1067"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1068"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1069"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/192"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/193">
+		<title xml:lang="en">SDF-Fundamental Programming Concepts</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/193"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1070"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/193"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1071"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/193"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1072"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/193"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1073"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/193"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1074"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/193"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1075"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/193"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1076"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/193"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1077"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/193"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/194">
+		<title xml:lang="en">SDF-Fundamental Data Structures</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/194"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1078"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/194"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1079"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/194"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1080"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/194"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1081"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/194"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1082"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/194"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1083"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/194"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/195">
+		<title xml:lang="en">SDF-Development Methods</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/195"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1084"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/195"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1085"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/195"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1086"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/195"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1087"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/195"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1088"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/195"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1089"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/195"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1090"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/195"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1091"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/195"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1092"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/195"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/196">
+		<title xml:lang="en">SE-Software Processes</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1093"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1094"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1095"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1096"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1097"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1098"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1099"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1100"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1101"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1102"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1103"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1104"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1105"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/196"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/197">
+		<title xml:lang="en">SE-Software Project Management</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1106"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1107"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1108"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1109"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1110"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1111"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1112"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1113"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1114"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1115"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1116"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1117"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1118"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1119"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1120"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1121"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1122"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1123"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1124"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1125"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1126"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1127"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1128"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1129"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1130"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/197"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/198">
+		<title xml:lang="en">SE-Tools and Environments</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/198"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1131"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/198"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1132"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/198"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1133"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/198"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1134"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/198"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/199">
+		<title xml:lang="en">SE-Requirements Engineering</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1135"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1136"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1137"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1138"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1139"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1140"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1141"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1142"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1143"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1144"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1145"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/199"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/200">
+		<title xml:lang="en">SE-Software Design</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1146"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1147"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1148"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1149"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1150"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1151"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1152"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1153"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1154"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1155"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1156"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1157"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1158"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1159"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1160"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1161"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1162"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1163"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1164"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1165"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/200"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/201">
+		<title xml:lang="en">SE-Software Construction</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/201"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1166"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/201"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1167"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/201"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1168"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/201"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1169"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/201"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1170"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/201"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1171"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/201"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1172"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/201"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1173"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/201"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/202">
+		<title xml:lang="en">SE-Software Verification Validation</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1174"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1175"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1176"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1177"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1178"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1179"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1180"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1181"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1182"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1183"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1184"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1185"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1186"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/202"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/203">
+		<title xml:lang="en">SE-Software Evolution</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/203"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1187"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/203"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1188"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/203"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1189"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/203"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1190"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/203"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1191"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/203"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1192"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/203"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/204">
+		<title xml:lang="en">SE-Formal Methods</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/204"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1193"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/204"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1194"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/204"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1195"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/204"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1196"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/204"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1197"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/204"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/205">
+		<title xml:lang="en">SE-Software Reliability</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/205"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1198"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/205"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1199"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/205"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1200"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/205"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1201"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/205"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1202"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/205"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1203"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/205"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1204"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/205"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/206">
+		<title xml:lang="en">SF-Computational Paradigms</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/206"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1205"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/206"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1206"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/206"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1207"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/206"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1208"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/206"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1209"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/206"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1210"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/206"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1211"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/206"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/207">
+		<title xml:lang="en">SF-Cross-Layer Communications</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/207"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1212"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/207"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1213"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/207"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1214"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/207"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1215"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/207"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1216"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/207"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/208">
+		<title xml:lang="en">SF-State-State Transition-State Machines</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/208"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1217"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/208"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1218"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/208"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1219"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/208"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1220"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/208"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1221"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/208"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1222"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/208"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/209">
+		<title xml:lang="en">SF-System Support for Parallelism</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/209"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1223"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/209"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1224"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/209"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1225"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/209"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1226"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/209"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1227"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/209"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1228"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/209"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/210">
+		<title xml:lang="en">SF-Performance</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/210"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1229"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/210"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1230"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/210"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1231"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/210"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1232"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/210"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/211">
+		<title xml:lang="en">SF-Resource Allocation and Scheduling</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/211"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1233"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/211"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1234"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/211"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1235"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/211"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1236"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/211"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/212">
+		<title xml:lang="en">SF-Proximity</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/212"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1237"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/212"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1238"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/212"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1239"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/212"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/213">
+		<title xml:lang="en">SF-Virtualization and Isolation</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/213"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1240"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/213"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1241"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/213"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1242"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/213"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/214">
+		<title xml:lang="en">SF-Reliability through Redundancy</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/214"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1243"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/214"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1244"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/214"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1245"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/214"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1246"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/214"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1247"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/214"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/215">
+		<title xml:lang="en">SP-Social Context</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/215"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1248"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/215"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1249"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/215"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1250"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/215"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1251"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/215"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1252"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/215"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1253"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/215"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1254"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/215"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1255"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/215"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1256"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/215"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/216">
+		<title xml:lang="en">SP-Analytical Tools</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/216"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1257"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/216"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1258"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/216"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1259"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/216"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1260"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/216"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1261"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/216"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/217">
+		<title xml:lang="en">SP-Professional Ethics</title>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1262"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1263"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1264"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1265"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1266"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1267"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1268"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1269"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1270"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1271"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1272"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1273"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1274"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/LOCrel">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://purl.org/net/inloc/hasLOCpart"></scheme>
+		<object id="http://www.eummena.org/inloc/1275"></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/217"></subject>
+		<scheme id="http://www.eummena.org/CSC">
+			<label xml:lang="en">CSC</label></scheme>
+		<object id="http://www.eummena.org/CSC#course">
+			<label xml:lang="en">Course</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/226">
+		<description xml:lang="EN">Explain what is meant by best, average, and worst case behavior of an algorithm</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/226"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/228">
+		<description xml:lang="en">Determine informally the time and space complexity of simple algorithms</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/228"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/229">
+		<description xml:lang="en">Understand the formal definition of big O</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/229"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/230">
+		<description xml:lang="en">List and contrast standard complexity classes</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/230"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/231">
+		<description xml:lang="en">Give examples that illustrate time-space trade-offs of algorithms</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/231"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/232">
+		<description xml:lang="en">Use big O notation formally to give asymptotic upper bounds on time and space complexity of algorithms</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/232"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/233">
+		<description xml:lang="en">Use big O notation formally to give average case bounds on time complexity of algorithms.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/233"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/234">
+		<description xml:lang="en">Explain the use of big omega, big theta, and little o notation to describe the amount of work done by an algorithm</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/234"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/235">
+		<description xml:lang="en">Use recurrence relations to determine the time complexity of recursively defined algorithms</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/235"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/236">
+		<description xml:lang="en">Solve elementary recurrence relations, e.g., using some form of a Master Theorem</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/236"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/237">
+		<description xml:lang="en">Perform empirical studies to validate hypotheses about runtime stemming from mathematical analysis. Run algorithms on input of various sizes and compare performance</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/237"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/238">
+		<description xml:lang="en">For each of the above strategies, identify a practical example to which it would apply</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/238"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/239">
+		<description xml:lang="en">Have facility mapping pseudocode to implementation, implementing examples of algorithmic strategies from scratch, and applying them to specific problems</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/239"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/240">
+		<description xml:lang="en">Use a greedy approach to solve an appropriate problem and determine if the greedy rule chosen leads to an optimal solution</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/240"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/240"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/241">
+		<description xml:lang="en">Use a divide-and-conquer algorithm to solve an appropriate problem</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/241"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/242">
+		<description xml:lang="en">Use recursive backtracking to solve a problem such as navigating a maze.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/242"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/243">
+		<description xml:lang="en">Use dynamic programming to solve an appropriate problem</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/243"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/244">
+		<description xml:lang="en">Describe various heuristic problem-solving methods.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/244"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/245">
+		<description xml:lang="en">Use a heuristic approach to solve an appropriate problem</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/245"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/246">
+		<description xml:lang="en">Describe the trade-offs between brute force and other strategies.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/246"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/247">
+		<description xml:lang="en">Implement basic numerical algorithms</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/247"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/248">
+		<description xml:lang="en">Implement simple search algorithms and explain the differences in their time complexities</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/248"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/248"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/249">
+		<description xml:lang="en">Be able to implement common quadratic and O(N log N) sorting algorithms</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/249"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/250">
+		<description xml:lang="en">Understand the implementation of hash tables, including collision avoidance and resolution</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/250"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/251">
+		<description xml:lang="en">Discuss the runtime and memory efficiency of principal algorithms for sorting, searching, and hashing</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/251"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/252">
+		<description xml:lang="en">Discuss factors other than computational efficiency that influence the choice of algorithms, such as programming time, maintainability, and the use of application-specific patterns in the input data</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/252"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/253">
+		<description xml:lang="en">Solve problems using fundamental graph algorithms, including depth-first and breadth-first search</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/253"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/254">
+		<description xml:lang="en">Demonstrate the ability to evaluate algorithms, to select from a range of possible options, to provide justification for that selection, and to implement the algorithm in a particular context</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/254"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/254"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/255">
+		<description xml:lang="en">Solve problems using graph algorithms, including single-source and all-pairs shortest paths, and at least one minimum spanning tree algorithm</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/255"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/256">
+		<description xml:lang="en">Be able to implement a string-matching algorithm</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/256"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/257">
+		<description xml:lang="en">Discuss the concept of finite state machines</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/257"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/258">
+		<description xml:lang="en">Design a deterministic finite state machine to accept a specified language</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/258"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/259">
+		<description xml:lang="en">Generate a regular expression to represent a specified language</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/259"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/260">
+		<description xml:lang="en">Explain why the halting problem has no algorithmic solution</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/260"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/261">
+		<description xml:lang="en">Design a context-free grammar to represent a specified language</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/261"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/262">
+		<description xml:lang="en">Define the classes P and NP</description>
+		<description xml:lang="en">Define the classes P and NP. (Also appears in ALBasic Automata, Computability, and Complexity)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/262"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/262"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/263">
+		<description xml:lang="en">Explain the significance of NP-completeness</description>
+		<description xml:lang="en">Explain the significance of NP-completeness. (Also appears in ALBasic Automata, Computability, and cComplexity)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/263"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/263"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/264">
+		<description xml:lang="en">Define the classes P and NP. (Also appears in ALBasic Automata, Computability, and Complexity)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/264"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/265">
+		<description xml:lang="en">Define the class EXP</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/267">
+		<description xml:lang="en">Provide examples of classic NP-complete problems.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/267"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/268">
+		<description xml:lang="en">Prove that a problem is NP-complete by reducing a classic known NP-complete problem to it. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/268"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/269">
+		<description xml:lang="en">Determine a languagequot;s place in the Chomsky hierarchy (regular, context-free, recursively enumerable). </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/269"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/270">
+		<description xml:lang="en">Prove that a language is in a specified class and that it is not in the next lower class.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/270"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/271">
+		<description xml:lang="en">Convert among equivalently powerful notations for a language, including among DFAs, NFAs, and regular expressions, and between PDAs and CFGs. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/271"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/272">
+		<description xml:lang="en">Explain the Church-Turing thesis and its significance.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/272"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/273">
+		<description xml:lang="en">Explain Ricequot;s Theorem and its significance. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/273"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/274">
+		<description xml:lang="en">Provide examples of uncomputable functions</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/274"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/275">
+		<description xml:lang="en">Prove that a problem is uncomputable by reducing a classic known uncomputable problem to it</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/275"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/276">
+		<description xml:lang="en">Understand the mapping of real-world problems to algorithmic solutions (e.g., as graph problems, linear programs, etc.)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/276"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/276"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/277">
+		<description xml:lang="en">Use advanced algorithmic techniques (e.g., randomization, approximation) to solve real problems.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/277"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/278">
+		<description xml:lang="en">Apply advanced analysis techniques (e.g., amortized, probabilistic, etc.) to algorithms</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/279">
+		<description xml:lang="en">Describe the progression of computer technology components from vacuum tubes to VLSI, from mainframe computer architectures to the organization of warehouse-scale computers</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/279"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/280">
+		<description xml:lang="en">Comprehend the trend of modern computer architectures towards multi-core and that parallelism is inherent in all hardware systems</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/280"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/282">
+		<description xml:lang="en">Articulate that there are many equivalent representations of computer functionality, including logical expressions and gates, and be able to use mathematical expressions to describe the functions of simple combinational and sequential circuits</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/282"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/283">
+		<description xml:lang="en">Design the basic building blocks of a computer: arithmetic-logic unit (gate-level), registers (gate-level), central processing unit (register transfer-level), memory (register transfer-level)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/283"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/284">
+		<description xml:lang="en">Use CAD tools for capture, synthesis, and simulation to evaluate simple building blocks (e.g., arithmetic- logic unit, registers, movement between registers) of a simple computer design</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/284"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/285">
+		<description xml:lang="en">Evaluate the functional and timing diagram behavior of a simple processor implemented at the logic circuit level</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/285"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/286">
+		<description xml:lang="en">Explain why everything is data, including instructions, in computers</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/286"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/287">
+		<description xml:lang="en">Explain the reasons for using alternative formats to represent numerical data</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/287"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/288">
+		<description xml:lang="en">Describe how negative integers are stored in sign-magnitude and twos-complement representations </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/288"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/289">
+		<description xml:lang="en">Explain how fixed-length number representations affect accuracy and precision</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/289"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/290">
+		<description xml:lang="en">Describe the internal representation of non-numeric data, such as characters, strings, records, and arrays </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/290"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/291">
+		<description xml:lang="en">Convert numerical data from one format to another</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/291"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/292">
+		<description xml:lang="en">Write simple programs at the assemblymachine level for string processing and manipulation </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/292"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/293">
+		<description xml:lang="en">Explain the organization of the classical von Neumann machine and its major functional units</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/293"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/294">
+		<description xml:lang="en">Describe how an instruction is executed in a classical von Neumann machine, with extensions for threads, multiprocessor synchronization, and SIMD execution</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/294"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/295">
+		<description xml:lang="en">Describe instruction level parallelism and hazards, and how they are managed in typical processor pipelines</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/295"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/296">
+		<description xml:lang="en">Summarize how instructions are represented at both the machine level and in the context of a symbolic assembler</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/296"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/297">
+		<description xml:lang="en">Demonstrate how to map between high-level language patterns into assemblymachine language notations </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/297"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/298">
+		<description xml:lang="en">Explain different instruction formats, such as addresses per instruction and variable length vs. fixed length formats</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/298"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/299">
+		<description xml:lang="en">Explain how subroutine calls are handled at the assembly level</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/299"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/299"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/300">
+		<description xml:lang="en">Explain the basic concepts of interrupts and IO operations</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/300"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/302">
+		<description xml:lang="en">Write simple assembly language program segments </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/302"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/303">
+		<description xml:lang="en">Show how fundamental high-level programming constructs are implemented at the machine-language level</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/303"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/304">
+		<description xml:lang="en">Identify the main types of memory technology</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/304"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/305">
+		<description xml:lang="en">Explain the effect of memory latency on running time</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/305"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/306">
+		<description xml:lang="en">Describe how the use of memory hierarchy (cache, virtual memory) is used to reduce the effective memory latency</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/306"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/307">
+		<description xml:lang="en">Describe the principles of memory management</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/307"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/308">
+		<description xml:lang="en">Explain the workings of a system with virtual memory management</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/308"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/309">
+		<description xml:lang="en">Compute Average Memory Access Time under a variety of memory system configurations and workload assumptions</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/309"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/310">
+		<description xml:lang="en">Explain how interrupts are used to implement IO control and data transfers</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/310"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/311">
+		<description xml:lang="en">Identify various types of buses in a computer system</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/311"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/312">
+		<description xml:lang="en">Describe data access from a magnetic disk drive</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/312"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/313">
+		<description xml:lang="en">Compare common network organizations, such as ethernetbus, ring, switched vs. routed</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/313"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/314">
+		<description xml:lang="en">Identify interfaces needed for multimedia support, from storage, through network, to memory and display</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/314"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/315">
+		<description xml:lang="en">Describe the advantages and limitations of RAID architectures</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/315"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/316">
+		<description xml:lang="en">Compare alternative implementation of datapaths</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/316"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/317">
+		<description xml:lang="en">Discuss the concept of control points and the generation of control signals using hardwired or microprogrammed implementations </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/317"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/318">
+		<description xml:lang="en">Explain basic instruction level parallelism using pipelining and the major hazards that may occur</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/318"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/319">
+		<description xml:lang="en">Design and implement a complete processor, including datapath and control</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/319"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/320">
+		<description xml:lang="en">Determine, for a given processor and memory system implementation, the average cycles per instruction</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/320"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/321">
+		<description xml:lang="en">Discuss the concept of parallel processing beyond the classical von Neumann model</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/321"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/322">
+		<description xml:lang="en">Describe alternative architectures such as SIMD and MIMD</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/322"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/323">
+		<description xml:lang="en">Explain the concept of interconnection networks and characterize different approaches </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/323"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/324">
+		<description xml:lang="en">Discuss the special concerns that multiprocessing systems present with respect to memory management and describe how these are addressed</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/324"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/325">
+		<description xml:lang="en">Describe the differences between memory backplane, processor memory interconnect, and remote memory via networks</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/325"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/326">
+		<description xml:lang="en">Describe superscalar architectures and their advantages</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/326"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/327">
+		<description xml:lang="en">Explain the concept of branch prediction and its utility</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/327"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/328">
+		<description xml:lang="en">Characterize the costs and benefits of prefetching </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/328"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/329">
+		<description xml:lang="en">Explain speculative execution and identify the conditions that justify it</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/329"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/330">
+		<description xml:lang="en">Discuss the performance advantages that multithreading offered in an architecture along with the factors that make it difficult to derive maximum benefits from this approach</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/330"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/331">
+		<description xml:lang="en">Describe the relevance of scalability to performance</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/331"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/332">
+		<description xml:lang="en">Explain the concept of modeling and the use of abstraction that allows the use of a machine to solve a problem</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/332"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/333">
+		<description xml:lang="en">Explain the concept of simulation.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/333"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/334">
+		<description xml:lang="en">Describe the relationship between modeling and simulation, i.e., thinking of simulation as dynamic modeling</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/334"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/335">
+		<description xml:lang="en">Articulate the use of a formal mathematical model of a situation in the validation of a simulation. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/335"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/336">
+		<description xml:lang="en">Differentiate among the different types of simulations.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/336"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/337">
+		<description xml:lang="en">Describe several approaches to validating models.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/337"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/338">
+		<description xml:lang="en">Explain and give examples of the benefits of simulation and modeling in a range of important application areas</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/339">
+		<description xml:lang="en">Demonstrate the ability to apply the techniques of modeling and simulation to a range of problem areas. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/340">
+		<description xml:lang="en">Explain the constructs and concepts of a particular modeling approach.</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/341">
+		<description xml:lang="en">Explain the difference between validation and verification of a model; demonstrate the difference with specific examples</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/342">
+		<description xml:lang="en">Verify and validate the results of a simulation. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/343">
+		<description xml:lang="en">Evaluate a simulation, highlighting the benefits and the drawbacks. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/344">
+		<description xml:lang="en">Choose an appropriate modeling approach for a given problem or situation. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/345">
+		<description xml:lang="en">Compare results from different simulations of the same situation and explain any differences. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/346">
+		<description xml:lang="en">Infer the behavior of a system from the results of a simulation of the system. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/347">
+		<description xml:lang="en">Extend or adapt an existing model to a new situation. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/348">
+		<description xml:lang="en">Explain the characteristics and defining properties of algorithms and how they relate to machine processing</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/349">
+		<description xml:lang="en">Analyze simple problem statements to identify relevant information and select appropriate processing to solve the problem</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/350">
+		<description xml:lang="en">Identify or sketch a workflow for an existing computational process such as the creation of a graph based om experimental data </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/351">
+		<description xml:lang="en">Describe the process of converting an algorithm to machine-executable code. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/352">
+		<description xml:lang="en">Summarize the phases of software development and compare several common lifecycle models. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/353">
+		<description xml:lang="en">Explain how data is represented in a machine. Compare representations of integers to floating point numbers. Describe underflow, overflow, round off, and truncation errors in data representations. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/354">
+		<description xml:lang="en">Apply standard numerical algorithms to solve ODEs and PDEs. Use computing systems to solve systems of equations</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/355">
+		<description xml:lang="en">Describe the basic properties of bandwidth, latency, scalability and granularity. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/356">
+		<description xml:lang="en">Describe the levels of parallelism including task, data, and event parallelism. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/357">
+		<description xml:lang="en">Compare and contrast parallel programming paradigms recognizing the strengths and weaknesses of each. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/358">
+		<description xml:lang="en">Identify the issues impacting correctness and efficiency of a computation. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/359">
+		<description xml:lang="en">Design, code, test and debug programs for a parallel computation. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/360">
+		<description xml:lang="en">Compare common computer interface mechanisms with respect to ease-of-use, learnability, and cost. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/361">
+		<description xml:lang="en">Use standard APIs and tools to create visual displays of data, including graphs, charts, tables, and histograms </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/362">
+		<description xml:lang="en">Describe several approaches to using a computer as a means for interacting with and processing data. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/363">
+		<description xml:lang="en">Extract useful information from a dataset. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/364">
+		<description xml:lang="en">Analyze and select visualization techniques for specific problems. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/365">
+		<description xml:lang="en">Describe issues related to scaling data analysis from small to large data sets. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/366">
+		<description xml:lang="en">Identify all of the data, information, and knowledge elements and related organizations, for a computational science application</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/367">
+		<description xml:lang="en">Describe how to represent data and information for processing. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/368">
+		<description xml:lang="en">Describe typical user requirements regarding that data, information, and knowledge. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/369">
+		<description xml:lang="en">Select a suitable system or software implementation to manage data, information, and knowledge. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/370">
+		<description xml:lang="en">List and describe the reports, transactions, and other processing needed for a computational science application</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/371">
+		<description xml:lang="en">Compare and contrast database management, information retrieval, and digital library systems with regard to handling typical computational science applications. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/373">
+		<description xml:lang="en">Explain with examples the basic terminology of functions, relations, and sets.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/373"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/374">
+		<description xml:lang="en">Perform the operations associated with sets, functions, and relations</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/374"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/375">
+		<description xml:lang="en">Relate practical examples to the appropriate set, function, or relation model, and interpret the associated  operations and terminology in context.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/375"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/376">
+		<description xml:lang="en">Convert logical statements from informal language to propositional and predicate logic expressions. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/376"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/377">
+		<description xml:lang="en">Apply formal methods of symbolic propositional and predicate logic, such as calculating validity of formulae and computing normal forms.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/377"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/378">
+		<description xml:lang="en">Use the rules of inference to construct proofs in propositional and predicate logic.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/378"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/379">
+		<description xml:lang="en">Describe how symbolic logic can be used to model real-life situations or applications, including those arising in computing contexts such as software analysis (e.g., program correctness), database queries, and algorithms</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/379"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/380">
+		<description xml:lang="en">Apply formal logic proofs andor informal, but rigorous, logical reasoning to real problems, such as predicting the behavior of software or solving problems such as puzzles</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/380"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/381">
+		<description xml:lang="en">Describe the strengths and limitations of propositional and predicate logic</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/381"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/382">
+		<description xml:lang="en">Identify the proof technique used in a given proof. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/382"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/383">
+		<description xml:lang="en">Outline the basic structure of each proof technique described in this unit. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/383"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/384">
+		<description xml:lang="en">Apply each of the proof techniques correctly in the construction of a sound argument.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/384"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/385">
+		<description xml:lang="en">Determine which type of proof is best for a given problem. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/385"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/387">
+		<description xml:lang="en">Explain the relationship between weak and strong induction and give examples of the appropriate use of each</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/387"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/388">
+		<description xml:lang="en">Apply counting arguments, including sum and product rules, inclusion-exclusion principle and arithmeticgeometric progressions.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/388"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/389">
+		<description xml:lang="en">Apply the pigeonhole principle in the context of a formal proof.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/389"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/390">
+		<description xml:lang="en">Compute permutations and combinations of a set, and interpret the meaning in the context of the particular application</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/390"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/391">
+		<description xml:lang="en">Map real-world applications to appropriate counting formalisms, such as determining the number of ways to arrange people around a table, subject to constraints on the seating arrangement, or the number of ways to determine certain hands in cards (e.g., a full house).</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/391"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/392">
+		<description xml:lang="en">Solve a variety of basic recurrence relations.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/392"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/393">
+		<description xml:lang="en">Analyze a problem to determine underlying recurrence relations. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/393"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/394">
+		<description xml:lang="en">Perform computations involving modular arithmetic.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/394"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/395">
+		<description xml:lang="en">Illustrate by example the basic terminology of graph theory, and some of the properties and special cases of each type of graphtree. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/395"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/396">
+		<description xml:lang="en">Demonstrate different traversal methods for trees and graphs, including pre, post, and in-order traversal of trees</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/396"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/397">
+		<description xml:lang="en">Model a variety of real-world problems in computer science using appropriate forms of graphs and trees,such as representing a network topology or the organization of a hierarchical file system.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/397"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/398">
+		<description xml:lang="en">Show how concepts from graphs and trees appear  in data structures, algorithms, proof techniques (structural induction), and counting.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/398"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/399">
+		<description xml:lang="en">Calculate probabilities of events and expectations of random variables for elementary problems such as  games of chance</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/399"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/400">
+		<description xml:lang="en">Differentiate between dependent and independent events.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/400"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/401">
+		<description xml:lang="en">Explain how events that are independent can be conditionally dependent (and vice-versa).  Identify real- world examples of such cases. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/401"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/402">
+		<description xml:lang="en">Identify a case of the binomial distribution and compute a probability using that distribution. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/402"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/403">
+		<description xml:lang="en">Make a probabilistic inference in a real-world problem using Bayesquot; theorem to determine the probability of a hypothesis given evidence</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/403"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/404">
+		<description xml:lang="en">Apply the tools of probability to solve problems such as the average case analysis of algorithms or analyzing hashing</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/404"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/405">
+		<description xml:lang="en">Describe the basic process of human visual perception including the perception of continuous motion from a sequence of discrete frames (sometimes called flicker fusion), tricolor stimulus, depth cues, contrast sensitivity, and the limits of human visual acuity</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/405"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/406">
+		<description xml:lang="en">Describe color models and their use in graphics display devices.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/406"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/407">
+		<description xml:lang="en">Differentiate between vector and raster rendering.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/407"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/408">
+		<description xml:lang="en">Introduce the algorithmic distinction between projecting light from surfaces forward to the screen (e.g., triangle rasterization and splatting) vs. tracing the path of light backwards (e.g., ray or beam tracing). </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/408"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/409">
+		<description xml:lang="en">Identify common uses of computer graphics.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/409"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/410">
+		<description xml:lang="en">Model simple graphics images. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/410"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/412">
+		<description xml:lang="en">Create 2D or 3D images using a standard graphics API.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/412"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/413">
+		<description xml:lang="en">Describe the basic graphics pipeline and how forward and backward rendering factor in this.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/413"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/414">
+		<description xml:lang="en">Describe the differences between lossy and lossless image compression techniques, for example as reflected in common graphics image file formats such as  JPG, PNG, and GIF</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/414"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/415">
+		<description xml:lang="en">Apply a data compression algorithm such as run-length, Haar-wavelet, JPEG encoding, Huffman coding or Ziv-Lempel.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/415"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/416">
+		<description xml:lang="en">Apply double-buffering in the generation of a graphics application.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/416"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/417">
+		<description xml:lang="en">Discuss the light transport problem and its relation to numerical integration i.e., light is emitted, scatters around the scene, and is measured by the eye; the form is an integral equation without analytic solution, but we can approach it as numerical integration.   </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/418">
+		<description xml:lang="en">Obtain 2-dimensional and 3-dimensional points by applying affine transformations. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/419">
+		<description xml:lang="en">Apply 3-dimensional coordinate system and the changes required to extend 2D transformation operations to handle transformations in 3D. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/420">
+		<description xml:lang="en">Contrast forward and backward rendering. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/421">
+		<description xml:lang="en">Explain the concept and applications of texture mapping, sampling, and anti-aliasing. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/422">
+		<description xml:lang="en">Explain the ray tracing – rasterization duality for the visibility problem. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/423">
+		<description xml:lang="en">Implement simple procedures that perform transformation and clipping operations on simple 2-dimensional images</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/424">
+		<description xml:lang="en">Implement a simple real-time renderer using a rasterization API (e.g., OpenGL) using vertex buffers and shaders</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/425">
+		<description xml:lang="en">Compare and contrast the different rendering techniques. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/426">
+		<description xml:lang="en">Compute space requirements based on resolution and color coding. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/427">
+		<description xml:lang="en">Compute time requirements based on refresh rates, rasterization techniques. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/428">
+		<description xml:lang="en">Represent curves and surfaces using both implicit and parametric forms. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/429">
+		<description xml:lang="en">Create simple polyhedral models by surface tessellation. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/430">
+		<description xml:lang="en">Implement such algorithms as </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/431">
+		<description xml:lang="en">Generate a mesh representation from an implicit surface. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/432">
+		<description xml:lang="en">Generate a fractal model or terrain using a procedural method. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/433">
+		<description xml:lang="en">Generate a mesh from data points acquired with a laser scanner. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/434">
+		<description xml:lang="en">Construct CSG models from simple primitives, such as cubes and quadric surfaces. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/435">
+		<description xml:lang="en">Contrast modeling approaches with respect to space and time complexity and quality of image. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/436">
+		<description xml:lang="en">Demonstrate how an algorithm estimates a solution to the rendering equation. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/437">
+		<description xml:lang="en">Prove the properties of a rendering algorithm, e.g., complete, consistent, andor unbiased. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/438">
+		<description xml:lang="en">Analyze the bandwidth and computation demands of a simple algorithm. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/439">
+		<description xml:lang="en">Implement a non-trivial shading algorithm (e.g., toon shading, cascaded shadow maps) under a rasterization API</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/440">
+		<description xml:lang="en">Discuss how a particular artistic technique might be implemented in a renderer. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/441">
+		<description xml:lang="en">Explain how to recognize the graphics techniques used to create a particular image. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/442">
+		<description xml:lang="en">Implement any of the specified graphics techniques using a primitive graphics system at the individual pixel level</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/443">
+		<description xml:lang="en">Implement a ray tracer for scenes using a simple (e.g., Phongquot;s) BRDF plus reflection and refraction.  </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/444">
+		<description xml:lang="en">Compute the location and orientation of model parts using an forward kinematic approach. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/445">
+		<description xml:lang="en">Compute the orientation of articulated parts of a model from a location and orientation using an inverse kinematic approach. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/446">
+		<description xml:lang="en">Describe the tradeoffs in different representations of rotations. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/447">
+		<description xml:lang="en">Implement the spline interpolation method for producing in-between positions and orientations. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/448">
+		<description xml:lang="en">Implement algorithms for physical modeling of particle dynamics using simple Newtonian mechanics, for example Witkin  Kass, snakes and worms, symplectic Euler, StormerVerlet, or midpoint Euler methods</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/449">
+		<description xml:lang="en">Describe the tradeoffs in different approaches to ODE integration for particle modeling.  </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/450">
+		<description xml:lang="en">Discuss the basic ideas behind some methods for fluid dynamics for modeling ballistic trajectories, for example for splashes, dust, fire, or smoke. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/451">
+		<description xml:lang="en">Use common animation software to construct simple organic forms using metaball and skeleton. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/452">
+		<description xml:lang="en">Describe the basic algorithms for scalar and vector visualization. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/453">
+		<description xml:lang="en">Describe the tradeoffs of algorithms in terms of accuracy and performance. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/454">
+		<description xml:lang="en">Propose a suitable visualization design for a particular combination of data characteristics and application tasks</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/455">
+		<description xml:lang="en">Discuss the effectiveness of a given visualization for a particular task. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/456">
+		<description xml:lang="en">Design a process to evaluate the utility of a visualization algorithm or system. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/457">
+		<description xml:lang="en">Recognize a variety of applications of visualization including representations of scientific, medical, and mathematical data; flow visualization; and spatial analysis. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/458">
+		<description xml:lang="en">Discuss why human-centered software development is important </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/458"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/459">
+		<description xml:lang="en">Summarize the basic precepts of psychological and social interaction </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/459"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/460">
+		<description xml:lang="en">Develop and use a conceptual vocabulary for analyzing human interaction with software: affordance, conceptual model, feedback, and so forth</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/461">
+		<description xml:lang="en">Define a user-centered design process that explicitly recognizes that the user is not like the developer or her acquaintances</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/462">
+		<description xml:lang="en">Create and conduct a simple usability test for an existing software application</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/462"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/463">
+		<description xml:lang="en">Create a simple application, together with help  documentation, that supports a user interface </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/463"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/464">
+		<description xml:lang="en">Conduct a quantitative evaluation and discussreport the results </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/464"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/465">
+		<description xml:lang="en">Discuss at least one national or international user interface design standard </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/466">
+		<description xml:lang="en">Understand there are common approaches to design problems, and be able to explain the importance of MVC to GUI programming</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/466"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/467">
+		<description xml:lang="en">Create an application with a modern l user interface </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/467"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/468">
+		<description xml:lang="en">Identify commonalities and differences in UIs across different platforms </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/468"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/469">
+		<description xml:lang="en">Explain and use GUI programming concepts: event handling, constraint-based layout management, etc </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/469"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/470">
+		<description xml:lang="en">Understand how user-centered design complements other software process models </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/470"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/471">
+		<description xml:lang="en">Choose appropriate methods to support the development of a specific UI </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/471"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/472">
+		<description xml:lang="en">Use a variety of techniques to evaluate a given UI </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/472"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/473">
+		<description xml:lang="en">Use lo-fi prototyping techniques to gather, and report, user responses </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/473"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/474">
+		<description xml:lang="en">Describe the constraints and benefits of different evaluative methods</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/475">
+		<description xml:lang="en">Describe when non-mouse interfaces are appropriate </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/475"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/476">
+		<description xml:lang="en">Discuss the advantages (and disadvantages) of non-mouse interfaces</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/476"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/477">
+		<description xml:lang="en">Understand the interaction possibilities beyond mouse-and-pointer interfaces </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/478">
+		<description xml:lang="en">Describe the difference between synchronous and asynchronous communication </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/478"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/479">
+		<description xml:lang="en">Compare the HCI issues in individual interaction with group interaction </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/480">
+		<description xml:lang="en">Discuss several issues of social concern raised by collaborative software </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/481">
+		<description xml:lang="en">Discuss the HCI issues in software that embodies human intention </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/482">
+		<description xml:lang="en">Explain basic statistical concepts and their areas of application </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/482"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/483">
+		<description xml:lang="en">Extract and articulate the statistical arguments used in papers which report HCI results </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/484">
+		<description xml:lang="en">Devise appropriate statistical tests for a given HCI problem </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/484"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/485">
+		<description xml:lang="en">Explain the concepts of phishing and spear phishing, and how to recognize them </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/485"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/486">
+		<description xml:lang="en">Explain the concept of identity management and its importance </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/486"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/487">
+		<description xml:lang="en">Describe the issues of trust in interface design with an example of a high and low trust system </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/487"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/488">
+		<description xml:lang="en">Design a user interface for a security mechanism </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/488"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/490">
+		<description xml:lang="en">Detail the processes of design appropriate to specific design orientations </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/490"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/491">
+		<description xml:lang="en">Apply a variety of design methods to a given problem </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/491"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/492">
+		<description xml:lang="en">Understand HCI as a design-oriented discipline.</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/493">
+		<description xml:lang="en">Describe the optical model realized by a computer graphics system to synthesize stereoscopic view </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/493"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/494">
+		<description xml:lang="en">Describe the principles of different viewer tracking technologies.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/494"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/495">
+		<description xml:lang="en">Describe the differences between geometry- and image-based virtual reality.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/495"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/496">
+		<description xml:lang="en">Describe the issues of user action synchronization and data consistency in a networked environment</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/496"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/497">
+		<description xml:lang="en">Determine the basic requirements on interface, hardware, and software configurations of a VR system for a specified application</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/497"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/498">
+		<description xml:lang="en">To be aware of the range of possibilities for games engines, including their potential and their limitations</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/499">
+		<description xml:lang="en">Describe the types of threats to data and information systems </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/499"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/500">
+		<description xml:lang="en">Describe why processes and data need protection </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/500"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/501">
+		<description xml:lang="en">Describe the context in which Confidentiality, Integrity, and Availability are important to given processes or data ?</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/501"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/502">
+		<description xml:lang="en">Determine if the security controls provide sufficient security for the required level of   Confidentiality, Integrity, andor Availability</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/502"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/503">
+		<description xml:lang="en">What are significant national level laws affecting the obligation for the protection of data?</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/503"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/504">
+		<description xml:lang="en">Describe how laws affecting privacy and dataIP protection differ based on country?</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/504"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/505">
+		<description xml:lang="en">Describe the major vulnerabilities present in systems today.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/505"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/506">
+		<description xml:lang="en">Define the fundamental motivations for intentional malicious exploitation of vulnerabilities. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/507">
+		<description xml:lang="en">Define the defense mechanisms that can be used to detect or mitigate malicious activity in IT systems. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/507"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/508">
+		<description xml:lang="en">Define an incident.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/508"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/509">
+		<description xml:lang="en">Enumerate the roles required in incident response and the common steps after an incident has been declared</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/509"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/510">
+		<description xml:lang="en">Describe the actions taken in response to the discovery of a given incident</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/510"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/511">
+		<description xml:lang="en">Identify protocols used to enhance Internet communication, and choose the appropriate protocol for a particular</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/511"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/512">
+		<description xml:lang="en">Discuss the difference between secret key and public key encryption. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/512"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/513">
+		<description xml:lang="en">Discuss the fundamental ideas of public-key cryptography. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/513"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/514">
+		<description xml:lang="en">Discuss the role of a certificate authority in public-key cryptography. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/514"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/515">
+		<description xml:lang="en">Discuss non-repudiation </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/515"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/516">
+		<description xml:lang="en">Describe a digital signature</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/516"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/517">
+		<description xml:lang="en">Describe how public key encryption is used to encrypt email traffic.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/517"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/518">
+		<description xml:lang="en">Generate and distribute a PGP key pair and use the PGP package to send an encrypted e-mail message.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/518"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/519">
+		<description xml:lang="en">Describe how public key encryption is used to secure HTTP traffic. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/519"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/520">
+		<description xml:lang="en">Describe the security risks present in networking.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/520"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/521">
+		<description xml:lang="en">Discuss the differences in Network Intrusion Detection and Network Intrusion Prevention.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/521"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/522">
+		<description xml:lang="en">Describe how the basic security implications of a hub and a switch.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/522"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/523">
+		<description xml:lang="en">Describe how a system can intercept traffic in a local subnet.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/523"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/524">
+		<description xml:lang="en">Describe different implementations for intrusion detection.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/524"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/525">
+		<description xml:lang="en">Identify a buffer overflow vulnerability in code  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/525"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/526">
+		<description xml:lang="en">Correct a buffer overflow error in code  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/526"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/527">
+		<description xml:lang="en">Describe the methods that can be used to alert that a system has a backdoor installed.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/527"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/528">
+		<description xml:lang="en">Describe the methods that can be used to identify a system is running processes not desired be the system owner</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/528"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/529">
+		<description xml:lang="en">Analyze a port listing for unwanted TCPUDP listeners.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/529"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/530">
+		<description xml:lang="en">Describe the difference between non-routable and routable IP addresses.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/530"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/531">
+		<description xml:lang="en">List the class A, B, and C non-routable IP ranges.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/531"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/532">
+		<description xml:lang="en">Describe the difference between stateful and non-stateful firewalls.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/532"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/533">
+		<description xml:lang="en">Implement firewalls to prevent specific IPquot;s or ports from traversing the firewall.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/533"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/534">
+		<description xml:lang="en">Describe the different actions a firewall can take with a packet.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/534"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/535">
+		<description xml:lang="en">Summarize common authentication protocols.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/535"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/536">
+		<description xml:lang="en">Describe and discuss recent successful security attacks.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/536"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/537">
+		<description xml:lang="en">Summarize the strengths and weaknesses associated with different approaches to security.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/537"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/538">
+		<description xml:lang="en">Describe what a message digest is and how it is commonly used.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/538"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/539">
+		<description xml:lang="en">What is the purpose of Cryptography? [Knowledge] </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/539"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/540">
+		<description xml:lang="en">What is plain text? [Knowledge] </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/540"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/541">
+		<description xml:lang="en">What is cipher text?  [Knowledge] </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/541"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/542">
+		<description xml:lang="en">What are the two basic methods (ciphers) for transforming plain text in cipher text?  [Knowledge] </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/542"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/543">
+		<description xml:lang="en">Describe attacks against a specified cypher. [Knowledge] </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/543"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/544">
+		<description xml:lang="en">Define the following terms: Cipher, Cryptanalysis, Cryptographic Algorithm, Cryptology.  [Knowledge] </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/544"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/545">
+		<description xml:lang="en">What is the Work Function of a given cryptographic algorithm?   [Knowledge] </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/545"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/546">
+		<description xml:lang="en">What is a One Time Pad (Vernam Cipher)?     [Knowledge] </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/546"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/547">
+		<description xml:lang="en">What is a Symmetric Key operation?    [Knowledge] </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/547"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/548">
+		<description xml:lang="en">What is an Asymmetric Key operation?    [Knowledge] </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/548"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/549">
+		<description xml:lang="en">For a given problem and environment weigh the tradeoffs between a Symmetric and Asymmetric key operation</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/549"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/550">
+		<description xml:lang="en">What are common Symmetric Key algorithms?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/550"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/551">
+		<description xml:lang="en">Explain in general how a public key algorithm works.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/551"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/552">
+		<description xml:lang="en">How does key recovery work?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/552"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/553">
+		<description xml:lang="en">List 5 public key algorithms.     </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/553"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/554">
+		<description xml:lang="en">Describe the process in the Diffie-Hellman key exchange.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/554"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/555">
+		<description xml:lang="en">What is a message digest and list 4 common algorithms?     </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/555"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/556">
+		<description xml:lang="en">What is a digital signature and how is one created?    </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/556"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/557">
+		<description xml:lang="en">What the three components of a PKI?   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/557"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/558">
+		<description xml:lang="en">List the ways a PKI infrastructure can be attacked.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/558"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/559">
+		<description xml:lang="en">How is risk determined?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/559"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/560">
+		<description xml:lang="en">What does it mean to manage risk?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/560"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/561">
+		<description xml:lang="en">What is the primary purpose of risk management?   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/561"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/562">
+		<description xml:lang="en">Who can accept Risk?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/562"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/563">
+		<description xml:lang="en">What is the objective of Security Controls in security management?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/563"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/564">
+		<description xml:lang="en">With respect to a risk program, what is an Asset?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/564"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/565">
+		<description xml:lang="en">With respect to a risk program, what is a Threat?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/565"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/566">
+		<description xml:lang="en">With respect to a risk program, what is a Vulnerability?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/566"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/567">
+		<description xml:lang="en">With respect to a risk program, what is a Safeguard?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/567"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/568">
+		<description xml:lang="en">With respect to a risk program, what is the Exposure Factor (EF)?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/568"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/569">
+		<description xml:lang="en">What is the difference between Quantitative Risk Analysis and Qualitative Risk Analysis?   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/569"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/570">
+		<description xml:lang="en">How does an organization determine what safeguards or controls to implement?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/570"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/572">
+		<description xml:lang="en">What is Risk Analysis (RA)?   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/572"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/573">
+		<description xml:lang="en">Describe how data is classified in either (government or commercial)?   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/573"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/574">
+		<description xml:lang="en">When are the factors used when determining the classification of a piece of information?   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/574"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/575">
+		<description xml:lang="en">What are three ways to deal with Risk?   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/575"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/576">
+		<description xml:lang="en">What is a security policy and why does an organization need a security policy?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/576"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/577">
+		<description xml:lang="en">Come up with an example of your own, which would be caused by missing security policies.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/577"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/578">
+		<description xml:lang="en">What are the basic things that need to be explained to every employee about a security policy? At what point in their employment? Why?</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/578"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/579">
+		<description xml:lang="en">Say you have an e-mail server that processes sensitive emails from important people. What kind of things should be put into the security policy for the email server?</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/579"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/580">
+		<description xml:lang="en">Read your institutionquot;s security plan and critique the plan. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/580"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/581">
+		<description xml:lang="en">Update your institutionquot;s security plan.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/581"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/582">
+		<description xml:lang="en">What is a Digital Investigation?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/582"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/583">
+		<description xml:lang="en">What systems in an IT infrastructure might have forensically recoverable data?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/583"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/584">
+		<description xml:lang="en">Who in an organization is authorized to permit the conduct of a forensics investigation?   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/584"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/585">
+		<description xml:lang="en">What is the Rule of Evidence?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/585"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/586">
+		<description xml:lang="en">What is a Chain of Custody?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/586"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/587">
+		<description xml:lang="en">Conduct a data collection on a hard drive.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/587"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/588">
+		<description xml:lang="en">Validate the integrity of a digital forensics data set.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/588"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/589">
+		<description xml:lang="en">Determine if a digital investigation is sound.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/589"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/590">
+		<description xml:lang="en">Describe the file system structure for a given device (NTFA, MFS, iNode, HFS…)  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/590"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/591">
+		<description xml:lang="en">Determine if a certain string of data exists on a hard drive.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/591"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/592">
+		<description xml:lang="en">Describe the capture of live data for a forensics investigation.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/592"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/593">
+		<description xml:lang="en">Capture and interpret network traffic.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/593"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/594">
+		<description xml:lang="en">Discuss identity management and its role in access control systems.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/594"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/595">
+		<description xml:lang="en">Determine what user was logged onto a given system at a given time.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/595"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/596">
+		<description xml:lang="en">Determine the submissability (from a legal perspective) of data.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/596"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/597">
+		<description xml:lang="en">Evaluate a system for the presence of malware.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/597"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/598">
+		<description xml:lang="en">Explain the need for software security and how software security is different from security features like access control or cryptography.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/598"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/599">
+		<description xml:lang="en">Understand common threats to web applications and common vulnerabilities written by developers. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/599"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/600">
+		<description xml:lang="en">Define least privilege.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/600"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/601">
+		<description xml:lang="en">Define Defense in Depth.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/601"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/602">
+		<description xml:lang="en">Define service isolation in the context of enterprise systems.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/602"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/603">
+		<description xml:lang="en">Architect an enterprise system using the concept of service isolation.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/603"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/604">
+		<description xml:lang="en">Describe the methods to provide for access control and what enterprise services must exist.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/604"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/605">
+		<description xml:lang="en">Discuss how user systems integrate into an enterprise environment.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/605"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/606">
+		<description xml:lang="en">Discuss the risks client systems pose to an enterprise environment.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/606"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/607">
+		<description xml:lang="en">Describe various methods to manage client systems.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/607"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/608">
+		<description xml:lang="en">Create a risk model of a web application, ranking and detailing the risks to the systemquot;s assets. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/608"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/609">
+		<description xml:lang="en">Construct, document, and analyze security requirements with abuse cases and constraints.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/609"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/610">
+		<description xml:lang="en">Apply secure design principles, such as least privilege, to the design of a web application.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/610"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/611">
+		<description xml:lang="en">Validate both the input and output of a web application.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/611"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/612">
+		<description xml:lang="en">Use cryptography appropriately, including SSL and certificate management.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/612"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/613">
+		<description xml:lang="en">Create a test plan and conduct thorough testing of web applications with appropriate software assistance.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/613"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/614">
+		<description xml:lang="en">Describe the Design Principles for Protection Mechanisms (Saltzer and Schroeder )  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/614"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/615">
+		<description xml:lang="en">Describe the Principles for Software Security (Viega and McGraw)  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/615"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/616">
+		<description xml:lang="en">Define Principles for a Secure Design (Morrie Gasser)  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/616"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/617">
+		<description xml:lang="en">Compare the principles for software and systems in the context of a software development effort. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/617"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/618">
+		<description xml:lang="en">Discuss the benefits and drawbacks of open-source vs proprietary software and security  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/618"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/619">
+		<description xml:lang="en">Integrate trustworthy development practices into an existing software development lifecycle  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/619"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/620">
+		<description xml:lang="en">Integrate authenticating libraries, DLL, run-time   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/620"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/621">
+		<description xml:lang="en">Identify a buffer overflow in a code sample  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/621"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/622">
+		<description xml:lang="en">Describe the difference between static and dynamic analysis.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/622"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/623">
+		<description xml:lang="en">Conduct static analysis to determine the security posture of a given application.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/623"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/624">
+		<description xml:lang="en">Monitor the execution of a software (dynamic analysis) and discuss the observed process flows. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/624"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/625">
+		<description xml:lang="en">How is quality assurance conducted for software development?  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/625"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/626">
+		<description xml:lang="en">Participate in a code review focused on finding security bugs using static analysis tools.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/626"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/627">
+		<description xml:lang="en">Where does patch management fit in a software development project?   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/627"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/628">
+		<description xml:lang="en">Describe how humans gain access to information and data to support their needs  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/628"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/629">
+		<description xml:lang="en">Compare and contrast information with data and knowledge  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/629"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/630">
+		<description xml:lang="en">Demonstrate uses of explicitly stored metadataschema associated with data  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/630"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/631">
+		<description xml:lang="en">Identify issues of data persistence to an organization  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/631"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/633">
+		<description xml:lang="en">Explain uses of declarative queries  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/633"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/634">
+		<description xml:lang="en">Give a declarative version for a navigational query  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/634"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/635">
+		<description xml:lang="en">Describe several technical solutions to the problems related to information privacy, integrity, security, and preservation</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/635"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/636">
+		<description xml:lang="en">Explain measures of efficiency (throughput, response time) and effectiveness (recall, precision)  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/636"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/637">
+		<description xml:lang="en">Describe approaches that scale up to globally networked systems   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/637"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/638">
+		<description xml:lang="en">Identify vulnerabilities and failure scenarios in common forms of information systems   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/638"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/639">
+		<description xml:lang="en">Explain the characteristics that distinguish the database approach from the traditional approach of programming with data files</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/639"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/640">
+		<description xml:lang="en">Cite the basic goals, functions, models, components, applications, and social impact of database systems  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/640"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/641">
+		<description xml:lang="en">Describe the components of a database system and give examples of their use  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/641"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/642">
+		<description xml:lang="en">Identify major DBMS functions and describe their role in a database system  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/642"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/643">
+		<description xml:lang="en">Explain the concept of data independence and its importance in a database system  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/643"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/644">
+		<description xml:lang="en">Use a declarative query language to elicit information from a database  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/644"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/646">
+		<description xml:lang="en">Categorize data models based on the types of concepts that they provide to describe the database structure—that is, conceptual data model, physical data model, and representational data model</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/647">
+		<description xml:lang="en">Describe the modeling concepts and notation of widely used modeling notation (e.g., ERD notation, and UML), including their use in data modeling</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/647"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/648">
+		<description xml:lang="en">Define the fundamental terminology used in the relational data model  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/648"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/649">
+		<description xml:lang="en">Describe the basic principles of the relational data model  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/649"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/650">
+		<description xml:lang="en">Apply the modeling concepts and notation of the relational data model  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/650"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/651">
+		<description xml:lang="en">Describe the main concepts of the OO model such as object identity, type constructors, encapsulation, inheritance, polymorphism, and versioning</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/651"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/652">
+		<description xml:lang="en">Describe the differences between relational and semi-structured data models  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/652"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/653">
+		<description xml:lang="en">Give a semi-structured equivalent (e.g., in DTD or XML Schema) for a given relational schema </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/653"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/654">
+		<description xml:lang="en">Generate an index file for a collection of resources. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/655">
+		<description xml:lang="en">Explain the role of an inverted index in locating a document in a collection </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/656">
+		<description xml:lang="en">Explain how stemming and stop words affect indexing </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/657">
+		<description xml:lang="en">Identify appropriate indices for given relational schema and query set </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/658">
+		<description xml:lang="en">Estimate time to retrieve information, when indices are used compared to when they are not used. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/659">
+		<description xml:lang="en">Prepare a relational schema from a conceptual model developed using the entity- relationship model </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/660">
+		<description xml:lang="en">Explain and demonstrate the concepts of entity integrity constraint and referential integrity constraint (including definition of the concept of a foreign key). </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/661">
+		<description xml:lang="en">Demonstrate use of the relational algebra operations from mathematical set theory (union, intersection, difference, and Cartesian product) and the relational algebra operations developed specifically for relational databases (select (restrict), project, join, and division). </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/662">
+		<description xml:lang="en">Demonstrate queries in the relational algebra. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/663">
+		<description xml:lang="en">Demonstrate queries in the tuple relational calculus. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/664">
+		<description xml:lang="en">Determine the functional dependency between two or more attributes that are a subset of a relation. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/665">
+		<description xml:lang="en">Connect constraints expressed as primary key and foreign key, with functional dependencies </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/666">
+		<description xml:lang="en">Compute the closure of a set of attributes under given functional dependencies </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/668">
+		<description xml:lang="en">Evaluate a proposed decomposition, to say whether or not it has lossless-join and dependency-preservation </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/669">
+		<description xml:lang="en">Describe what is meant by 1NF, 2NF, 3NF, and BCNF. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/670">
+		<description xml:lang="en">Identify whether a relation is in 1NF, 2NF, 3NF, or BCNF. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/671">
+		<description xml:lang="en">Normalize a 1NF relation into a set of 3NF (or BCNF) relations and denormalize a relational schema. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/672">
+		<description xml:lang="en">Explain the impact of normalization on the efficiency of database operations, especially query optimization. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/673">
+		<description xml:lang="en">Describe what is a multivalued dependency and what type of constraints it specifies. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/674">
+		<description xml:lang="en">Explain why 4NF is useful in schema design. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/675">
+		<description xml:lang="en">Create a relational database schema in SQL that incorporates key, entity integrity, and referential integrity constraints</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/676">
+		<description xml:lang="en">Demonstrate data definition in SQL and retrieving information from a database using the SQL SELECT statement. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/677">
+		<description xml:lang="en">Evaluate a set of query processing strategies and select the optimal strategy. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/678">
+		<description xml:lang="en">Create a non-procedural query by filling in templates of relations to construct an example of the desired query result </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/679">
+		<description xml:lang="en">Embed object-oriented queries into a stand-alone language such as C++ or Java (e.g., SELECT Col.Method() FROM Object). </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/680">
+		<description xml:lang="en">Write a stored procedure that deals with parameters and has some control flow, to provide a given functionality</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/681">
+		<description xml:lang="en">Create a transaction by embedding SQL into an application program. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/682">
+		<description xml:lang="en">Explain the concept of implicit commits. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/683">
+		<description xml:lang="en">Describe the issues specific to efficient transaction execution. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/684">
+		<description xml:lang="en">Explain when and why rollback is needed and how logging assures proper rollback. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/685">
+		<description xml:lang="en">Explain the effect of different isolation levels on the concurrency control mechanisms. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/686">
+		<description xml:lang="en">Choose the proper isolation level for implementing a specified transaction protocol. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/687">
+		<description xml:lang="en">Explain the techniques used for data fragmentation, replication, and allocation during the distributed database design process. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/688">
+		<description xml:lang="en">Evaluate simple strategies for executing a distributed query to select the strategy that minimizes the amount of data transfer. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/689">
+		<description xml:lang="en">Explain how the two-phase commit protocol is used to deal with committing a transaction that accesses databases stored on multiple nodes. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/690">
+		<description xml:lang="en">Describe distributed concurrency control based on the distinguished copy techniques and the voting method</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/691">
+		<description xml:lang="en">Describe the three levels of software in the client-server model. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/692">
+		<description xml:lang="en">Explain the concepts of records, record types, and files, as well as the different techniques for placing file records on disk.</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/693">
+		<description xml:lang="en">Give examples of the application of primary, secondary, and clustering indexes. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/694">
+		<description xml:lang="en">Distinguish between a non-dense index and a dense index. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/695">
+		<description xml:lang="en">Implement dynamic multilevel indexes using B-trees. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/696">
+		<description xml:lang="en">Explain the theory and application of internal and external hashing techniques. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/697">
+		<description xml:lang="en">Use hashing to facilitate dynamic file expansion. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/698">
+		<description xml:lang="en">Describe the relationships among hashing, compression, and efficient database searches. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/699">
+		<description xml:lang="en">Evaluate costs and benefits of various hashing schemes. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/700">
+		<description xml:lang="en">Explain how physical database design affects database transaction efficiency. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/701">
+		<description xml:lang="en">Compare and contrast different conceptions of data mining as evidenced in both research and application. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/702">
+		<description xml:lang="en">Explain the role of finding associations in commercial market basket data. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/703">
+		<description xml:lang="en">Characterize the kinds of patterns that can be discovered by association rule mining. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/704">
+		<description xml:lang="en">Describe how to extend a relational system to find patterns using association rules. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/705">
+		<description xml:lang="en">Evaluate methodological issues underlying the effective application of data mining. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/706">
+		<description xml:lang="en">Identify and characterize sources of noise, redundancy, and outliers in presented data. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/707">
+		<description xml:lang="en">Identify mechanisms (on-line aggregation, anytime behavior, interactive visualization) to close the loop in the data mining process. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/708">
+		<description xml:lang="en">Describe why the various close-the-loop processes improve the effectiveness of data mining. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/709">
+		<description xml:lang="en">Explain basic information storage and retrieval concepts. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/710">
+		<description xml:lang="en">Describe what issues are specific to efficient information retrieval. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/711">
+		<description xml:lang="en">Give applications of alternative search strategies and explain why the particular search strategy is appropriate for the application. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/712">
+		<description xml:lang="en">Perform Internet-based research. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/713">
+		<description xml:lang="en">Design and implement a small to medium size information storage and retrieval system, or digital library. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/714">
+		<description xml:lang="en">Describe some of the technical solutions to the problems related to archiving and preserving information in a digital library. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/715">
+		<description xml:lang="en">Describe Turing test and the Chinese Room thought experiment.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/715"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/716">
+		<description xml:lang="en">Differentiate between the concepts of optimal reasoningbehavior and human-like reasoningbehavior. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/716"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/717">
+		<description xml:lang="en">Describe a given problem domain using the characteristics of the environments in which intelligent systems must function</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/717"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/718">
+		<description xml:lang="en">Formulate an efficient problem space for a problem expressed in natural language (e.g., English) in terms of initial and goal states, and operators</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/718"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/719">
+		<description xml:lang="en">Describe the role of heuristics and describe the trade-offs among completeness, optimality, time complexity, and space complexity. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/719"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/720">
+		<description xml:lang="en">Describe the problem of combinatorial explosion of search space and its consequences.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/720"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/721">
+		<description xml:lang="en">Select and implement an appropriate uninformed search algorithm for a problem, and characterize its time and space complexities</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/721"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/721"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/722">
+		<description xml:lang="en">Select and implement an appropriate informed search algorithm for a problem by designing the necessary heuristic evaluation function.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/722"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/722"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/723">
+		<description xml:lang="en">Evaluate whether a heuristic for a given problem is admissiblecan guarantee optimal solution.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/723"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/724">
+		<description xml:lang="en">Formulate a problem specified in natural language (e.g., English) as a constraint-satisfaction problem and implement it using a chronological backtracking algorithm or stochastic local search.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/724"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/725">
+		<description xml:lang="en">Compare and contrast basic search issues with game playing issues</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/725"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/726">
+		<description xml:lang="en">Translate a natural language (e.g., English) sentence into predicate logic statement.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/726"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/727">
+		<description xml:lang="en">Convert a quantified logic statement into clause form.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/727"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/728">
+		<description xml:lang="en">Apply resolution to a set of logic statements to answer a query.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/728"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/729">
+		<description xml:lang="en">Apply Bayes theorem to determine conditional probabilities in a problem.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/729"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/730">
+		<description xml:lang="en">Identify examples of classification tasks, including the available input features and output to be predicted. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/730"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/731">
+		<description xml:lang="en">Explain the difference between inductive and deductive learning.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/731"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/732">
+		<description xml:lang="en">Apply the simple statistical learning algorithm such as Naive Bayesian Classifier to a classification task and measure the classifiers accuracy. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/732"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/733">
+		<description xml:lang="en">Design and implement a genetic algorithm solution to a problem.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/733"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/734">
+		<description xml:lang="en">Design and implement a simulated annealing schedule to avoid local minima in a problem.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/734"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/735">
+		<description xml:lang="en">Design and implement A*beam search to solve a problem.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/735"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/736">
+		<description xml:lang="en">Apply minimax search with alpha-beta pruning to prune search space in a two-player game.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/736"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/737">
+		<description xml:lang="en">Compare and contrast genetic algorithms with classic search techniques.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/737"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/738">
+		<description xml:lang="en">Compare and contrast various heuristic searches vis-a-vis applicability to a given problem.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/738"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/739">
+		<description xml:lang="en">Compare and contrast the most common models used for structured knowledge representation, highlighting their strengths and weaknesses.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/739"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/740">
+		<description xml:lang="en">Identify the components of non-monotonic reasoning and its usefulness as a representational mechanisms for belief systems.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/740"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/741">
+		<description xml:lang="en">Compare and contrast the basic techniques for representing uncertainty.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/741"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/741"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/742">
+		<description xml:lang="en">Compare and contrast the basic techniques for qualitative representation.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/742"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/742"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/743">
+		<description xml:lang="en">Apply situation and event calculus to problems of action and change.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/743"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/744">
+		<description xml:lang="en">Explain the distinction between temporal and spatial reasoning, and how they interrelate.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/744"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/744"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/745">
+		<description xml:lang="en">Explain the difference between rule-based, case-based and model-based reasoning techniques</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/745"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/745"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/746">
+		<description xml:lang="en">Define the concept of a planning system and how they differ from classical search techniques.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/746"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/746"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/747">
+		<description xml:lang="en">Describe the differences between planning as search, operator-based planning, and propositional planning, providing examples of domains where each is most applicable.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/747"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/747"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/748">
+		<description xml:lang="en">Explain the distinction between monotonic and non-monotonic inference.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/748"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/749">
+		<description xml:lang="en">Apply Bayesquot; rule to determine the probability of a hypothesis given evidence.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/749"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/750">
+		<description xml:lang="en">Explain how conditional independence assertions allow for greater efficiency of probabilistic systems. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/750"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/751">
+		<description xml:lang="en">Identify examples of knowledge representations for reasoning under uncertainty.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/751"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/752">
+		<description xml:lang="en">State the complexity of exact inference.  Identify methods for approximate inference.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/752"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/753">
+		<description xml:lang="en">Design and implement at least one knowledge representation for reasoning under uncertainty.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/753"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/754">
+		<description xml:lang="en">Describe the complexities of temporal probabilistic reasoning.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/754"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/755">
+		<description xml:lang="en">Explain the complexities of temporal probabilistic reasoning.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/755"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/756">
+		<description xml:lang="en">Design and implement an HMM as one example of a temporal probabilistic system.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/756"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/757">
+		<description xml:lang="en">Describe the relationship between preferences and utility functions.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/757"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/758">
+		<description xml:lang="en">Explain how utility functions and probabilistic reasoning can be combined to make rational decisions.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/758"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/759">
+		<description xml:lang="en">List the defining characteristics of an intelligent agent.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/759"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/760">
+		<description xml:lang="en">Characterize and contrast the standard agent architectures.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/760"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/761">
+		<description xml:lang="en">Describe the applications of agent theory to domains such as software agents, personal assistants, and believable agents. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/761"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/762">
+		<description xml:lang="en">Describe the primary paradigms used by learning agents.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/762"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/763">
+		<description xml:lang="en">Demonstrate using appropriate examples how multi-agent systems support agent interaction.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/763"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/764">
+		<description xml:lang="en">Define and contrast deterministic and stochastic grammars, providing examples to show the adequacy of each</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/764"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/765">
+		<description xml:lang="en">Simulate, apply, or implement classic and stochastic algorithms for parsing natural language.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/765"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/766">
+		<description xml:lang="en">Identify the challenges of representing meaning.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/766"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/767">
+		<description xml:lang="en">List the advantages of using standard corpora.  Identify examples of current corpora for a variety of NLP tasks</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/767"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/768">
+		<description xml:lang="en">Identify techniques for information retrieval, language translation, and text classification.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/768"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/769">
+		<description xml:lang="en">Explain the differences among the three main styles of learning: supervised, reinforcement, and unsupervised.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/769"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/770">
+		<description xml:lang="en">Implement simple algorithms for supervised learning, reinforcement learning, and unsupervised learning. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/770"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/771">
+		<description xml:lang="en">Determine which of the three learning styles is appropriate to a particular problem domain.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/771"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/772">
+		<description xml:lang="en">Compare and contrast each of the following techniques, providing examples of when each strategy is superior: decision trees, neural networks, and belief networks.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/772"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/773">
+		<description xml:lang="en">Evaluate the performance of a simple learning system on a real-world dataset.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/773"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/774">
+		<description xml:lang="en">Characterize the state of the art in learning theory, including its achievements and its shortcomings.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/774"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/775">
+		<description xml:lang="en">Explain the problem of overfitting, along with techniques for detecting and managing the problem. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/775"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/776">
+		<description xml:lang="en">List capabilities and limitations of todays state-of-the-art robot systems, including their sensors and the crucial sensor processing that informs those systems. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/776"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/777">
+		<description xml:lang="en">Integrate sensors, actuators, and software into a robot designed to undertake some task.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/777"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/779">
+		<description xml:lang="en">Implement fundamental motion planning algorithms within a robot configuration space.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/779"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/780">
+		<description xml:lang="en">Characterize the uncertainties associated with common robot sensors and actuators; articulate strategies for mitigating these uncertainties</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/780"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/783">
+		<description xml:lang="en">Describe at least one approach for coordinating the actions and sensing of several robots to accomplish a single task</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/783"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/784">
+		<description xml:lang="en">Summarize the importance of image and object recognition in AI and indicate several significant applications of this technology</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/784"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/785">
+		<description xml:lang="en">List at least three image-segmentation approaches, such as thresholding, edge-based and region-based algorithms, along with their defining characteristics, strengths, and weaknesses.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/785"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/786">
+		<description xml:lang="en">Implement 2d object recognition based on contour- andor region-based shape representations. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/786"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/787">
+		<description xml:lang="en">Distinguish the goals of sound-recognition, speech-recognition, and speaker-recognition and identify how the raw audio signal will be handled differently in each of these cases. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/787"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/788">
+		<description xml:lang="en">Provide at least two examples of a transformation of a data source from one sensory domain to another,e.g., tactile data interpreted as single-band 2d images.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/788"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/789">
+		<description xml:lang="en">Implement a feature-extraction algorithm on real data, e.g., an edge or corner detector for images or vectors of Fourier coefficients describing a short slice of audio signal.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/789"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/790">
+		<description xml:lang="en">Implement an algorithm combining features into higher-level percepts, e.g., a contour or polygon from visual primitives or phoneme hypotheses from an audio signal</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/790"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/791">
+		<description xml:lang="en">Implement a classification algorithm that segments input percepts into output categories and quantitatively evaluates the resulting classification.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/791"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/792">
+		<description xml:lang="en">Evaluate the performance of the underlying feature-extraction, relative to at least one alternative possible approach (whether implemented or not) in its contribution to the classification task (8), above.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/792"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/793">
+		<description xml:lang="en">Describe at least three classification approaches, their prerequisites for applicability, their strengths, and their shortcomings.                     </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/793"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/794">
+		<description xml:lang="en">Articulate the organization of the Internet  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/794"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/795">
+		<description xml:lang="en">List and define the appropriate network terminology  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/795"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/796">
+		<description xml:lang="en">Describe the layered structure of a typical networked architecture  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/796"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/797">
+		<description xml:lang="en">Identify the different levels of complexity in a network (edges, core, etc.)  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/797"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/798">
+		<description xml:lang="en">List the differences and the relations between names and addresses in a network  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/798"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/799">
+		<description xml:lang="en">Define the principles behind DNS and HTTP  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/799"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/800">
+		<description xml:lang="en">Be able to implement a simple client-server socket-based application  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/800"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/801">
+		<description xml:lang="en">Describe the operation of reliable delivery protocols  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/801"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/802">
+		<description xml:lang="en">List the factors that affect the performance of reliable delivery protocols  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/802"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/803">
+		<description xml:lang="en">Design and implement a simple reliable protocol  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/803"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/804">
+		<description xml:lang="en">Describe the organization of the network layer  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/804"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/805">
+		<description xml:lang="en">Describe how packets are forwarded in an IP networks  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/805"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/806">
+		<description xml:lang="en">List the scalability benefits of hierarchical addressing  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/806"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/807">
+		<description xml:lang="en">List the major steps in solving the multiple access problem  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/807"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/808">
+		<description xml:lang="en">Describe how frames are forwarded in an Ethernet network  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/808"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/809">
+		<description xml:lang="en">Identify the differences between IP and Ethernet  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/809"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/810">
+		<description xml:lang="en">Describe the interrelations between IP and Ethernet  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/810"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/811">
+		<description xml:lang="en">Describe how resources can be allocated in a network  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/811"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/812">
+		<description xml:lang="en">Describe the congestion problem in a large network  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/812"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/813">
+		<description xml:lang="en">Compare and contrast the fixed and dynamic allocation techniques  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/813"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/814">
+		<description xml:lang="en">Describe the organization of a wireless network  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/814"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/815">
+		<description xml:lang="en">Describe how wireless networks support mobile users  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/815"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/816">
+		<description xml:lang="en">Explain the objectives and functions of modern operating systems [Knowledge]. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/816"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/817">
+		<description xml:lang="en">Analyze the tradeoffs inherent in operating system design [Application]. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/817"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/818">
+		<description xml:lang="en">Describe the functions of a contemporary operating system with respect to convenience, efficiency, and the ability to evolve</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/818"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/819">
+		<description xml:lang="en">Discuss networked, client-server, distributed operating systems and how they differ from single user operating systems</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/819"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/820">
+		<description xml:lang="en">Identify potential threats to operating systems and the security features design to guard against them </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/820"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/821">
+		<description xml:lang="en">Explain the concept of a logical layer  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/821"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/822">
+		<description xml:lang="en">Explain the benefits of building abstract layers in hierarchical fashion  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/822"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/823">
+		<description xml:lang="en">Defend the need for APIs and middleware  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/823"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/824">
+		<description xml:lang="en">Describe how computing resources are used by application software and managed by system software </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/824"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/825">
+		<description xml:lang="en">Contrast kernel and user mode in an operating system  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/825"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/826">
+		<description xml:lang="en">Discuss the advantages and disadvantages of using interrupt processing  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/826"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/827">
+		<description xml:lang="en">Explain the use of a device list and driver IO queue  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/827"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/828">
+		<description xml:lang="en">Describe the need for concurrency within the framework of an operating system  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/828"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/829">
+		<description xml:lang="en">Demonstrate the potential run-time problems arising from the concurrent operation of many separate tasks </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/829"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/830">
+		<description xml:lang="en">Summarize the range of mechanisms that can be employed at the operating system level to realize concurrent systems and describe the benefits of each</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/830"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/831">
+		<description xml:lang="en">Explain the different states that a task may pass through and the data structures needed to support the management of many tasks</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/831"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/832">
+		<description xml:lang="en">Summarize techniques for achieving synchronization in an operating system (e.g., describe how to implement a semaphore using OS primitives)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/832"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/833">
+		<description xml:lang="en">Describe reasons for using interrupts, dispatching, and context switching to support concurrency in an operating system</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/833"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/834">
+		<description xml:lang="en">Create state and transition diagrams for simple problem domains</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/834"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/835">
+		<description xml:lang="en">Compare and contrast the common algorithms used for both preemptive and non-preemptive scheduling of tasks in operating systems, such as priority, performance comparison, and fair-share schemes</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/835"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/836">
+		<description xml:lang="en">Describe relationships between scheduling algorithms and application domains  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/836"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/837">
+		<description xml:lang="en">Discuss the types of processor scheduling such as short-term, medium-term, long-term, and IO </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/837"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/838">
+		<description xml:lang="en">Describe the difference between processes and threads  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/838"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/839">
+		<description xml:lang="en">Compare and contrast static and dynamic approaches to real-time scheduling  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/839"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/840">
+		<description xml:lang="en">Discuss the need for preemption and deadline scheduling  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/840"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/841">
+		<description xml:lang="en">Identify ways that the logic embodied in scheduling algorithms are applicable to other domains, such as disk IO, network scheduling, project scheduling, and problems beyond computing</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/841"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/842">
+		<description xml:lang="en">Explain memory hierarchy and cost-performance trade-offs  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/842"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/843">
+		<description xml:lang="en">Summarize the principles of virtual memory as applied to caching and paging  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/843"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/844">
+		<description xml:lang="en">Evaluate the trade-offs in terms of memory size (main memory, cache memory, auxiliary memory) and processor speed </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/844"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/845">
+		<description xml:lang="en">Defend the different ways of allocating memory to tasks, citing the relative merits of each  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/845"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/846">
+		<description xml:lang="en">Describe the reason for and use of cache memory (performance and proximity, different dimension of how caches complicate isolation and VM abstraction)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/846"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/847">
+		<description xml:lang="en">Discuss the concept of thrashing, both in terms of the reasons it occurs and the techniques used to recognize and manage the problem</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/847"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/849">
+		<description xml:lang="en">Summarize the features and limitations of an operating system used to provide protection and security (cross reference IASSecurity Architecture and Systems Administration) </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/849"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/851">
+		<description xml:lang="en">Carry out simple system administration tasks according to a security policy, for example creating accounts, setting permissions, applying patches, and arranging for regular backups (cross reference IASSecurity Architecture and Systems Administration )</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/851"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/852">
+		<description xml:lang="en">Explain the concept of virtual memory and how it is realized in hardware and software  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/852"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/853">
+		<description xml:lang="en">Differentiate emulation and isolation  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/853"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/854">
+		<description xml:lang="en">Evaluate virtualization trade-offs  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/854"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/855">
+		<description xml:lang="en">Discuss hypervisors and the need for them in conjunction with different types of hypervisors  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/855"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/856">
+		<description xml:lang="en">Explain the key difference between serial and parallel devices and identify the conditions in which each is appropriate </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/856"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/857">
+		<description xml:lang="en">Identify the relationship between the physical hardware and the virtual devices maintained by the operating system</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/857"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/858">
+		<description xml:lang="en">Explain buffering and describe strategies for implementing it  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/858"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/859">
+		<description xml:lang="en">Differentiate the mechanisms used in interfacing a range of devices (including hand-held devices, networks, multimedia) to a computer and explain the implications of these for the design of an operating system</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/859"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/860">
+		<description xml:lang="en">Describe the advantages and disadvantages of direct memory access and discuss the circumstances in which its use is warranted</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/860"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/861">
+		<description xml:lang="en">Identify the requirements for failure recovery  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/861"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/862">
+		<description xml:lang="en">Implement a simple device driver for a range of possible devices  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/862"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/863">
+		<description xml:lang="en">Summarize the full range of considerations in the design of file systems  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/863"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/864">
+		<description xml:lang="en">Compare and contrast different approaches to file organization, recognizing the strengths and weaknesses of each</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/864"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/865">
+		<description xml:lang="en">Summarize how hardware developments have led to changes in the priorities for the design and the management of file systems</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/865"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/866">
+		<description xml:lang="en">Summarize the use of journaling and how log-structured file systems enhance fault tolerance</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/866"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/867">
+		<description xml:lang="en">Describe what makes a system a real-time system  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/867"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/868">
+		<description xml:lang="en">Explain the presence of and describe the characteristics of latency in real-time systems  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/868"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/869">
+		<description xml:lang="en">Summarize special concerns that real-time systems present and how these concerns are addressed </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/869"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/870">
+		<description xml:lang="en">Explain the relevance of the terms fault tolerance, reliability, and availability  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/870"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/871">
+		<description xml:lang="en">Outline the range of methods for implementing fault tolerance in an operating system </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/871"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/872">
+		<description xml:lang="en">Explain how an operating system can continue functioning after a fault occurs  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/872"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/873">
+		<description xml:lang="en">Describe the performance measurements used to determine how a system performs  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/873"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/874">
+		<description xml:lang="en">Explain the main evaluation models used to evaluate a system  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/874"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/875">
+		<description xml:lang="en">Describe how platform-based development differs from general purpose programming  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/875"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/876">
+		<description xml:lang="en">List characteristics of platform languages  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/876"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/877">
+		<description xml:lang="en">Write and execute a simple platform-based program  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/877"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/878">
+		<description xml:lang="en">List the advantages and disadvantages of programming with platform constraints  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/878"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/879">
+		<description xml:lang="en">Design and Implement a simple web application   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/879"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/880">
+		<description xml:lang="en">Describe the constraints that the web puts on developers [  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/880"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/881">
+		<description xml:lang="en">Compare and contrast web programming with general purpose programming  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/881"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/882">
+		<description xml:lang="en">Describe the differences between Software-as-a-Service and traditional software products  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/882"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/883">
+		<description xml:lang="en">Design and implement a mobile application for a given mobile platform.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/883"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/884">
+		<description xml:lang="en">Discuss the constraints that mobile platforms put on developers  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/884"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/885">
+		<description xml:lang="en">Discuss the performance vs. power tradeoff  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/885"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/886">
+		<description xml:lang="en">Compare and Contrast mobile programming with general purpose programming  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/886"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/887">
+		<description xml:lang="en">Design and implement an industrial application on a given platform (Lego Mindstorms, Matlab, etc.) </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/887"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/888">
+		<description xml:lang="en">Compare and contrast domain specific languages with general purpose programming languages.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/888"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/889">
+		<description xml:lang="en">Discuss the constraints that a given industrial platforms impose on developers  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/889"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/890">
+		<description xml:lang="en">Design and Implement a simple application on a game platform.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/890"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/891">
+		<description xml:lang="en">Describe the constraints that game platforms impose on developers.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/891"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/892">
+		<description xml:lang="en">Compare and contrast game programming with general purpose programming  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/892"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/893">
+		<description xml:lang="en">Distinguish using computational resources for a faster answer from managing efficient access to a shared resource</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/893"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/894">
+		<description xml:lang="en">Distinguish multiple sufficient programming constructs for synchronization that may be inter-implementable but have complementary advantages</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/894"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/895">
+		<description xml:lang="en">Distinguish data races from higher level races</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/895"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/896">
+		<description xml:lang="en">Explain why synchronization is necessary in a specific parallel program  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/896"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/897">
+		<description xml:lang="en">Write a correct and scalable parallel algorithm  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/897"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/898">
+		<description xml:lang="en">Parallelize an algorithm by applying task-based decomposition  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/898"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/899">
+		<description xml:lang="en">Parallelize an algorithm by applying data-parallel decomposition  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/899"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/900">
+		<description xml:lang="en">Use mutual exclusion to avoid a given race condition  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/900"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/901">
+		<description xml:lang="en">Give an example of an ordering of accesses among concurrent activities that is not sequentially consistent </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/901"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/902">
+		<description xml:lang="en">Give an example of a scenario in which blocking message sends can deadlock  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/902"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/903">
+		<description xml:lang="en">Explain when and why multicast or event-based messaging can be preferable to alternatives  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/903"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/904">
+		<description xml:lang="en">Write a program that correctly terminates when all of a set of concurrent tasks have completed </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/904"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/905">
+		<description xml:lang="en">Use a properly synchronized queue to buffer data passed among activities</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/905"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/906">
+		<description xml:lang="en">Explain why checks for preconditions, and actions based on these checks, must share the same unit of atomicity to be effective</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/906"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/907">
+		<description xml:lang="en">Write a test program that can reveal a concurrent programming error; for example, missing an update when two activities both try to increment a variable</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/907"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/908">
+		<description xml:lang="en">Describe at least one design technique for avoiding liveness failures in programs using multiple locks or semaphores</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/908"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/909">
+		<description xml:lang="en">Describe the relative merits of optimistic versus conservative concurrency control under different rates of contention among updates</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/909"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/910">
+		<description xml:lang="en">Give an example of a scenario in which an attempted optimistic update may never complete</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/910"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/911">
+		<description xml:lang="en">Use semaphores or condition variables to block threads until a necessary precondition holds</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/911"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/912">
+		<description xml:lang="en">Define critical path, work, and span  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/912"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/913">
+		<description xml:lang="en">Compute the work and span, and determine the critical path with respect to a parallel execution diagram </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/913"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/914">
+		<description xml:lang="en">Define speed-up and explain the notion of an algorithmquot;s scalability in this regard  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/914"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/915">
+		<description xml:lang="en">Identify independent tasks in a program that may be parallelized  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/915"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/916">
+		<description xml:lang="en">Characterize features of a workload that allow or prevent it from being naturally parallelized  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/916"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/918">
+		<description xml:lang="en">Decompose a problem (e.g., counting the number of occurrences of some word in a document) via map and reduce operations</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/918"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/919">
+		<description xml:lang="en">Provide an example of a problem that fits the producer-consumer paradigm  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/919"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/920">
+		<description xml:lang="en">Give examples of problems where pipelining would be an effective means of parallelization  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/920"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/921">
+		<description xml:lang="en">Identify issues that arise in producer-consumer algorithms and mechanisms that may be used for addressing them</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/921"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/922">
+		<description xml:lang="en">Describe the SMP architecture and note its key features  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/922"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/923">
+		<description xml:lang="en">Characterize the kinds of tasks that are a natural match for SIMD machines  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/923"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/924">
+		<description xml:lang="en">Explain the features of each classification in Flynnquot;s taxonomy  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/924"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/925">
+		<description xml:lang="en">Explain the differences between shared and distributed memory  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/925"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/926">
+		<description xml:lang="en">Describe the challenges in maintaining cache coherence  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/926"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/927">
+		<description xml:lang="en">Describe the key features of different distributed system topologies  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/927"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/928">
+		<description xml:lang="en">Calculate the implications of Amdahlquot;s law for a particular parallel algorithm  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/928"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/929">
+		<description xml:lang="en">Describe how data distributionlayout can affect an algorithmquot;s communication costs </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/929"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/930">
+		<description xml:lang="en">Detect and correct a load imbalance  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/930"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/931">
+		<description xml:lang="en">Detect and correct an instance of false sharing  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/931"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/932">
+		<description xml:lang="en">Explain the impact of scheduling on parallel performance  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/932"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/933">
+		<description xml:lang="en">Explain performance impacts of data locality  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/933"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/934">
+		<description xml:lang="en">Explain the impact and trade-off related to power usage on parallel performance  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/934"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/935">
+		<description xml:lang="en">Distinguish network faults from other kinds of failures  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/935"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/936">
+		<description xml:lang="en">Explain why synchronization constructs such as simple locks are not useful in the presence of distributed faults</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/936"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/937">
+		<description xml:lang="en">Give examples of problems for which consensus algorithms such as leader election are required </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/937"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/938">
+		<description xml:lang="en">Write a program that performs any required marshalling and conversion into message units, such as packets, to communicate interesting data between two hosts</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/938"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/939">
+		<description xml:lang="en">Measure the observed throughput and response latency across hosts in a given network  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/939"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/940">
+		<description xml:lang="en">Explain why no distributed system can be simultaneously consistent, available, and partition tolerant </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/940"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/941">
+		<description xml:lang="en">Implement a simple server -- for example, a spell checking service  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/941"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/942">
+		<description xml:lang="en">Explain the tradeoffs among overhead, scalability, and fault tolerance when choosing a stateful v. stateless design for a given service</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/942"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/943">
+		<description xml:lang="en">Describe the scalability challenges associated with a service growing to accommodate many clients, as well as those associated with a service only transiently having many clients</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/943"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/944">
+		<description xml:lang="en">Model a concurrent process using a formal model, such as pi-calculus  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/944"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/945">
+		<description xml:lang="en">Explain the characteristics of a particular formal parallel model  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/945"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/946">
+		<description xml:lang="en">Formally model a shared memory system to show if it is consistent  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/946"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/947">
+		<description xml:lang="en">Use a model to show progress guarantees in a parallel algorithm  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/947"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/948">
+		<description xml:lang="en">Use formal techniques to show that a parallel algorithm is correct with respect to a safety or liveness property</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/948"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/949">
+		<description xml:lang="en">Decide if a specific execution is linearizable or not</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/949"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/951">
+		<description xml:lang="en">Use subclassing to design simple class hierarchies that allow code to be reused for distinct subclasses</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/951"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/951"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/951"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/951"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/951"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/951"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/952">
+		<description xml:lang="en">Use multiple encapsulation mechanisms, such as function closures, object-oriented interfaces, and support for abstract datatypes, in multiple programming languages</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/952"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/952"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/952"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/952"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/952"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/952"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/953">
+		<description xml:lang="en">Define and use iterators and other operations on aggregates using idioms most natural in multiple programming languages, including taking functions as arguments. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/953"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/953"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/953"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/953"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/953"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/953"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/954">
+		<description xml:lang="en">Write basic algorithms that avoid assigning to mutable state or considering object identity.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/954"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/954"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/954"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/954"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/954"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/954"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/955">
+		<description xml:lang="en">Write event handlers for use in reactive systems, such as GUIs.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/955"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/955"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/955"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/955"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/955"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/955"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/956">
+		<description xml:lang="en">Explain the relationship between object-oriented inheritance (code-sharing and overriding) and subtyping (the idea of a subtype being usable in a context that expects the supertype)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/956"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/956"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/956"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/956"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/956"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/956"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/957">
+		<description xml:lang="en">Explain benefits and limitations of static typing</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/957"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/957"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/957"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/957"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/957"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/957"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/958">
+		<description xml:lang="en">For multiple programming languages, identify program properties checked statically and program properties checked dynamically.  Use this knowledge when writing and debugging programs.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/958"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/958"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/958"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/958"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/958"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/958"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/959">
+		<description xml:lang="en">Distinguish a language definition (what constructs mean) from a particular language implementation (compiler vs. interpreter, run-time representation of data objects, etc.).</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/959"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/959"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/959"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/959"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/959"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/959"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/960">
+		<description xml:lang="en">Explain how programming language implementations typically organize memory into global data, text, heap, and stack sections and how features such as recursion and  memory management map to this memory model. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/960"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/960"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/960"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/960"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/960"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/960"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/961">
+		<description xml:lang="en">Reason about memory leaks, dangling-pointer dereferences, and the benefits and limitations of garbage collection</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/961"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/961"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/961"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/961"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/961"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/961"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/962">
+		<description xml:lang="en">Process some representation of code for some purpose, such as an interpreter, an expression optimizer, a documentation generator, etc</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/962"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/962"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/962"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/962"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/962"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/962"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1028">
+		<description xml:lang="en">Use formal grammars to specify the syntax of languages</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1028"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1029">
+		<description xml:lang="en">Use declarative tools to generate parsers and scanners.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1029"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1030">
+		<description xml:lang="en">Identify key issues in syntax definitions: ambiguity, associativity, precedence.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1030"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1031">
+		<description xml:lang="en">Implement context-sensitive, source-level static analyses such as type-checkers or resolving identifiers to identify their binding occurrences</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1031"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1032">
+		<description xml:lang="en">Identify all essential steps for automatically converting source code into assembly or other low-level languages</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1032"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1033">
+		<description xml:lang="en">Generate the low-level code for calling functionsmethods in modern languages.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1033"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1034">
+		<description xml:lang="en">Discuss opportunities for optimization introduced by naive translation and approaches for achieving optimization</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1034"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1035">
+		<description xml:lang="en">Compare the benefits of different memory-management schemes, using concepts such as fragmentation, locality, and memory overhead</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1035"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1036">
+		<description xml:lang="en">Discuss benefits and limitations of automatic memory management. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1036"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1037">
+		<description xml:lang="en">Identify the services provided by modern language run-time systems. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1037"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1038">
+		<description xml:lang="en">Discuss advantages, disadvantages, and difficulties of dynamic recompilation.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1038"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1039">
+		<description xml:lang="en">Define useful static analyses in terms of a conceptual framework such as dataflow analysis. [Application] </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/1040">
+		<description xml:lang="en">Communicate why an analysis is correct (sound and terminating).  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1040"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1041">
+		<description xml:lang="en">Distinguish may and must analyses.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1041"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1042">
+		<description xml:lang="en">Explain why potential aliasing limits sound program analysis and how alias analysis can help.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1042"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1043">
+		<description xml:lang="en">Use the results of a static analysis for program optimization andor partial program correctness. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1043"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1044">
+		<description xml:lang="en">Use various advanced programming constructs and idioms correctly.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1044"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1045">
+		<description xml:lang="en">Discuss how various advanced programming constructs aim to improve program structure, software quality, and programmer productivity</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1045"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1046">
+		<description xml:lang="en">Discuss how various advanced programming constructs interact with the definition and implementation of other language features</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1046"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1047">
+		<description xml:lang="en">Write correct concurrent programs using multiple programming models.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1047"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1048">
+		<description xml:lang="en">Explain why programming languages do not guarantee sequential consistency in the presence of data races and what programmers must do as a result. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1048"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1049">
+		<description xml:lang="en">Define a type system precisely and compositionally.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1049"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1050">
+		<description xml:lang="en">For various foundational type constructors, identify the values they describe and the invariants they enforce</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1050"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1051">
+		<description xml:lang="en">Precisely specify the invariants preserved by a sound type system.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1051"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1052">
+		<description xml:lang="en">Give a formal semantics for a small language.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1052"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1053">
+		<description xml:lang="en">Use induction to prove properties of all (or a well-defined subset of) programs in a language.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1053"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1054">
+		<description xml:lang="en">Use language-based techniques to build a formal model of a software system.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1054"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1055">
+		<description xml:lang="en">Discuss the role of concepts such as orthogonality and well-chosen defaults in language design. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1055"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1056">
+		<description xml:lang="en">Use crisp and objective criteria for evaluating language-design decisions. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1056"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1057">
+		<description xml:lang="en">Use a logic language to implement conventional algorithms.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1057"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1058">
+		<description xml:lang="en">Use a logic language to implement algorithms employing implicit search using clauses and relations. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1058"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1059">
+		<description xml:lang="en">Discuss the importance of algorithms in the problem-solving process.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1059"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1060">
+		<description xml:lang="en">Discuss how a problem may be solved by multiple algorithms, each with different properties. [Knowledge]   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1060"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1061">
+		<description xml:lang="en">Create algorithms for solving simple problems.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1061"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1062">
+		<description xml:lang="en">Use pseudocode or a programming language to implement, test, and debug algorithms for solving simple problems</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1062"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1063">
+		<description xml:lang="en">Implement, test, and debug simple recursive functions and procedures.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1063"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1064">
+		<description xml:lang="en">Determine when a recursive solution is appropriate for a problem.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1064"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1065">
+		<description xml:lang="en">Implement a divide-and-conquer algorithm for solving a problem.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1065"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1066">
+		<description xml:lang="en">Apply the techniques of decomposition to break a program into smaller pieces.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1066"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1067">
+		<description xml:lang="en">Identify the data components and behaviors of multiple abstract data types.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1067"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1068">
+		<description xml:lang="en">Implement a coherent abstract data type, with loose coupling between components and behaviors. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1068"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1069">
+		<description xml:lang="en">Identify the relative strengths and weaknesses among multiple designs or implementations for a problem.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1069"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1070">
+		<description xml:lang="en">Analyze and explain the behavior of simple programs involving the fundamental programming constructs covered by this unit</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1070"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1071">
+		<description xml:lang="en">Identify and describe uses of primitive data types.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1071"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1072">
+		<description xml:lang="en">Write programs that use each of the primitive data types.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1072"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1073">
+		<description xml:lang="en">Modify and expand short programs that use standard conditional and iterative control structures and functions</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1073"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1074">
+		<description xml:lang="en">Design, implement, test, and debug a program that uses each of the following fundamental programming constructs: basic computation, simple IO, standard conditional and iterative structures, the definition of functions, and parameter passing.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1074"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1075">
+		<description xml:lang="en">Choose appropriate conditional and iteration constructs for a given programming task. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1075"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1076">
+		<description xml:lang="en">Describe the concept of recursion and give examples of its use.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1076"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1077">
+		<description xml:lang="en">Identify the base case and the general case of a recursively-defined problem. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1077"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1078">
+		<description xml:lang="en">Discuss the appropriate use of built-in data structures.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1078"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1079">
+		<description xml:lang="en">Describe common applications for each data structure in the topic list.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1079"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1080">
+		<description xml:lang="en">Compare alternative implementations of data structures with respect to performance.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1080"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1081">
+		<description xml:lang="en">Write programs that use each of the following data structures: arrays, strings, linked lists, stacks, queues, sets, and maps</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1081"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1082">
+		<description xml:lang="en">Compare and contrast the costs and benefits of dynamic and static data structure implementations. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1082"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1083">
+		<description xml:lang="en">Choose the appropriate data structure for modeling a given problem</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1083"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1084">
+		<description xml:lang="en">Explain why the creation of correct program components is important in the production of quality software. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1084"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1085">
+		<description xml:lang="en">Identify common coding errors that lead to insecure programs (e.g., buffer overflows, memory leaks, malicious code) and apply strategies for avoiding such errors.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1085"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1086">
+		<description xml:lang="en">Conduct a personal code review (focused on common coding errors) on a program component using a provided checklist</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1086"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1087">
+		<description xml:lang="en">Contribute to a small-team code review focused on component correctness.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1087"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1088">
+		<description xml:lang="en">Describe how a contract can be used to specify the behavior of a program component.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1088"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1089">
+		<description xml:lang="en">Create a unit test plan for a medium-size code segment.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1089"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1090">
+		<description xml:lang="en">Apply a variety of strategies to the testing and debugging of simple programs.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1090"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1091">
+		<description xml:lang="en">Construct, execute and debug programs using a modern IDE (e.g., Visual Studio or Eclipse) and associated tools such as unit testing tools and visual debuggers.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1091"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1092">
+		<description xml:lang="en">Apply consistent documentation and program style standards that contribute to the readability and maintainability of software.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1092"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1093">
+		<description xml:lang="en">Describe how software can interact with and participate in various systems including information management, embedded, process control, and communications systems.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1093"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1094">
+		<description xml:lang="en">Differentiate among the phases of software development.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1094"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1095">
+		<description xml:lang="en">Explain the concept of a software life cycle and provide an example, illustrating its phases including the deliverables that are produced.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1095"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1096">
+		<description xml:lang="en">Describe how programming in the large differs from individual efforts with respect to understanding a large code base, code reading, understanding builds, and understanding context of changes. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1096"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1097">
+		<description xml:lang="en">Describe the difference between principles of the waterfall model and models using iterations. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1097"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1098">
+		<description xml:lang="en">Compare several common process models with respect to their value for development of particular classes of software systems taking into account issues such as requirement stability, size, and non-functional characteristics</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1098"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1099">
+		<description xml:lang="en">Define software quality and describe the role of quality assurance activities in the software process. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1099"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1100">
+		<description xml:lang="en">Describe the intent and fundamental similarities among process improvement approaches</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1100"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1101">
+		<description xml:lang="en">Compare several process improvement models such as CMM, CMMI, CQI, Plan-Do-Check-Act, or ISO9000.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1101"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1102">
+		<description xml:lang="en">Use a process improvement model such as PSP to assess a development effort and recommend approaches to improvement</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1102"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1103">
+		<description xml:lang="en">Explain the role of process maturity models in process improvement. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1103"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1104">
+		<description xml:lang="en">Describe several process metrics for assessing and controlling a project.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1104"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1105">
+		<description xml:lang="en">Use project metrics to describe the current state of a project. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1105"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1106">
+		<description xml:lang="en">List several examples of software risks.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1106"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1107">
+		<description xml:lang="en">Describe the impact of risk in a software development life cycle.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1107"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1108">
+		<description xml:lang="en">Describe different categories of risk in software systems.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1108"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1109">
+		<description xml:lang="en">Describe the impact of risk tolerance on the software development process.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1109"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1110">
+		<description xml:lang="en">Identify risks and describe approaches to managing risk (avoidance, acceptance, transference, mitigation), and characterize the strengths and shortcomings of each</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1110"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1111">
+		<description xml:lang="en">Explain how risk affects decisions in the software development process.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1111"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1112">
+		<description xml:lang="en">Identify behaviors that contribute to the effective functioning of a team.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1112"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1113">
+		<description xml:lang="en">Create and follow an agenda for a team meeting.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1113"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1114">
+		<description xml:lang="en">Identify and justify necessary roles in a software development team.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1114"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1115">
+		<description xml:lang="en">Understand the sources, hazards, and potential benefits of team conflict.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1115"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1116">
+		<description xml:lang="en">Apply a conflict resolution strategy in a team setting.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1116"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1117">
+		<description xml:lang="en">Use an ad hoc method to estimate software development effort (e.g., time) and compare to actual effort required</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1117"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1118">
+		<description xml:lang="en">Identify security risks for a software system.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1118"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1119">
+		<description xml:lang="en">Demonstrate through involvement in a team project the central elements of team building and team management</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1119"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1120">
+		<description xml:lang="en">Identify several possible team organizational structures and team decision-making processes.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1120"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1121">
+		<description xml:lang="en">Create a team by identifying appropriate roles and assigning roles to team members.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1121"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1122">
+		<description xml:lang="en">Assess and provide feedback to teams and individuals on their performance in a team setting.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1122"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1123">
+		<description xml:lang="en">Prepare a project plan for a software project that includes estimates of size and effort, a schedule, resource allocation, configuration control, change management, and project risk identification and management. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1123"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1124">
+		<description xml:lang="en">Track the progress of a project using appropriate project metrics.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1124"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1125">
+		<description xml:lang="en">Compare simple software size and cost estimation techniques.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1125"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1126">
+		<description xml:lang="en">Use a project management tool to assist in the assignment and tracking of tasks in a software development project</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1126"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1127">
+		<description xml:lang="en">Demonstrate a systematic approach to the task of identifying hazards and risks in a particular situation.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1127"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1128">
+		<description xml:lang="en">Apply the basic principles of risk management in a variety of simple scenarios including a security situation</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1128"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1129">
+		<description xml:lang="en">Conduct a costbenefit analysis for a risk mitigation approach.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1129"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1130">
+		<description xml:lang="en">Identify and analyze some of the risks for an entire system that arise from aspects other than the software. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/1131">
+		<description xml:lang="en">Describe the difference between centralized and distributed software configuration management. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1131"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1132">
+		<description xml:lang="en">Identify configuration items and use a source code control tool in a small team-based project.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1132"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1133">
+		<description xml:lang="en">Describe the issues that are important in selecting a set of tools for the development of a particular software system, including tools for requirements tracking, design modeling, implementation, build automation, and testing</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1133"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1134">
+		<description xml:lang="en">Demonstrate the capability to use software tools in support of the development of a software product of medium size</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1134"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1135">
+		<description xml:lang="en">Describe the fundamental challenges of and common techniques used for requirements elicitation.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1135"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1136">
+		<description xml:lang="en">Interpret a given requirements model for a simple software system. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1136"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1137">
+		<description xml:lang="en">Conduct a review of a set of software requirements to determine the quality of the requirements with respect to the characteristics of good requirements.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1137"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1138">
+		<description xml:lang="en">List the key components of a use case or similar description of some behavior that is required for a system and discuss their role in the requirements engineering process.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1138"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1139">
+		<description xml:lang="en">List the key components of a class diagram or similar description of the data that a system is required to handle</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1139"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1140">
+		<description xml:lang="en">Identify both functional and non-functional requirements in a given requirements specification for a software system</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1140"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1141">
+		<description xml:lang="en">Apply key elements and common methods for elicitation and analysis to produce a set of software requirements for a medium-sized software system.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1141"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1142">
+		<description xml:lang="en">Use a common, non-formal method to model and specify (in the form of a requirements specification document) the requirements for a medium-size software system</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1142"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1143">
+		<description xml:lang="en">Translate into natural language a software requirements specification (e.g., a software component contract) written in a formal specification language. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1143"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1144">
+		<description xml:lang="en">Create a prototype of a software system to mitigate risk in requirements.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1144"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1145">
+		<description xml:lang="en">Differentiate between forward and backward tracing and explain their roles in the requirements validation process</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1145"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1146">
+		<description xml:lang="en">Articulate design principles including separation of concerns, information hiding, coupling and cohesion, and encapsulation</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1146"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1147">
+		<description xml:lang="en">Use a design paradigm to design a simple software system, and explain how system design principles have been applied in this design</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1147"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1148">
+		<description xml:lang="en">Construct models of the design of a simple software system that are appropriate for the paradigm used to design it</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1148"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1149">
+		<description xml:lang="en">For the design of a simple software system within the context of a single design paradigm, describe the software architecture of that system</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1149"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1150">
+		<description xml:lang="en">Within the context of a single design paradigm, describe one or more design patterns that could be applicable to the design of a simple software system.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1150"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1151">
+		<description xml:lang="en">Given a high-level design, identify the software architecture by differentiating among common software architectures such as 3-tier, pipe-and-filter, and client-server</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1151"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1152">
+		<description xml:lang="en">For a simple system suitable for a given scenario, discuss and select an appropriate design paradigm</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1152"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1153">
+		<description xml:lang="en">Create appropriate models for the structure and behavior of software products from their requirements specifications.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1153"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1154">
+		<description xml:lang="en">Explain the relationships between the requirements for a software product and the designed structure and behavior, in terms of the appropriate models and transformations of them.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1154"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1155">
+		<description xml:lang="en">Apply simple examples of patterns in a software design.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1155"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1156">
+		<description xml:lang="en">Investigate the impact of software architectures selection on the design of a simple system. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/1157">
+		<description xml:lang="en">Select suitable components for use in the design of a software product.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1157"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1158">
+		<description xml:lang="en">Explain how suitable components might need to be adapted for use in the design of a software product.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1158"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1159">
+		<description xml:lang="en">Design a contract for a typical small software component for use in a given system</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1159"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1160">
+		<description xml:lang="en">Discuss and select appropriate software architecture for a simple system suitable for a given scenario. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1160"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1161">
+		<description xml:lang="en">Apply models for internal and external qualities in designing software components to achieve an acceptable tradeoff between conflicting quality aspects</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1161"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1162">
+		<description xml:lang="en">Analyze a software design from the perspective of a significant internal quality attribute.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1162"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1163">
+		<description xml:lang="en">Analyze a software design from the perspective of a significant external quality attribute. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1163"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1164">
+		<description xml:lang="en">Explain the role of objects in middleware systems and the relationship with components.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1164"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1165">
+		<description xml:lang="en">Apply component-oriented approaches to the design of a range of software, such as using components for concurrency and transactions, for reliable communication services, for database interaction including services for remote query and database management, or for secure communication and access.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1165"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1166">
+		<description xml:lang="en">Describe techniques, coding idioms and mechanisms for implementing designs to achieve desired properties such as reliability, efficiency, and robustness.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1166"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1167">
+		<description xml:lang="en">Build robust code using exception handling mechanisms. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1167"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1168">
+		<description xml:lang="en">Describe secure coding and defensive coding practices.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1168"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1169">
+		<description xml:lang="en">Select and use a defined coding standard in a small software project. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1169"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1170">
+		<description xml:lang="en">Compare and contrast integration strategies including top-down, bottom-up, and sandwich integration. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1170"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1171">
+		<description xml:lang="en">Rewrite a simple program to remove common vulnerabilities, such as buffer overflows, integer overflows and race conditions </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/1172">
+		<description xml:lang="en">State and apply the principles of least privilege and fail-safe defaults. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/1173">
+		<description xml:lang="en">Write a simple library that performs some non-trivial task and will not terminate the calling program regardless of how it is called </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/1174">
+		<description xml:lang="en">Distinguish between program validation and verification.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1174"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1175">
+		<description xml:lang="en">Describe the role that tools can play in the validation of software.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1175"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1176">
+		<description xml:lang="en">Undertake, as part of a team activity, an inspection of a medium-size code segment.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1176"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1177">
+		<description xml:lang="en">Describe and distinguish among the different types and levels of testing (unit, integration, systems, and acceptance).</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1177"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1178">
+		<description xml:lang="en">Use a defect tracking tool to manage software defects in a small software project</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1178"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1179">
+		<description xml:lang="en">Describe the issues and approaches to testing distributed and parallel systems. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1179"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1180">
+		<description xml:lang="en">Create, evaluate, and implement a test plan for a medium-size code segment.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1180"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1181">
+		<description xml:lang="en">Compare static and dynamic approaches to verification.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1181"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1182">
+		<description xml:lang="en">Discuss the issues involving the testing of object-oriented software.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1182"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1183">
+		<description xml:lang="en">Describe techniques for the verification and validation of non-code artifacts.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1183"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1184">
+		<description xml:lang="en">Describe approaches for fault estimation.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1184"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1185">
+		<description xml:lang="en">Estimate the number of faults in a small software application based on fault density and fault seeding. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1185"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1186">
+		<description xml:lang="en">Conduct an inspection or review of software source code for a small or medium sized software project. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1186"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1187">
+		<description xml:lang="en">Identify the principal issues associated with software evolution and explain their impact on the software life cycle</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1187"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1188">
+		<description xml:lang="en">Discuss the challenges of evolving systems in a changing environment. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1188"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1189">
+		<description xml:lang="en">Outline the process of regression testing and its role in release management</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1189"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1190">
+		<description xml:lang="en">Discuss the advantages and disadvantages of software reuse.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1190"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1191">
+		<description xml:lang="en">Estimate the impact of a change request to an existing product of medium size. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1191"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1192">
+		<description xml:lang="en">Identify weaknesses in a given simple design, and removed them through refactoring</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1192"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1193">
+		<description xml:lang="en">Describe the role formal specification and analysis techniques can play in the development of complex software and compare their use as validation and verification techniques with testing</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1193"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1194">
+		<description xml:lang="en">Apply formal specification and analysis techniques to software designs and programs with low complexity. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1194"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1195">
+		<description xml:lang="en">Explain the potential benefits and drawbacks of using formal specification languages.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1195"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1196">
+		<description xml:lang="en">Create and evaluate program assertions for a variety of behaviors ranging from simple through complex. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1196"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1197">
+		<description xml:lang="en">Using a common formal specification language, formulate the specification of a simple software system and derive examples of test cases from the specification</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1197"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1198">
+		<description xml:lang="en">Explain the problems that exist in achieving very high levels of reliability.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1198"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1199">
+		<description xml:lang="en">Describe how software reliability contributes to system reliability  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1199"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1200">
+		<description xml:lang="en">List approaches to minimizing faults that can be applied at each stage of the software lifecycle. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1200"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1201">
+		<description xml:lang="en">Compare the characteristics of three different reliability modeling approaches.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1201"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1202">
+		<description xml:lang="en">Demonstrate the ability to apply multiple methods to develop reliability estimates for a software system. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1202"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1203">
+		<description xml:lang="en">Identify methods that will lead to the realization of a software architecture that achieves a specified reliability level of reliability</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1203"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1204">
+		<description xml:lang="en">Identify ways to apply redundancy to achieve fault tolerance for a medium-sized application.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1204"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1205">
+		<description xml:lang="en">List commonly encountered patterns of how computations are organized  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1205"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1206">
+		<description xml:lang="en">Describe the basic building blocks of computers and their role in the historical development of computer architecture</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1206"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1207">
+		<description xml:lang="en">Articulate the differences between single thread vs. multiple thread, single server vs. multiple server models, motivated by real world examples (e.g., cooking recipes, lines for multiple teller machines, couple shopping for food, wash-dry-fold, etc.)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1207"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1208">
+		<description xml:lang="en">Articulate the concept of strong vs. weak scaling, i.e., how performance is affected by scale of problem vs. scale of resources to solve the problem. This can be motivated by the simple, real-world examples </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1208"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1209">
+		<description xml:lang="en">Design and simulate a simple logic circuit using the fundamental building blocks of logic design </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1209"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1210">
+		<description xml:lang="en">Write a simple sequential problem and a simple parallel version of the same program  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1210"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1211">
+		<description xml:lang="en">Evaluate performance of simple sequential and parallel versions of a program with different problem sizes, and be able to describe the speed-ups achieved </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1211"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1212">
+		<description xml:lang="en">Describe how computing systems are constructed of layers upon layers, based on separation of concerns, with well-defined interfaces, hiding details of low layers from the higher layers</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1212"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1213">
+		<description xml:lang="en">Recognize that hardware, VM, OS, application are just additional layers of interpretationprocessing </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1213"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1214">
+		<description xml:lang="en">Describe the mechanisms of how errors are detected, signaled back, and handled through the layers </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1214"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1215">
+		<description xml:lang="en">Construct a simple program using methods of layering, error detection and recovery, and reflection of error status across layers</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1215"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1216">
+		<description xml:lang="en">Find bugs in a layered program by using tools for program tracing, single stepping, and debugging </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1216"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1217">
+		<description xml:lang="en">Describe computations as a system with a known set of configurations, and a byproduct of the computation is to transition from one unique configuration (state) to another (state) </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1217"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1218">
+		<description xml:lang="en">Recognize the distinction between systems whose output is only a function of their input (Combinational) and those with memory or history (Sequential)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1218"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1219">
+		<description xml:lang="en">Describe a computer as a state machine that interprets machine instructions  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1219"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1220">
+		<description xml:lang="en">Explain how a program or network protocol can also be expressed as a state machine, and that alternative representations for the same computation can exist</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1220"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1221">
+		<description xml:lang="en">Develop state machine descriptions for simple problem statement solutions (e.g., traffic light sequencing, pattern recognizers) </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1221"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1222">
+		<description xml:lang="en">Derive time-series behavior of a state machine from its state machine representation</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1222"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1223">
+		<description xml:lang="en">For a given program, distinguish between its sequential and parallel execution, and the performance implications thereof</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1223"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1224">
+		<description xml:lang="en">Demonstrate on an execution time line that parallel events and operations can take place simultaneously (i.e., at the same time). Explain how work can be performed in less elapsed time if this can be exploited </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1224"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1225">
+		<description xml:lang="en">Explain other uses of parallelism, such as for reliabilityredundancy of execution  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1225"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1226">
+		<description xml:lang="en">Define the differences between the concepts of Instruction Parallelism, Data Parallelism, Thread ParallelismMultitasking, TaskRequest Parallelism. </description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/1227">
+		<description xml:lang="en">Write a simple parallel program in more than one paradigm so as to be able to compare and contrast ease of expression and performance in solving a given problem</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1227"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1228">
+		<description xml:lang="en">Use performance tools to measure speed-up achieved by parallel programs in terms of both problem size and number of resources</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1228"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1229">
+		<description xml:lang="en">Explain how the components of system architecture contribute to improving its performance </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1229"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1230">
+		<description xml:lang="en">Describe Amdahlquot;s law and its implications for parallel system speed-up when limited by sequential portions, e.g., in processing pipelines</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1230"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1231">
+		<description xml:lang="en">Benchmark a parallel program with different data sets in order to iteratively improve its performance </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1231"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1232">
+		<description xml:lang="en">Use software tools to profile and measure program performance</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1232"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1233">
+		<description xml:lang="en">Define how finite computer resources (e.g., processor share, memory, storage and network bandwidth) are managed by their careful allocation to existing entities</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1233"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1234">
+		<description xml:lang="en">Describe the scheduling algorithms by which resources are allocated to competing entities, and the figures of merit by which these algorithms are evaluated, such as fairness</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1234"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1235">
+		<description xml:lang="en">Implement simple scheduling algorithms   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1235"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1236">
+		<description xml:lang="en">Measure figures of merit of different scheduler implementations </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1236"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1237">
+		<description xml:lang="en">Explain the importance of locality in determining performance  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1237"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1238">
+		<description xml:lang="en">Describe why things that are close in space take less time to access  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1238"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1239">
+		<description xml:lang="en">Calculate average memory access time and describe the tradeoffs in memory hierarchy performance in terms of capacity, misshit rate, and access time</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1239"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1240">
+		<description xml:lang="en">Explain why it is important to isolate and protect the execution of individual programs and environments that share common underlying resources, including the processor, memory, storage, and network access </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1240"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1241">
+		<description xml:lang="en">Describe how the concept of indirection can create the illusion of a dedicated machine and its resources even when physically shared among multiple programs and environments</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1241"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1242">
+		<description xml:lang="en">Measure the performance of two application instances running on separate virtual machines, and determine the effect of performance isolation</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1242"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1243">
+		<description xml:lang="en">Explain the distinction between program errors, system errors, and hardware faults (e.g., bad memory) and exceptions (e.g., attempt to divide by zero)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1243"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1244">
+		<description xml:lang="en">Articulate the distinction between detecting, handling, and recovering from faults, and the methods for their implementation </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1244"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1245">
+		<description xml:lang="en">Describe the role of error correcting codes in providing error checking and correction techniques in memories, storage, and networks</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1245"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1246">
+		<description xml:lang="en">Apply simple algorithms for exploiting redundant information for the purposes of data correction </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1246"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1247">
+		<description xml:lang="en">Compare different error detection and correction methods for their data overhead, implementation complexity, and relative execution time for encoding, detecting, and correcting errors</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1247"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1248">
+		<description xml:lang="en">Describe positive and negative ways in which computer technology (networks, mobile computing, cloud computing) alters modes of social interaction at the personal level.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1248"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1249">
+		<description xml:lang="en">Identify developersquot; assumptions and values embedded in hardware and software design, especially as they pertain to usability for diverse populations including under-represented populations and the disabled.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1249"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1250">
+		<description xml:lang="en">Interpret the social context of a given design and its implementation.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1250"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1251">
+		<description xml:lang="en">Evaluate the efficacy of a given design and implementation using empirical data. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1251"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1252">
+		<description xml:lang="en">Investigate the implications of social media on individualism versus collectivism and culture.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1252"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1253">
+		<description xml:lang="en">Discuss how Internet access serves as a liberating force for people living under oppressive forms of government; explain how limits on Internet access are used as tools of political and social repression. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1253"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1254">
+		<description xml:lang="en">Analyze the pros and cons of reliance on computing in the implementation of democracy (e.g. delivery of social services, electronic voting)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1254"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1255">
+		<description xml:lang="en">Describe the impact of the under-representation of diverse populations in the computing profession (e.g., industry culture, product diversity).</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1255"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1256">
+		<description xml:lang="en">Investigate the implications of context awareness in ubiquitous computing systems.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1256"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1257">
+		<description xml:lang="en">Evaluate stakeholder positions in a given situation.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1257"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1258">
+		<description xml:lang="en">Analyze basic logical fallacies in an argument.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1258"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1259">
+		<description xml:lang="en">Analyze an argument to identify premises and conclusion.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1259"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1260">
+		<description xml:lang="en">Illustrate the use of example and analogy in ethical argument. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1260"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1261">
+		<description xml:lang="en">Evaluate ethical tradeoffs in technical decisions.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1261"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1262">
+		<description xml:lang="en">Identify ethical issues that arise in software development and determine how to address them technically and ethically</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1262"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1263">
+		<description xml:lang="en">Recognize the ethical responsibility of ensuring software correctness, reliability and safety.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1263"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1264">
+		<description xml:lang="en">Describe the mechanisms that typically exist for a professional to keep up-to-date.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1264"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1265">
+		<description xml:lang="en">Describe the strengths and weaknesses of relevant professional codes as expressions of professionalism and guides to decision-making</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1265"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1266">
+		<description xml:lang="en">Analyze a global computing issue, observing the role of professionals and government officials in managing the problem</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1266"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1267">
+		<description xml:lang="en">Evaluate the professional codes of ethics from the ACM, the IEEE Computer Society, and other organizations.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1267"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1268">
+		<description xml:lang="en">Describe ways in which professionals may contribute to public policy.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1268"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1269">
+		<description xml:lang="en">Describe the consequences of inappropriate professional behavior.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1269"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1270">
+		<description xml:lang="en">Identify progressive stages in a whistle-blowing incident.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1270"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1271">
+		<description xml:lang="en">Investigate forms of harassment and discrimination and avenues of assistance  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1271"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1272">
+		<description xml:lang="en">Examine various forms of professional credentialing  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1272"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1273">
+		<description xml:lang="en">Identify the social implications of ergonomic devices and the workplace environment to peoplequot;s health. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1273"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1274">
+		<description xml:lang="en">Develop a computer use policy with enforcement measures.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1274"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1275">
+		<description xml:lang="en">Describe issues associated with industries push to focus on time to market versus enforcing quality professional standards</description>
+	</LOCdefinition>
+	<LOCdefinition id="http://www.eummena.org/inloc/1277">
+		<description xml:lang="en">Discuss the philosophical bases of intellectual property.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1277"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1278">
+		<description xml:lang="en">Discuss the rationale for the legal protection of intellectual property.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1278"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1279">
+		<description xml:lang="en">Describe legislation aimed at digital copyright infringements.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1279"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1280">
+		<description xml:lang="en">Critique legislation aimed at digital copyright infringements  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1280"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1281">
+		<description xml:lang="en">Identify contemporary examples of intangible digital intellectual property  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1281"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1282">
+		<description xml:lang="en">Justify uses of copyrighted materials.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1282"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1283">
+		<description xml:lang="en">Evaluate the ethical issues inherent in various plagiarism detection mechanisms.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1283"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1284">
+		<description xml:lang="en">Interpret the intent and implementation of software licensing.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1284"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1285">
+		<description xml:lang="en">Discuss the issues involved in securing software patents.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1285"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1286">
+		<description xml:lang="en">Characterize and contrast the concepts of copyright, patenting and trademarks.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1286"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1287">
+		<description xml:lang="en">Identify the goals of the open source movement.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1287"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1288">
+		<description xml:lang="en">Identify the global nature of software piracy. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1288"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1288"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1289">
+		<description xml:lang="en">Discuss the philosophical basis for the legal protection of personal privacy.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1289"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1290">
+		<description xml:lang="en">Evaluate solutions to privacy threats in transactional databases and data warehouses.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1290"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1291">
+		<description xml:lang="en">Recognize the fundamental role of data collection in the implementation of pervasive surveillance systems (e.g., RFID, face recognition, toll collection, mobile computing)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1291"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1292">
+		<description xml:lang="en">Recognize the ramifications of differential privacy.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1292"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1293">
+		<description xml:lang="en">Investigate the impact of technological solutions to privacy problems. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1293"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1294">
+		<description xml:lang="en">Critique the intent, potential value and implementation of various forms of privacy legislation.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1294"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1296">
+		<description xml:lang="en">Identify strategies to enable appropriate freedom of expression.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1296"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1297">
+		<description xml:lang="en">Write clear, concise, and accurate technical documents following well-defined standards for format and for including appropriate tables, figures, and references</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1297"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1298">
+		<description xml:lang="en">Evaluate written technical documentation to detect problems of various kinds.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1298"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1299">
+		<description xml:lang="en">Develop and deliver a good quality formal presentation.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1299"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1300">
+		<description xml:lang="en">Plan interactions (e.g. virtual, face-to-face, shared documents) with others in which they are able to get their point across, and are also able to listen carefully and appreciate the points of others, even when they disagree, and are able to convey to others that they have heard.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1300"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1301">
+		<description xml:lang="en">Describe the strengths and weaknesses of various forms of communication (e.g. virtual, face-to-face, shared documents)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1301"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1302">
+		<description xml:lang="en">Examine appropriate measures used to communicate with stakeholders involved in a project.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1302"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1303">
+		<description xml:lang="en">Compare and contrast various collaboration tools.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1303"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1304">
+		<description xml:lang="en">Discuss ways to influence performance and results in cross-cultural teams.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1304"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1305">
+		<description xml:lang="en">Examine the tradeoffs and common sources of risk in software projects regarding technology, structureprocess, quality, people, market and financial.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1305"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1306">
+		<description xml:lang="en">Identify ways to be a sustainable practitioner  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1306"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1307">
+		<description xml:lang="en">Illustrate global social and environmental impacts of computer use and disposal (e-waste)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1307"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1308">
+		<description xml:lang="en">Describe the environmental impacts of design choices within the field of computing that relate to algorithm design, operating system design, networking design, database design, etc.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1308"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1309">
+		<description xml:lang="en">Investigate the social and environmental impacts of new system designs through projects.</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1309"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1310">
+		<description xml:lang="en">Identify guidelines for sustainable IT design or deployment  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1310"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1311">
+		<description xml:lang="en">List the sustainable effects of telecommuting or web shopping  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1311"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1312">
+		<description xml:lang="en">Investigate pervasive computing in areas such as smart energy systems, social networking, transportation, agriculture, supply-chain systems, environmental monitoring and citizen activism</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1312"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1313">
+		<description xml:lang="en">Develop applications of computing and assess through research areas pertaining to environmental issues (e.g. energy, pollution, resource usage, recycling and reuse, food management, farming)</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1313"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1314">
+		<description xml:lang="en">Identify significant continuing trends in the history of the computing field.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1314"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1315">
+		<description xml:lang="en">Identify the contributions of several pioneers in the computing field.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1315"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1316">
+		<description xml:lang="en">Discuss the historical context for several programming language paradigms.   </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1316"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1317">
+		<description xml:lang="en">Compare daily life before and after the advent of personal computers and the Internet.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1317"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Evaluation">
+			<label xml:lang="en">Evaluation Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1318">
+		<description xml:lang="en">Summarize the rationale for antimonopoly efforts.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1318"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1319">
+		<description xml:lang="en">Identify several ways in which the information technology industry is affected by shortages in the labor supply</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1319"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1320">
+		<description xml:lang="en">Identify the evolution of pricing strategies for computing goods and services.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1320"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1321">
+		<description xml:lang="en">Discuss the benefits, the drawbacks and the implications of off-shoring and outsourcing.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1321"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1322">
+		<description xml:lang="en">Investigate and defend ways to address limitations on access to computing.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1322"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1323">
+		<description xml:lang="en">List examples of classic computer crimes and social engineering incidents with societal impact. </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1323"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1324">
+		<description xml:lang="en">Identify laws that apply to computer crimes  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1324"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1325">
+		<description xml:lang="en">Describe the motivation and  ramifications of cyber terrorism and criminal hacking  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1325"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1326">
+		<description xml:lang="en">Examine the ethical and legal issues surrounding the misuse of access and various breaches in security </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1326"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1327">
+		<description xml:lang="en">Discuss the professionals role in security and the trade-offs involved.  </description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1327"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">ACM Competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Knowledge">
+			<label xml:lang="en">Knowledge Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1328">
+		<description xml:lang="en">Investigate measures that can be taken by both individuals and organizations including governments to prevent or mitigate the undesirable effects of computer crimes and identity theft</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1328"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation>
+	<LOCdefinition id="http://www.eummena.org/inloc/1329">
+		<description xml:lang="en">Write a company-wide security policy, which includes procedures for managing passwords and employee monitoring</description>
+	</LOCdefinition>
+	<LOCassociation type="http://purl.org/net/inloc/category">
+		<subject id="http://www.eummena.org/inloc/1329"></subject>
+		<scheme id="http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013">
+			<label xml:lang="en">competence</label></scheme>
+		<object id="http://www.eummena.org/inloc/competence#Application">
+			<label xml:lang="en">Application Outcome</label></object>
+		</LOCassociation></LOCstructure>
\ No newline at end of file
diff --git a/models/courseManager.js b/models/courseManager.js
new file mode 100644
index 0000000..94234aa
--- /dev/null
+++ b/models/courseManager.js
@@ -0,0 +1,69 @@
+var Db = require('mongodb').Db;
+var Connection = require('mongodb').Connection;
+var Server = require('mongodb').Server;
+var BSON = require('mongodb').BSON;
+var ObjectID = require('mongodb').ObjectID;
+
+CourseManager = function(host, port, dbName) {
+	//console.log(host+port+dbName);
+  this.db= new Db(dbName, new Server(host, port), {auto_reconnect: true, safe: true});
+  this.db.open(function(err, client){
+  	if(err){
+  		console.log("Error!:"+err);
+  	}else{
+  		console.log("open OK");
+  	}
+  });
+};
+
+CourseManager.prototype.getCollection= function(callback) {
+	  this.db.collection('courses', function(error, coursesCollection) {
+	    if( error ) callback(error);
+	    else callback(null, coursesCollection);
+	  });
+	};
+
+	CourseManager.prototype.findAll = function(callback) {
+	    this.getCollection(function(error, coursesCollection) {
+	      if( error ) callback(error);
+	      else {
+	        coursesCollection.find().toArray(function(error, results) {
+	          if( error ) callback(error);
+	          else callback(null, results);
+	        });
+	      }
+	    });
+	};
+
+
+	CourseManager.prototype.findById = function(id, callback) {
+	    this.getCollection(function(error, coursesCollection) {
+	      if( error ) callback(error);
+	      else {
+	        coursesCollection.findOne({_id: coursesCollection.db.bson_serializer.ObjectID.createFromHexString(id)}, function(error, result) {
+	          if( error ) callback(error);
+	          else callback(null, result);
+	        });
+	      }
+	    });
+	};
+
+	CourseManager.prototype.save = function(courses, callback) {
+	    this.getCollection(function(error, coursesCollection) {
+	      if( error ) callback(error);
+	      else {
+	        if( typeof(courses.length)=="undefined")
+	          courses = [courses];
+	          coursesCollection.insert(courses, function(err) {
+	          	if(err) console.log("ERROR:"+err);
+	          	callback(null, courses);
+	        });
+	      }
+	    });
+	};
+
+	CourseManager.prototype.close = function(){
+		this.db.close();
+	}
+
+	exports.CourseManager = CourseManager;
\ No newline at end of file
diff --git a/node_modules/mongodb/.travis.yml b/node_modules/mongodb/.travis.yml
new file mode 100644
index 0000000..0140117
--- /dev/null
+++ b/node_modules/mongodb/.travis.yml
@@ -0,0 +1,5 @@
+language: node_js
+node_js:
+  - 0.6
+  - 0.8
+  - 0.10 # development version of 0.8, may be unstable
\ No newline at end of file
diff --git a/node_modules/mongodb/CONTRIBUTING.md b/node_modules/mongodb/CONTRIBUTING.md
new file mode 100644
index 0000000..2a1c52e
--- /dev/null
+++ b/node_modules/mongodb/CONTRIBUTING.md
@@ -0,0 +1,23 @@
+## Contributing to the driver
+
+### Bugfixes
+
+- Before starting to write code, look for existing [tickets](https://github.com/mongodb/node-mongodb-native/issues) or [create one](https://github.com/mongodb/node-mongodb-native/issues/new) for your specific issue. That way you avoid working on something that might not be of interest or that has been addressed already in a different branch.
+- Fork the [repo](https://github.com/mongodb/node-mongodb-native) _or_ for small documentation changes, navigate to the source on github and click the [Edit](https://github.com/blog/844-forking-with-the-edit-button) button.
+- Follow the general coding style of the rest of the project:
+  - 2 space tabs
+  - no trailing whitespace
+  - comma last
+  - inline documentation for new methods, class members, etc
+  - 0 space between conditionals/functions, and their parenthesis and curly braces
+    - `if(..) {`
+    - `for(..) {`
+    - `while(..) {`
+    - `function(err) {`
+- Write tests and make sure they pass (execute `make test` from the cmd line to run the test suite).
+
+### Documentation
+
+To contribute to the [API documentation](http://mongodb.github.com/node-mongodb-native/) just make your changes to the inline documentation of the appropriate [source code](https://github.com/mongodb/node-mongodb-native/tree/master/docs) in the master branch and submit a [pull request](https://help.github.com/articles/using-pull-requests/). You might also use the github [Edit](https://github.com/blog/844-forking-with-the-edit-button) button.
+
+If you'd like to preview your documentation changes, first commit your changes to your local master branch, then execute `make generate_docs`. Make sure you have the python documentation framework sphinx installed `easy_install sphinx`. The docs are generated under `docs/build'. If all looks good, submit a [pull request](https://help.github.com/articles/using-pull-requests/) to the master branch with your changes.
\ No newline at end of file
diff --git a/node_modules/mongodb/Makefile b/node_modules/mongodb/Makefile
new file mode 100644
index 0000000..59d2bfe
--- /dev/null
+++ b/node_modules/mongodb/Makefile
@@ -0,0 +1,28 @@
+NODE = node
+NPM = npm
+NODEUNIT = node_modules/nodeunit/bin/nodeunit
+DOX = node_modules/dox/bin/dox
+name = all
+
+total: build_native
+
+test_functional:
+	node test/runner.js -t functional
+
+test_ssl:
+	node test/runner.js -t ssl	
+
+test_replicaset:
+	node test/runner.js -t replicaset
+
+test_sharded:
+	node test/runner.js -t sharded
+
+test_auth:
+	node test/runner.js -t auth
+
+generate_docs:
+	$(NODE) dev/tools/build-docs.js
+	make --directory=./docs/sphinx-docs --file=Makefile html
+
+.PHONY: total
diff --git a/node_modules/mongodb/Readme.md b/node_modules/mongodb/Readme.md
new file mode 100644
index 0000000..306fde7
--- /dev/null
+++ b/node_modules/mongodb/Readme.md
@@ -0,0 +1,442 @@
+Up to date documentation
+========================
+
+[Documentation](http://mongodb.github.com/node-mongodb-native/)
+
+Install
+=======
+
+To install the most recent release from npm, run:
+
+    npm install mongodb
+
+That may give you a warning telling you that bugs['web'] should be bugs['url'], it would be safe to ignore it (this has been fixed in the development version)
+
+To install the latest from the repository, run::
+
+    npm install path/to/node-mongodb-native
+
+Community
+=========
+Check out the google group [node-mongodb-native](http://groups.google.com/group/node-mongodb-native) for questions/answers from users of the driver.
+
+Live Examples
+============
+<a href="https://runnable.com/node-mongodb-native" target="_blank"><img src="https://runnable.com/external/styles/assets/runnablebtn.png" style="width:67px;height:25px;"></a>
+
+Introduction
+============
+
+This is a node.js driver for MongoDB. It's a port (or close to a port) of the library for ruby at http://github.com/mongodb/mongo-ruby-driver/.
+
+A simple example of inserting a document.
+
+```javascript
+    var client = new Db('test', new Server("127.0.0.1", 27017, {}), {w: 1}),
+        test = function (err, collection) {
+          collection.insert({a:2}, function(err, docs) {
+
+            collection.count(function(err, count) {
+              test.assertEquals(1, count);
+            });
+
+            // Locate all the entries using find
+            collection.find().toArray(function(err, results) {
+              test.assertEquals(1, results.length);
+              test.assertTrue(results[0].a === 2);
+
+              // Let's close the db
+              client.close();
+            });
+          });
+        };
+
+    client.open(function(err, p_client) {
+      client.collection('test_insert', test);
+    });
+```
+
+Data types
+==========
+
+To store and retrieve the non-JSON MongoDb primitives ([ObjectID](http://www.mongodb.org/display/DOCS/Object+IDs), Long, Binary, [Timestamp](http://www.mongodb.org/display/DOCS/Timestamp+data+type), [DBRef](http://www.mongodb.org/display/DOCS/Database+References#DatabaseReferences-DBRef), Code).
+
+In particular, every document has a unique `_id` which can be almost any type, and by default a 12-byte ObjectID is created. ObjectIDs can be represented as 24-digit hexadecimal strings, but you must convert the string back into an ObjectID before you can use it in the database. For example:
+
+```javascript
+    // Get the objectID type
+    var ObjectID = require('mongodb').ObjectID;
+
+    var idString = '4e4e1638c85e808431000003';
+    collection.findOne({_id: new ObjectID(idString)}, console.log)  // ok
+    collection.findOne({_id: idString}, console.log)  // wrong! callback gets undefined
+```
+
+Here are the constructors the non-Javascript BSON primitive types:
+
+```javascript
+    // Fetch the library
+    var mongo = require('mongodb');
+    // Create new instances of BSON types
+    new mongo.Long(numberString)
+    new mongo.ObjectID(hexString)
+    new mongo.Timestamp()  // the actual unique number is generated on insert.
+    new mongo.DBRef(collectionName, id, dbName)
+    new mongo.Binary(buffer)  // takes a string or Buffer
+    new mongo.Code(code, [context])
+    new mongo.Symbol(string)
+    new mongo.MinKey()
+    new mongo.MaxKey()
+    new mongo.Double(number)	// Force double storage
+```
+
+The C/C++ bson parser/serializer
+--------------------------------
+
+If you are running a version of this library has the C/C++ parser compiled, to enable the driver to use the C/C++ bson parser pass it the option native_parser:true like below
+
+```javascript
+    // using native_parser:
+    var client = new Db('integration_tests_20',
+                        new Server("127.0.0.1", 27017),
+                        {native_parser:true});
+```
+
+The C++ parser uses the js objects both for serialization and deserialization.
+
+GitHub information
+==================
+
+The source code is available at http://github.com/mongodb/node-mongodb-native.
+You can either clone the repository or download a tarball of the latest release.
+
+Once you have the source you can test the driver by running
+
+    $ make test
+
+in the main directory. You will need to have a mongo instance running on localhost for the integration tests to pass.
+
+Examples
+========
+
+For examples look in the examples/ directory. You can execute the examples using node.
+
+    $ cd examples
+    $ node queries.js
+
+GridStore
+=========
+
+The GridStore class allows for storage of binary files in mongoDB using the mongoDB defined files and chunks collection definition.
+
+For more information have a look at [Gridstore](https://github.com/mongodb/node-mongodb-native/blob/master/docs/gridfs.md)
+
+Replicasets
+===========
+For more information about how to connect to a replicaset have a look at [Replicasets](https://github.com/mongodb/node-mongodb-native/blob/master/docs/replicaset.md)
+
+Primary Key Factories
+---------------------
+
+Defining your own primary key factory allows you to generate your own series of id's
+(this could f.ex be to use something like ISBN numbers). The generated the id needs to be a 12 byte long "string".
+
+Simple example below
+
+```javascript
+    // Custom factory (need to provide a 12 byte array);
+    CustomPKFactory = function() {}
+    CustomPKFactory.prototype = new Object();
+    CustomPKFactory.createPk = function() {
+      return new ObjectID("aaaaaaaaaaaa");
+    }
+
+    var p_client = new Db('integration_tests_20', new Server("127.0.0.1", 27017, {}), {'pk':CustomPKFactory});
+    p_client.open(function(err, p_client) {
+      p_client.dropDatabase(function(err, done) {
+        p_client.createCollection('test_custom_key', function(err, collection) {
+          collection.insert({'a':1}, function(err, docs) {
+            collection.find({'_id':new ObjectID("aaaaaaaaaaaa")}, function(err, cursor) {
+              cursor.toArray(function(err, items) {
+                test.assertEquals(1, items.length);
+
+                // Let's close the db
+                p_client.close();
+              });
+            });
+          });
+        });
+      });
+    });
+```
+
+Strict mode
+-----------
+
+Each database has an optional strict mode. If it is set then asking for a collection
+that does not exist will return an Error object in the callback. Similarly if you
+attempt to create a collection that already exists. Strict is provided for convenience.
+
+```javascript
+    var error_client = new Db('integration_tests_', new Server("127.0.0.1", 27017, {auto_reconnect: false}), {strict:true});
+      test.assertEquals(true, error_client.strict);
+
+      error_client.open(function(err, error_client) {
+      error_client.collection('does-not-exist', function(err, collection) {
+        test.assertTrue(err instanceof Error);
+        test.assertEquals("Collection does-not-exist does not exist. Currently in strict mode.", err.message);
+      });
+
+      error_client.createCollection('test_strict_access_collection', function(err, collection) {
+        error_client.collection('test_strict_access_collection', function(err, collection) {
+          test.assertTrue(collection instanceof Collection);
+          // Let's close the db
+          error_client.close();
+        });
+      });
+    });
+```
+
+Documentation
+=============
+
+If this document doesn't answer your questions, see the source of
+[Collection](https://github.com/mongodb/node-mongodb-native/blob/master/lib/mongodb/collection.js)
+or [Cursor](https://github.com/mongodb/node-mongodb-native/blob/master/lib/mongodb/cursor.js),
+or the documentation at MongoDB for query and update formats.
+
+Find
+----
+
+The find method is actually a factory method to create
+Cursor objects. A Cursor lazily uses the connection the first time
+you call `nextObject`, `each`, or `toArray`.
+
+The basic operation on a cursor is the `nextObject` method
+that fetches the next matching document from the database. The convenience
+methods `each` and `toArray` call `nextObject` until the cursor is exhausted.
+
+Signatures:
+
+```javascript
+    var cursor = collection.find(query, [fields], options);
+    cursor.sort(fields).limit(n).skip(m).
+
+    cursor.nextObject(function(err, doc) {});
+    cursor.each(function(err, doc) {});
+    cursor.toArray(function(err, docs) {});
+
+    cursor.rewind()  // reset the cursor to its initial state.
+```
+
+Useful chainable methods of cursor. These can optionally be options of `find` instead of method calls:
+
+* `.limit(n).skip(m)` to control paging.
+* `.sort(fields)` Order by the given fields. There are several equivalent syntaxes:
+  * `.sort({field1: -1, field2: 1})` descending by field1, then ascending by field2.
+  * `.sort([['field1', 'desc'], ['field2', 'asc']])` same as above
+  * `.sort([['field1', 'desc'], 'field2'])` same as above
+  * `.sort('field1')` ascending by field1
+
+Other options of `find`:
+
+* `fields` the fields to fetch (to avoid transferring the entire document)
+* `tailable` if true, makes the cursor [tailable](http://www.mongodb.org/display/DOCS/Tailable+Cursors).
+* `batchSize` The number of the subset of results to request the database
+to return for every request. This should initially be greater than 1 otherwise
+the database will automatically close the cursor. The batch size can be set to 1
+with `batchSize(n, function(err){})` after performing the initial query to the database.
+* `hint` See [Optimization: hint](http://www.mongodb.org/display/DOCS/Optimization#Optimization-Hint).
+* `explain` turns this into an explain query. You can also call
+`explain()` on any cursor to fetch the explanation.
+* `snapshot` prevents documents that are updated while the query is active
+from being returned multiple times. See more
+[details about query snapshots](http://www.mongodb.org/display/DOCS/How+to+do+Snapshotted+Queries+in+the+Mongo+Database).
+* `timeout` if false, asks MongoDb not to time out this cursor after an
+inactivity period.
+
+
+For information on how to create queries, see the
+[MongoDB section on querying](http://www.mongodb.org/display/DOCS/Querying).
+
+```javascript
+    var mongodb = require('mongodb');
+    var server = new mongodb.Server("127.0.0.1", 27017, {});
+    new mongodb.Db('test', server, {}).open(function (error, client) {
+      if (error) throw error;
+      var collection = new mongodb.Collection(client, 'test_collection');
+      collection.find({}, {limit:10}).toArray(function(err, docs) {
+        console.dir(docs);
+      });
+    });
+```
+
+Insert
+------
+
+Signature:
+
+```javascript
+    collection.insert(docs, options, [callback]);
+```
+
+where `docs` can be a single document or an array of documents.
+
+Useful options:
+
+* `safe:true` Should always set if you have a callback.
+
+See also: [MongoDB docs for insert](http://www.mongodb.org/display/DOCS/Inserting).
+
+```javascript
+    var mongodb = require('mongodb');
+    var server = new mongodb.Server("127.0.0.1", 27017, {});
+    new mongodb.Db('test', server, {w: 1}).open(function (error, client) {
+      if (error) throw error;
+      var collection = new mongodb.Collection(client, 'test_collection');
+      collection.insert({hello: 'world'}, {safe:true},
+                        function(err, objects) {
+        if (err) console.warn(err.message);
+        if (err && err.message.indexOf('E11000 ') !== -1) {
+          // this _id was already inserted in the database
+        }
+      });
+    });
+```
+
+Note that there's no reason to pass a callback to the insert or update commands
+unless you use the `safe:true` option. If you don't specify `safe:true`, then
+your callback will be called immediately.
+
+Update; update and insert (upsert)
+----------------------------------
+
+The update operation will update the first document that matches your query
+(or all documents that match if you use `multi:true`).
+If `safe:true`, `upsert` is not set, and no documents match, your callback will return 0 documents updated.
+
+See the [MongoDB docs](http://www.mongodb.org/display/DOCS/Updating) for
+the modifier (`$inc`, `$set`, `$push`, etc.) formats.
+
+Signature:
+
+```javascript
+    collection.update(criteria, objNew, options, [callback]);
+```
+
+Useful options:
+
+* `safe:true` Should always set if you have a callback.
+* `multi:true` If set, all matching documents are updated, not just the first.
+* `upsert:true` Atomically inserts the document if no documents matched.
+
+Example for `update`:
+
+```javascript
+    var mongodb = require('mongodb');
+    var server = new mongodb.Server("127.0.0.1", 27017, {});
+    new mongodb.Db('test', server, {w: 1}).open(function (error, client) {
+      if (error) throw error;
+      var collection = new mongodb.Collection(client, 'test_collection');
+      collection.update({hi: 'here'}, {$set: {hi: 'there'}}, {safe:true},
+                        function(err) {
+        if (err) console.warn(err.message);
+        else console.log('successfully updated');
+      });
+    });
+```
+
+Find and modify
+---------------
+
+`findAndModify` is like `update`, but it also gives the updated document to
+your callback. But there are a few key differences between findAndModify and
+update:
+
+  1. The signatures differ.
+  2. You can only findAndModify a single item, not multiple items.
+
+Signature:
+
+```javascript
+    collection.findAndModify(query, sort, update, options, callback)
+```
+
+The sort parameter is used to specify which object to operate on, if more than
+one document matches. It takes the same format as the cursor sort (see
+Connection.find above).
+
+See the
+[MongoDB docs for findAndModify](http://www.mongodb.org/display/DOCS/findAndModify+Command)
+for more details.
+
+Useful options:
+
+* `remove:true` set to a true to remove the object before returning
+* `new:true` set to true if you want to return the modified object rather than the original. Ignored for remove.
+* `upsert:true` Atomically inserts the document if no documents matched.
+
+Example for `findAndModify`:
+
+```javascript
+    var mongodb = require('mongodb');
+    var server = new mongodb.Server("127.0.0.1", 27017, {});
+    new mongodb.Db('test', server, {w: 1}).open(function (error, client) {
+      if (error) throw error;
+      var collection = new mongodb.Collection(client, 'test_collection');
+      collection.findAndModify({hello: 'world'}, [['_id','asc']], {$set: {hi: 'there'}}, {},
+                        function(err, object) {
+        if (err) console.warn(err.message);
+        else console.dir(object);  // undefined if no matching object exists.
+      });
+    });
+```
+
+Save
+----
+
+The `save` method is a shorthand for upsert if the document contains an
+`_id`, or an insert if there is no `_id`.
+
+Sponsors
+========
+Just as Felix Geisendörfer I'm also working on the driver for my own startup and this driver is a big project that also benefits other companies who are using MongoDB.
+
+If your company could benefit from a even better-engineered node.js mongodb driver I would appreciate any type of sponsorship you may be able to provide. All the sponsors will get a lifetime display in this readme, priority support and help on problems and votes on the roadmap decisions for the driver. If you are interested contact me on [christkv AT g m a i l.com](mailto:christkv@gmail.com) for details.
+
+And I'm very thankful for code contributions. If you are interested in working on features please contact me so we can discuss API design and testing.
+
+Release Notes
+=============
+
+See HISTORY
+
+Credits
+=======
+
+1. [10gen](http://github.com/mongodb/mongo-ruby-driver/)
+2. [Google Closure Library](http://code.google.com/closure/library/)
+3. [Jonas Raoni Soares Silva](http://jsfromhell.com/classes/binary-parser)
+
+Contributors
+============
+
+Aaron Heckmann, Christoph Pojer, Pau Ramon Revilla, Nathan White, Emmerman, Seth LaForge, Boris Filipov, Stefan Schärmeli, Tedde Lundgren, renctan, Sergey Ukustov, Ciaran Jessup, kuno, srimonti, Erik Abele, Pratik Daga, Slobodan Utvic, Kristina Chodorow, Yonathan Randolph, Brian Noguchi, Sam Epstein, James Harrison Fisher, Vladimir Dronnikov, Ben Hockey, Henrik Johansson, Simon Weare, Alex Gorbatchev, Shimon Doodkin, Kyle Mueller, Eran Hammer-Lahav, Marcin Ciszak, François de Metz, Vinay Pulim, nstielau, Adam Wiggins, entrinzikyl, Jeremy Selier, Ian Millington, Public Keating, andrewjstone, Christopher Stott, Corey Jewett, brettkiefer, Rob Holland, Senmiao Liu, heroic, gitfy
+
+License
+=======
+
+ Copyright 2009 - 2012 Christian Amor Kvalheim.
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+
diff --git a/node_modules/mongodb/index.js b/node_modules/mongodb/index.js
new file mode 100755
index 0000000..4f59e9d
--- /dev/null
+++ b/node_modules/mongodb/index.js
@@ -0,0 +1 @@
+module.exports = require('./lib/mongodb');
diff --git a/node_modules/mongodb/install.js b/node_modules/mongodb/install.js
new file mode 100644
index 0000000..f9f2a57
--- /dev/null
+++ b/node_modules/mongodb/install.js
@@ -0,0 +1,40 @@
+var spawn = require('child_process').spawn,
+  exec = require('child_process').exec;
+
+process.stdout.write("================================================================================\n");
+process.stdout.write("=                                                                              =\n");
+process.stdout.write("=  To install with C++ bson parser do <npm install mongodb --mongodb:native>   =\n");
+process.stdout.write("=                                                                              =\n");
+process.stdout.write("================================================================================\n");
+
+// Check if we want to build the native code
+var build_native = process.env['npm_package_config_native'] != null ? process.env['npm_package_config_native'] : 'false';
+build_native = build_native == 'true' ? true : false;
+// If we are building the native bson extension ensure we use gmake if available
+if(build_native) {
+  // Check if we need to use gmake
+  exec('which gmake', function(err, stdout, stderr) {
+    // Set up spawn command
+    var make = null;
+    // No gmake build using make
+    if(err != null) {
+      make = spawn('make', ['total']);
+    } else {
+      make = spawn('gmake', ['total']);
+    }
+
+    // Execute spawn
+    make.stdout.on('data', function(data) {
+      process.stdout.write(data);
+    })
+
+    make.stderr.on('data', function(data) {
+      process.stdout.write(data);
+    })
+
+    make.on('exit', function(code) {
+      process.stdout.write('child process exited with code ' + code + "\n");
+    })
+  });  
+}
+
diff --git a/node_modules/mongodb/lib/mongodb/admin.js b/node_modules/mongodb/lib/mongodb/admin.js
new file mode 100644
index 0000000..6e9cd30
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/admin.js
@@ -0,0 +1,339 @@
+/*!
+ * Module dependencies.
+ */
+var Collection = require('./collection').Collection,
+    Cursor = require('./cursor').Cursor,
+    DbCommand = require('./commands/db_command').DbCommand,
+    utils = require('./utils');
+
+/**
+ * Allows the user to access the admin functionality of MongoDB
+ *
+ * @class Represents the Admin methods of MongoDB.
+ * @param {Object} db Current db instance we wish to perform Admin operations on.
+ * @return {Function} Constructor for Admin type.
+ */
+function Admin(db) {
+  if(!(this instanceof Admin)) return new Admin(db);
+  this.db = db;
+};
+
+/**
+ * Retrieve the server information for the current
+ * instance of the db client
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from buildInfo or null if an error occured.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.buildInfo = function(callback) {
+  this.serverInfo(callback);
+}
+
+/**
+ * Retrieve the server information for the current
+ * instance of the db client
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from serverInfo or null if an error occured.
+ * @return {null} Returns no result
+ * @api private
+ */
+Admin.prototype.serverInfo = function(callback) {
+  this.db.executeDbAdminCommand({buildinfo:1}, function(err, doc) {
+    if(err != null) return callback(err, null);
+    return callback(null, doc.documents[0]);
+  });
+}
+
+/**
+ * Retrieve this db's server status.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from serverStatus or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Admin.prototype.serverStatus = function(callback) {
+  var self = this;
+
+  this.db.executeDbAdminCommand({serverStatus: 1}, function(err, doc) {
+    if(err == null && doc.documents[0].ok === 1) {
+      callback(null, doc.documents[0]);
+    } else {
+      if(err) return callback(err, false);
+      return callback(utils.toError(doc.documents[0]), false);
+    }
+  });
+};
+
+/**
+ * Retrieve the current profiling Level for MongoDB
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from profilingLevel or null if an error occured.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.profilingLevel = function(callback) {
+  var self = this;
+
+  this.db.executeDbAdminCommand({profile:-1}, function(err, doc) {
+    doc = doc.documents[0];
+
+    if(err == null && doc.ok === 1) {
+      var was = doc.was;
+      if(was == 0) return callback(null, "off");
+      if(was == 1) return callback(null, "slow_only");
+      if(was == 2) return callback(null, "all");
+        return callback(new Error("Error: illegal profiling level value " + was), null);
+    } else {
+      err != null ? callback(err, null) : callback(new Error("Error with profile command"), null);
+    }
+  });
+};
+
+/**
+ * Ping the MongoDB server and retrieve results
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from ping or null if an error occured.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.ping = function(options, callback) {
+  // Unpack calls
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+
+  this.db.executeDbAdminCommand({ping: 1}, callback);
+}
+
+/**
+ * Authenticate against MongoDB
+ *
+ * @param {String} username The user name for the authentication.
+ * @param {String} password The password for the authentication.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from authenticate or null if an error occured.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.authenticate = function(username, password, callback) {
+  this.db.authenticate(username, password, {authdb: 'admin'}, function(err, doc) {
+    return callback(err, doc);
+  })
+}
+
+/**
+ * Logout current authenticated user
+ *
+ * @param {Object} [options] Optional parameters to the command.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from logout or null if an error occured.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.logout = function(callback) {
+  this.db.logout({authdb: 'admin'},  function(err, doc) {
+    return callback(err, doc);
+  })
+}
+
+/**
+ * Add a user to the MongoDB server, if the user exists it will
+ * overwrite the current password
+ *
+ * Options
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {String} username The user name for the authentication.
+ * @param {String} password The password for the authentication.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from addUser or null if an error occured.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.addUser = function(username, password, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 2);
+  callback = args.pop();
+  options = args.length ? args.shift() : {};
+
+  options.dbName = 'admin';
+  // Add user
+  this.db.addUser(username, password, options, function(err, doc) {
+    return callback(err, doc);
+  })
+}
+
+/**
+ * Remove a user from the MongoDB server
+ *
+ * Options
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {String} username The user name for the authentication.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from removeUser or null if an error occured.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.removeUser = function(username, options, callback) {
+  var self = this;
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  options = args.length ? args.shift() : {};
+  options.dbName = 'admin';
+
+  this.db.removeUser(username, options, function(err, doc) {
+    return callback(err, doc);
+  })
+}
+
+/**
+ * Set the current profiling level of MongoDB
+ *
+ * @param {String} level The new profiling level (off, slow_only, all)
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from setProfilingLevel or null if an error occured.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.setProfilingLevel = function(level, callback) {
+  var self = this;
+  var command = {};
+  var profile = 0;
+
+  if(level == "off") {
+    profile = 0;
+  } else if(level == "slow_only") {
+    profile = 1;
+  } else if(level == "all") {
+    profile = 2;
+  } else {
+    return callback(new Error("Error: illegal profiling level value " + level));
+  }
+
+  // Set up the profile number
+  command['profile'] = profile;
+
+  this.db.executeDbAdminCommand(command, function(err, doc) {
+    doc = doc.documents[0];
+
+    if(err == null && doc.ok === 1)
+      return callback(null, level);
+    return err != null ? callback(err, null) : callback(new Error("Error with profile command"), null);
+  });
+};
+
+/**
+ * Retrive the current profiling information for MongoDB
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from profilingInfo or null if an error occured.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.profilingInfo = function(callback) {
+  try {
+    new Cursor(this.db, new Collection(this.db, DbCommand.SYSTEM_PROFILE_COLLECTION), {}, {}, {dbName: 'admin'}).toArray(function(err, items) {
+        return callback(err, items);
+    });
+  } catch (err) {
+    return callback(err, null);
+  }
+};
+
+/**
+ * Execute a db command against the Admin database
+ *
+ * @param {Object} command A command object `{ping:1}`.
+ * @param {Object} [options] Optional parameters to the command.
+ * @param {Function} callback this will be called after executing this method. The command always return the whole result of the command as the second parameter.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.command = function(command, options, callback) {
+  var self = this;
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  options = args.length ? args.shift() : {};
+
+  // Execute a command
+  this.db.executeDbAdminCommand(command, options, function(err, doc) {
+    // Ensure change before event loop executes
+    return callback != null ? callback(err, doc) : null;
+  });
+}
+
+/**
+ * Validate an existing collection
+ *
+ * @param {String} collectionName The name of the collection to validate.
+ * @param {Object} [options] Optional parameters to the command.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from validateCollection or null if an error occured.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.validateCollection = function(collectionName, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  options = args.length ? args.shift() : {};
+
+  var self = this;
+  var command = {validate: collectionName};
+  var keys = Object.keys(options);
+
+  // Decorate command with extra options
+  for(var i = 0; i < keys.length; i++) {
+    if(options.hasOwnProperty(keys[i])) {
+      command[keys[i]] = options[keys[i]];
+    }
+  }
+
+  this.db.executeDbCommand(command, function(err, doc) {
+    if(err != null) return callback(err, null);
+    doc = doc.documents[0];
+
+    if(doc.ok === 0)
+      return callback(new Error("Error with validate command"), null);
+    if(doc.result != null && doc.result.constructor != String)
+      return callback(new Error("Error with validation data"), null);
+    if(doc.result != null && doc.result.match(/exception|corrupt/) != null)
+      return callback(new Error("Error: invalid collection " + collectionName), null);
+    if(doc.valid != null && !doc.valid)
+      return callback(new Error("Error: invalid collection " + collectionName), null);
+
+    return callback(null, doc);
+  });
+};
+
+/**
+ * List the available databases
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from listDatabases or null if an error occured.
+ * @return {null} Returns no result
+ * @api public
+ */
+Admin.prototype.listDatabases = function(callback) {
+  // Execute the listAllDatabases command
+  this.db.executeDbAdminCommand({listDatabases:1}, {}, function(err, doc) {
+    if(err != null) return callback(err, null);
+    return callback(null, doc.documents[0]);
+  });
+}
+
+/**
+ * Get ReplicaSet status
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from replSetGetStatus or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Admin.prototype.replSetGetStatus = function(callback) {
+  var self = this;
+
+  this.db.executeDbAdminCommand({replSetGetStatus:1}, function(err, doc) {
+    if(err == null && doc.documents[0].ok === 1)
+      return callback(null, doc.documents[0]);
+    if(err) return callback(err, false);
+    return callback(utils.toError(doc.documents[0]), false);
+  });
+};
+
+/**
+ * @ignore
+ */
+exports.Admin = Admin;
diff --git a/node_modules/mongodb/lib/mongodb/auth/mongodb_cr.js b/node_modules/mongodb/lib/mongodb/auth/mongodb_cr.js
new file mode 100644
index 0000000..51b09b1
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/auth/mongodb_cr.js
@@ -0,0 +1,53 @@
+var DbCommand = require('../commands/db_command').DbCommand
+  , utils = require('../utils');
+
+var authenticate = function(db, username, password, authdb, options, callback) {
+  var numberOfConnections = 0;
+  var errorObject = null;
+
+  if(options['connection'] != null) {
+    //if a connection was explicitly passed on options, then we have only one...
+    numberOfConnections = 1;
+  } else {
+    // Get the amount of connections in the pool to ensure we have authenticated all comments
+    numberOfConnections = db.serverConfig.allRawConnections().length;
+    options['onAll'] = true;
+  }
+
+  // Execute all four
+  db._executeQueryCommand(DbCommand.createGetNonceCommand(db), options, function(err, result, connection) {
+    // Execute on all the connections
+    if(err == null) {
+      // Nonce used to make authentication request with md5 hash
+      var nonce = result.documents[0].nonce;
+      // Execute command
+      db._executeQueryCommand(DbCommand.createAuthenticationCommand(db, username, password, nonce, authdb), {connection:connection}, function(err, result) {
+        // Count down
+        numberOfConnections = numberOfConnections - 1;
+        // Ensure we save any error
+        if(err) {
+          errorObject = err;
+        } else if(result.documents[0].err != null || result.documents[0].errmsg != null){
+          errorObject = utils.toError(result.documents[0]);
+        }
+
+        // Work around the case where the number of connections are 0
+        if(numberOfConnections <= 0 && typeof callback == 'function') {
+          var internalCallback = callback;
+          callback = null;
+
+          if(errorObject == null && result.documents[0].ok == 1) {
+            // We authenticated correctly save the credentials
+            db.serverConfig.auth.add('MONGODB-CR', db.databaseName, username, password, authdb);
+            // Return callback
+            internalCallback(errorObject, true);
+          } else {
+            internalCallback(errorObject, false);
+          }
+        }
+      });
+    }
+  });  
+}
+
+exports.authenticate = authenticate;
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/auth/mongodb_gssapi.js b/node_modules/mongodb/lib/mongodb/auth/mongodb_gssapi.js
new file mode 100644
index 0000000..f41cd5d
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/auth/mongodb_gssapi.js
@@ -0,0 +1,148 @@
+var DbCommand = require('../commands/db_command').DbCommand
+  , utils = require('../utils')
+  , format = require('util').format;
+
+// Kerberos class
+var Kerberos = null;
+var MongoAuthProcess = null;
+// Try to grab the Kerberos class
+try {
+  Kerberos = require('kerberos').Kerberos
+  // Authentication process for Mongo
+  MongoAuthProcess = require('kerberos').processes.MongoAuthProcess
+} catch(err) {}
+
+var authenticate = function(db, username, password, authdb, options, callback) {
+  var numberOfConnections = 0;
+  var errorObject = null;  
+  // We don't have the Kerberos library
+  if(Kerberos == null) return callback(new Error("Kerberos library is not installed"));
+
+  if(options['connection'] != null) {
+    //if a connection was explicitly passed on options, then we have only one...
+    numberOfConnections = 1;
+  } else {
+    // Get the amount of connections in the pool to ensure we have authenticated all comments
+    numberOfConnections = db.serverConfig.allRawConnections().length;
+    options['onAll'] = true;
+  }
+
+  // Grab all the connections
+  var connections = options['connection'] != null ? [options['connection']] : db.serverConfig.allRawConnections();
+  var error = null;
+  // Authenticate all connections
+  for(var i = 0; i < numberOfConnections; i++) {
+
+    // Start Auth process for a connection
+    GSSAPIInitialize(db, username, password, authdb, connections[i], function(err, result) {
+      // Adjust number of connections left to connect
+      numberOfConnections = numberOfConnections - 1;
+      // If we have an error save it
+      if(err) error = err;
+
+      // We are done
+      if(numberOfConnections == 0) {
+        if(err) return callback(error, false);
+        // We authenticated correctly save the credentials
+        db.serverConfig.auth.add('GSSAPI', db.databaseName, username, password, authdb);
+        // Return valid callback
+        return callback(null, true);
+      }
+    });    
+  }
+}
+
+//
+// Initialize step
+var GSSAPIInitialize = function(db, username, password, authdb, connection, callback) {
+  // Create authenticator
+  var mongo_auth_process = new MongoAuthProcess(connection.socketOptions.host, connection.socketOptions.port);
+
+  // Perform initialization
+  mongo_auth_process.init(username, password, function(err, context) {
+    if(err) return callback(err, false);
+
+    // Perform the first step
+    mongo_auth_process.transition('', function(err, payload) {
+      if(err) return callback(err, false);
+
+      // Call the next db step
+      MongoDBGSSAPIFirstStep(mongo_auth_process, payload, db, username, password, authdb, connection, callback);
+    });
+  });
+}
+
+//
+// Perform first step against mongodb
+var MongoDBGSSAPIFirstStep = function(mongo_auth_process, payload, db, username, password, authdb, connection, callback) {
+  // Build the sasl start command
+  var command = {
+      saslStart: 1
+    , mechanism: 'GSSAPI'
+    , payload: payload
+    , autoAuthorize: 1
+  };
+
+  // Execute first sasl step
+  db._executeQueryCommand(DbCommand.createDbCommand(db, command, {}, '$external'), {connection:connection}, function(err, doc) {
+    if(err) return callback(err, false);
+    // Get the payload
+    doc = doc.documents[0];
+    var db_payload = doc.payload;
+
+    mongo_auth_process.transition(doc.payload, function(err, payload) {
+      if(err) return callback(err, false);
+
+      // MongoDB API Second Step
+      MongoDBGSSAPISecondStep(mongo_auth_process, payload, doc, db, username, password, authdb, connection, callback);
+    });
+  });
+}
+
+//
+// Perform first step against mongodb
+var MongoDBGSSAPISecondStep = function(mongo_auth_process, payload, doc, db, username, password, authdb, connection, callback) {
+  // Build Authentication command to send to MongoDB
+  var command = {
+      saslContinue: 1
+    , conversationId: doc.conversationId
+    , payload: payload
+  };
+
+  // Execute the command
+  db._executeQueryCommand(DbCommand.createDbCommand(db, command, {}, '$external'), {connection:connection}, function(err, doc) {
+    if(err) return callback(err, false);
+
+    // Get the result document
+    doc = doc.documents[0];
+
+    // Call next transition for kerberos
+    mongo_auth_process.transition(doc.payload, function(err, payload) {
+      if(err) return callback(err, false);
+
+      // Call the last and third step
+      MongoDBGSSAPIThirdStep(mongo_auth_process, payload, doc, db, username, password, authdb, connection, callback);
+    });    
+  });
+}
+
+var MongoDBGSSAPIThirdStep = function(mongo_auth_process, payload, doc, db, username, password, authdb, connection, callback) {
+  // Build final command
+  var command = {
+      saslContinue: 1
+    , conversationId: doc.conversationId
+    , payload: payload
+  };
+
+  // Let's finish the auth process against mongodb
+  db._executeQueryCommand(DbCommand.createDbCommand(db, command, {}, '$external'), {connection:connection}, function(err, doc) {
+    if(err) return callback(err, false);
+
+    mongo_auth_process.transition(null, function(err, payload) {
+      if(err) return callback(err, false);
+      callback(null, true);
+    });
+  });
+}
+
+exports.authenticate = authenticate;
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/auth/mongodb_sspi.js b/node_modules/mongodb/lib/mongodb/auth/mongodb_sspi.js
new file mode 100644
index 0000000..1990efd
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/auth/mongodb_sspi.js
@@ -0,0 +1,134 @@
+var DbCommand = require('../commands/db_command').DbCommand
+  , utils = require('../utils')
+  , format = require('util').format;
+
+// Kerberos class
+var Kerberos = null;
+var MongoAuthProcess = null;
+// Try to grab the Kerberos class
+try {
+  Kerberos = require('kerberos').Kerberos
+  // Authentication process for Mongo
+  MongoAuthProcess = require('kerberos').processes.MongoAuthProcess
+} catch(err) {}
+
+var authenticate = function(db, username, password, authdb, options, callback) {
+  var numberOfConnections = 0;
+  var errorObject = null;  
+  // We don't have the Kerberos library
+  if(Kerberos == null) return callback(new Error("Kerberos library is not installed"));
+
+  if(options['connection'] != null) {
+    //if a connection was explicitly passed on options, then we have only one...
+    numberOfConnections = 1;
+  } else {
+    // Get the amount of connections in the pool to ensure we have authenticated all comments
+    numberOfConnections = db.serverConfig.allRawConnections().length;
+    options['onAll'] = true;
+  }
+
+  var connection = db.serverConfig.allRawConnections()[0];
+
+  // Grab all the connections
+  var connections = db.serverConfig.allRawConnections();
+  var error = null;
+  
+  // Authenticate all connections
+  for(var i = 0; i < numberOfConnections; i++) {
+    // Start Auth process for a connection
+    SSIPAuthenticate(db, username, password, authdb, connections[i], function(err, result) {
+      // Adjust number of connections left to connect
+      numberOfConnections = numberOfConnections - 1;
+      // If we have an error save it
+      if(err) error = err;
+
+      // We are done
+      if(numberOfConnections == 0) {
+        if(err) return callback(err, false);
+        // We authenticated correctly save the credentials
+        db.serverConfig.auth.add('GSSAPI', db.databaseName, username, password, authdb);
+        // Return valid callback
+        return callback(null, true);
+      }
+    });    
+  }
+}
+
+var SSIPAuthenticate = function(db, username, password, authdb, connection, callback) {
+  // --------------------------------------------------------------
+  // Async Version
+  // --------------------------------------------------------------
+  var command = {
+      saslStart: 1
+    , mechanism: 'GSSAPI'
+    , payload: ''
+    , autoAuthorize: 1
+  };
+
+  // Create authenticator
+  var mongo_auth_process = new MongoAuthProcess(connection.socketOptions.host, connection.socketOptions.port);
+
+  // Execute first sasl step
+  db._executeQueryCommand(DbCommand.createDbCommand(db, command, {}, '$external'), {connection:connection}, function(err, doc) {
+    if(err) return callback(err);
+    doc = doc.documents[0];
+
+    mongo_auth_process.init(username, password, function(err) {
+      if(err) return callback(err);
+
+      mongo_auth_process.transition(doc.payload, function(err, payload) {
+        if(err) return callback(err);
+
+        // Perform the next step against mongod
+        var command = {
+            saslContinue: 1
+          , conversationId: doc.conversationId
+          , payload: payload
+        };
+
+        // Execute the command
+        db._executeQueryCommand(DbCommand.createDbCommand(db, command, {}, '$external'), {connection:connection}, function(err, doc) {
+          if(err) return callback(err);
+          doc = doc.documents[0];
+
+          mongo_auth_process.transition(doc.payload, function(err, payload) {
+            if(err) return callback(err);
+
+            // Perform the next step against mongod
+            var command = {
+                saslContinue: 1
+              , conversationId: doc.conversationId
+              , payload: payload
+            };
+
+            // Execute the command
+            db._executeQueryCommand(DbCommand.createDbCommand(db, command, {}, '$external'), {connection:connection}, function(err, doc) {
+              if(err) return callback(err);
+              doc = doc.documents[0];
+              
+              mongo_auth_process.transition(doc.payload, function(err, payload) {
+                // Perform the next step against mongod
+                var command = {
+                    saslContinue: 1
+                  , conversationId: doc.conversationId
+                  , payload: payload
+                };
+
+                // Execute the command
+                db._executeQueryCommand(DbCommand.createDbCommand(db, command, {}, '$external'), {connection:connection}, function(err, doc) {
+                  if(err) return callback(err);
+                  doc = doc.documents[0];
+
+                  if(doc.done) return callback(null, true);
+                  callback(new Error("Authentication failed"), false);
+                });        
+              });
+            });
+          });
+        });
+      });
+    });
+  });  
+}
+
+exports.authenticate = authenticate;
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/collection.js b/node_modules/mongodb/lib/mongodb/collection.js
new file mode 100644
index 0000000..e0b792b
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/collection.js
@@ -0,0 +1,1759 @@
+/**
+ * Module dependencies.
+ * @ignore
+ */
+var InsertCommand = require('./commands/insert_command').InsertCommand
+  , QueryCommand = require('./commands/query_command').QueryCommand
+  , DeleteCommand = require('./commands/delete_command').DeleteCommand
+  , UpdateCommand = require('./commands/update_command').UpdateCommand
+  , DbCommand = require('./commands/db_command').DbCommand
+  , ObjectID = require('bson').ObjectID
+  , Code = require('bson').Code
+  , Cursor = require('./cursor').Cursor
+  , utils = require('./utils');
+
+/**
+ * Precompiled regexes
+ * @ignore
+**/
+const eErrorMessages = /No matching object found/;
+
+/**
+ * toString helper.
+ * @ignore
+ */
+var toString = Object.prototype.toString;
+
+/**
+ * Create a new Collection instance (INTERNAL TYPE)
+ *
+ * Options
+ *  - **readPreference** {String}, the prefered read preference (ReadPreference.PRIMARY, ReadPreference.PRIMARY_PREFERRED, ReadPreference.SECONDARY, ReadPreference.SECONDARY_PREFERRED, ReadPreference.NEAREST).
+ *  - **slaveOk** {Boolean, default:false}, Allow reads from secondaries.
+ *  - **serializeFunctions** {Boolean, default:false}, serialize functions on the document.
+ *  - **raw** {Boolean, default:false}, perform all operations using raw bson objects.
+ *  - **pkFactory** {Object}, object overriding the basic ObjectID primary key generation.
+ *
+ * @class Represents a Collection
+ * @param {Object} db db instance.
+ * @param {String} collectionName collection name.
+ * @param {Object} [pkFactory] alternative primary key factory.
+ * @param {Object} [options] additional options for the collection.
+ * @return {Object} a collection instance.
+ */
+function Collection (db, collectionName, pkFactory, options) {
+  if(!(this instanceof Collection)) return new Collection(db, collectionName, pkFactory, options);
+
+  checkCollectionName(collectionName);
+
+  this.db = db;
+  this.collectionName = collectionName;
+  this.internalHint = null;
+  this.opts = options != null && ('object' === typeof options) ? options : {};
+  this.slaveOk = options == null || options.slaveOk == null ? db.slaveOk : options.slaveOk;
+  this.serializeFunctions = options == null || options.serializeFunctions == null ? db.serializeFunctions : options.serializeFunctions;
+  this.raw = options == null || options.raw == null ? db.raw : options.raw;
+
+  this.readPreference = options == null || options.readPreference == null ? db.serverConfig.options.readPreference : options.readPreference;
+  this.readPreference = this.readPreference == null ? 'primary' : this.readPreference;
+
+  this.pkFactory = pkFactory == null
+    ? ObjectID
+    : pkFactory;
+
+  var self = this;
+}
+
+/**
+ * Inserts a single document or a an array of documents into MongoDB.
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **continueOnError/keepGoing** {Boolean, default:false}, keep inserting documents even if one document has an error, *mongodb 1.9.1 >*.
+ *  - **serializeFunctions** {Boolean, default:false}, serialize functions on the document.
+ *  - **forceServerObjectId** {Boolean, default:false}, let server assign ObjectId instead of the driver
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {Array|Object} docs
+ * @param {Object} [options] optional options for insert command
+ * @param {Function} [callback] optional callback for the function, must be provided when using a writeconcern
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.insert = function insert (docs, options, callback) {
+  if ('function' === typeof options) callback = options, options = {};
+  if(options == null) options = {};
+  if(!('function' === typeof callback)) callback = null;
+  var self = this;
+  insertAll(self, Array.isArray(docs) ? docs : [docs], options, callback);
+  return this;
+};
+
+/**
+ * @ignore
+ */
+var checkCollectionName = function checkCollectionName (collectionName) {
+  if ('string' !== typeof collectionName) {
+    throw Error("collection name must be a String");
+  }
+
+  if (!collectionName || collectionName.indexOf('..') != -1) {
+    throw Error("collection names cannot be empty");
+  }
+
+  if (collectionName.indexOf('$') != -1 &&
+      collectionName.match(/((^\$cmd)|(oplog\.\$main))/) == null) {
+    throw Error("collection names must not contain '$'");
+  }
+
+  if (collectionName.match(/^\.|\.$/) != null) {
+    throw Error("collection names must not start or end with '.'");
+  }
+};
+
+/**
+ * Removes documents specified by `selector` from the db.
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **single** {Boolean, default:false}, removes the first document found.
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {Object} [selector] optional select, no selector is equivalent to removing all documents.
+ * @param {Object} [options] additional options during remove.
+ * @param {Function} [callback] must be provided if you performing a remove with a writeconcern
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.remove = function remove(selector, options, callback) {
+  if ('function' === typeof selector) {
+    callback = selector;
+    selector = options = {};
+  } else if ('function' === typeof options) {
+    callback = options;
+    options = {};
+  }
+
+  // Ensure options
+  if(options == null) options = {};
+  if(!('function' === typeof callback)) callback = null;
+  // Ensure we have at least an empty selector
+  selector = selector == null ? {} : selector;
+  // Set up flags for the command, if we have a single document remove
+  var flags = 0 | (options.single ? 1 : 0);
+
+  // DbName
+  var dbName = options['dbName'];
+  // If no dbname defined use the db one
+  if(dbName == null) {
+    dbName = this.db.databaseName;
+  }
+
+  // Create a delete command
+  var deleteCommand = new DeleteCommand(
+      this.db
+    , dbName + "." + this.collectionName
+    , selector
+    , flags);
+
+  var self = this;
+  var errorOptions = _getWriteConcern(self, options, callback);
+  // Execute the command, do not add a callback as it's async
+  if(_hasWriteConcern(errorOptions) && typeof callback == 'function') {
+    // Insert options
+    var commandOptions = {read:false};
+    // If we have safe set set async to false
+    if(errorOptions == null) commandOptions['async'] = true;
+    // Set safe option
+    commandOptions['safe'] = true;
+    // If we have an error option
+    if(typeof errorOptions == 'object') {
+      var keys = Object.keys(errorOptions);
+      for(var i = 0; i < keys.length; i++) {
+        commandOptions[keys[i]] = errorOptions[keys[i]];
+      }
+    }
+
+    // Execute command with safe options (rolls up both command and safe command into one and executes them on the same connection)
+    this.db._executeRemoveCommand(deleteCommand, commandOptions, function (err, error) {
+      error = error && error.documents;
+      if(!callback) return;
+
+      if(err) {
+        callback(err);
+      } else if(error[0].err || error[0].errmsg) {
+        callback(utils.toError(error[0]));
+      } else {
+        callback(null, error[0].n);
+      }
+    });
+  } else if(_hasWriteConcern(errorOptions) && callback == null) {
+    throw new Error("Cannot use a writeConcern without a provided callback");
+  } else {
+    var result = this.db._executeRemoveCommand(deleteCommand);
+    // If no callback just return
+    if (!callback) return;
+    // If error return error
+    if (result instanceof Error) {
+      return callback(result);
+    }
+    // Otherwise just return
+    return callback();
+  }
+};
+
+/**
+ * Renames the collection.
+ *
+ * Options
+ *  - **dropTarget** {Boolean, default:false}, drop the target name collection if it previously exists.
+ *
+ * @param {String} newName the new name of the collection.
+ * @param {Object} [options] returns option results.
+ * @param {Function} callback the callback accepting the result
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.rename = function rename (newName, options, callback) {
+  var self = this;
+
+  if(typeof options == 'function') {
+    callback = options;
+    options = {}
+  }
+
+  // Ensure the new name is valid
+  checkCollectionName(newName);
+  // Execute the command, return the new renamed collection if successful
+  self.db._executeQueryCommand(DbCommand.createRenameCollectionCommand(self.db, self.collectionName, newName, options), function(err, result) {
+    if(err == null && result.documents[0].ok == 1) {
+      if(callback != null) {
+        // Set current object to point to the new name
+        self.collectionName = newName;
+        // Return the current collection
+        callback(null, self);
+      }
+    } else if(result.documents[0].errmsg != null) {
+      if(null != callback) {
+        if (null == err) {
+          err = utils.toError(result.documents[0]);
+        }
+        callback(err, null);
+      }
+    }
+  });
+};
+
+/**
+ * @ignore
+ */
+var insertAll = function insertAll (self, docs, options, callback) {
+  if('function' === typeof options) callback = options, options = {};
+  if(options == null) options = {};
+  if(!('function' === typeof callback)) callback = null;
+
+  // Insert options (flags for insert)
+  var insertFlags = {};
+  // If we have a mongodb version >= 1.9.1 support keepGoing attribute
+  if(options['keepGoing'] != null) {
+    insertFlags['keepGoing'] = options['keepGoing'];
+  }
+
+  // If we have a mongodb version >= 1.9.1 support keepGoing attribute
+  if(options['continueOnError'] != null) {
+    insertFlags['continueOnError'] = options['continueOnError'];
+  }
+
+  // DbName
+  var dbName = options['dbName'];
+  // If no dbname defined use the db one
+  if(dbName == null) {
+    dbName = self.db.databaseName;
+  }
+
+  // Either use override on the function, or go back to default on either the collection
+  // level or db
+  if(options['serializeFunctions'] != null) {
+    insertFlags['serializeFunctions'] = options['serializeFunctions'];
+  } else {
+    insertFlags['serializeFunctions'] = self.serializeFunctions;
+  }
+
+  // Pass in options
+  var insertCommand = new InsertCommand(
+      self.db
+    , dbName + "." + self.collectionName, true, insertFlags);
+
+  // Add the documents and decorate them with id's if they have none
+  for(var index = 0, len = docs.length; index < len; ++index) {
+    var doc = docs[index];
+
+    // Add id to each document if it's not already defined
+    if (!(Buffer.isBuffer(doc)) 
+      && doc['_id'] == null 
+      && self.db.forceServerObjectId != true
+      && options.forceServerObjectId != true) {
+        doc['_id'] = self.pkFactory.createPk();
+    }
+
+    insertCommand.add(doc);
+  }
+
+  // Collect errorOptions
+  var errorOptions = _getWriteConcern(self, options, callback);
+  // Default command options
+  var commandOptions = {};
+  // If safe is defined check for error message
+  if(_hasWriteConcern(errorOptions) && typeof callback == 'function') {
+    // Insert options
+    commandOptions['read'] = false;
+    // If we have safe set set async to false
+    if(errorOptions == null) commandOptions['async'] = true;
+
+    // Set safe option
+    commandOptions['safe'] = errorOptions;
+    // If we have an error option
+    if(typeof errorOptions == 'object') {
+      var keys = Object.keys(errorOptions);
+      for(var i = 0; i < keys.length; i++) {
+        commandOptions[keys[i]] = errorOptions[keys[i]];
+      }
+    }
+
+    // Execute command with safe options (rolls up both command and safe command into one and executes them on the same connection)
+    self.db._executeInsertCommand(insertCommand, commandOptions, function (err, error) {
+      error = error && error.documents;
+      if(!callback) return;
+
+      if (err) {
+        callback(err);
+      } else if(error[0].err || error[0].errmsg) {
+        callback(utils.toError(error[0]));
+      } else {
+        callback(null, docs);
+      }
+    });
+  } else if(_hasWriteConcern(errorOptions) && callback == null) {
+    throw new Error("Cannot use a writeConcern without a provided callback");
+  } else {
+    // Execute the call without a write concern
+    var result = self.db._executeInsertCommand(insertCommand, commandOptions);
+    // If no callback just return
+    if(!callback) return;
+    // If error return error
+    if(result instanceof Error) {
+      return callback(result);
+    }
+    // Otherwise just return
+    return callback(null, docs);
+  }
+};
+
+/**
+ * Save a document. Simple full document replacement function. Not recommended for efficiency, use atomic
+ * operators and update instead for more efficient operations.
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {Object} [doc] the document to save
+ * @param {Object} [options] additional options during remove.
+ * @param {Function} [callback] must be provided if you performing a safe save
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.save = function save(doc, options, callback) {
+  if('function' === typeof options) callback = options, options = null;
+  if(options == null) options = {};
+  if(!('function' === typeof callback)) callback = null;
+  // Throw an error if attempting to perform a bulk operation
+  if(Array.isArray(doc)) throw new Error("doc parameter must be a single document");
+  // Extract the id, if we have one we need to do a update command
+  var id = doc['_id'];
+  var commandOptions = _getWriteConcern(this, options, callback);
+
+  if(id) {
+    commandOptions.upsert = true;
+    this.update({ _id: id }, doc, commandOptions, callback);
+  } else {
+    this.insert(doc, commandOptions, callback && function (err, docs) {
+      if (err) return callback(err, null);
+
+      if (Array.isArray(docs)) {
+        callback(err, docs[0]);
+      } else {
+        callback(err, docs);
+      }
+    });
+  }
+};
+
+/**
+ * Updates documents.
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **upsert** {Boolean, default:false}, perform an upsert operation.
+ *  - **multi** {Boolean, default:false}, update all documents matching the selector.
+ *  - **serializeFunctions** {Boolean, default:false}, serialize functions on the document.
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {Object} selector the query to select the document/documents to be updated
+ * @param {Object} document the fields/vals to be updated, or in the case of an upsert operation, inserted.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} [callback] must be provided if you performing an update with a writeconcern
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.update = function update(selector, document, options, callback) {
+  if('function' === typeof options) callback = options, options = null;
+  if(options == null) options = {};
+  if(!('function' === typeof callback)) callback = null;
+
+  // DbName
+  var dbName = options['dbName'];
+  // If no dbname defined use the db one
+  if(dbName == null) {
+    dbName = this.db.databaseName;
+  }
+
+  // If we are not providing a selector or document throw
+  if(selector == null || typeof selector != 'object') return callback(new Error("selector must be a valid JavaScript object"));
+  if(document == null || typeof document != 'object') return callback(new Error("document must be a valid JavaScript object"));
+
+  // Either use override on the function, or go back to default on either the collection
+  // level or db
+  if(options['serializeFunctions'] != null) {
+    options['serializeFunctions'] = options['serializeFunctions'];
+  } else {
+    options['serializeFunctions'] = this.serializeFunctions;
+  }
+
+  var updateCommand = new UpdateCommand(
+      this.db
+    , dbName + "." + this.collectionName
+    , selector
+    , document
+    , options);
+
+  var self = this;
+  // Unpack the error options if any
+  var errorOptions = _getWriteConcern(this, options, callback);
+  // If safe is defined check for error message
+  if(_hasWriteConcern(errorOptions) && typeof callback == 'function') {
+    // Insert options
+    var commandOptions = {read:false};
+    // If we have safe set set async to false
+    if(errorOptions == null) commandOptions['async'] = true;
+    // Set safe option
+    commandOptions['safe'] = errorOptions;
+    // If we have an error option
+    if(typeof errorOptions == 'object') {
+      var keys = Object.keys(errorOptions);
+      for(var i = 0; i < keys.length; i++) {
+        commandOptions[keys[i]] = errorOptions[keys[i]];
+      }
+    }
+
+    // Execute command with safe options (rolls up both command and safe command into one and executes them on the same connection)
+    this.db._executeUpdateCommand(updateCommand, commandOptions, function (err, error) {
+      error = error && error.documents;
+      if(!callback) return;
+
+      if(err) {
+        callback(err);
+      } else if(error[0].err || error[0].errmsg) {
+        callback(utils.toError(error[0]));
+      } else {
+        // Perform the callback
+        callback(null, error[0].n, error[0]);
+      }
+    });
+  } else if(_hasWriteConcern(errorOptions) && callback == null) {
+    throw new Error("Cannot use a writeConcern without a provided callback");
+  } else {
+    // Execute update
+    var result = this.db._executeUpdateCommand(updateCommand);
+    // If no callback just return
+    if (!callback) return;
+    // If error return error
+    if (result instanceof Error) {
+      return callback(result);
+    }
+    // Otherwise just return
+    return callback();
+  }
+};
+
+/**
+ * The distinct command returns returns a list of distinct values for the given key across a collection.
+ *
+ * Options
+ *  - **readPreference** {String}, the preferred read preference (Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *
+ * @param {String} key key to run distinct against.
+ * @param {Object} [query] option query to narrow the returned objects.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from distinct or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.distinct = function distinct(key, query, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  query = args.length ? args.shift() || {} : {};
+  options = args.length ? args.shift() || {} : {};
+
+  var mapCommandHash = {
+      'distinct': this.collectionName
+    , 'query': query
+    , 'key': key
+  };
+
+  // Set read preference if we set one
+  var readPreference = options['readPreference'] ? options['readPreference'] : false;
+  // Create the command
+  var cmd = DbCommand.createDbSlaveOkCommand(this.db, mapCommandHash);
+
+  this.db._executeQueryCommand(cmd, {read:readPreference}, function (err, result) {
+    if(err)
+      return callback(err);
+    if(result.documents[0].ok != 1)
+      return callback(new Error(result.documents[0].errmsg));
+    callback(null, result.documents[0].values);
+  });
+};
+
+/**
+ * Count number of matching documents in the db to a query.
+ *
+ * Options
+ *  - **skip** {Number}, The number of documents to skip for the count.
+ *  - **limit** {Number}, The limit of documents to count.
+ *  - **readPreference** {String}, the preferred read preference (Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *
+ * @param {Object} [query] query to filter by before performing count.
+ * @param {Object} [options] additional options during count.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the count method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.count = function count (query, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  query = args.length ? args.shift() || {} : {};
+  options = args.length ? args.shift() || {} : {};
+  var skip = options.skip;
+  var limit = options.limit;
+
+  // Final query
+  var commandObject = {
+      'count': this.collectionName
+    , 'query': query
+    , 'fields': null
+  };
+
+  // Add limit and skip if defined
+  if(typeof skip == 'number') commandObject.skip = skip;
+  if(typeof limit == 'number') commandObject.limit = limit;
+
+  // Set read preference if we set one
+  options.readPreference = _getReadConcern(this, options);
+
+  // Execute the command
+  this.db.command(commandObject, options, function(err, result) {
+    if(err) return callback(err, null);
+    return callback(null, result.n);
+  });
+};
+
+
+/**
+ * Drop the collection
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the drop method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.drop = function drop(callback) {
+  this.db.dropCollection(this.collectionName, callback);
+};
+
+/**
+ * Find and update a document.
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **remove** {Boolean, default:false}, set to true to remove the object before returning.
+ *  - **upsert** {Boolean, default:false}, perform an upsert operation.
+ *  - **new** {Boolean, default:false}, set to true if you want to return the modified object rather than the original. Ignored for remove.
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {Object} query query object to locate the object to modify
+ * @param {Array}  sort - if multiple docs match, choose the first one in the specified sort order as the object to manipulate
+ * @param {Object} doc - the fields/vals to be updated
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the findAndModify method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.findAndModify = function findAndModify (query, sort, doc, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  sort = args.length ? args.shift() || [] : [];
+  doc = args.length ? args.shift() : null;
+  options = args.length ? args.shift() || {} : {};
+  var self = this;
+
+  var queryObject = {
+      'findandmodify': this.collectionName
+    , 'query': query
+    , 'sort': utils.formattedOrderClause(sort)
+  };
+
+  queryObject.new = options.new ? 1 : 0;
+  queryObject.remove = options.remove ? 1 : 0;
+  queryObject.upsert = options.upsert ? 1 : 0;
+
+  if (options.fields) {
+    queryObject.fields = options.fields;
+  }
+
+  if (doc && !options.remove) {
+    queryObject.update = doc;
+  }
+
+  // Either use override on the function, or go back to default on either the collection
+  // level or db
+  if(options['serializeFunctions'] != null) {
+    options['serializeFunctions'] = options['serializeFunctions'];
+  } else {
+    options['serializeFunctions'] = this.serializeFunctions;
+  }
+
+  // Unpack the error options if any
+  var errorOptions = _getWriteConcern(this, options, callback);
+  // If we have j, w or something else do the getLast Error path
+  if(errorOptions != null 
+    && typeof errorOptions == 'object'
+    && (errorOptions.w != 0 && errorOptions.w != 1 && errorOptions.safe != false)) {
+    // Commands to send
+    var commands = [];
+    // Add the find and modify command
+    commands.push(DbCommand.createDbCommand(this.db, queryObject, options));
+    // If we have safe defined we need to return both call results
+    var chainedCommands = errorOptions != null ? true : false;
+    // Add error command if we have one
+    if(chainedCommands) {
+      commands.push(DbCommand.createGetLastErrorCommand(errorOptions, this.db));
+    }
+
+    // Fire commands and
+    this.db._executeQueryCommand(commands, {read:false}, function(err, result) {
+      if(err != null) return callback(err);
+      result = result && result.documents;
+
+      if(result[0].err != null) {
+        return callback(utils.toError(result[0]), null);
+      }
+
+      // Workaround due to 1.8.X returning an error on no matching object
+      // while 2.0.X does not not, making 2.0.X behaviour standard
+      if(result[0].errmsg != null && !result[0].errmsg.match(eErrorMessages)) {
+        return callback(utils.toError(result[0]), null, result[0]);
+      }
+
+      return callback(null, result[0].value, result[0]);
+    });
+  } else {
+    // Only run command and rely on getLastError command
+    var command = DbCommand.createDbCommand(this.db, queryObject, options)
+    // Execute command
+    this.db._executeQueryCommand(command, {read:false}, function(err, result) {
+      if(err != null) return callback(err);
+
+      result = result && result.documents;
+
+      if(result[0].errmsg != null && !result[0].errmsg.match(eErrorMessages)) {
+        return callback(utils.toError(result[0]), null, result[0]);
+      }
+
+      // If we have an error return it
+      if(result[0].lastErrorObject && result[0].lastErrorObject.err != null) {
+        return callback(utils.toError(result[0].lastErrorObject), null);
+      }
+
+      return callback(null, result[0].value, result[0]);
+    });
+  }
+}
+
+/**
+ * Find and remove a document
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {Object} query query object to locate the object to modify
+ * @param {Array}  sort - if multiple docs match, choose the first one in the specified sort order as the object to manipulate
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the findAndRemove method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.findAndRemove = function(query, sort, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  sort = args.length ? args.shift() || [] : [];
+  options = args.length ? args.shift() || {} : {};
+  // Add the remove option
+  options['remove'] = true;
+  // Execute the callback
+  this.findAndModify(query, sort, null, options, callback);
+}
+
+var testForFields = {
+    limit: 1, sort: 1, fields:1, skip: 1, hint: 1, explain: 1, snapshot: 1, timeout: 1, tailable: 1, tailableRetryInterval: 1
+  , numberOfRetries: 1, awaitdata: 1, exhaust: 1, batchSize: 1, returnKey: 1, maxScan: 1, min: 1, max: 1, showDiskLoc: 1
+  , comment: 1, raw: 1, readPreference: 1, partial: 1, read: 1, dbName: 1
+};
+
+/**
+ * Creates a cursor for a query that can be used to iterate over results from MongoDB
+ *
+ * Various argument possibilities
+ *  - callback?
+ *  - selector, callback?,
+ *  - selector, fields, callback?
+ *  - selector, options, callback?
+ *  - selector, fields, options, callback?
+ *  - selector, fields, skip, limit, callback?
+ *  - selector, fields, skip, limit, timeout, callback?
+ *
+ * Options
+ *  - **limit** {Number, default:0}, sets the limit of documents returned in the query.
+ *  - **sort** {Array | Object}, set to sort the documents coming back from the query. Array of indexes, [['a', 1]] etc.
+ *  - **fields** {Object}, the fields to return in the query. Object of fields to include or exclude (not both), {'a':1}
+ *  - **skip** {Number, default:0}, set to skip N documents ahead in your query (useful for pagination).
+ *  - **hint** {Object}, tell the query to use specific indexes in the query. Object of indexes to use, {'_id':1}
+ *  - **explain** {Boolean, default:false}, explain the query instead of returning the data.
+ *  - **snapshot** {Boolean, default:false}, snapshot query.
+ *  - **timeout** {Boolean, default:false}, specify if the cursor can timeout.
+ *  - **tailable** {Boolean, default:false}, specify if the cursor is tailable.
+ *  - **tailableRetryInterval** {Number, default:100}, specify the miliseconds between getMores on tailable cursor.
+ *  - **numberOfRetries** {Number, default:5}, specify the number of times to retry the tailable cursor.
+ *  - **awaitdata** {Boolean, default:false} allow the cursor to wait for data, only applicable for tailable cursor.
+ *  - **exhaust** {Boolean, default:false} have the server send all the documents at once as getMore packets, not recommended.
+ *  - **batchSize** {Number, default:0}, set the batchSize for the getMoreCommand when iterating over the query results.
+ *  - **returnKey** {Boolean, default:false}, only return the index key.
+ *  - **maxScan** {Number}, Limit the number of items to scan.
+ *  - **min** {Number}, Set index bounds.
+ *  - **max** {Number}, Set index bounds.
+ *  - **showDiskLoc** {Boolean, default:false}, Show disk location of results.
+ *  - **comment** {String}, You can put a $comment field on a query to make looking in the profiler logs simpler.
+ *  - **raw** {Boolean, default:false}, Return all BSON documents as Raw Buffer documents.
+ *  - **readPreference** {String}, the preferred read preference ((Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *  - **numberOfRetries** {Number, default:5}, if using awaidata specifies the number of times to retry on timeout.
+ *  - **partial** {Boolean, default:false}, specify if the cursor should return partial results when querying against a sharded system
+ *
+ * @param {Object|ObjectID} query query object to locate the object to modify
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the find method or null if an error occured.
+ * @return {Cursor} returns a cursor to the query
+ * @api public
+ */
+Collection.prototype.find = function find () {
+  var options
+    , args = Array.prototype.slice.call(arguments, 0)
+    , has_callback = typeof args[args.length - 1] === 'function'
+    , has_weird_callback = typeof args[0] === 'function'
+    , callback = has_callback ? args.pop() : (has_weird_callback ? args.shift() : null)
+    , len = args.length
+    , selector = len >= 1 ? args[0] : {}
+    , fields = len >= 2 ? args[1] : undefined;
+
+  if(len === 1 && has_weird_callback) {
+    // backwards compat for callback?, options case
+    selector = {};
+    options = args[0];
+  }
+
+  if(len === 2 && !Array.isArray(fields)) {
+    var fieldKeys = Object.getOwnPropertyNames(fields);
+    var is_option = false;
+
+    for(var i = 0; i < fieldKeys.length; i++) {
+      if(testForFields[fieldKeys[i]] != null) {
+        is_option = true;
+        break;
+      }
+    }
+
+    if(is_option) {
+      options = fields;
+      fields = undefined;
+    } else {
+      options = {};
+    }
+  } else if(len === 2 && Array.isArray(fields) && !Array.isArray(fields[0])) {
+    var newFields = {};
+    // Rewrite the array
+    for(var i = 0; i < fields.length; i++) {
+      newFields[fields[i]] = 1;
+    }
+    // Set the fields
+    fields = newFields;
+  }
+
+  if(3 === len) {
+    options = args[2];
+  }
+
+  // Ensure selector is not null
+  selector = selector == null ? {} : selector;
+  // Validate correctness off the selector
+  var object = selector;
+  if(Buffer.isBuffer(object)) {
+    var object_size = object[0] | object[1] << 8 | object[2] << 16 | object[3] << 24;
+    if(object_size != object.length)  {
+      var error = new Error("query selector raw message size does not match message header size [" + object.length + "] != [" + object_size + "]");
+      error.name = 'MongoError';
+      throw error;
+    }
+  }
+
+  // Validate correctness of the field selector
+  var object = fields;
+  if(Buffer.isBuffer(object)) {
+    var object_size = object[0] | object[1] << 8 | object[2] << 16 | object[3] << 24;
+    if(object_size != object.length)  {
+      var error = new Error("query fields raw message size does not match message header size [" + object.length + "] != [" + object_size + "]");
+      error.name = 'MongoError';
+      throw error;
+    }
+  }
+
+  // Check special case where we are using an objectId
+  if(selector instanceof ObjectID || (selector != null && selector._bsontype == 'ObjectID')) {
+    selector = {_id:selector};
+  }
+
+  // If it's a serialized fields field we need to just let it through
+  // user be warned it better be good
+  if(options && options.fields && !(Buffer.isBuffer(options.fields))) {
+    fields = {};
+
+    if(Array.isArray(options.fields)) {
+      if(!options.fields.length) {
+        fields['_id'] = 1;
+      } else {
+        for (var i = 0, l = options.fields.length; i < l; i++) {
+          fields[options.fields[i]] = 1;
+        }
+      }
+    } else {
+      fields = options.fields;
+    }
+  }
+
+  if (!options) options = {};
+  options.skip = len > 3 ? args[2] : options.skip ? options.skip : 0;
+  options.limit = len > 3 ? args[3] : options.limit ? options.limit : 0;
+  options.raw = options.raw != null && typeof options.raw === 'boolean' ? options.raw : this.raw;
+  options.hint = options.hint != null ? normalizeHintField(options.hint) : this.internalHint;
+  options.timeout = len == 5 ? args[4] : typeof options.timeout === 'undefined' ? undefined : options.timeout;
+  // If we have overridden slaveOk otherwise use the default db setting
+  options.slaveOk = options.slaveOk != null ? options.slaveOk : this.db.slaveOk;
+
+  // Set option
+  var o = options;
+  // Support read/readPreference
+  if(o["read"] != null) o["readPreference"] = o["read"];
+  // Set the read preference
+  o.read = o["readPreference"] ? o.readPreference : this.readPreference;
+  // Adjust slave ok if read preference is secondary or secondary only
+  if(o.read == "secondary" || o.read == "secondaryOnly") options.slaveOk = true;
+
+  // callback for backward compatibility
+  if(callback) {
+    // TODO refactor Cursor args
+    callback(null, new Cursor(this.db, this, selector, fields, o));
+  } else {
+    return new Cursor(this.db, this, selector, fields, o);
+  }
+};
+
+/**
+ * Normalizes a `hint` argument.
+ *
+ * @param {String|Object|Array} hint
+ * @return {Object}
+ * @api private
+ */
+var normalizeHintField = function normalizeHintField(hint) {
+  var finalHint = null;
+
+  if(typeof hint == 'string') {
+    finalHint = hint;
+  } else if(Array.isArray(hint)) {
+    finalHint = {};
+
+    hint.forEach(function(param) {
+      finalHint[param] = 1;
+    });  
+  } else if(hint != null && typeof hint == 'object') {
+    finalHint = {};
+    for (var name in hint) {
+      finalHint[name] = hint[name];
+    }    
+  }
+
+  return finalHint;
+};
+
+/**
+ * Finds a single document based on the query
+ *
+ * Various argument possibilities
+ *  - callback?
+ *  - selector, callback?,
+ *  - selector, fields, callback?
+ *  - selector, options, callback?
+ *  - selector, fields, options, callback?
+ *  - selector, fields, skip, limit, callback?
+ *  - selector, fields, skip, limit, timeout, callback?
+ *
+ * Options
+ *  - **limit** {Number, default:0}, sets the limit of documents returned in the query.
+ *  - **sort** {Array | Object}, set to sort the documents coming back from the query. Array of indexes, [['a', 1]] etc.
+ *  - **fields** {Object}, the fields to return in the query. Object of fields to include or exclude (not both), {'a':1}
+ *  - **skip** {Number, default:0}, set to skip N documents ahead in your query (useful for pagination).
+ *  - **hint** {Object}, tell the query to use specific indexes in the query. Object of indexes to use, {'_id':1}
+ *  - **explain** {Boolean, default:false}, explain the query instead of returning the data.
+ *  - **snapshot** {Boolean, default:false}, snapshot query.
+ *  - **timeout** {Boolean, default:false}, specify if the cursor can timeout.
+ *  - **tailable** {Boolean, default:false}, specify if the cursor is tailable.
+ *  - **batchSize** {Number, default:0}, set the batchSize for the getMoreCommand when iterating over the query results.
+ *  - **returnKey** {Boolean, default:false}, only return the index key.
+ *  - **maxScan** {Number}, Limit the number of items to scan.
+ *  - **min** {Number}, Set index bounds.
+ *  - **max** {Number}, Set index bounds.
+ *  - **showDiskLoc** {Boolean, default:false}, Show disk location of results.
+ *  - **comment** {String}, You can put a $comment field on a query to make looking in the profiler logs simpler.
+ *  - **raw** {Boolean, default:false}, Return all BSON documents as Raw Buffer documents.
+ *  - **readPreference** {String}, the preferred read preference (Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *  - **partial** {Boolean, default:false}, specify if the cursor should return partial results when querying against a sharded system
+ *
+ * @param {Object|ObjectID} query query object to locate the object to modify
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the findOne method or null if an error occured.
+ * @return {Cursor} returns a cursor to the query
+ * @api public
+ */
+Collection.prototype.findOne = function findOne () {
+  var self = this;
+  var args = Array.prototype.slice.call(arguments, 0);
+  var callback = args.pop();
+  var cursor = this.find.apply(this, args).limit(-1).batchSize(1);
+  // Return the item
+  cursor.nextObject(function(err, item) {
+    if(err != null) return callback(utils.toError(err), null);
+    callback(null, item);
+  });
+};
+
+/**
+ * Creates an index on the collection.
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **unique** {Boolean, default:false}, creates an unique index.
+ *  - **sparse** {Boolean, default:false}, creates a sparse index.
+ *  - **background** {Boolean, default:false}, creates the index in the background, yielding whenever possible.
+ *  - **dropDups** {Boolean, default:false}, a unique index cannot be created on a key that has pre-existing duplicate values. If you would like to create the index anyway, keeping the first document the database indexes and deleting all subsequent documents that have duplicate value
+ *  - **min** {Number}, for geospatial indexes set the lower bound for the co-ordinates.
+ *  - **max** {Number}, for geospatial indexes set the high bound for the co-ordinates.
+ *  - **v** {Number}, specify the format version of the indexes.
+ *  - **expireAfterSeconds** {Number}, allows you to expire data on indexes applied to a data (MongoDB 2.2 or higher)
+ *  - **name** {String}, override the autogenerated index name (useful if the resulting name is larger than 128 bytes)
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {Object} fieldOrSpec fieldOrSpec that defines the index.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the createIndex method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.createIndex = function createIndex (fieldOrSpec, options, callback) {
+  // Clean up call
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  options = args.length ? args.shift() || {} : {};
+  options = typeof callback === 'function' ? options : callback;
+  options = options == null ? {} : options;
+
+  // Collect errorOptions
+  var errorOptions = _getWriteConcern(this, options, callback);
+  // Execute create index
+  this.db.createIndex(this.collectionName, fieldOrSpec, options, callback);
+};
+
+/**
+ * Ensures that an index exists, if it does not it creates it
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **unique** {Boolean, default:false}, creates an unique index.
+ *  - **sparse** {Boolean, default:false}, creates a sparse index.
+ *  - **background** {Boolean, default:false}, creates the index in the background, yielding whenever possible.
+ *  - **dropDups** {Boolean, default:false}, a unique index cannot be created on a key that has pre-existing duplicate values. If you would like to create the index anyway, keeping the first document the database indexes and deleting all subsequent documents that have duplicate value
+ *  - **min** {Number}, for geospatial indexes set the lower bound for the co-ordinates.
+ *  - **max** {Number}, for geospatial indexes set the high bound for the co-ordinates.
+ *  - **v** {Number}, specify the format version of the indexes.
+ *  - **expireAfterSeconds** {Number}, allows you to expire data on indexes applied to a data (MongoDB 2.2 or higher)
+ *  - **name** {String}, override the autogenerated index name (useful if the resulting name is larger than 128 bytes)
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {Object} fieldOrSpec fieldOrSpec that defines the index.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the ensureIndex method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.ensureIndex = function ensureIndex (fieldOrSpec, options, callback) {
+  // Clean up call
+  if (typeof callback === 'undefined' && typeof options === 'function') {
+    callback = options;
+    options = {};
+  }
+
+  if (options == null) {
+    options = {};
+  }
+
+  // Execute create index
+  this.db.ensureIndex(this.collectionName, fieldOrSpec, options, callback);
+};
+
+/**
+ * Retrieves this collections index info.
+ *
+ * Options
+ *  - **full** {Boolean, default:false}, returns the full raw index information.
+ *
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the indexInformation method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.indexInformation = function indexInformation (options, callback) {
+  // Unpack calls
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  options = args.length ? args.shift() || {} : {};
+  // Call the index information
+  this.db.indexInformation(this.collectionName, options, callback);
+};
+
+/**
+ * Drops an index from this collection.
+ *
+ * @param {String} name
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the dropIndex method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.dropIndex = function dropIndex (name, callback) {
+  this.db.dropIndex(this.collectionName, name, callback);
+};
+
+/**
+ * Drops all indexes from this collection.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the dropAllIndexes method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.dropAllIndexes = function dropIndexes (callback) {
+  this.db.dropIndex(this.collectionName, '*', function (err, result) {
+    if(err != null) {
+      callback(err, false);
+    } else if(result.documents[0].errmsg == null) {
+      callback(null, true);
+    } else {
+      callback(new Error(result.documents[0].errmsg), false);
+    }
+  });
+};
+
+/**
+ * Drops all indexes from this collection.
+ *
+ * @deprecated
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the dropIndexes method or null if an error occured.
+ * @return {null}
+ * @api private
+ */
+Collection.prototype.dropIndexes = Collection.prototype.dropAllIndexes;
+
+/**
+ * Reindex all indexes on the collection
+ * Warning: reIndex is a blocking operation (indexes are rebuilt in the foreground) and will be slow for large collections.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the reIndex method or null if an error occured.
+ * @return {null}
+ * @api public
+**/
+Collection.prototype.reIndex = function(callback) {
+  this.db.reIndex(this.collectionName, callback);
+}
+
+/**
+ * Run Map Reduce across a collection. Be aware that the inline option for out will return an array of results not a collection.
+ *
+ * Options
+ *  - **out** {Object}, sets the output target for the map reduce job. *{inline:1} | {replace:'collectionName'} | {merge:'collectionName'} | {reduce:'collectionName'}*
+ *  - **query** {Object}, query filter object.
+ *  - **sort** {Object}, sorts the input objects using this key. Useful for optimization, like sorting by the emit key for fewer reduces.
+ *  - **limit** {Number}, number of objects to return from collection.
+ *  - **keeptemp** {Boolean, default:false}, keep temporary data.
+ *  - **finalize** {Function | String}, finalize function.
+ *  - **scope** {Object}, can pass in variables that can be access from map/reduce/finalize.
+ *  - **jsMode** {Boolean, default:false}, it is possible to make the execution stay in JS. Provided in MongoDB > 2.0.X.
+ *  - **verbose** {Boolean, default:false}, provide statistics on job execution time.
+ *  - **readPreference** {String, only for inline results}, the preferred read preference (Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *
+ * @param {Function|String} map the mapping function.
+ * @param {Function|String} reduce the reduce function.
+ * @param {Objects} [options] options for the map reduce job.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the mapReduce method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.mapReduce = function mapReduce (map, reduce, options, callback) {
+  if ('function' === typeof options) callback = options, options = {};
+  // Out must allways be defined (make sure we don't break weirdly on pre 1.8+ servers)
+  if(null == options.out) {
+    throw new Error("the out option parameter must be defined, see mongodb docs for possible values");
+  }
+
+  if ('function' === typeof map) {
+    map = map.toString();
+  }
+
+  if ('function' === typeof reduce) {
+    reduce = reduce.toString();
+  }
+
+  if ('function' === typeof options.finalize) {
+    options.finalize = options.finalize.toString();
+  }
+
+  var mapCommandHash = {
+      mapreduce: this.collectionName
+    , map: map
+    , reduce: reduce
+  };
+
+  // Add any other options passed in
+  for (var name in options) {
+    if ('scope' == name) {
+      mapCommandHash[name] = processScope(options[name]);
+    } else {
+      mapCommandHash[name] = options[name];
+    }
+  }
+
+  // Set read preference if we set one
+  var readPreference = _getReadConcern(this, options);
+
+  // If we have a read preference and inline is not set as output fail hard
+  if((readPreference != false && readPreference != 'primary') && options['out'] != 'inline') {
+    throw new Error("a readPreference can only be provided when performing an inline mapReduce");
+  }
+
+  // self
+  var self = this;
+  var cmd = DbCommand.createDbCommand(this.db, mapCommandHash);
+
+  this.db._executeQueryCommand(cmd, {read:readPreference}, function (err, result) {
+    if (err) {
+      return callback(err);
+    }
+
+    //
+    if (1 != result.documents[0].ok || result.documents[0].err || result.documents[0].errmsg) {
+      return callback(utils.toError(result.documents[0]));
+    }
+
+    // Create statistics value
+    var stats = {};
+    if(result.documents[0].timeMillis) stats['processtime'] = result.documents[0].timeMillis;
+    if(result.documents[0].counts) stats['counts'] = result.documents[0].counts;
+    if(result.documents[0].timing) stats['timing'] = result.documents[0].timing;
+
+    // invoked with inline?
+    if(result.documents[0].results) {
+      return callback(null, result.documents[0].results, stats);
+    }
+
+    // The returned collection
+    var collection = null;
+
+    // If we have an object it's a different db
+    if(result.documents[0].result != null && typeof result.documents[0].result == 'object') {
+      var doc = result.documents[0].result;
+      collection = self.db.db(doc.db).collection(doc.collection);
+    } else {
+      // Create a collection object that wraps the result collection
+      collection = self.db.collection(result.documents[0].result)
+    }
+
+    // If we wish for no verbosity
+    if(options['verbose'] == null || !options['verbose']) {
+      return callback(err, collection);
+    }
+
+    // Return stats as third set of values
+    callback(err, collection, stats);
+  });
+};
+
+/**
+ * Functions that are passed as scope args must
+ * be converted to Code instances.
+ * @ignore
+ */
+function processScope (scope) {
+  if (!utils.isObject(scope)) {
+    return scope;
+  }
+
+  var keys = Object.keys(scope);
+  var i = keys.length;
+  var key;
+
+  while (i--) {
+    key = keys[i];
+    if ('function' == typeof scope[key]) {
+      scope[key] = new Code(String(scope[key]));
+    }
+  }
+
+  return scope;
+}
+
+/**
+ * Group function helper
+ * @ignore
+ */
+var groupFunction = function () {
+  var c = db[ns].find(condition);
+  var map = new Map();
+  var reduce_function = reduce;
+
+  while (c.hasNext()) {
+    var obj = c.next();
+    var key = {};
+
+    for (var i = 0, len = keys.length; i < len; ++i) {
+      var k = keys[i];
+      key[k] = obj[k];
+    }
+
+    var aggObj = map.get(key);
+
+    if (aggObj == null) {
+      var newObj = Object.extend({}, key);
+      aggObj = Object.extend(newObj, initial);
+      map.put(key, aggObj);
+    }
+
+    reduce_function(obj, aggObj);
+  }
+
+  return { "result": map.values() };
+}.toString();
+
+/**
+ * Run a group command across a collection
+  *
+ * Options
+ *  - **readPreference** {String}, the preferred read preference (Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *
+ * @param {Object|Array|Function|Code} keys an object, array or function expressing the keys to group by.
+ * @param {Object} condition an optional condition that must be true for a row to be considered.
+ * @param {Object} initial initial value of the aggregation counter object.
+ * @param {Function|Code} reduce the reduce function aggregates (reduces) the objects iterated
+ * @param {Function|Code} finalize an optional function to be run on each item in the result set just before the item is returned.
+ * @param {Boolean} command specify if you wish to run using the internal group command or using eval, default is true.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the group method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.group = function group(keys, condition, initial, reduce, finalize, command, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 3);
+  callback = args.pop();
+  // Fetch all commands
+  reduce = args.length ? args.shift() : null;
+  finalize = args.length ? args.shift() : null;
+  command = args.length ? args.shift() : null;
+  options = args.length ? args.shift() || {} : {};
+
+  // Make sure we are backward compatible
+  if(!(typeof finalize == 'function')) {
+    command = finalize;
+    finalize = null;
+  }
+
+  if (!Array.isArray(keys) && keys instanceof Object && typeof(keys) !== 'function' && !(keys instanceof Code)) {
+    keys = Object.keys(keys);
+  }
+
+  if(typeof reduce === 'function') {
+    reduce = reduce.toString();
+  }
+
+  if(typeof finalize === 'function') {
+    finalize = finalize.toString();
+  }
+
+  // Set up the command as default
+  command = command == null ? true : command;
+
+  // Execute using the command
+  if(command) {
+    var reduceFunction = reduce instanceof Code
+        ? reduce
+        : new Code(reduce);
+
+    var selector = {
+      group: {
+          'ns': this.collectionName
+        , '$reduce': reduceFunction
+        , 'cond': condition
+        , 'initial': initial
+        , 'out': "inline"
+      }
+    };
+
+    // if finalize is defined
+    if(finalize != null) selector.group['finalize'] = finalize;
+    // Set up group selector
+    if ('function' === typeof keys || keys instanceof Code) {
+      selector.group.$keyf = keys instanceof Code
+        ? keys
+        : new Code(keys);
+    } else {
+      var hash = {};
+      keys.forEach(function (key) {
+        hash[key] = 1;
+      });
+      selector.group.key = hash;
+    }
+
+    var cmd = DbCommand.createDbSlaveOkCommand(this.db, selector);
+    // Set read preference if we set one
+    var readPreference = _getReadConcern(this, options);
+
+    this.db._executeQueryCommand(cmd, {read:readPreference}, function (err, result) {
+      if(err != null) return callback(err);
+
+      var document = result.documents[0];
+      if (null == document.retval) {
+        return callback(new Error("group command failed: " + document.errmsg));
+      }
+
+      callback(null, document.retval);
+    });
+
+  } else {
+    // Create execution scope
+    var scope = reduce != null && reduce instanceof Code
+      ? reduce.scope
+      : {};
+
+    scope.ns = this.collectionName;
+    scope.keys = keys;
+    scope.condition = condition;
+    scope.initial = initial;
+
+    // Pass in the function text to execute within mongodb.
+    var groupfn = groupFunction.replace(/ reduce;/, reduce.toString() + ';');
+
+    this.db.eval(new Code(groupfn, scope), function (err, results) {
+      if (err) return callback(err, null);
+      callback(null, results.result || results);
+    });
+  }
+};
+
+/**
+ * Returns the options of the collection.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the options method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.options = function options(callback) {
+  this.db.collectionsInfo(this.collectionName, function (err, cursor) {
+    if (err) return callback(err);
+    cursor.nextObject(function (err, document) {
+      callback(err, document && document.options || null);
+    });
+  });
+};
+
+/**
+ * Returns if the collection is a capped collection
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the isCapped method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.isCapped = function isCapped(callback) {
+  this.options(function(err, document) {
+    if(err != null) {
+      callback(err);
+    } else {
+      callback(null, document && document.capped);
+    }
+  });
+};
+
+/**
+ * Checks if one or more indexes exist on the collection
+ *
+ * @param {String|Array} indexNames check if one or more indexes exist on the collection.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the indexExists method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.indexExists = function indexExists(indexes, callback) {
+ this.indexInformation(function(err, indexInformation) {
+   // If we have an error return
+   if(err != null) return callback(err, null);
+   // Let's check for the index names
+   if(Array.isArray(indexes)) {
+     for(var i = 0; i < indexes.length; i++) {
+       if(indexInformation[indexes[i]] == null) {
+         return callback(null, false);
+       }
+     }
+
+     // All keys found return true
+     return callback(null, true);
+   } else {
+     return callback(null, indexInformation[indexes] != null);
+   }
+ });
+}
+
+/**
+ * Execute the geoNear command to search for items in the collection
+ *
+ * Options
+ *  - **num** {Number}, max number of results to return.
+ *  - **maxDistance** {Number}, include results up to maxDistance from the point.
+ *  - **distanceMultiplier** {Number}, include a value to multiply the distances with allowing for range conversions.
+ *  - **query** {Object}, filter the results by a query.
+ *  - **spherical** {Boolean, default:false}, perform query using a spherical model.
+ *  - **uniqueDocs** {Boolean, default:false}, the closest location in a document to the center of the search region will always be returned MongoDB > 2.X.
+ *  - **includeLocs** {Boolean, default:false}, include the location data fields in the top level of the results MongoDB > 2.X.
+ *  - **readPreference** {String}, the preferred read preference ((Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *
+ * @param {Number} x point to search on the x axis, ensure the indexes are ordered in the same order.
+ * @param {Number} y point to search on the y axis, ensure the indexes are ordered in the same order.
+ * @param {Objects} [options] options for the map reduce job.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the geoNear method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.geoNear = function geoNear(x, y, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 2);
+  callback = args.pop();
+  // Fetch all commands
+  options = args.length ? args.shift() || {} : {};
+
+  // Build command object
+  var commandObject = {
+    geoNear:this.collectionName,
+    near: [x, y]
+  }
+
+  // Decorate object if any with known properties
+  if(options['num'] != null) commandObject['num'] = options['num'];
+  if(options['maxDistance'] != null) commandObject['maxDistance'] = options['maxDistance'];
+  if(options['distanceMultiplier'] != null) commandObject['distanceMultiplier'] = options['distanceMultiplier'];
+  if(options['query'] != null) commandObject['query'] = options['query'];
+  if(options['spherical'] != null) commandObject['spherical'] = options['spherical'];
+  if(options['uniqueDocs'] != null) commandObject['uniqueDocs'] = options['uniqueDocs'];
+  if(options['includeLocs'] != null) commandObject['includeLocs'] = options['includeLocs'];
+
+  // Ensure we have the right read preference inheritance
+  options.readPreference = _getReadConcern(this, options);
+
+  // Execute the command
+  this.db.command(commandObject, options, callback);
+}
+
+/**
+ * Execute a geo search using a geo haystack index on a collection.
+ *
+ * Options
+ *  - **maxDistance** {Number}, include results up to maxDistance from the point.
+ *  - **search** {Object}, filter the results by a query.
+ *  - **limit** {Number}, max number of results to return.
+ *  - **readPreference** {String}, the preferred read preference ((Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *
+ * @param {Number} x point to search on the x axis, ensure the indexes are ordered in the same order.
+ * @param {Number} y point to search on the y axis, ensure the indexes are ordered in the same order.
+ * @param {Objects} [options] options for the map reduce job.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the geoHaystackSearch method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.geoHaystackSearch = function geoHaystackSearch(x, y, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 2);
+  callback = args.pop();
+  // Fetch all commands
+  options = args.length ? args.shift() || {} : {};
+
+  // Build command object
+  var commandObject = {
+    geoSearch:this.collectionName,
+    near: [x, y]
+  }
+
+  // Decorate object if any with known properties
+  if(options['maxDistance'] != null) commandObject['maxDistance'] = options['maxDistance'];
+  if(options['query'] != null) commandObject['search'] = options['query'];
+  if(options['search'] != null) commandObject['search'] = options['search'];
+  if(options['limit'] != null) commandObject['limit'] = options['limit'];
+
+  // Ensure we have the right read preference inheritance
+  options.readPreference = _getReadConcern(this, options);
+
+  // Execute the command
+  this.db.command(commandObject, options, callback);
+}
+
+/**
+ * Retrieve all the indexes on the collection.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the indexes method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.indexes = function indexes(callback) {
+  // Return all the index information
+  this.db.indexInformation(this.collectionName, {full:true}, callback);
+}
+
+/**
+ * Execute an aggregation framework pipeline against the collection, needs MongoDB >= 2.1
+ *
+ * Options
+ *  - **readPreference** {String}, the preferred read preference ((Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *
+ * @param {Array} array containing all the aggregation framework commands for the execution.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the aggregate method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.aggregate = function(pipeline, options, callback) {
+  // *  - **explain** {Boolean}, return the query plan for the aggregation pipeline instead of the results. 2.3, 2.4
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  var self = this;
+
+  // If we have any of the supported options in the options object
+  var opts = args[args.length - 1];
+  options = opts.readPreference || opts.explain ? args.pop() : {}
+
+  // Convert operations to an array
+  if(!Array.isArray(args[0])) {
+    pipeline = [];
+    // Push all the operations to the pipeline
+    for(var i = 0; i < args.length; i++) pipeline.push(args[i]);
+  }
+
+  // Build the command
+  var command = { aggregate : this.collectionName, pipeline : pipeline};
+
+  // Ensure we have the right read preference inheritance
+  options.readPreference = _getReadConcern(this, options);
+
+  // Execute the command
+  this.db.command(command, options, function(err, result) {
+    if(err) {
+      callback(err);
+    } else if(result['err'] || result['errmsg']) {
+      callback(utils.toError(result));
+    } else if(typeof result == 'object' && result['serverPipeline']) {
+      callback(null, result);
+    } else {
+      callback(null, result.result);
+    }
+  });
+}
+
+/**
+ * Get all the collection statistics.
+ *
+ * Options
+ *  - **scale** {Number}, divide the returned sizes by scale value.
+ *  - **readPreference** {String}, the preferred read preference ((Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *
+ * @param {Objects} [options] options for the stats command.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the stats method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Collection.prototype.stats = function stats(options, callback) {
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  // Fetch all commands
+  options = args.length ? args.shift() || {} : {};
+
+  // Build command object
+  var commandObject = {
+    collStats:this.collectionName,
+  }
+
+  // Check if we have the scale value
+  if(options['scale'] != null) commandObject['scale'] = options['scale'];
+
+  // Ensure we have the right read preference inheritance
+  options.readPreference = _getReadConcern(this, options);
+
+  // Execute the command
+  this.db.command(commandObject, options, callback);
+}
+
+/**
+ * @ignore
+ */
+Object.defineProperty(Collection.prototype, "hint", {
+    enumerable: true
+  , get: function () {
+      return this.internalHint;
+    }
+  , set: function (v) {
+      this.internalHint = normalizeHintField(v);
+    }
+});
+
+var _getReadConcern = function(self, options) {
+  if(options.readPreference) return options.readPreference;
+  if(self.readPreference) return self.readPreference;
+  if(self.db.readPreference) return self.readPreference;
+  return 'primary';
+}
+
+/**
+ * @ignore
+ */
+var _hasWriteConcern = function(errorOptions) {
+  return errorOptions == true
+    || errorOptions.w > 0
+    || errorOptions.w == 'majority'
+    || errorOptions.j == true
+    || errorOptions.journal == true
+    || errorOptions.fsync == true
+}
+
+/**
+ * @ignore
+ */
+var _setWriteConcernHash = function(options) {
+  var finalOptions = {};
+  if(options.w != null) finalOptions.w = options.w;  
+  if(options.journal == true) finalOptions.j = options.journal;
+  if(options.j == true) finalOptions.j = options.j;
+  if(options.fsync == true) finalOptions.fsync = options.fsync;
+  if(options.wtimeout != null) finalOptions.wtimeout = options.wtimeout;  
+  return finalOptions;
+}
+
+/**
+ * @ignore
+ */
+var _getWriteConcern = function(self, options, callback) {
+  // Final options
+  var finalOptions = {w:1};
+  // Local options verification
+  if(options.w != null || typeof options.j == 'boolean' || typeof options.journal == 'boolean' || typeof options.fsync == 'boolean') {
+    finalOptions = _setWriteConcernHash(options);
+  } else if(typeof options.safe == "boolean") {
+    finalOptions = {w: (options.safe ? 1 : 0)};
+  } else if(options.safe != null && typeof options.safe == 'object') {
+    finalOptions = _setWriteConcernHash(options.safe);
+  } else if(self.opts.w != null || typeof self.opts.j == 'boolean' || typeof self.opts.journal == 'boolean' || typeof self.opts.fsync == 'boolean') {
+    finalOptions = _setWriteConcernHash(self.opts);
+  } else if(typeof self.opts.safe == "boolean") {
+    finalOptions = {w: (self.opts.safe ? 1 : 0)};
+  } else if(self.db.safe.w != null || typeof self.db.safe.j == 'boolean' || typeof self.db.safe.journal == 'boolean' || typeof self.db.safe.fsync == 'boolean') {
+    finalOptions = _setWriteConcernHash(self.db.safe);
+  } else if(self.db.options.w != null || typeof self.db.options.j == 'boolean' || typeof self.db.options.journal == 'boolean' || typeof self.db.options.fsync == 'boolean') {
+    finalOptions = _setWriteConcernHash(self.db.options);
+  } else if(typeof self.db.safe == "boolean") {
+    finalOptions = {w: (self.db.safe ? 1 : 0)};
+  }
+
+  // Ensure we don't have an invalid combination of write concerns
+  if(finalOptions.w < 1 
+    && (finalOptions.journal == true || finalOptions.j == true || finalOptions.fsync == true)) throw new Error("No acknowlegement using w < 1 cannot be combined with journal:true or fsync:true");
+
+  // Return the options
+  return finalOptions;
+}
+
+/**
+ * Expose.
+ */
+exports.Collection = Collection;
diff --git a/node_modules/mongodb/lib/mongodb/commands/base_command.js b/node_modules/mongodb/lib/mongodb/commands/base_command.js
new file mode 100644
index 0000000..9558582
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/commands/base_command.js
@@ -0,0 +1,29 @@
+/**
+  Base object used for common functionality
+**/
+var BaseCommand = exports.BaseCommand = function BaseCommand() {
+};
+
+var id = 1;
+BaseCommand.prototype.getRequestId = function getRequestId() {
+  if (!this.requestId) this.requestId = id++;
+  return this.requestId;
+};
+
+BaseCommand.prototype.setMongosReadPreference = function setMongosReadPreference(readPreference, tags) {}
+
+BaseCommand.prototype.updateRequestId = function() {
+  this.requestId = id++;
+  return this.requestId;
+};
+
+// OpCodes
+BaseCommand.OP_REPLY = 1;
+BaseCommand.OP_MSG = 1000;
+BaseCommand.OP_UPDATE = 2001;
+BaseCommand.OP_INSERT =	2002;
+BaseCommand.OP_GET_BY_OID = 2003;
+BaseCommand.OP_QUERY = 2004;
+BaseCommand.OP_GET_MORE = 2005;
+BaseCommand.OP_DELETE =	2006;
+BaseCommand.OP_KILL_CURSORS =	2007;
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/commands/db_command.js b/node_modules/mongodb/lib/mongodb/commands/db_command.js
new file mode 100644
index 0000000..f8751b5
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/commands/db_command.js
@@ -0,0 +1,241 @@
+var QueryCommand = require('./query_command').QueryCommand,
+  InsertCommand = require('./insert_command').InsertCommand,
+  inherits = require('util').inherits,
+  utils = require('../utils'),
+  crypto = require('crypto');
+
+/**
+  Db Command
+**/
+var DbCommand = exports.DbCommand = function(dbInstance, collectionName, queryOptions, numberToSkip, numberToReturn, query, returnFieldSelector, options) {
+  QueryCommand.call(this);
+  this.collectionName = collectionName;
+  this.queryOptions = queryOptions;
+  this.numberToSkip = numberToSkip;
+  this.numberToReturn = numberToReturn;
+  this.query = query;
+  this.returnFieldSelector = returnFieldSelector;
+  this.db = dbInstance;
+
+  // Make sure we don't get a null exception
+  options = options == null ? {} : options;
+  // Let us defined on a command basis if we want functions to be serialized or not
+  if(options['serializeFunctions'] != null && options['serializeFunctions']) {
+    this.serializeFunctions = true;
+  }
+};
+
+inherits(DbCommand, QueryCommand);
+
+// Constants
+DbCommand.SYSTEM_NAMESPACE_COLLECTION = "system.namespaces";
+DbCommand.SYSTEM_INDEX_COLLECTION = "system.indexes";
+DbCommand.SYSTEM_PROFILE_COLLECTION = "system.profile";
+DbCommand.SYSTEM_USER_COLLECTION = "system.users";
+DbCommand.SYSTEM_COMMAND_COLLECTION = "$cmd";
+DbCommand.SYSTEM_JS_COLLECTION = "system.js";
+
+// New commands
+DbCommand.NcreateIsMasterCommand = function(db, databaseName) {
+  return new DbCommand(db, databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, {'ismaster':1}, null);
+};
+
+// Provide constructors for different db commands
+DbCommand.createIsMasterCommand = function(db) {
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, {'ismaster':1}, null);
+};
+
+DbCommand.createCollectionInfoCommand = function(db, selector) {
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_NAMESPACE_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, 0, selector, null);
+};
+
+DbCommand.createGetNonceCommand = function(db, options) {
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, {'getnonce':1}, null);
+};
+
+DbCommand.createAuthenticationCommand = function(db, username, password, nonce, authdb) {
+  // Use node md5 generator
+  var md5 = crypto.createHash('md5');
+  // Generate keys used for authentication
+  md5.update(username + ":mongo:" + password);
+  var hash_password = md5.digest('hex');
+  // Final key
+  md5 = crypto.createHash('md5');
+  md5.update(nonce + username + hash_password);
+  var key = md5.digest('hex');
+  // Creat selector
+  var selector = {'authenticate':1, 'user':username, 'nonce':nonce, 'key':key};
+  // Create db command
+  return new DbCommand(db, authdb + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NONE, 0, -1, selector, null);
+};
+
+DbCommand.createLogoutCommand = function(db) {
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, {'logout':1}, null);
+};
+
+DbCommand.createCreateCollectionCommand = function(db, collectionName, options) {
+  var selector = {'create':collectionName};
+  // Modify the options to ensure correct behaviour
+  for(var name in options) {
+    if(options[name] != null && options[name].constructor != Function) selector[name] = options[name];
+  }
+  // Execute the command
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, selector, null);
+};
+
+DbCommand.createDropCollectionCommand = function(db, collectionName) {
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, {'drop':collectionName}, null);
+};
+
+DbCommand.createRenameCollectionCommand = function(db, fromCollectionName, toCollectionName, options) {
+  var renameCollection = db.databaseName + "." + fromCollectionName;
+  var toCollection = db.databaseName + "." + toCollectionName;
+  var dropTarget = options && options.dropTarget ? options.dropTarget : false;
+  return new DbCommand(db, "admin." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, {'renameCollection':renameCollection, 'to':toCollection, 'dropTarget':dropTarget}, null);
+};
+
+DbCommand.createGetLastErrorCommand = function(options, db) {
+
+  if (typeof db === 'undefined') {
+    db =  options;
+    options = {};
+  }
+  // Final command
+  var command = {'getlasterror':1};
+  // If we have an options Object let's merge in the fields (fsync/wtimeout/w)
+  if('object' === typeof options) {
+    for(var name in options) {
+      command[name] = options[name]
+    }
+  }
+
+  // Special case for w == 1, remove the w
+  if(1 == command.w) {
+    delete command.w;
+  }
+
+  // Execute command
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, command, null);
+};
+
+DbCommand.createGetLastStatusCommand = DbCommand.createGetLastErrorCommand;
+
+DbCommand.createGetPreviousErrorsCommand = function(db) {
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, {'getpreverror':1}, null);
+};
+
+DbCommand.createResetErrorHistoryCommand = function(db) {
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, {'reseterror':1}, null);
+};
+
+DbCommand.createCreateIndexCommand = function(db, collectionName, fieldOrSpec, options) {
+  var fieldHash = {};
+  var indexes = [];
+  var keys;
+
+  // Get all the fields accordingly
+  if('string' == typeof fieldOrSpec) {
+    // 'type'
+    indexes.push(fieldOrSpec + '_' + 1);
+    fieldHash[fieldOrSpec] = 1;
+
+  } else if(utils.isArray(fieldOrSpec)) {
+
+    fieldOrSpec.forEach(function(f) {
+      if('string' == typeof f) {
+        // [{location:'2d'}, 'type']
+        indexes.push(f + '_' + 1);
+        fieldHash[f] = 1;
+      } else if(utils.isArray(f)) {
+        // [['location', '2d'],['type', 1]]
+        indexes.push(f[0] + '_' + (f[1] || 1));
+        fieldHash[f[0]] = f[1] || 1;
+      } else if(utils.isObject(f)) {
+        // [{location:'2d'}, {type:1}]
+        keys = Object.keys(f);
+        keys.forEach(function(k) {
+          indexes.push(k + '_' + f[k]);
+          fieldHash[k] = f[k];
+        });
+      } else {
+        // undefined (ignore)
+      }
+    });
+
+  } else if(utils.isObject(fieldOrSpec)) {
+    // {location:'2d', type:1}
+    keys = Object.keys(fieldOrSpec);
+    keys.forEach(function(key) {
+      indexes.push(key + '_' + fieldOrSpec[key]);
+      fieldHash[key] = fieldOrSpec[key];
+    });
+  }
+
+  // Generate the index name
+  var indexName = typeof options.name == 'string'
+    ? options.name
+    : indexes.join("_");
+
+  var selector = {
+    'ns': db.databaseName + "." + collectionName,
+    'key': fieldHash,
+    'name': indexName
+  }
+
+  // Ensure we have a correct finalUnique
+  var finalUnique = options == null || 'object' === typeof options
+    ? false
+    : options;
+
+  // Set up options
+  options = options == null || typeof options == 'boolean'
+    ? {}
+    : options;
+
+  // Add all the options
+  var keys = Object.keys(options);
+  for(var i = 0; i < keys.length; i++) {
+    selector[keys[i]] = options[keys[i]];
+  }
+
+  if(selector['unique'] == null)
+    selector['unique'] = finalUnique;
+
+  var name = db.databaseName + "." + DbCommand.SYSTEM_INDEX_COLLECTION;
+  var cmd = new InsertCommand(db, name, false);
+  return cmd.add(selector);
+};
+
+DbCommand.logoutCommand = function(db, command_hash, options) {
+  var dbName = options != null && options['authdb'] != null ? options['authdb'] : db.databaseName;
+  return new DbCommand(db, dbName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, command_hash, null);
+}
+
+DbCommand.createDropIndexCommand = function(db, collectionName, indexName) {
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, {'deleteIndexes':collectionName, 'index':indexName}, null);
+};
+
+DbCommand.createReIndexCommand = function(db, collectionName) {
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, {'reIndex':collectionName}, null);
+};
+
+DbCommand.createDropDatabaseCommand = function(db) {
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, {'dropDatabase':1}, null);
+};
+
+DbCommand.createDbCommand = function(db, command_hash, options, auth_db) {
+  var db_name = (auth_db ? auth_db : db.databaseName) + "." + DbCommand.SYSTEM_COMMAND_COLLECTION;
+  return new DbCommand(db, db_name, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, command_hash, null, options);
+};
+
+DbCommand.createAdminDbCommand = function(db, command_hash) {
+  return new DbCommand(db, "admin." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT, 0, -1, command_hash, null);
+};
+
+DbCommand.createAdminDbCommandSlaveOk = function(db, command_hash) {
+  return new DbCommand(db, "admin." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT | QueryCommand.OPTS_SLAVE, 0, -1, command_hash, null);
+};
+
+DbCommand.createDbSlaveOkCommand = function(db, command_hash, options) {
+  return new DbCommand(db, db.databaseName + "." + DbCommand.SYSTEM_COMMAND_COLLECTION, QueryCommand.OPTS_NO_CURSOR_TIMEOUT | QueryCommand.OPTS_SLAVE, 0, -1, command_hash, null, options);
+};
diff --git a/node_modules/mongodb/lib/mongodb/commands/delete_command.js b/node_modules/mongodb/lib/mongodb/commands/delete_command.js
new file mode 100644
index 0000000..e6ae20a
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/commands/delete_command.js
@@ -0,0 +1,114 @@
+var BaseCommand = require('./base_command').BaseCommand,
+  inherits = require('util').inherits;
+
+/**
+  Insert Document Command
+**/
+var DeleteCommand = exports.DeleteCommand = function(db, collectionName, selector, flags) {
+  BaseCommand.call(this);
+
+  // Validate correctness off the selector
+  var object = selector;
+  if(Buffer.isBuffer(object)) {
+    var object_size = object[0] | object[1] << 8 | object[2] << 16 | object[3] << 24;        
+    if(object_size != object.length)  {
+      var error = new Error("delete raw message size does not match message header size [" + object.length + "] != [" + object_size + "]");
+      error.name = 'MongoError';
+      throw error;
+    }
+  }
+  
+  this.flags = flags;
+  this.collectionName = collectionName;
+  this.selector = selector;
+  this.db = db;
+};
+
+inherits(DeleteCommand, BaseCommand);
+
+DeleteCommand.OP_DELETE =	2006;
+
+/*
+struct {
+    MsgHeader header;                 // standard message header
+    int32     ZERO;                   // 0 - reserved for future use
+    cstring   fullCollectionName;     // "dbname.collectionname"
+    int32     ZERO;                   // 0 - reserved for future use
+    mongo.BSON      selector;               // query object.  See below for details.
+}
+*/
+DeleteCommand.prototype.toBinary = function() {
+  // Calculate total length of the document
+  var totalLengthOfCommand = 4 + Buffer.byteLength(this.collectionName) + 1 + 4 + this.db.bson.calculateObjectSize(this.selector, false, true) + (4 * 4);
+  // Let's build the single pass buffer command
+  var _index = 0;
+  var _command = new Buffer(totalLengthOfCommand);
+  // Write the header information to the buffer
+  _command[_index + 3] = (totalLengthOfCommand >> 24) & 0xff;     
+  _command[_index + 2] = (totalLengthOfCommand >> 16) & 0xff;
+  _command[_index + 1] = (totalLengthOfCommand >> 8) & 0xff;
+  _command[_index] = totalLengthOfCommand & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write the request ID
+  _command[_index + 3] = (this.requestId >> 24) & 0xff;     
+  _command[_index + 2] = (this.requestId >> 16) & 0xff;
+  _command[_index + 1] = (this.requestId >> 8) & 0xff;
+  _command[_index] = this.requestId & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write zero
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  // Write the op_code for the command
+  _command[_index + 3] = (DeleteCommand.OP_DELETE >> 24) & 0xff;     
+  _command[_index + 2] = (DeleteCommand.OP_DELETE >> 16) & 0xff;
+  _command[_index + 1] = (DeleteCommand.OP_DELETE >> 8) & 0xff;
+  _command[_index] = DeleteCommand.OP_DELETE & 0xff;
+  // Adjust index
+  _index = _index + 4;
+
+  // Write zero
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+
+  // Write the collection name to the command
+  _index = _index + _command.write(this.collectionName, _index, 'utf8') + 1;
+  _command[_index - 1] = 0;    
+
+  // Write the flags
+  _command[_index + 3] = (this.flags >> 24) & 0xff;     
+  _command[_index + 2] = (this.flags >> 16) & 0xff;
+  _command[_index + 1] = (this.flags >> 8) & 0xff;
+  _command[_index] = this.flags & 0xff;
+  // Adjust index
+  _index = _index + 4;
+
+  // Document binary length
+  var documentLength = 0
+
+  // Serialize the selector
+  // If we are passing a raw buffer, do minimal validation
+  if(Buffer.isBuffer(this.selector)) {
+    documentLength = this.selector.length;
+    // Copy the data into the current buffer
+    this.selector.copy(_command, _index);
+  } else {
+    documentLength = this.db.bson.serializeWithBufferAndIndex(this.selector, this.checkKeys, _command, _index) - _index + 1;
+  }
+  
+  // Write the length to the document
+  _command[_index + 3] = (documentLength >> 24) & 0xff;     
+  _command[_index + 2] = (documentLength >> 16) & 0xff;
+  _command[_index + 1] = (documentLength >> 8) & 0xff;
+  _command[_index] = documentLength & 0xff;
+  // Update index in buffer
+  _index = _index + documentLength;
+  // Add terminating 0 for the object
+  _command[_index - 1] = 0;      
+  return _command;
+};
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/commands/get_more_command.js b/node_modules/mongodb/lib/mongodb/commands/get_more_command.js
new file mode 100644
index 0000000..d3aac02
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/commands/get_more_command.js
@@ -0,0 +1,83 @@
+var BaseCommand = require('./base_command').BaseCommand,
+  inherits = require('util').inherits,
+  binaryutils = require('../utils');
+
+/**
+  Get More Document Command
+**/
+var GetMoreCommand = exports.GetMoreCommand = function(db, collectionName, numberToReturn, cursorId) {
+  BaseCommand.call(this);
+
+  this.collectionName = collectionName;
+  this.numberToReturn = numberToReturn;
+  this.cursorId = cursorId;
+  this.db = db;
+};
+
+inherits(GetMoreCommand, BaseCommand);
+
+GetMoreCommand.OP_GET_MORE = 2005;
+
+GetMoreCommand.prototype.toBinary = function() {
+  // Calculate total length of the document
+  var totalLengthOfCommand = 4 + Buffer.byteLength(this.collectionName) + 1 + 4 + 8 + (4 * 4);
+  // Let's build the single pass buffer command
+  var _index = 0;
+  var _command = new Buffer(totalLengthOfCommand);
+  // Write the header information to the buffer
+  _command[_index++] = totalLengthOfCommand & 0xff;
+  _command[_index++] = (totalLengthOfCommand >> 8) & 0xff;
+  _command[_index++] = (totalLengthOfCommand >> 16) & 0xff;
+  _command[_index++] = (totalLengthOfCommand >> 24) & 0xff;     
+
+  // Write the request ID
+  _command[_index++] = this.requestId & 0xff;
+  _command[_index++] = (this.requestId >> 8) & 0xff;
+  _command[_index++] = (this.requestId >> 16) & 0xff;
+  _command[_index++] = (this.requestId >> 24) & 0xff;     
+
+  // Write zero
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+
+  // Write the op_code for the command
+  _command[_index++] = GetMoreCommand.OP_GET_MORE & 0xff;
+  _command[_index++] = (GetMoreCommand.OP_GET_MORE >> 8) & 0xff;
+  _command[_index++] = (GetMoreCommand.OP_GET_MORE >> 16) & 0xff;
+  _command[_index++] = (GetMoreCommand.OP_GET_MORE >> 24) & 0xff;     
+
+  // Write zero
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+
+  // Write the collection name to the command
+  _index = _index + _command.write(this.collectionName, _index, 'utf8') + 1;
+  _command[_index - 1] = 0;    
+
+  // Number of documents to return
+  _command[_index++] = this.numberToReturn & 0xff;
+  _command[_index++] = (this.numberToReturn >> 8) & 0xff;
+  _command[_index++] = (this.numberToReturn >> 16) & 0xff;
+  _command[_index++] = (this.numberToReturn >> 24) & 0xff;     
+  
+  // Encode the cursor id
+  var low_bits = this.cursorId.getLowBits();
+  // Encode low bits
+  _command[_index++] = low_bits & 0xff;
+  _command[_index++] = (low_bits >> 8) & 0xff;
+  _command[_index++] = (low_bits >> 16) & 0xff;
+  _command[_index++] = (low_bits >> 24) & 0xff;     
+  
+  var high_bits = this.cursorId.getHighBits();
+  // Encode high bits
+  _command[_index++] = high_bits & 0xff;
+  _command[_index++] = (high_bits >> 8) & 0xff;
+  _command[_index++] = (high_bits >> 16) & 0xff;
+  _command[_index++] = (high_bits >> 24) & 0xff;     
+  // Return command
+  return _command;
+};
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/commands/insert_command.js b/node_modules/mongodb/lib/mongodb/commands/insert_command.js
new file mode 100644
index 0000000..d6a2100
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/commands/insert_command.js
@@ -0,0 +1,147 @@
+var BaseCommand = require('./base_command').BaseCommand,
+  inherits = require('util').inherits;
+
+/**
+  Insert Document Command
+**/
+var InsertCommand = exports.InsertCommand = function(db, collectionName, checkKeys, options) {
+  BaseCommand.call(this);
+
+  this.collectionName = collectionName;
+  this.documents = [];
+  this.checkKeys = checkKeys == null ? true : checkKeys;
+  this.db = db;
+  this.flags = 0;
+  this.serializeFunctions = false;
+
+  // Ensure valid options hash
+  options = options == null ? {} : options;
+
+  // Check if we have keepGoing set -> set flag if it's the case
+  if(options['keepGoing'] != null && options['keepGoing']) {
+    // This will finish inserting all non-index violating documents even if it returns an error
+    this.flags = 1;
+  }
+
+  // Check if we have keepGoing set -> set flag if it's the case
+  if(options['continueOnError'] != null && options['continueOnError']) {
+    // This will finish inserting all non-index violating documents even if it returns an error
+    this.flags = 1;
+  }
+
+  // Let us defined on a command basis if we want functions to be serialized or not
+  if(options['serializeFunctions'] != null && options['serializeFunctions']) {
+    this.serializeFunctions = true;
+  }
+};
+
+inherits(InsertCommand, BaseCommand);
+
+// OpCodes
+InsertCommand.OP_INSERT =	2002;
+
+InsertCommand.prototype.add = function(document) {
+  if(Buffer.isBuffer(document)) {
+    var object_size = document[0] | document[1] << 8 | document[2] << 16 | document[3] << 24;
+    if(object_size != document.length)  {
+      var error = new Error("insert raw message size does not match message header size [" + document.length + "] != [" + object_size + "]");
+      error.name = 'MongoError';
+      throw error;
+    }
+  }
+
+  this.documents.push(document);
+  return this;
+};
+
+/*
+struct {
+    MsgHeader header;             // standard message header
+    int32     ZERO;               // 0 - reserved for future use
+    cstring   fullCollectionName; // "dbname.collectionname"
+    BSON[]    documents;          // one or more documents to insert into the collection
+}
+*/
+InsertCommand.prototype.toBinary = function() {
+  // Calculate total length of the document
+  var totalLengthOfCommand = 4 + Buffer.byteLength(this.collectionName) + 1 + (4 * 4);
+  // var docLength = 0
+  for(var i = 0; i < this.documents.length; i++) {
+    if(Buffer.isBuffer(this.documents[i])) {
+      totalLengthOfCommand += this.documents[i].length;
+    } else {
+      // Calculate size of document
+      totalLengthOfCommand += this.db.bson.calculateObjectSize(this.documents[i], this.serializeFunctions, true);
+    }
+  }
+
+  // Let's build the single pass buffer command
+  var _index = 0;
+  var _command = new Buffer(totalLengthOfCommand);
+  // Write the header information to the buffer
+  _command[_index + 3] = (totalLengthOfCommand >> 24) & 0xff;
+  _command[_index + 2] = (totalLengthOfCommand >> 16) & 0xff;
+  _command[_index + 1] = (totalLengthOfCommand >> 8) & 0xff;
+  _command[_index] = totalLengthOfCommand & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write the request ID
+  _command[_index + 3] = (this.requestId >> 24) & 0xff;
+  _command[_index + 2] = (this.requestId >> 16) & 0xff;
+  _command[_index + 1] = (this.requestId >> 8) & 0xff;
+  _command[_index] = this.requestId & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write zero
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  // Write the op_code for the command
+  _command[_index + 3] = (InsertCommand.OP_INSERT >> 24) & 0xff;
+  _command[_index + 2] = (InsertCommand.OP_INSERT >> 16) & 0xff;
+  _command[_index + 1] = (InsertCommand.OP_INSERT >> 8) & 0xff;
+  _command[_index] = InsertCommand.OP_INSERT & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write flags if any
+  _command[_index + 3] = (this.flags >> 24) & 0xff;
+  _command[_index + 2] = (this.flags >> 16) & 0xff;
+  _command[_index + 1] = (this.flags >> 8) & 0xff;
+  _command[_index] = this.flags & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write the collection name to the command
+  _index = _index + _command.write(this.collectionName, _index, 'utf8') + 1;
+  _command[_index - 1] = 0;
+
+  // Write all the bson documents to the buffer at the index offset
+  for(var i = 0; i < this.documents.length; i++) {
+    // Document binary length
+    var documentLength = 0
+    var object = this.documents[i];
+
+    // Serialize the selector
+    // If we are passing a raw buffer, do minimal validation
+    if(Buffer.isBuffer(object)) {
+      documentLength = object.length;
+      // Copy the data into the current buffer
+      object.copy(_command, _index);
+    } else {
+      // Serialize the document straight to the buffer
+      documentLength = this.db.bson.serializeWithBufferAndIndex(object, this.checkKeys, _command, _index, this.serializeFunctions) - _index + 1;
+    }
+
+    // Write the length to the document
+    _command[_index + 3] = (documentLength >> 24) & 0xff;
+    _command[_index + 2] = (documentLength >> 16) & 0xff;
+    _command[_index + 1] = (documentLength >> 8) & 0xff;
+    _command[_index] = documentLength & 0xff;
+    // Update index in buffer
+    _index = _index + documentLength;
+    // Add terminating 0 for the object
+    _command[_index - 1] = 0;
+  }
+
+  return _command;
+};
diff --git a/node_modules/mongodb/lib/mongodb/commands/kill_cursor_command.js b/node_modules/mongodb/lib/mongodb/commands/kill_cursor_command.js
new file mode 100644
index 0000000..d8ccb0c
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/commands/kill_cursor_command.js
@@ -0,0 +1,98 @@
+var BaseCommand = require('./base_command').BaseCommand,
+  inherits = require('util').inherits,
+  binaryutils = require('../utils');
+
+/**
+  Insert Document Command
+**/
+var KillCursorCommand = exports.KillCursorCommand = function(db, cursorIds) {
+  BaseCommand.call(this);
+
+  this.cursorIds = cursorIds;
+  this.db = db;
+};
+
+inherits(KillCursorCommand, BaseCommand);
+
+KillCursorCommand.OP_KILL_CURSORS = 2007;
+
+/*
+struct {
+    MsgHeader header;                 // standard message header
+    int32     ZERO;                   // 0 - reserved for future use
+    int32     numberOfCursorIDs;      // number of cursorIDs in message
+    int64[]   cursorIDs;                // array of cursorIDs to close
+}
+*/
+KillCursorCommand.prototype.toBinary = function() {
+  // Calculate total length of the document
+  var totalLengthOfCommand = 4 + 4 + (4 * 4) + (this.cursorIds.length * 8);
+  // Let's build the single pass buffer command
+  var _index = 0;
+  var _command = new Buffer(totalLengthOfCommand);
+  // Write the header information to the buffer
+  _command[_index + 3] = (totalLengthOfCommand >> 24) & 0xff;     
+  _command[_index + 2] = (totalLengthOfCommand >> 16) & 0xff;
+  _command[_index + 1] = (totalLengthOfCommand >> 8) & 0xff;
+  _command[_index] = totalLengthOfCommand & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write the request ID
+  _command[_index + 3] = (this.requestId >> 24) & 0xff;     
+  _command[_index + 2] = (this.requestId >> 16) & 0xff;
+  _command[_index + 1] = (this.requestId >> 8) & 0xff;
+  _command[_index] = this.requestId & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write zero
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  // Write the op_code for the command
+  _command[_index + 3] = (KillCursorCommand.OP_KILL_CURSORS >> 24) & 0xff;     
+  _command[_index + 2] = (KillCursorCommand.OP_KILL_CURSORS >> 16) & 0xff;
+  _command[_index + 1] = (KillCursorCommand.OP_KILL_CURSORS >> 8) & 0xff;
+  _command[_index] = KillCursorCommand.OP_KILL_CURSORS & 0xff;
+  // Adjust index
+  _index = _index + 4;
+
+  // Write zero
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+
+  // Number of cursors to kill
+  var numberOfCursors = this.cursorIds.length;
+  _command[_index + 3] = (numberOfCursors >> 24) & 0xff;     
+  _command[_index + 2] = (numberOfCursors >> 16) & 0xff;
+  _command[_index + 1] = (numberOfCursors >> 8) & 0xff;
+  _command[_index] = numberOfCursors & 0xff;
+  // Adjust index
+  _index = _index + 4;
+
+  // Encode all the cursors
+  for(var i = 0; i < this.cursorIds.length; i++) {
+    // Encode the cursor id
+    var low_bits = this.cursorIds[i].getLowBits();
+    // Encode low bits
+    _command[_index + 3] = (low_bits >> 24) & 0xff;     
+    _command[_index + 2] = (low_bits >> 16) & 0xff;
+    _command[_index + 1] = (low_bits >> 8) & 0xff;
+    _command[_index] = low_bits & 0xff;
+    // Adjust index
+    _index = _index + 4;
+      
+    var high_bits = this.cursorIds[i].getHighBits();
+    // Encode high bits
+    _command[_index + 3] = (high_bits >> 24) & 0xff;     
+    _command[_index + 2] = (high_bits >> 16) & 0xff;
+    _command[_index + 1] = (high_bits >> 8) & 0xff;
+    _command[_index] = high_bits & 0xff;
+    // Adjust index
+    _index = _index + 4;
+  }
+  
+  return _command;
+};
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/commands/query_command.js b/node_modules/mongodb/lib/mongodb/commands/query_command.js
new file mode 100644
index 0000000..76829d9
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/commands/query_command.js
@@ -0,0 +1,261 @@
+var BaseCommand = require('./base_command').BaseCommand,
+  inherits = require('util').inherits;
+
+/**
+  Insert Document Command
+**/
+var QueryCommand = exports.QueryCommand = function(db, collectionName, queryOptions, numberToSkip, numberToReturn, query, returnFieldSelector, options) {
+  BaseCommand.call(this);
+
+  // Validate correctness off the selector
+  var object = query,
+    object_size;
+  if(Buffer.isBuffer(object)) {
+    object_size = object[0] | object[1] << 8 | object[2] << 16 | object[3] << 24;
+    if(object_size != object.length) {
+      var error = new Error("query selector raw message size does not match message header size [" + object.length + "] != [" + object_size + "]");
+      error.name = 'MongoError';
+      throw error;
+    }
+  }
+
+  object = returnFieldSelector;
+  if(Buffer.isBuffer(object)) {
+    object_size = object[0] | object[1] << 8 | object[2] << 16 | object[3] << 24;
+    if(object_size != object.length) {
+      var error = new Error("query fields raw message size does not match message header size [" + object.length + "] != [" + object_size + "]");
+      error.name = 'MongoError';
+      throw error;
+    }
+  }
+
+  // Make sure we don't get a null exception
+  options = options == null ? {} : options;
+  // Set up options
+  this.collectionName = collectionName;
+  this.queryOptions = queryOptions;
+  this.numberToSkip = numberToSkip;
+  this.numberToReturn = numberToReturn;
+
+  // Ensure we have no null query
+  query = query == null ? {} : query;
+  // Wrap query in the $query parameter so we can add read preferences for mongos
+  this.query = query;
+  this.returnFieldSelector = returnFieldSelector;
+  this.db = db;
+
+  // Let us defined on a command basis if we want functions to be serialized or not
+  if(options['serializeFunctions'] != null && options['serializeFunctions']) {
+    this.serializeFunctions = true;
+  }
+};
+
+inherits(QueryCommand, BaseCommand);
+
+QueryCommand.OP_QUERY = 2004;
+
+/*
+ * Adds the read prefrence to the current command
+ */
+QueryCommand.prototype.setMongosReadPreference = function(readPreference, tags) {
+  // If we have readPreference set to true set to secondary prefered
+  if(readPreference == true) {
+    readPreference = 'secondaryPreferred';
+  } else if(readPreference == 'false') {
+    readPreference = 'primary';
+  }
+
+  // Force the slave ok flag to be set if we are not using primary read preference
+  if(readPreference != false && readPreference != 'primary') {
+    this.queryOptions |= QueryCommand.OPTS_SLAVE;
+  }
+
+  // Backward compatibility, ensure $query only set on read preference so 1.8.X works
+  if((readPreference != null || tags != null) && this.query['$query'] == null) {
+    this.query = {'$query': this.query};
+  }
+
+  // If we have no readPreference set and no tags, check if the slaveOk bit is set
+  if(readPreference == null && tags == null) {
+    // If we have a slaveOk bit set the read preference for MongoS
+    if(this.queryOptions & QueryCommand.OPTS_SLAVE) {
+      this.query['$readPreference'] = {mode: 'secondary'}
+    } else {
+      this.query['$readPreference'] = {mode: 'primary'}
+    }
+  }
+
+  // Build read preference object
+  if(typeof readPreference == 'object' && readPreference['_type'] == 'ReadPreference') {
+    this.query['$readPreference'] = readPreference.toObject();
+  } else if(readPreference != null) {
+    // Add the read preference
+    this.query['$readPreference'] = {mode: readPreference};
+
+    // If we have tags let's add them
+    if(tags != null) {
+      this.query['$readPreference']['tags'] = tags;
+    }
+  }
+}
+
+/*
+struct {
+    MsgHeader header;                 // standard message header
+    int32     opts;                   // query options.  See below for details.
+    cstring   fullCollectionName;     // "dbname.collectionname"
+    int32     numberToSkip;           // number of documents to skip when returning results
+    int32     numberToReturn;         // number of documents to return in the first OP_REPLY
+    BSON      query ;                 // query object.  See below for details.
+  [ BSON      returnFieldSelector; ]  // OPTIONAL : selector indicating the fields to return.  See below for details.
+}
+*/
+QueryCommand.prototype.toBinary = function() {
+  // Total length of the command
+  var totalLengthOfCommand = 0;
+  // Calculate total length of the document
+  if(Buffer.isBuffer(this.query)) {
+    totalLengthOfCommand = 4 + Buffer.byteLength(this.collectionName) + 1 + 4 + 4 + this.query.length + (4 * 4);
+  } else {
+    totalLengthOfCommand = 4 + Buffer.byteLength(this.collectionName) + 1 + 4 + 4 + this.db.bson.calculateObjectSize(this.query, this.serializeFunctions, true) + (4 * 4);
+  }
+
+  // Calculate extra fields size
+  if(this.returnFieldSelector != null && !(Buffer.isBuffer(this.returnFieldSelector)))  {
+    if(Object.keys(this.returnFieldSelector).length > 0) {
+      totalLengthOfCommand += this.db.bson.calculateObjectSize(this.returnFieldSelector, this.serializeFunctions, true);
+    }
+  } else if(Buffer.isBuffer(this.returnFieldSelector)) {
+    totalLengthOfCommand += this.returnFieldSelector.length;
+  }
+
+  // Let's build the single pass buffer command
+  var _index = 0;
+  var _command = new Buffer(totalLengthOfCommand);
+  // Write the header information to the buffer
+  _command[_index + 3] = (totalLengthOfCommand >> 24) & 0xff;
+  _command[_index + 2] = (totalLengthOfCommand >> 16) & 0xff;
+  _command[_index + 1] = (totalLengthOfCommand >> 8) & 0xff;
+  _command[_index] = totalLengthOfCommand & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write the request ID
+  _command[_index + 3] = (this.requestId >> 24) & 0xff;
+  _command[_index + 2] = (this.requestId >> 16) & 0xff;
+  _command[_index + 1] = (this.requestId >> 8) & 0xff;
+  _command[_index] = this.requestId & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write zero
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  // Write the op_code for the command
+  _command[_index + 3] = (QueryCommand.OP_QUERY >> 24) & 0xff;
+  _command[_index + 2] = (QueryCommand.OP_QUERY >> 16) & 0xff;
+  _command[_index + 1] = (QueryCommand.OP_QUERY >> 8) & 0xff;
+  _command[_index] = QueryCommand.OP_QUERY & 0xff;
+  // Adjust index
+  _index = _index + 4;
+
+  // Write the query options
+  _command[_index + 3] = (this.queryOptions >> 24) & 0xff;
+  _command[_index + 2] = (this.queryOptions >> 16) & 0xff;
+  _command[_index + 1] = (this.queryOptions >> 8) & 0xff;
+  _command[_index] = this.queryOptions & 0xff;
+  // Adjust index
+  _index = _index + 4;
+
+  // Write the collection name to the command
+  _index = _index + _command.write(this.collectionName, _index, 'utf8') + 1;
+  _command[_index - 1] = 0;
+
+  // Write the number of documents to skip
+  _command[_index + 3] = (this.numberToSkip >> 24) & 0xff;
+  _command[_index + 2] = (this.numberToSkip >> 16) & 0xff;
+  _command[_index + 1] = (this.numberToSkip >> 8) & 0xff;
+  _command[_index] = this.numberToSkip & 0xff;
+  // Adjust index
+  _index = _index + 4;
+
+  // Write the number of documents to return
+  _command[_index + 3] = (this.numberToReturn >> 24) & 0xff;
+  _command[_index + 2] = (this.numberToReturn >> 16) & 0xff;
+  _command[_index + 1] = (this.numberToReturn >> 8) & 0xff;
+  _command[_index] = this.numberToReturn & 0xff;
+  // Adjust index
+  _index = _index + 4;
+
+  // Document binary length
+  var documentLength = 0
+  var object = this.query;
+
+  // Serialize the selector
+  if(Buffer.isBuffer(object)) {
+    documentLength = object.length;
+    // Copy the data into the current buffer
+    object.copy(_command, _index);
+  } else {
+    // Serialize the document straight to the buffer
+    documentLength = this.db.bson.serializeWithBufferAndIndex(object, this.checkKeys, _command, _index, this.serializeFunctions) - _index + 1;
+  }
+
+  // Write the length to the document
+  _command[_index + 3] = (documentLength >> 24) & 0xff;
+  _command[_index + 2] = (documentLength >> 16) & 0xff;
+  _command[_index + 1] = (documentLength >> 8) & 0xff;
+  _command[_index] = documentLength & 0xff;
+  // Update index in buffer
+  _index = _index + documentLength;
+  // Add terminating 0 for the object
+  _command[_index - 1] = 0;
+
+  // Push field selector if available
+  if(this.returnFieldSelector != null && !(Buffer.isBuffer(this.returnFieldSelector)))  {
+    if(Object.keys(this.returnFieldSelector).length > 0) {
+      var documentLength = this.db.bson.serializeWithBufferAndIndex(this.returnFieldSelector, this.checkKeys, _command, _index, this.serializeFunctions) - _index + 1;
+      // Write the length to the document
+      _command[_index + 3] = (documentLength >> 24) & 0xff;
+      _command[_index + 2] = (documentLength >> 16) & 0xff;
+      _command[_index + 1] = (documentLength >> 8) & 0xff;
+      _command[_index] = documentLength & 0xff;
+      // Update index in buffer
+      _index = _index + documentLength;
+      // Add terminating 0 for the object
+      _command[_index - 1] = 0;
+    }
+  } if(this.returnFieldSelector != null && Buffer.isBuffer(this.returnFieldSelector))  {
+    // Document binary length
+    var documentLength = 0
+    var object = this.returnFieldSelector;
+
+    // Serialize the selector
+    documentLength = object.length;
+    // Copy the data into the current buffer
+    object.copy(_command, _index);
+
+    // Write the length to the document
+    _command[_index + 3] = (documentLength >> 24) & 0xff;
+    _command[_index + 2] = (documentLength >> 16) & 0xff;
+    _command[_index + 1] = (documentLength >> 8) & 0xff;
+    _command[_index] = documentLength & 0xff;
+    // Update index in buffer
+    _index = _index + documentLength;
+    // Add terminating 0 for the object
+    _command[_index - 1] = 0;
+  }
+
+  // Return finished command
+  return _command;
+};
+
+// Constants
+QueryCommand.OPTS_NONE = 0;
+QueryCommand.OPTS_TAILABLE_CURSOR = 2;
+QueryCommand.OPTS_SLAVE = 4;
+QueryCommand.OPTS_OPLOG_REPLY = 8;
+QueryCommand.OPTS_NO_CURSOR_TIMEOUT = 16;
+QueryCommand.OPTS_AWAIT_DATA = 32;
+QueryCommand.OPTS_EXHAUST = 64;
+QueryCommand.OPTS_PARTIAL = 128;
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/commands/update_command.js b/node_modules/mongodb/lib/mongodb/commands/update_command.js
new file mode 100644
index 0000000..9829dea
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/commands/update_command.js
@@ -0,0 +1,174 @@
+var BaseCommand = require('./base_command').BaseCommand,
+  inherits = require('util').inherits;
+
+/**
+  Update Document Command
+**/
+var UpdateCommand = exports.UpdateCommand = function(db, collectionName, spec, document, options) {
+  BaseCommand.call(this);
+
+  var object = spec;
+  if(Buffer.isBuffer(object)) {
+    var object_size = object[0] | object[1] << 8 | object[2] << 16 | object[3] << 24;    
+    if(object_size != object.length)  {
+      var error = new Error("update spec raw message size does not match message header size [" + object.length + "] != [" + object_size + "]");
+      error.name = 'MongoError';
+      throw error;
+    }
+  }
+
+  var object = document;
+  if(Buffer.isBuffer(object)) {
+    var object_size = object[0] | object[1] << 8 | object[2] << 16 | object[3] << 24;    
+    if(object_size != object.length)  {
+      var error = new Error("update document raw message size does not match message header size [" + object.length + "] != [" + object_size + "]");
+      error.name = 'MongoError';
+      throw error;
+    }
+  }
+
+  this.collectionName = collectionName;
+  this.spec = spec;
+  this.document = document;
+  this.db = db;
+  this.serializeFunctions = false;
+
+  // Generate correct flags
+  var db_upsert = 0;
+  var db_multi_update = 0;
+  db_upsert = options != null && options['upsert'] != null ? (options['upsert'] == true ? 1 : 0) : db_upsert;
+  db_multi_update = options != null && options['multi'] != null ? (options['multi'] == true ? 1 : 0) : db_multi_update;
+
+  // Flags
+  this.flags = parseInt(db_multi_update.toString() + db_upsert.toString(), 2);
+  // Let us defined on a command basis if we want functions to be serialized or not
+  if(options['serializeFunctions'] != null && options['serializeFunctions']) {
+    this.serializeFunctions = true;
+  }
+};
+
+inherits(UpdateCommand, BaseCommand);
+
+UpdateCommand.OP_UPDATE = 2001;
+
+/*
+struct {
+    MsgHeader header;             // standard message header
+    int32     ZERO;               // 0 - reserved for future use
+    cstring   fullCollectionName; // "dbname.collectionname"
+    int32     flags;              // bit vector. see below
+    BSON      spec;               // the query to select the document
+    BSON      document;           // the document data to update with or insert
+}
+*/
+UpdateCommand.prototype.toBinary = function() {
+  // Calculate total length of the document
+  var totalLengthOfCommand = 4 + Buffer.byteLength(this.collectionName) + 1 + 4 + this.db.bson.calculateObjectSize(this.spec, false, true) +
+      this.db.bson.calculateObjectSize(this.document, this.serializeFunctions, true) + (4 * 4);
+
+  // Let's build the single pass buffer command
+  var _index = 0;
+  var _command = new Buffer(totalLengthOfCommand);
+  // Write the header information to the buffer
+  _command[_index + 3] = (totalLengthOfCommand >> 24) & 0xff;     
+  _command[_index + 2] = (totalLengthOfCommand >> 16) & 0xff;
+  _command[_index + 1] = (totalLengthOfCommand >> 8) & 0xff;
+  _command[_index] = totalLengthOfCommand & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write the request ID
+  _command[_index + 3] = (this.requestId >> 24) & 0xff;     
+  _command[_index + 2] = (this.requestId >> 16) & 0xff;
+  _command[_index + 1] = (this.requestId >> 8) & 0xff;
+  _command[_index] = this.requestId & 0xff;
+  // Adjust index
+  _index = _index + 4;
+  // Write zero
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  // Write the op_code for the command
+  _command[_index + 3] = (UpdateCommand.OP_UPDATE >> 24) & 0xff;     
+  _command[_index + 2] = (UpdateCommand.OP_UPDATE >> 16) & 0xff;
+  _command[_index + 1] = (UpdateCommand.OP_UPDATE >> 8) & 0xff;
+  _command[_index] = UpdateCommand.OP_UPDATE & 0xff;
+  // Adjust index
+  _index = _index + 4;
+
+  // Write zero
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+  _command[_index++] = 0;
+
+  // Write the collection name to the command
+  _index = _index + _command.write(this.collectionName, _index, 'utf8') + 1;
+  _command[_index - 1] = 0;    
+
+  // Write the update flags
+  _command[_index + 3] = (this.flags >> 24) & 0xff;     
+  _command[_index + 2] = (this.flags >> 16) & 0xff;
+  _command[_index + 1] = (this.flags >> 8) & 0xff;
+  _command[_index] = this.flags & 0xff;
+  // Adjust index
+  _index = _index + 4;
+
+  // Document binary length
+  var documentLength = 0
+  var object = this.spec;
+
+  // Serialize the selector
+  // If we are passing a raw buffer, do minimal validation
+  if(Buffer.isBuffer(object)) {
+    var object_size = object[0] | object[1] << 8 | object[2] << 16 | object[3] << 24;
+    if(object_size != object.length) throw new Error("raw message size does not match message header size [" + object.length + "] != [" + object_size + "]");
+    documentLength = object.length;
+    // Copy the data into the current buffer
+    object.copy(_command, _index);
+  } else {
+    documentLength = this.db.bson.serializeWithBufferAndIndex(object, this.checkKeys, _command, _index, false) - _index + 1;
+  }
+
+  // Write the length to the document
+  _command[_index + 3] = (documentLength >> 24) & 0xff;     
+  _command[_index + 2] = (documentLength >> 16) & 0xff;
+  _command[_index + 1] = (documentLength >> 8) & 0xff;
+  _command[_index] = documentLength & 0xff;
+  // Update index in buffer
+  _index = _index + documentLength;
+  // Add terminating 0 for the object
+  _command[_index - 1] = 0;    
+
+  // Document binary length
+  var documentLength = 0
+  var object = this.document;
+
+  // Serialize the document
+  // If we are passing a raw buffer, do minimal validation
+  if(Buffer.isBuffer(object)) {
+    var object_size = object[0] | object[1] << 8 | object[2] << 16 | object[3] << 24;
+    if(object_size != object.length) throw new Error("raw message size does not match message header size [" + object.length + "] != [" + object_size + "]");
+    documentLength = object.length;
+    // Copy the data into the current buffer
+    object.copy(_command, _index);
+  } else {    
+    documentLength = this.db.bson.serializeWithBufferAndIndex(object, this.checkKeys, _command, _index, this.serializeFunctions) - _index + 1;
+  }
+
+  // Write the length to the document
+  _command[_index + 3] = (documentLength >> 24) & 0xff;     
+  _command[_index + 2] = (documentLength >> 16) & 0xff;
+  _command[_index + 1] = (documentLength >> 8) & 0xff;
+  _command[_index] = documentLength & 0xff;
+  // Update index in buffer
+  _index = _index + documentLength;
+  // Add terminating 0 for the object
+  _command[_index - 1] = 0;    
+
+  return _command;
+};
+
+// Constants
+UpdateCommand.DB_UPSERT = 0;
+UpdateCommand.DB_MULTI_UPDATE = 1;
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/connection/base.js b/node_modules/mongodb/lib/mongodb/connection/base.js
new file mode 100644
index 0000000..93b236e
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/base.js
@@ -0,0 +1,465 @@
+var EventEmitter = require('events').EventEmitter
+  , inherits = require('util').inherits
+  , mongodb_cr_authenticate = require('../auth/mongodb_cr.js').authenticate
+  , mongodb_gssapi_authenticate = require('../auth/mongodb_gssapi.js').authenticate
+  , mongodb_sspi_authenticate = require('../auth/mongodb_sspi.js').authenticate;  
+
+var id = 0;
+
+/**
+ * Internal class for callback storage
+ * @ignore
+ */
+var CallbackStore = function() {
+  // Make class an event emitter
+  EventEmitter.call(this);
+  // Add a info about call variable
+  this._notReplied = {};
+  this.id = id++;
+}
+
+/**
+ * @ignore
+ */
+inherits(CallbackStore, EventEmitter);
+
+CallbackStore.prototype.notRepliedToIds = function() {
+  return Object.keys(this._notReplied);
+}
+
+CallbackStore.prototype.callbackInfo = function(id) {
+  return this._notReplied[id]; 
+}
+
+/**
+ * Internal class for holding non-executed commands
+ * @ignore
+ */
+var NonExecutedOperationStore = function(config) {  
+  this.config = config;
+  this.commands = {
+      read: []
+    , write_reads: []
+    , write: []
+  };
+}
+
+NonExecutedOperationStore.prototype.write = function(op) {
+  this.commands.write.push(op);
+}
+
+NonExecutedOperationStore.prototype.read_from_writer = function(op) {  
+  this.commands.write_reads.push(op);
+}
+
+NonExecutedOperationStore.prototype.read = function(op) {  
+  this.commands.read.push(op);
+}
+
+NonExecutedOperationStore.prototype.execute_queries = function(executeInsertCommand) {
+  var connection = this.config.checkoutReader();
+  if(connection == null || connection instanceof Error) return;
+
+  // Write out all the queries
+  while(this.commands.read.length > 0) {
+    // Get the next command
+    var command = this.commands.read.shift();
+    // command['options'].connection = this.config.checkoutReader();
+    command.options.connection = connection;
+    // Execute the next command
+    command.executeQueryCommand(command.db, command.db_command, command.options, command.callback);
+  }
+}
+
+NonExecutedOperationStore.prototype.execute_writes = function() {
+  var connection = this.config.checkoutWriter();
+  if(connection == null || connection instanceof Error) return;
+
+  // Write out all the queries to the primary
+  while(this.commands.write_reads.length > 0) {
+    // Get the next command
+    var command = this.commands.write_reads.shift();
+    command.options.connection = connection;
+    // Execute the next command
+    command.executeQueryCommand(command.db, command.db_command, command.options, command.callback);
+  }
+
+  // Execute all write operations
+  while(this.commands.write.length > 0) {
+    // Get the next command
+    var command = this.commands.write.shift();
+    // Set the connection
+    command.options.connection = connection;
+    // Execute the next command
+    command.executeInsertCommand(command.db, command.db_command, command.options, command.callback);
+  }  
+}
+
+/**
+ * Internal class for authentication storage
+ * @ignore
+ */
+var AuthStore = function() {
+  this._auths = [];
+}
+
+AuthStore.prototype.add = function(authMechanism, dbName, username, password, authdbName) {
+  // Check for duplicates
+  if(!this.contains(dbName)) {
+    // Base config
+    var config = {
+        'username':username
+      , 'password':password
+      , 'db': dbName
+      , 'authMechanism': authMechanism
+    };
+
+    // Add auth source if passed in
+    if(typeof authdbName == 'string') {
+      config['authdb'] = authdbName;
+    }
+
+    // Push the config
+    this._auths.push(config);
+  }
+}
+
+AuthStore.prototype.contains = function(dbName) {
+  for(var i = 0; i < this._auths.length; i++) {
+    if(this._auths[i].db == dbName) return true;
+  }
+
+  return false;
+}
+
+AuthStore.prototype.remove = function(dbName) {
+  var newAuths = [];
+
+  // Filter out all the login details
+  for(var i = 0; i < this._auths.length; i++) {
+    if(this._auths[i].db != dbName) newAuths.push(this._auths[i]);
+  }
+
+  //  Set the filtered list
+  this._auths = newAuths;
+}
+
+AuthStore.prototype.get = function(index) {
+  return this._auths[index];
+}
+
+AuthStore.prototype.length = function() {
+  return this._auths.length;
+}
+
+AuthStore.prototype.toArray = function() {
+  return this._auths.slice(0);
+}
+
+/**
+ * Internal class for storing db references
+ * @ignore
+ */
+var DbStore = function() {
+  this._dbs = [];
+}
+
+DbStore.prototype.add = function(db) {
+  // this._dbs.push(db);
+  var found = false;
+  // Only add if it does not exist already
+  for(var i = 0; i < this._dbs.length; i++) {
+    if(db.databaseName == this._dbs[i].databaseName) found = true;
+  }
+
+  if(!found) this._dbs.push(db);
+}
+
+DbStore.prototype.reset = function() {
+  this._dbs = [];
+}
+
+DbStore.prototype.emit = function(event, message, object, reset, filterDb) {
+  if(reset) {
+    while(this._dbs.length > 0) {
+      var db = this._dbs.shift();
+      // Only emit if there is a listener
+      if(db.listeners(event).length > 0) {
+        if(filterDb == null  || filterDb.databaseName !== db.databaseName 
+          || filterDb.tag !== db.tag) {
+          db.emit(event, message, object);
+        }
+      }
+    }
+  } else {
+    for(var i = 0; i < this._dbs.length; i++) {
+      if(this._dbs[i].listeners(event).length > 0) {
+        if(filterDb == null || filterDb.databaseName !== this._dbs[i].databaseName 
+          || filterDb.tag !== this._dbs[i].tag) {
+          this._dbs[i].emit(event, message, object);
+        }
+      }
+    }
+  }
+}
+
+var Base = function Base() {  
+  EventEmitter.call(this);
+
+  // Callback store is part of connection specification
+  if(Base._callBackStore == null) {
+    Base._callBackStore = new CallbackStore();
+  }
+
+  // Create a new callback store  
+  this._callBackStore = new CallbackStore();
+  // All commands not being executed
+  this._commandsStore = new NonExecutedOperationStore(this);
+  // Create a new auth store
+  this.auth = new AuthStore();
+  // Contains all the dbs attached to this server config
+  this._dbStore = new DbStore();
+}
+
+/**
+ * @ignore
+ */
+inherits(Base, EventEmitter);
+
+/**
+ * @ignore
+ */
+Base.prototype._apply_auths = function(db, callback) {
+  _apply_auths_serially(this, db, this.auth.toArray(), callback);
+}
+
+var _apply_auths_serially = function(self, db, auths, callback) {
+  if(auths.length == 0) return callback(null, null);
+  // Get the first auth
+  var auth = auths.shift();
+  var connections = self.allRawConnections();
+  var connectionsLeft = connections.length;
+
+  // Let's apply it to all raw connections
+  for(var i = 0; i < connections.length; i++) {
+    var options = {connection: connections[i]};
+
+    if(auth.authMechanism == 'GSSAPI') {
+      var connectionHandler = function(err, result) {
+        connectionsLeft = connectionsLeft - 1;
+        // If no more connections are left return
+        if(connectionsLeft == 0) {
+          return _apply_auths_serially(self, db, auths, callback);
+        }                
+      }
+
+      // We have the kerberos library, execute auth process
+      if(process.platform == 'win32') {
+        mongodb_sspi_authenticate(db, auth.username, auth.password, auth.authdb, options, callback);
+      } else {
+        mongodb_gssapi_authenticate(db, auth.username, auth.password, auth.authdb, options, callback);
+      }
+    } else if(auth.authMechanism == 'MONGODB-CR') {
+      mongodb_cr_authenticate(db, auth.username, auth.password, auth.authdb, options, callback);
+    }
+  }
+}
+
+/**
+ * Fire all the errors
+ * @ignore
+ */
+Base.prototype.__executeAllCallbacksWithError = function(err) {
+  // Check all callbacks
+  var keys = Object.keys(this._callBackStore._notReplied);
+  // For each key check if it's a callback that needs to be returned
+  for(var j = 0; j < keys.length; j++) {
+    var info = this._callBackStore._notReplied[keys[j]];
+    // Check if we have a chained command (findAndModify)
+    if(info && info['chained'] && Array.isArray(info['chained']) && info['chained'].length > 0) {
+      var chained = info['chained'];
+      // Only callback once and the last one is the right one
+      var finalCallback = chained.pop();
+      // Emit only the last event
+      this._callBackStore.emit(finalCallback, err, null);
+
+      // Put back the final callback to ensure we don't call all commands in the chain
+      chained.push(finalCallback);
+
+      // Remove all chained callbacks
+      for(var i = 0; i < chained.length; i++) {
+        delete this._callBackStore._notReplied[chained[i]];
+      }
+      // Remove the key
+      delete this._callBackStore._notReplied[keys[j]];
+    } else {
+      this._callBackStore.emit(keys[j], err, null);
+      // Remove the key
+      delete this._callBackStore._notReplied[keys[j]];
+    }
+  }
+}
+
+/**
+ * Fire all the errors
+ * @ignore
+ */
+Base.prototype.__executeAllServerSpecificErrorCallbacks = function(host, port, err) {  
+  // Check all callbacks
+  var keys = Object.keys(this._callBackStore._notReplied);
+  // For each key check if it's a callback that needs to be returned
+  for(var j = 0; j < keys.length; j++) {
+    var info = this._callBackStore._notReplied[keys[j]];
+
+    if(info.connection) {
+      // Unpack the connection settings
+      var _host = info.connection.socketOptions.host;
+      var _port = info.connection.socketOptions.port;
+      // Check if we have a chained command (findAndModify)
+      if(info && info['chained'] 
+        && Array.isArray(info['chained']) 
+        && info['chained'].length > 0
+        && _port == port && _host == host) {
+          var chained = info['chained'];
+          // Only callback once and the last one is the right one
+          var finalCallback = chained.pop();
+          // Emit only the last event
+          this._callBackStore.emit(finalCallback, err, null);
+
+          // Put back the final callback to ensure we don't call all commands in the chain
+          chained.push(finalCallback);
+
+          // Remove all chained callbacks
+          for(var i = 0; i < chained.length; i++) {
+            delete this._callBackStore._notReplied[chained[i]];
+          }
+          // Remove the key
+          delete this._callBackStore._notReplied[keys[j]];
+      } else if(_port == port && _host == host) {
+        this._callBackStore.emit(keys[j], err, null);
+        // Remove the key
+        delete this._callBackStore._notReplied[keys[j]];
+      }      
+    }
+  }
+}
+
+/**
+ * Register a handler
+ * @ignore
+ * @api private
+ */
+Base.prototype._registerHandler = function(db_command, raw, connection, exhaust, callback) {
+  // If we have an array of commands, chain them
+  var chained = Array.isArray(db_command);
+
+  // Check if we have exhausted
+  if(typeof exhaust == 'function') {
+    callback = exhaust;
+    exhaust = false;
+  }
+
+  // If they are chained we need to add a special handler situation
+  if(chained) {
+    // List off chained id's
+    var chainedIds = [];
+    // Add all id's
+    for(var i = 0; i < db_command.length; i++) chainedIds.push(db_command[i].getRequestId().toString());
+    // Register all the commands together
+    for(var i = 0; i < db_command.length; i++) {
+      var command = db_command[i];
+      // Add the callback to the store
+      this._callBackStore.once(command.getRequestId(), callback);
+      // Add the information about the reply
+      this._callBackStore._notReplied[command.getRequestId().toString()] = {start: new Date().getTime(), 'raw': raw, chained:chainedIds, connection:connection, exhaust:false};
+    }
+  } else {
+    // Add the callback to the list of handlers
+    this._callBackStore.once(db_command.getRequestId(), callback);
+    // Add the information about the reply
+    this._callBackStore._notReplied[db_command.getRequestId().toString()] = {start: new Date().getTime(), 'raw': raw, connection:connection, exhaust:exhaust};
+  }
+}
+
+/**
+ * Re-Register a handler, on the cursor id f.ex
+ * @ignore
+ * @api private
+ */
+Base.prototype._reRegisterHandler = function(newId, object, callback) {
+  // Add the callback to the list of handlers
+  this._callBackStore.once(newId, object.callback.listener);
+  // Add the information about the reply
+  this._callBackStore._notReplied[newId] = object.info;
+}
+
+/**
+ *
+ * @ignore
+ * @api private
+ */
+Base.prototype._callHandler = function(id, document, err) {
+  // If there is a callback peform it
+  if(this._callBackStore.listeners(id).length >= 1) {
+    // Get info object
+    var info = this._callBackStore._notReplied[id];
+    // Delete the current object
+    delete this._callBackStore._notReplied[id];      
+    // Emit to the callback of the object
+    this._callBackStore.emit(id, err, document, info.connection);
+  }
+}
+
+/**
+ *
+ * @ignore
+ * @api private
+ */
+Base.prototype._hasHandler = function(id) {
+  // If there is a callback peform it
+  return this._callBackStore.listeners(id).length >= 1;
+}
+
+/**
+ *
+ * @ignore
+ * @api private
+ */
+Base.prototype._removeHandler = function(id) {
+  // Remove the information
+  if(this._callBackStore._notReplied[id] != null) delete this._callBackStore._notReplied[id];
+  // Remove the callback if it's registered
+  this._callBackStore.removeAllListeners(id);
+  // Force cleanup _events, node.js seems to set it as a null value
+  if(this._callBackStore._events != null) delete this._callBackStore._events[id];
+}
+
+/**
+ *
+ * @ignore
+ * @api private
+ */
+Base.prototype._findHandler = function(id) {
+  var info = this._callBackStore._notReplied[id];
+  // Return the callback
+  return {info:info, callback:(this._callBackStore.listeners(id).length >= 1) ? this._callBackStore.listeners(id)[0] : null}
+}
+
+/**
+ *
+ * @ignore
+ * @api private
+ */
+Base.prototype._emitAcrossAllDbInstances = function(server, filterDb, event, message, object, resetConnection) {
+  if(resetConnection) {
+    for(var i = 0; i < this._dbStore._dbs.length; i++) {
+      if(typeof this._dbStore._dbs[i].openCalled != 'undefined')
+        this._dbStore._dbs[i].openCalled = false;
+    }
+  }
+  
+  // Fire event
+  this._dbStore.emit(event, message, object, resetConnection, filterDb);
+}
+
+exports.Base = Base;
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/connection/connection.js b/node_modules/mongodb/lib/mongodb/connection/connection.js
new file mode 100644
index 0000000..6753fd2
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/connection.js
@@ -0,0 +1,505 @@
+var utils = require('./connection_utils'),
+  inherits = require('util').inherits,
+  net = require('net'),
+  EventEmitter = require('events').EventEmitter,
+  inherits = require('util').inherits,
+  binaryutils = require('../utils'),
+  tls = require('tls');
+
+var Connection = exports.Connection = function(id, socketOptions) {
+  // Set up event emitter
+  EventEmitter.call(this);
+  // Store all socket options
+  this.socketOptions = socketOptions ? socketOptions : {host:'localhost', port:27017, domainSocket:false};
+  // Set keep alive default if not overriden
+  if(this.socketOptions.keepAlive == null && (process.platform !== "sunos" || process.platform !== "win32")) this.socketOptions.keepAlive = 100;
+  // Id for the connection
+  this.id = id;
+  // State of the connection
+  this.connected = false;
+  // Set if this is a domain socket
+  this.domainSocket = this.socketOptions.domainSocket;
+
+  //
+  // Connection parsing state
+  //
+  this.maxBsonSize = socketOptions.maxBsonSize ? socketOptions.maxBsonSize : Connection.DEFAULT_MAX_BSON_SIZE;
+  this.maxMessageSizeBytes = socketOptions.maxMessageSizeBytes ? socketOptions.maxMessageSizeBytes : Connection.DEFAULT_MAX_MESSAGE_SIZE;
+  // Contains the current message bytes
+  this.buffer = null;
+  // Contains the current message size
+  this.sizeOfMessage = 0;
+  // Contains the readIndex for the messaage
+  this.bytesRead = 0;
+  // Contains spill over bytes from additional messages
+  this.stubBuffer = 0;
+
+  // Just keeps list of events we allow
+  this.eventHandlers = {error:[], parseError:[], poolReady:[], message:[], close:[], timeout:[], end:[]};
+
+  // Just keeps list of events we allow
+  resetHandlers(this, false);
+}
+
+// Set max bson size
+Connection.DEFAULT_MAX_BSON_SIZE = 1024 * 1024 * 4;
+// Set default to max bson to avoid overflow or bad guesses
+Connection.DEFAULT_MAX_MESSAGE_SIZE = Connection.DEFAULT_MAX_BSON_SIZE;
+
+// Inherit event emitter so we can emit stuff wohoo
+inherits(Connection, EventEmitter);
+
+Connection.prototype.start = function() {
+  var self = this;
+
+  // If we have a normal connection
+  if(this.socketOptions.ssl) {
+    // Create new connection instance
+    if(this.domainSocket) {
+      this.connection = net.createConnection(this.socketOptions.host);
+    } else {
+      this.connection = net.createConnection(this.socketOptions.port, this.socketOptions.host);
+    }
+    if(this.logger != null && this.logger.doDebug){
+      this.logger.debug("opened connection", this.socketOptions);
+    }
+    // Set options on the socket
+    this.connection.setTimeout(this.socketOptions.connectTimeoutMS != null ? this.socketOptions.connectTimeoutMS : this.socketOptions.timeout);
+    // Work around for 0.4.X
+    if(process.version.indexOf("v0.4") == -1) this.connection.setNoDelay(this.socketOptions.noDelay);
+    // Set keep alive if defined
+    if(process.version.indexOf("v0.4") == -1) {
+      if(this.socketOptions.keepAlive > 0) {
+        this.connection.setKeepAlive(true, this.socketOptions.keepAlive);
+      } else {
+        this.connection.setKeepAlive(false);
+      }
+    }
+
+    // Check if the driver should validate the certificate
+    var validate_certificates = this.socketOptions.sslValidate == true ? true : false;
+
+    // Create options for the tls connection
+    var tls_options = {
+        socket: this.connection
+      , rejectUnauthorized: false
+    }
+
+    // If we wish to validate the certificate we have provided a ca store
+    if(validate_certificates) {
+      tls_options.ca = this.socketOptions.sslCA;
+    }
+
+    // If we have a certificate to present
+    if(this.socketOptions.sslCert) {      
+      tls_options.cert = this.socketOptions.sslCert;
+      tls_options.key = this.socketOptions.sslKey;
+    }
+
+    // If the driver has been provided a private key password
+    if(this.socketOptions.sslPass) {
+      tls_options.passphrase = this.socketOptions.sslPass;
+    }
+
+    // Contains the cleartext stream
+    var cleartext = null;
+    // Attempt to establish a TLS connection to the server
+    try {
+      cleartext = tls.connect(this.socketOptions.port, this.socketOptions.host, tls_options, function() {      
+        // If we have a ssl certificate validation error return an error
+        if(cleartext.authorizationError && validate_certificates) {          
+          // Emit an error
+          return self.emit("error", cleartext.authorizationError, self, {ssl:true});        
+        }
+        
+        // Connect to the server
+        connectHandler(self)();
+      })      
+    } catch(err) {
+      return self.emit("error", "SSL connection failed", self, {ssl:true});
+    }
+
+    // Save the output stream
+    this.writeSteam = cleartext;
+
+    // Set up data handler for the clear stream
+    cleartext.on("data", createDataHandler(this));
+    // Do any handling of end event of the stream
+    cleartext.on("end", endHandler(this));
+    cleartext.on("error", errorHandler(this));    
+
+    // Handle any errors
+    this.connection.on("error", errorHandler(this));    
+    // Handle timeout
+    this.connection.on("timeout", timeoutHandler(this));
+    // Handle drain event
+    this.connection.on("drain", drainHandler(this));
+    // Handle the close event
+    this.connection.on("close", closeHandler(this));
+  } else {
+    // Create new connection instance
+    if(this.domainSocket) {
+      this.connection = net.createConnection(this.socketOptions.host);
+    } else {
+      this.connection = net.createConnection(this.socketOptions.port, this.socketOptions.host);
+    }
+    if(this.logger != null && this.logger.doDebug){
+      this.logger.debug("opened connection", this.socketOptions);
+    }
+
+    // Set options on the socket
+    this.connection.setTimeout(this.socketOptions.connectTimeoutMS != null ? this.socketOptions.connectTimeoutMS : this.socketOptions.timeout);
+    // Work around for 0.4.X
+    if(process.version.indexOf("v0.4") == -1) this.connection.setNoDelay(this.socketOptions.noDelay);
+    // Set keep alive if defined
+    if(process.version.indexOf("v0.4") == -1) {
+      if(this.socketOptions.keepAlive > 0) {
+        this.connection.setKeepAlive(true, this.socketOptions.keepAlive);
+      } else {
+        this.connection.setKeepAlive(false);
+      }
+    }
+
+    // Set up write stream
+    this.writeSteam = this.connection;
+    // Add handlers
+    this.connection.on("error", errorHandler(this));
+    // Add all handlers to the socket to manage it
+    this.connection.on("connect", connectHandler(this));
+    // this.connection.on("end", endHandler(this));
+    this.connection.on("data", createDataHandler(this));
+    this.connection.on("timeout", timeoutHandler(this));
+    this.connection.on("drain", drainHandler(this));
+    this.connection.on("close", closeHandler(this));
+  }
+}
+
+// Check if the sockets are live
+Connection.prototype.isConnected = function() {
+  return this.connected && !this.connection.destroyed && this.connection.writable && this.connection.readable;
+}
+
+// Write the data out to the socket
+Connection.prototype.write = function(command, callback) {
+  try {
+    // If we have a list off commands to be executed on the same socket
+    if(Array.isArray(command)) {
+      for(var i = 0; i < command.length; i++) {
+        var binaryCommand = command[i].toBinary()
+        
+        if(!this.socketOptions['disableDriverBSONSizeCheck'] && binaryCommand.length > this.maxBsonSize) 
+          return callback(new Error("Document exceeds maximum allowed bson size of " + this.maxBsonSize + " bytes"));
+        
+        if(this.socketOptions['disableDriverBSONSizeCheck'] && binaryCommand.length > this.maxMessageSizeBytes) {
+          return callback(new Error("Command exceeds maximum message size of " + this.maxMessageSizeBytes + " bytes"));
+        }
+
+        if(this.logger != null && this.logger.doDebug) 
+          this.logger.debug("writing command to mongodb", {binary: binaryCommand, json: command[i]});
+        
+        var r = this.writeSteam.write(binaryCommand);
+      }
+    } else {
+      var binaryCommand = command.toBinary()
+
+      if(!this.socketOptions['disableDriverBSONSizeCheck'] && binaryCommand.length > this.maxBsonSize) 
+        return callback(new Error("Document exceeds maximum allowed bson size of " + this.maxBsonSize + " bytes"));
+
+      if(this.socketOptions['disableDriverBSONSizeCheck'] && binaryCommand.length > this.maxMessageSizeBytes) {
+        return callback(new Error("Command exceeds maximum message size of " + this.maxMessageSizeBytes + " bytes"));
+      }
+      
+      if(this.logger != null && this.logger.doDebug) 
+        this.logger.debug("writing command to mongodb", {binary: binaryCommand, json: command});
+
+      var r = this.writeSteam.write(binaryCommand);
+    }
+  } catch (err) {
+    if(typeof callback === 'function') callback(err);
+  }
+}
+
+// Force the closure of the connection
+Connection.prototype.close = function() {
+  // clear out all the listeners
+  resetHandlers(this, true);
+  // Add a dummy error listener to catch any weird last moment errors (and ignore them)
+  this.connection.on("error", function() {})
+  // destroy connection
+  this.connection.destroy();
+  if(this.logger != null && this.logger.doDebug){
+    this.logger.debug("closed connection", this.connection);
+  }
+}
+
+// Reset all handlers
+var resetHandlers = function(self, clearListeners) {
+  self.eventHandlers = {error:[], connect:[], close:[], end:[], timeout:[], parseError:[], message:[]};
+
+  // If we want to clear all the listeners
+  if(clearListeners && self.connection != null) {
+    var keys = Object.keys(self.eventHandlers);
+    // Remove all listeners
+    for(var i = 0; i < keys.length; i++) {
+      self.connection.removeAllListeners(keys[i]);
+    }
+  }
+}
+
+//
+// Handlers
+//
+
+// Connect handler
+var connectHandler = function(self) {
+  return function(data) {
+    // Set connected
+    self.connected = true;
+    // Now that we are connected set the socket timeout
+    self.connection.setTimeout(self.socketOptions.socketTimeoutMS != null ? self.socketOptions.socketTimeoutMS : self.socketOptions.timeout);
+    // Emit the connect event with no error
+    self.emit("connect", null, self);
+  }
+}
+
+var createDataHandler = exports.Connection.createDataHandler = function(self) {
+  // We need to handle the parsing of the data
+  // and emit the messages when there is a complete one
+  return function(data) {
+    // Parse until we are done with the data
+    while(data.length > 0) {
+      // If we still have bytes to read on the current message
+      if(self.bytesRead > 0 && self.sizeOfMessage > 0) {
+        // Calculate the amount of remaining bytes
+        var remainingBytesToRead = self.sizeOfMessage - self.bytesRead;
+        // Check if the current chunk contains the rest of the message
+        if(remainingBytesToRead > data.length) {
+          // Copy the new data into the exiting buffer (should have been allocated when we know the message size)
+          data.copy(self.buffer, self.bytesRead);
+          // Adjust the number of bytes read so it point to the correct index in the buffer
+          self.bytesRead = self.bytesRead + data.length;
+
+          // Reset state of buffer
+          data = new Buffer(0);
+        } else {
+          // Copy the missing part of the data into our current buffer
+          data.copy(self.buffer, self.bytesRead, 0, remainingBytesToRead);
+          // Slice the overflow into a new buffer that we will then re-parse
+          data = data.slice(remainingBytesToRead);
+
+          // Emit current complete message
+          try {
+            var emitBuffer = self.buffer;
+            // Reset state of buffer
+            self.buffer = null;
+            self.sizeOfMessage = 0;
+            self.bytesRead = 0;
+            self.stubBuffer = null;
+            // Emit the buffer
+            self.emit("message", emitBuffer, self);
+          } catch(err) {
+            var errorObject = {err:"socketHandler", trace:err, bin:self.buffer, parseState:{
+              sizeOfMessage:self.sizeOfMessage,
+              bytesRead:self.bytesRead,
+              stubBuffer:self.stubBuffer}};
+            if(self.logger != null && self.logger.doError) self.logger.error("parseError", errorObject);
+            // We got a parse Error fire it off then keep going
+            self.emit("parseError", errorObject, self);
+          }
+        }
+      } else {
+        // Stub buffer is kept in case we don't get enough bytes to determine the
+        // size of the message (< 4 bytes)
+        if(self.stubBuffer != null && self.stubBuffer.length > 0) {
+
+          // If we have enough bytes to determine the message size let's do it
+          if(self.stubBuffer.length + data.length > 4) {
+            // Prepad the data
+            var newData = new Buffer(self.stubBuffer.length + data.length);
+            self.stubBuffer.copy(newData, 0);
+            data.copy(newData, self.stubBuffer.length);
+            // Reassign for parsing
+            data = newData;
+
+            // Reset state of buffer
+            self.buffer = null;
+            self.sizeOfMessage = 0;
+            self.bytesRead = 0;
+            self.stubBuffer = null;
+
+          } else {
+
+            // Add the the bytes to the stub buffer
+            var newStubBuffer = new Buffer(self.stubBuffer.length + data.length);
+            // Copy existing stub buffer
+            self.stubBuffer.copy(newStubBuffer, 0);
+            // Copy missing part of the data
+            data.copy(newStubBuffer, self.stubBuffer.length);
+            // Exit parsing loop
+            data = new Buffer(0);
+          }
+        } else {
+          if(data.length > 4) {
+            // Retrieve the message size
+            var sizeOfMessage = binaryutils.decodeUInt32(data, 0);
+            // If we have a negative sizeOfMessage emit error and return
+            if(sizeOfMessage < 0 || sizeOfMessage > self.maxBsonSize) {
+              var errorObject = {err:"socketHandler", trace:'', bin:self.buffer, parseState:{
+                sizeOfMessage: sizeOfMessage,
+                bytesRead: self.bytesRead,
+                stubBuffer: self.stubBuffer}};
+              if(self.logger != null && self.logger.doError) self.logger.error("parseError", errorObject);
+              // We got a parse Error fire it off then keep going
+              self.emit("parseError", errorObject, self);
+              return;
+            }
+
+            // Ensure that the size of message is larger than 0 and less than the max allowed
+            if(sizeOfMessage > 4 && sizeOfMessage < self.maxBsonSize && sizeOfMessage > data.length) {
+              self.buffer = new Buffer(sizeOfMessage);
+              // Copy all the data into the buffer
+              data.copy(self.buffer, 0);
+              // Update bytes read
+              self.bytesRead = data.length;
+              // Update sizeOfMessage
+              self.sizeOfMessage = sizeOfMessage;
+              // Ensure stub buffer is null
+              self.stubBuffer = null;
+              // Exit parsing loop
+              data = new Buffer(0);
+
+            } else if(sizeOfMessage > 4 && sizeOfMessage < self.maxBsonSize && sizeOfMessage == data.length) {
+              try {
+                var emitBuffer = data;
+                // Reset state of buffer
+                self.buffer = null;
+                self.sizeOfMessage = 0;
+                self.bytesRead = 0;
+                self.stubBuffer = null;
+                // Exit parsing loop
+                data = new Buffer(0);
+                // Emit the message
+                self.emit("message", emitBuffer, self);
+              } catch (err) {
+                var errorObject = {err:"socketHandler", trace:err, bin:self.buffer, parseState:{
+                  sizeOfMessage:self.sizeOfMessage,
+                  bytesRead:self.bytesRead,
+                  stubBuffer:self.stubBuffer}};
+                if(self.logger != null && self.logger.doError) self.logger.error("parseError", errorObject);
+                // We got a parse Error fire it off then keep going
+                self.emit("parseError", errorObject, self);
+              }
+            } else if(sizeOfMessage <= 4 || sizeOfMessage > self.maxBsonSize) {
+              var errorObject = {err:"socketHandler", trace:null, bin:data, parseState:{
+                sizeOfMessage:sizeOfMessage,
+                bytesRead:0,
+                buffer:null,
+                stubBuffer:null}};
+              if(self.logger != null && self.logger.doError) self.logger.error("parseError", errorObject);
+              // We got a parse Error fire it off then keep going
+              self.emit("parseError", errorObject, self);
+
+              // Clear out the state of the parser
+              self.buffer = null;
+              self.sizeOfMessage = 0;
+              self.bytesRead = 0;
+              self.stubBuffer = null;
+              // Exit parsing loop
+              data = new Buffer(0);
+
+            } else {
+              try {
+                var emitBuffer = data.slice(0, sizeOfMessage);
+                // Reset state of buffer
+                self.buffer = null;
+                self.sizeOfMessage = 0;
+                self.bytesRead = 0;
+                self.stubBuffer = null;
+                // Copy rest of message
+                data = data.slice(sizeOfMessage);
+                // Emit the message
+                self.emit("message", emitBuffer, self);
+              } catch (err) {
+                var errorObject = {err:"socketHandler", trace:err, bin:self.buffer, parseState:{
+                  sizeOfMessage:sizeOfMessage,
+                  bytesRead:self.bytesRead,
+                  stubBuffer:self.stubBuffer}};
+                if(self.logger != null && self.logger.doError) self.logger.error("parseError", errorObject);
+                // We got a parse Error fire it off then keep going
+                self.emit("parseError", errorObject, self);
+              }
+
+            }
+          } else {
+            // Create a buffer that contains the space for the non-complete message
+            self.stubBuffer = new Buffer(data.length)
+            // Copy the data to the stub buffer
+            data.copy(self.stubBuffer, 0);
+            // Exit parsing loop
+            data = new Buffer(0);
+          }
+        }
+      }
+    }
+  }
+}
+
+var endHandler = function(self) {
+  return function() {
+    // Set connected to false
+    self.connected = false;
+    // Emit end event
+    self.emit("end", {err: 'connection received Fin packet from [' + self.socketOptions.host + ':' + self.socketOptions.port + ']'}, self);
+  }
+}
+
+var timeoutHandler = function(self) {
+  return function() {
+    // Set connected to false
+    self.connected = false;
+    // Emit timeout event
+    self.emit("timeout", {err: 'connection to [' + self.socketOptions.host + ':' + self.socketOptions.port + '] timed out'}, self);
+  }
+}
+
+var drainHandler = function(self) {
+  return function() {
+  }
+}
+
+var errorHandler = function(self) {
+  return function(err) {
+    self.connection.destroy();
+    // Set connected to false
+    self.connected = false;
+    // Emit error
+    self.emit("error", {err: 'failed to connect to [' + self.socketOptions.host + ':' + self.socketOptions.port + ']'}, self);
+  }
+}
+
+var closeHandler = function(self) {
+  return function(hadError) {
+    // If we have an error during the connection phase
+    if(hadError && !self.connected) {
+      // Set disconnected
+      self.connected = false;
+      // Emit error
+      self.emit("error", {err: 'failed to connect to [' + self.socketOptions.host + ':' + self.socketOptions.port + ']'}, self);
+    } else {
+      // Set disconnected
+      self.connected = false;
+      // Emit close
+      self.emit("close", {err: 'connection closed to [' + self.socketOptions.host + ':' + self.socketOptions.port + ']'}, self);
+    }
+  }
+}
+
+// Some basic defaults
+Connection.DEFAULT_PORT = 27017;
+
+
+
+
+
+
+
diff --git a/node_modules/mongodb/lib/mongodb/connection/connection_pool.js b/node_modules/mongodb/lib/mongodb/connection/connection_pool.js
new file mode 100644
index 0000000..94cf754
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/connection_pool.js
@@ -0,0 +1,294 @@
+var utils = require('./connection_utils'),
+  inherits = require('util').inherits,
+  net = require('net'),
+  timers = require('timers'),
+  EventEmitter = require('events').EventEmitter,
+  inherits = require('util').inherits,
+  MongoReply = require("../responses/mongo_reply").MongoReply,
+  Connection = require("./connection").Connection;
+
+// Set processor, setImmediate if 0.10 otherwise nextTick
+var processor = timers.setImmediate ? timers.setImmediate : process.nextTick;
+processor = process.nextTick
+
+var ConnectionPool = exports.ConnectionPool = function(host, port, poolSize, bson, socketOptions) {
+  if(typeof host !== 'string') {
+    throw new Error("host must be specified [" + host + "]");
+  }
+
+  // Set up event emitter
+  EventEmitter.call(this);
+
+  // Keep all options for the socket in a specific collection allowing the user to specify the
+  // Wished upon socket connection parameters
+  this.socketOptions = typeof socketOptions === 'object' ? socketOptions : {};
+  this.socketOptions.host = host;
+  this.socketOptions.port = port;
+  this.socketOptions.domainSocket = false;
+  this.bson = bson;
+  // PoolSize is always + 1 for special reserved "measurment" socket (like ping, stats etc)
+  this.poolSize = poolSize;
+  this.minPoolSize = Math.floor(this.poolSize / 2) + 1;
+
+  // Check if the host is a socket
+  if(host.match(/^\//)) {
+    this.socketOptions.domainSocket = true;
+  } else if(typeof port === 'string') {
+    try { 
+      port = parseInt(port, 10); 
+    } catch(err) { 
+      new Error("port must be specified or valid integer["  + port + "]"); 
+    }
+  } else if(typeof port !== 'number') {
+    throw new Error("port must be specified ["  + port + "]");
+  }
+
+  // Set default settings for the socket options
+  utils.setIntegerParameter(this.socketOptions, 'timeout', 0);
+  // Delay before writing out the data to the server
+  utils.setBooleanParameter(this.socketOptions, 'noDelay', true);
+  // Delay before writing out the data to the server
+  utils.setIntegerParameter(this.socketOptions, 'keepAlive', 0);
+  // Set the encoding of the data read, default is binary == null
+  utils.setStringParameter(this.socketOptions, 'encoding', null);
+  // Allows you to set a throttling bufferSize if you need to stop overflows
+  utils.setIntegerParameter(this.socketOptions, 'bufferSize', 0);
+
+  // Internal structures
+  this.openConnections = [];
+  // Assign connection id's
+  this.connectionId = 0;
+
+  // Current index for selection of pool connection
+  this.currentConnectionIndex = 0;
+  // The pool state
+  this._poolState = 'disconnected';
+  // timeout control
+  this._timeout = false;
+  // Time to wait between connections for the pool
+  this._timeToWait = 10;
+}
+
+inherits(ConnectionPool, EventEmitter);
+
+ConnectionPool.prototype.setMaxBsonSize = function(maxBsonSize) {
+  if(maxBsonSize == null){
+    maxBsonSize = Connection.DEFAULT_MAX_BSON_SIZE;
+  }
+
+  for(var i = 0; i < this.openConnections.length; i++) {
+    this.openConnections[i].maxBsonSize = maxBsonSize;
+  }
+}
+
+ConnectionPool.prototype.setMaxMessageSizeBytes = function(maxMessageSizeBytes) {
+  if(maxMessageSizeBytes == null){
+    maxMessageSizeBytes = Connection.DEFAULT_MAX_MESSAGE_SIZE;
+  }
+
+  for(var i = 0; i < this.openConnections.length; i++) {
+    this.openConnections[i].maxMessageSizeBytes = maxMessageSizeBytes;
+  }
+}
+
+// Start a function
+var _connect = function(_self) {
+  // return new function() {
+    // Create a new connection instance
+    var connection = new Connection(_self.connectionId++, _self.socketOptions);
+    // Set logger on pool
+    connection.logger = _self.logger;
+    // Connect handler
+    connection.on("connect", function(err, connection) {
+      // Add connection to list of open connections
+      _self.openConnections.push(connection);
+      // If the number of open connections is equal to the poolSize signal ready pool
+      if(_self.openConnections.length === _self.poolSize && _self._poolState !== 'disconnected') {
+        // Set connected
+        _self._poolState = 'connected';
+        // Emit pool ready
+        _self.emit("poolReady");
+      } else if(_self.openConnections.length < _self.poolSize) {
+        // Wait a little bit of time to let the close event happen if the server closes the connection
+        // so we don't leave hanging connections around
+        if(typeof _self._timeToWait == 'number') {
+          setTimeout(function() {
+            // If we are still connecting (no close events fired in between start another connection)
+            if(_self._poolState == 'connecting') {
+              _connect(_self);
+            }
+          }, _self._timeToWait);
+        } else {
+          processor(function() {
+            // If we are still connecting (no close events fired in between start another connection)
+            if(_self._poolState == 'connecting') {
+              _connect(_self);
+            }
+          });
+        }
+      }
+    });
+
+    var numberOfErrors = 0
+
+    // Error handler
+    connection.on("error", function(err, connection, error_options) {
+      numberOfErrors++;
+      // If we are already disconnected ignore the event
+      if(_self._poolState != 'disconnected' && _self.listeners("error").length > 0) {
+        _self.emit("error", err, connection, error_options);
+      }
+
+      // Close the connection
+      connection.close();
+      // Set pool as disconnected
+      _self._poolState = 'disconnected';
+      // Stop the pool
+      _self.stop();
+    });
+
+    // Close handler
+    connection.on("close", function() {
+      // If we are already disconnected ignore the event
+      if(_self._poolState !== 'disconnected' && _self.listeners("close").length > 0) {
+        _self.emit("close");
+      }
+
+      // Set disconnected
+      _self._poolState = 'disconnected';
+      // Stop
+      _self.stop();
+    });
+
+    // Timeout handler
+    connection.on("timeout", function(err, connection) {
+      // If we are already disconnected ignore the event
+      if(_self._poolState !== 'disconnected' && _self.listeners("timeout").length > 0) {
+        _self.emit("timeout", err);
+      }
+
+      // Close the connection
+      connection.close();
+      // Set disconnected
+      _self._poolState = 'disconnected';
+      _self.stop();
+    });
+
+    // Parse error, needs a complete shutdown of the pool
+    connection.on("parseError", function() {
+      // If we are already disconnected ignore the event
+      if(_self._poolState !== 'disconnected' && _self.listeners("parseError").length > 0) {
+        _self.emit("parseError", new Error("parseError occured"));
+      }
+
+      // Set disconnected
+      _self._poolState = 'disconnected';
+      _self.stop();
+    });
+
+    connection.on("message", function(message) {
+      _self.emit("message", message);
+    });
+
+    // Start connection in the next tick
+    connection.start();
+  // }();
+}
+
+
+// Start method, will throw error if no listeners are available
+// Pass in an instance of the listener that contains the api for
+// finding callbacks for a given message etc.
+ConnectionPool.prototype.start = function() {
+  var markerDate = new Date().getTime();
+  var self = this;
+
+  if(this.listeners("poolReady").length == 0) {
+    throw "pool must have at least one listener ready that responds to the [poolReady] event";
+  }
+
+  // Set pool state to connecting
+  this._poolState = 'connecting';
+  this._timeout = false;
+
+  _connect(self);
+}
+
+// Restart a connection pool (on a close the pool might be in a wrong state)
+ConnectionPool.prototype.restart = function() {
+  // Close all connections
+  this.stop(false);
+  // Now restart the pool
+  this.start();
+}
+
+// Stop the connections in the pool
+ConnectionPool.prototype.stop = function(removeListeners) {
+  removeListeners = removeListeners == null ? true : removeListeners;
+  // Set disconnected
+  this._poolState = 'disconnected';
+
+  // Clear all listeners if specified
+  if(removeListeners) {
+    this.removeAllEventListeners();
+  }
+
+  // Close all connections
+  for(var i = 0; i < this.openConnections.length; i++) {
+    this.openConnections[i].close();
+  }
+
+  // Clean up
+  this.openConnections = [];
+}
+
+// Check the status of the connection
+ConnectionPool.prototype.isConnected = function() {
+  // return this._poolState === 'connected';
+  return this.openConnections.length > 0 && this.openConnections[0].isConnected();
+}
+
+// Checkout a connection from the pool for usage, or grab a specific pool instance
+ConnectionPool.prototype.checkoutConnection = function(id) {
+  var index = (this.currentConnectionIndex++ % (this.openConnections.length));
+  var connection = this.openConnections[index];
+  return connection;
+}
+
+ConnectionPool.prototype.getAllConnections = function() {
+  return this.openConnections;
+}
+
+// Remove all non-needed event listeners
+ConnectionPool.prototype.removeAllEventListeners = function() {
+  this.removeAllListeners("close");
+  this.removeAllListeners("error");
+  this.removeAllListeners("timeout");
+  this.removeAllListeners("connect");
+  this.removeAllListeners("end");
+  this.removeAllListeners("parseError");
+  this.removeAllListeners("message");
+  this.removeAllListeners("poolReady");
+}
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/node_modules/mongodb/lib/mongodb/connection/connection_utils.js b/node_modules/mongodb/lib/mongodb/connection/connection_utils.js
new file mode 100644
index 0000000..5910924
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/connection_utils.js
@@ -0,0 +1,23 @@
+exports.setIntegerParameter = function(object, field, defaultValue) {
+  if(object[field] == null) {
+    object[field] = defaultValue;
+  } else if(typeof object[field] !== "number" && object[field] !== parseInt(object[field], 10)) {
+    throw "object field [" + field + "] must be a numeric integer value, attempted to set to [" + object[field] + "] type of [" + typeof object[field] + "]";
+  }
+}
+
+exports.setBooleanParameter = function(object, field, defaultValue) {
+  if(object[field] == null) {
+    object[field] = defaultValue;
+  } else if(typeof object[field] !== "boolean") {
+    throw "object field [" + field + "] must be a boolean value, attempted to set to [" + object[field] + "] type of [" + typeof object[field] + "]";
+  }
+}
+
+exports.setStringParameter = function(object, field, defaultValue) {
+  if(object[field] == null) {
+    object[field] = defaultValue;
+  } else if(typeof object[field] !== "string") {
+    throw "object field [" + field + "] must be a string value, attempted to set to [" + object[field] + "] type of [" + typeof object[field] + "]";
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/connection/mongos.js b/node_modules/mongodb/lib/mongodb/connection/mongos.js
new file mode 100644
index 0000000..61a5bb1
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/mongos.js
@@ -0,0 +1,470 @@
+var ReadPreference = require('./read_preference').ReadPreference
+  , Base = require('./base').Base
+  , Server = require('./server').Server
+  , inherits = require('util').inherits;
+
+/**
+ * Mongos constructor provides a connection to a mongos proxy including failover to additional servers
+ *
+ * Options
+ *  - **socketOptions** {Object, default:null}, an object containing socket options to use (noDelay:(boolean), keepAlive:(number), connectTimeoutMS:(number), socketTimeoutMS:(number))
+ *  - **ha** {Boolean, default:true}, turn on high availability, attempts to reconnect to down proxies
+ *  - **haInterval** {Number, default:2000}, time between each replicaset status check.
+ *
+ * @class Represents a Mongos connection with failover to backup proxies
+ * @param {Array} list of mongos server objects
+ * @param {Object} [options] additional options for the mongos connection
+ */
+var Mongos = function Mongos(servers, options) {
+  // Set up basic
+  if(!(this instanceof Mongos))
+    return new Mongos(servers, options);
+
+  // Set up event emitter
+  Base.call(this);
+
+  // Throw error on wrong setup
+  if(servers == null || !Array.isArray(servers) || servers.length == 0)
+    throw new Error("At least one mongos proxy must be in the array");
+
+  // Ensure we have at least an empty options object
+  this.options = options == null ? {} : options;
+  // Set default connection pool options
+  this.socketOptions = this.options.socketOptions != null ? this.options.socketOptions : {};
+  // Enabled ha
+  this.haEnabled = this.options['ha'] == null ? true : this.options['ha'];
+  this._haInProgress = false;
+  // How often are we checking for new servers in the replicaset
+  this.mongosStatusCheckInterval = this.options['haInterval'] == null ? 1000 : this.options['haInterval'];
+  // Save all the server connections
+  this.servers = servers;
+  // Servers we need to attempt reconnect with
+  this.downServers = [];
+  // Emit open setup
+  this.emitOpen = this.options.emitOpen || true;
+  // Just contains the current lowest ping time and server
+  this.lowestPingTimeServer = null;
+  this.lowestPingTime = 0;
+  // Connection timeout
+  this._connectTimeoutMS = this.socketOptions.connectTimeoutMS
+    ? this.socketOptions.connectTimeoutMS
+    : 1000;
+
+  // Add options to servers
+  for(var i = 0; i < this.servers.length; i++) {
+    var server = this.servers[i];
+    server._callBackStore = this._callBackStore;
+    server.auto_reconnect = false;
+    // Default empty socket options object
+    var socketOptions = {host: server.host, port: server.port};
+    // If a socket option object exists clone it
+    if(this.socketOptions != null) {
+      var keys = Object.keys(this.socketOptions);
+      for(var k = 0; k < keys.length;k++) socketOptions[keys[i]] = this.socketOptions[keys[i]];
+    }
+
+    // Set socket options
+    server.socketOptions = socketOptions;
+  }
+}
+
+/**
+ * @ignore
+ */
+inherits(Mongos, Base);
+
+/**
+ * @ignore
+ */
+Mongos.prototype.isMongos = function() {
+  return true;
+}
+
+/**
+ * @ignore
+ */
+Mongos.prototype.connect = function(db, options, callback) {
+  if('function' === typeof options) callback = options, options = {};
+  if(options == null) options = {};
+  if(!('function' === typeof callback)) callback = null;
+  var self = this;
+
+  // Keep reference to parent
+  this.db = db;
+  // Set server state to connecting
+  this._serverState = 'connecting';
+  // Number of total servers that need to initialized (known servers)
+  this._numberOfServersLeftToInitialize = this.servers.length;  
+  // Connect handler
+  var connectHandler = function(_server) {
+    return function(err, result) {
+      self._numberOfServersLeftToInitialize = self._numberOfServersLeftToInitialize - 1;
+
+      if(self._numberOfServersLeftToInitialize == 0) {
+        // Start ha function if it exists
+        if(self.haEnabled) {
+          // Setup the ha process
+          if(self._replicasetTimeoutId != null) clearInterval(self._replicasetTimeoutId);
+          self._replicasetTimeoutId = setInterval(self.mongosCheckFunction, self.mongosStatusCheckInterval);
+        }
+
+        // Set the mongos to connected
+        self._serverState = "connected";
+
+        // Emit the open event
+        if(self.emitOpen)
+          self.db.emit("open", null, self.db);
+        
+        // Callback
+        callback(null, self.db);
+      }
+    }
+  };
+
+  // Error handler
+  var errorOrCloseHandler = function(_server) {
+    return function(err, result) {
+      var validServers = [];
+      // Execute all the callbacks with errors
+      self.__executeAllCallbacksWithError(err);
+      // Check if we have the server
+      var found = false;
+      // Save the down server if it does not already exists
+      for(var i = 0; i < self.downServers.length; i++) {
+        if(self.downServers[i].host == _server.host && self.downServers[i].port == _server.port) {
+          found = true;
+          break;
+        }        
+      }
+
+      if(!found)
+        self.downServers.push(_server);
+
+      // Remove the current server from the list
+      for(var i = 0; i < self.servers.length; i++) {
+        if(!(self.servers[i].host == _server.host && self.servers[i].port == _server.port) && self.servers[i].isConnected()) {
+          validServers.push(self.servers[i]);
+        }
+      }
+
+      // Set current list of servers
+      self.servers = validServers;
+      
+      // Emit close across all the attached db instances
+      if(self.servers.length == 0) {
+        self._dbStore.emit("close", new Error("mongos disconnected, no valid proxies contactable over tcp"), null, true);
+      }
+    }
+  }
+
+  // Mongo function
+  this.mongosCheckFunction = function() {
+    if(self._haInProgress) return;
+    // If all servers are down we are done
+    if(self.servers.length == 0) return;
+
+    // Check that at least one server is available
+    var alldown = true;
+    for(var i = 0; i < self.servers.length; i++) {
+      if(self.servers[i].isConnected()) {
+        alldown = false;
+        break;
+      }
+    }
+
+    // All servers are down
+    if(alldown) return;
+
+    // Set as not waiting for check event 
+    self._haInProgress = true;
+    // Check downed servers
+    if(self.downServers.length > 0) {
+      var numberOfServersLeft = self.downServers.length;
+
+      // Iterate over all the downed servers
+      for(var i = 0; i < self.downServers.length; i++) {
+        // Pop a downed server      
+        var downServer = self.downServers.pop();
+
+        // Set up the connection options for a Mongos
+        var options = {
+          auto_reconnect: false,
+          returnIsMasterResults: true,
+          slaveOk: true,
+          poolSize: downServer.poolSize,
+          socketOptions: { 
+            connectTimeoutMS: self._connectTimeoutMS,
+            socketTimeoutMS: self._socketTimeoutMS
+          }          
+        }
+
+        // Create a new server object
+        var newServer = new Server(downServer.host, downServer.port, options);
+        // Setup the connection function
+        var connectFunction = function(_db, _server, _options, _callback)  {
+          return function() {
+            // Attempt to connect
+            _server.connect(_db, _options, function(err, result) {
+              numberOfServersLeft = numberOfServersLeft - 1;
+
+              if(err) {
+                return _callback(err, _server);
+              } else {
+                // Set the new server settings
+                _server._callBackStore = self._callBackStore;
+                
+                // Add server event handlers
+                _server.on("close", errorOrCloseHandler(_server));
+                _server.on("timeout", errorOrCloseHandler(_server));
+                _server.on("error", errorOrCloseHandler(_server));
+                
+                // Get a read connection
+                var _connection = _server.checkoutReader();
+                // Get the start time
+                var startTime = new Date().getTime();
+                
+                // Execute ping command to mark each server with the expected times
+                self.db.command({ping:1}
+                  , {failFast:true, connection:_connection}, function(err, result) {
+                  // Get the start time
+                  var endTime = new Date().getTime();
+                  // Mark the server with the ping time
+                  _server.runtimeStats['pingMs'] = endTime - startTime;
+                  // Sort the servers on runtime so the first server always is the closest one
+                  self.servers.sort(function(a, b) {
+                    return a.runtimeStats['pingMs'] > b.runtimeStats['pingMs'];
+                  });
+
+                  // Callback
+                  return _callback(null, _server);
+                });
+              }
+            });
+          }
+        } 
+
+        // Attempt to connect to the database
+        connectFunction(self.db, newServer, options, function(err, _server) {
+          // If we have an error
+          if(err) {
+            self.downServers.push(_server);
+          }
+
+          // Connection function
+          var connectionFunction = function(_auth, _connection, _callback) {
+            var pending = _auth.length();
+
+            for(var j = 0; j < pending; j++) {
+              // Get the auth object
+              var _auth = _auth.get(j);
+              // Unpack the parameter
+              var username = _auth.username;
+              var password = _auth.password;
+              var options = { 
+                  authMechanism: _auth.authMechanism
+                , authSource: _auth.authdb
+                , connection: _connection 
+              };
+
+              // Hold any error
+              var _error = null;
+              // Authenticate against the credentials
+              self.db.authenticate(username, password, options, function(err, result) {
+                _error = err != null ? err : _error;
+                // Adjust the pending authentication
+                pending = pending - 1;
+                // Finished up
+                if(pending == 0) _callback(_error ? _error : null, _error ? false : true);
+              });
+            }
+          }
+
+          // Run auths against the connections
+          if(self.auth.length() > 0) {
+            var connections = _server.allRawConnections();
+            var pendingAuthConn = connections.length;
+
+            // No connections we are done
+            if(connections.length == 0) {
+              // Set ha done
+              if(numberOfServersLeft == 0) {
+                self._haInProgress = false;
+              }              
+            }
+
+            // Final error object
+            var finalError = null;
+            // Go over all the connections
+            for(var j = 0; j < connections.length; j++) {
+              
+              // Execute against all the connections
+              connectionFunction(self.auth, connections[j], function(err, result) {
+                // Pending authentication
+                pendingAuthConn = pendingAuthConn - 1 ;
+
+                // Save error if any
+                finalError = err ? err : finalError;
+
+                // If we are done let's finish up
+                if(pendingAuthConn == 0) {
+                  // Set ha done
+                  if(numberOfServersLeft == 0) {
+                    self._haInProgress = false;
+                  }
+
+                  if(finalError) {
+                    return self.downServers.push(_server);
+                  }
+
+                  // Push to list of valid server
+                  self.servers.push(_server);
+                }
+              });
+            }
+          } else {
+            self.servers.push(_server);            
+            // Set ha done
+            if(numberOfServersLeft == 0) {
+              self._haInProgress = false;
+            }
+          }
+        })();
+      }
+    } else {
+      self._haInProgress = false;
+    }
+  }
+
+  // Connect all the server instances
+  for(var i = 0; i < this.servers.length; i++) {
+    // Get the connection
+    var server = this.servers[i];
+    server.mongosInstance = this;
+    // Add server event handlers
+    server.on("close", errorOrCloseHandler(server));
+    server.on("timeout", errorOrCloseHandler(server));
+    server.on("error", errorOrCloseHandler(server));
+    
+    // Configuration
+    var options = {
+      slaveOk: true,
+      poolSize: server.poolSize,
+      socketOptions: { connectTimeoutMS: self._connectTimeoutMS },
+      returnIsMasterResults: true
+    }        
+
+    // Connect the instance
+    server.connect(self.db, options, connectHandler(server));
+  }
+}
+
+/**
+ * @ignore
+ * Just return the currently picked active connection
+ */
+Mongos.prototype.allServerInstances = function() {
+  return this.servers;
+}
+
+/**
+ * Always ourselves
+ * @ignore
+ */
+Mongos.prototype.setReadPreference = function() {}
+
+/**
+ * @ignore
+ */
+Mongos.prototype.allRawConnections = function() {
+  // Neeed to build a complete list of all raw connections, start with master server
+  var allConnections = [];
+  // Add all connections
+  for(var i = 0; i < this.servers.length; i++) {
+    allConnections = allConnections.concat(this.servers[i].allRawConnections());
+  }
+
+  // Return all the conections
+  return allConnections;
+}
+
+/**
+ * @ignore
+ */
+Mongos.prototype.isConnected = function() {
+  return this._serverState == "connected";
+}
+
+/**
+ * @ignore
+ */
+Mongos.prototype.canWrite = Mongos.prototype.isConnected;
+
+/**
+ * @ignore
+ */
+Mongos.prototype.canRead = Mongos.prototype.isConnected;
+
+/**
+ * @ignore
+ */
+Mongos.prototype.isDestroyed = function() {
+  return this._serverState == 'destroyed';
+}
+
+/**
+ * @ignore
+ */
+Mongos.prototype.checkoutWriter = function() {
+  if(this.servers.length == 0) return null;
+  return this.servers[0].checkoutWriter();
+}
+
+/**
+ * @ignore
+ */
+Mongos.prototype.checkoutReader = function(read) {
+  // If we have a read preference object unpack it
+  if(read != null && typeof read == 'object' && read['_type'] == 'ReadPreference') {
+    // Validate if the object is using a valid mode
+    if(!read.isValid()) throw new Error("Illegal readPreference mode specified, " + read.mode);
+  } else if(!ReadPreference.isValid(read)) {
+    throw new Error("Illegal readPreference mode specified, " + read);
+  }
+
+  if(this.servers.length == 0) return null;
+  return this.servers[0].checkoutWriter();
+}
+
+/**
+ * @ignore
+ */
+Mongos.prototype.close = function(callback) {
+  var self = this;
+  // Set server status as disconnected
+  this._serverState = 'destroyed';
+  // Number of connections to close
+  var numberOfConnectionsToClose = self.servers.length;
+  // If we have a ha process running kill it
+  if(self._replicasetTimeoutId != null) clearInterval(self._replicasetTimeoutId);
+  self._replicasetTimeoutId = null;
+  // Close all proxy connections
+  for(var i = 0; i < self.servers.length; i++) {
+    self.servers[i].close(function(err, result) {
+      numberOfConnectionsToClose = numberOfConnectionsToClose - 1;
+      // Callback if we have one defined
+      if(numberOfConnectionsToClose == 0 && typeof callback == 'function') {
+        callback(null);
+      }
+    });
+  }
+}
+
+/**
+ * @ignore
+ * Return the used state
+ */
+Mongos.prototype._isUsed = function() {
+  return this._used;
+}
+
+exports.Mongos = Mongos;
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/connection/read_preference.js b/node_modules/mongodb/lib/mongodb/connection/read_preference.js
new file mode 100644
index 0000000..6845171
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/read_preference.js
@@ -0,0 +1,67 @@
+/**
+ * A class representation of the Read Preference.
+ *
+ * Read Preferences
+ *  - **ReadPreference.PRIMARY**, Read from primary only. All operations produce an error (throw an exception where applicable) if primary is unavailable. Cannot be combined with tags (This is the default.).
+ *  - **ReadPreference.PRIMARY_PREFERRED**, Read from primary if available, otherwise a secondary.
+ *  - **ReadPreference.SECONDARY**, Read from secondary if available, otherwise error.
+ *  - **ReadPreference.SECONDARY_PREFERRED**, Read from a secondary if available, otherwise read from the primary.
+ *  - **ReadPreference.NEAREST**, All modes read from among the nearest candidates, but unlike other modes, NEAREST will include both the primary and all secondaries in the random selection.
+ *
+ * @class Represents a Read Preference.
+ * @param {String} the read preference type
+ * @param {Object} tags
+ * @return {ReadPreference}
+ */
+var ReadPreference = function(mode, tags) {
+  if(!(this instanceof ReadPreference))
+    return new ReadPreference(mode, tags);
+  this._type = 'ReadPreference';
+  this.mode = mode;
+  this.tags = tags;
+}
+
+/**
+ * @ignore
+ */
+ReadPreference.isValid = function(_mode) {
+  return (_mode == ReadPreference.PRIMARY || _mode == ReadPreference.PRIMARY_PREFERRED
+    || _mode == ReadPreference.SECONDARY || _mode == ReadPreference.SECONDARY_PREFERRED
+    || _mode == ReadPreference.NEAREST
+    || _mode == true || _mode == false);
+}
+
+/**
+ * @ignore
+ */
+ReadPreference.prototype.isValid = function(mode) {
+  var _mode = typeof mode == 'string' ? mode : this.mode;
+  return ReadPreference.isValid(_mode);
+}
+
+/**
+ * @ignore
+ */
+ReadPreference.prototype.toObject = function() {
+  var object = {mode:this.mode};
+
+  if(this.tags != null) {
+    object['tags'] = this.tags;
+  }
+
+  return object;
+}
+
+/**
+ * @ignore
+ */
+ReadPreference.PRIMARY = 'primary';
+ReadPreference.PRIMARY_PREFERRED = 'primaryPreferred';
+ReadPreference.SECONDARY = 'secondary';
+ReadPreference.SECONDARY_PREFERRED = 'secondaryPreferred';
+ReadPreference.NEAREST = 'nearest'
+
+/**
+ * @ignore
+ */
+exports.ReadPreference  = ReadPreference;
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/connection/repl_set/ha.js b/node_modules/mongodb/lib/mongodb/connection/repl_set/ha.js
new file mode 100644
index 0000000..f2b3717
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/repl_set/ha.js
@@ -0,0 +1,393 @@
+var DbCommand = require('../../commands/db_command').DbCommand
+  , format = require('util').format;
+
+var HighAvailabilityProcess = function(replset, options) {  
+  this.replset = replset;
+  this.options = options;
+  this.server = null;
+  this.state = HighAvailabilityProcess.INIT;
+  this.selectedIndex = 0;
+}
+
+HighAvailabilityProcess.INIT = 'init';
+HighAvailabilityProcess.RUNNING = 'running';
+HighAvailabilityProcess.STOPPED = 'stopped';
+
+HighAvailabilityProcess.prototype.start = function() {  
+  var self = this;
+  if(this.replset._state 
+    && Object.keys(this.replset._state.addresses).length == 0) {
+    if(this.server) this.server.close();
+    this.state = HighAvailabilityProcess.STOPPED;
+    return;      
+  }
+
+  if(this.server) this.server.close();
+  // Start the running
+  this._haProcessInProcess = false;
+  this.state = HighAvailabilityProcess.RUNNING;
+  
+  // Get all possible reader servers
+  var candidate_servers = this.replset._state.getAllReadServers();
+  if(candidate_servers.length == 0) {
+    return;
+  }
+
+  // Select a candidate server for the connection
+  var server = candidate_servers[this.selectedIndex % candidate_servers.length];
+  this.selectedIndex = this.selectedIndex + 1;
+  
+  // Unpack connection options
+  var connectTimeoutMS = self.options.connectTimeoutMS || 10000;
+  var socketTimeoutMS = self.options.socketTimeoutMS || 30000;
+
+  // Just ensure we don't have a full cycle dependency
+  var Db = require('../../db').Db
+  var Server = require('../server').Server;
+
+  // Set up a new server instance
+  var newServer = new Server(server.host, server.port, {
+      auto_reconnect: false
+    , returnIsMasterResults: true
+    , poolSize: 1
+    , socketOptions: { 
+        connectTimeoutMS: connectTimeoutMS,
+        socketTimeoutMS: socketTimeoutMS,
+        keepAlive: 100
+      }
+    , ssl: this.options.ssl
+    , sslValidate: this.options.sslValidate
+    , sslCA: this.options.sslCA
+    , sslCert: this.options.sslCert
+    , sslKey: this.options.sslKey
+    , sslPass: this.options.sslPass
+  });
+
+  // Create new dummy db for app
+  self.db = new Db('local', newServer, {w:1});
+
+  // Set up the event listeners
+  newServer.once("error", _handle(this, newServer));
+  newServer.once("close", _handle(this, newServer));
+  newServer.once("timeout", _handle(this, newServer));
+  newServer.name = format("%s:%s", server.host, server.port);
+
+  // Let's attempt a connection over here
+  newServer.connect(self.db, function(err, result, _server) {
+    if(self.state == HighAvailabilityProcess.STOPPED) {
+      _server.close();
+    }
+
+    if(err) {
+      // Close the server
+      _server.close();
+      // Check if we can even do HA (is there anything running)
+      if(Object.keys(self.replset._state.addresses).length == 0) {
+        return;
+      }
+      
+      // Let's boot the ha timeout settings
+      setTimeout(function() {
+        self.start();
+      }, self.options.haInterval);
+    } else {
+      self.server = _server;
+      // Let's boot the ha timeout settings
+      setTimeout(_timeoutHandle(self), self.options.haInterval);
+    }
+  });
+}
+
+HighAvailabilityProcess.prototype.stop = function() {
+  this.state = HighAvailabilityProcess.STOPPED;
+  if(this.server) this.server.close();
+}
+
+var _timeoutHandle = function(self) {
+  return function() {
+    if(self.state == HighAvailabilityProcess.STOPPED) {
+      // Stop all server instances
+      for(var name in self.replset._state.addresses) {
+        self.replset._state.addresses[name].close();
+        delete self.replset._state.addresses[name];
+      }
+
+      // Finished pinging
+      return;
+    }
+
+    // If the server is connected
+    if(self.server.isConnected() && !self._haProcessInProcess) {
+      // Start HA process
+      self._haProcessInProcess = true;
+      // Execute is master command
+      self.db._executeQueryCommand(DbCommand.createIsMasterCommand(self.db), 
+          {failFast:true, connection: self.server.checkoutReader()}
+        , function(err, res) {
+          if(err) {
+            self.server.close();
+            return setTimeout(_timeoutHandle(self), self.options.haInterval);
+          }
+
+          // Master document
+          var master = res.documents[0];
+          var hosts = master.hosts || [];
+          var reconnect_servers = [];
+          var state = self.replset._state;
+
+          // For all the hosts let's check that we have connections
+          for(var i = 0; i < hosts.length; i++) {
+            var host = hosts[i];
+
+            // Check if we need to reconnect to a server
+            if(state.addresses[host] == null) {
+              reconnect_servers.push(host);
+            } else if(state.addresses[host] && !state.addresses[host].isConnected()) {
+              state.addresses[host].close();
+              reconnect_servers.push(host);              
+            }
+
+            if((master.primary && state.master == null)
+              || (master.primary && state.master.name != master.primary)) {
+
+              // Locate the primary and set it
+              if(state.addresses[master.primary]) {
+                if(state.master) state.master.close();
+                delete state.secondaries[master.primary];
+                state.master = state.addresses[master.primary];
+              }
+              
+              // Set up the changes
+              if(state.master != null && state.master.isMasterDoc != null) {
+                state.master.isMasterDoc.ismaster = true;
+                state.master.isMasterDoc.secondary = false;                
+              } else if(state.master != null) {
+                state.master.isMasterDoc = master;
+                state.master.isMasterDoc.ismaster = true;
+                state.master.isMasterDoc.secondary = false;                
+              }
+
+              // Execute any waiting commands (queries or writes)
+              self.replset._commandsStore.execute_queries();
+              self.replset._commandsStore.execute_writes();   
+            }
+          }
+
+          // Let's reconnect to any server needed
+          if(reconnect_servers.length > 0) {
+            _reconnect_servers(self, reconnect_servers);  
+          } else {
+            self._haProcessInProcess = false
+            return setTimeout(_timeoutHandle(self), self.options.haInterval);
+          }
+      });
+    } else if(!self.server.isConnected()) {
+      setTimeout(function() {
+        return self.start();
+      }, self.options.haInterval);
+    } else {
+      setTimeout(_timeoutHandle(self), self.options.haInterval);
+    }
+  }
+}
+
+var _reconnect_servers = function(self, reconnect_servers) {
+  if(reconnect_servers.length == 0) {
+    self._haProcessInProcess = false    
+    return setTimeout(_timeoutHandle(self), self.options.haInterval);
+  }
+
+  // Unpack connection options
+  var connectTimeoutMS = self.options.connectTimeoutMS || 10000;
+  var socketTimeoutMS = self.options.socketTimeoutMS || 30000;
+
+  // Server class
+  var Db = require('../../db').Db
+  var Server = require('../server').Server;
+  // Get the host
+  var host = reconnect_servers.shift();
+  // Split it up
+  var _host = host.split(":")[0];
+  var _port = parseInt(host.split(":")[1], 10);
+
+  // Set up a new server instance
+  var newServer = new Server(_host, _port, {
+      auto_reconnect: false
+    , returnIsMasterResults: true
+    , poolSize: self.options.poolSize
+    , socketOptions: { 
+        connectTimeoutMS: connectTimeoutMS,
+        socketTimeoutMS: socketTimeoutMS
+      }
+    , ssl: self.options.ssl
+    , sslValidate: self.options.sslValidate
+    , sslCA: self.options.sslCA
+    , sslCert: self.options.sslCert
+    , sslKey: self.options.sslKey
+    , sslPass: self.options.sslPass
+  });
+
+  // Create new dummy db for app
+  var db = new Db('local', newServer, {w:1});
+  var state = self.replset._state;
+
+  // Set up the event listeners
+  newServer.once("error", _repl_set_handler("error", self.replset, newServer));
+  newServer.once("close", _repl_set_handler("close", self.replset, newServer));
+  newServer.once("timeout", _repl_set_handler("timeout", self.replset, newServer));
+
+  // Set shared state
+  newServer.name = host;
+  newServer._callBackStore = self.replset._callBackStore;
+  newServer.replicasetInstance = self.replset;
+  newServer.enableRecordQueryStats(self.replset.recordQueryStats);
+
+  // Let's attempt a connection over here
+  newServer.connect(db, function(err, result, _server) {
+    if(self.state == HighAvailabilityProcess.STOPPED) {
+      _server.close();
+    }
+
+    // If we connected let's check what kind of server we have
+    if(!err) {
+      _apply_auths(self, db, _server, function(err, result) {
+        if(err) {
+          _server.close();
+          // Process the next server
+          return setTimeout(function() {
+            _reconnect_servers(self, reconnect_servers);  
+          }, self.options.haInterval);                      
+        }
+        var doc = _server.isMasterDoc;    
+        // Fire error on any unknown callbacks for this server
+        self.replset.__executeAllServerSpecificErrorCallbacks(_server.socketOptions.host, _server.socketOptions.port, err);    
+
+        if(doc.ismaster) {
+          if(state.secondaries[doc.me]) {
+            delete state.secondaries[doc.me];
+          }
+
+          // Override any server in list of addresses
+          state.addresses[doc.me] = _server;
+          // Set server as master
+          state.master = _server;     
+          // Execute any waiting writes
+          self.replset._commandsStore.execute_writes();   
+        } else if(doc.secondary) {
+          state.secondaries[doc.me] = _server;
+          // Override any server in list of addresses
+          state.addresses[doc.me] = _server;
+          // Execute any waiting reads
+          self.replset._commandsStore.execute_queries();   
+        } else {
+          _server.close();
+        }
+
+        // Set any tags on the instance server
+        _server.name = doc.me;
+        _server.tags = doc.tags;
+        // Process the next server
+        setTimeout(function() {
+          _reconnect_servers(self, reconnect_servers);  
+        }, self.options.haInterval);            
+      });
+    } else {
+      _server.close();
+      self.replset.__executeAllServerSpecificErrorCallbacks(_server.socketOptions.host, _server.socketOptions.port, err);    
+
+      setTimeout(function() {
+        _reconnect_servers(self, reconnect_servers);  
+      }, self.options.haInterval);            
+    }
+  });
+}
+
+var _apply_auths = function(self, _db, _server, _callback) {
+  if(self.replset.auth.length() == 0) return _callback(null);
+  // Apply any authentication needed
+  if(self.replset.auth.length() > 0) {
+    var pending = self.replset.auth.length();
+    var connections = _server.allRawConnections();
+    var pendingAuthConn = connections.length;
+
+    // Connection function
+    var connectionFunction = function(_auth, _connection, __callback) {
+      var pending = _auth.length();
+
+      for(var j = 0; j < pending; j++) {
+        // Get the auth object
+        var _auth = _auth.get(j);
+        // Unpack the parameter
+        var username = _auth.username;
+        var password = _auth.password;
+        var options = { 
+            authMechanism: _auth.authMechanism
+          , authSource: _auth.authdb
+          , connection: _connection 
+        };
+
+        // Hold any error
+        var _error = null;
+        
+        // Authenticate against the credentials
+        _db.authenticate(username, password, options, function(err, result) {
+          _error = err != null ? err : _error;
+          // Adjust the pending authentication
+          pending = pending - 1;
+          // Finished up
+          if(pending == 0) __callback(_error ? _error : null, _error ? false : true);
+        });
+      }
+    }
+
+    // Final error object
+    var finalError = null;
+    // Iterate over all the connections
+    for(var i = 0; i < connections.length; i++) {
+      connectionFunction(self.replset.auth, connections[i], function(err, result) {
+        // Pending authentication
+        pendingAuthConn = pendingAuthConn - 1 ;
+
+        // Save error if any
+        finalError = err ? err : finalError;
+
+        // If we are done let's finish up
+        if(pendingAuthConn == 0) {
+          _callback(null);
+        }
+      });
+    }
+  }
+}
+
+var _handle = function(self, server) {
+  return function(err) {
+    server.close();    
+  }
+}
+
+var _repl_set_handler = function(event, self, server) {
+  var ReplSet = require('./repl_set').ReplSet;
+
+  return function(err, doc) {
+    server.close();
+
+    // The event happened to a primary
+    // Remove it from play
+    if(self._state.isPrimary(server)) {
+      self._state.master == null;
+      self._serverState = ReplSet.REPLSET_READ_ONLY;
+    } else if(self._state.isSecondary(server)) {
+      delete self._state.secondaries[server.name];
+    }
+
+    // Unpack variables
+    var host = server.socketOptions.host;
+    var port = server.socketOptions.port;
+
+    // Fire error on any unknown callbacks
+    self.__executeAllServerSpecificErrorCallbacks(host, port, err);    
+  }
+}
+
+exports.HighAvailabilityProcess = HighAvailabilityProcess;
diff --git a/node_modules/mongodb/lib/mongodb/connection/repl_set/options.js b/node_modules/mongodb/lib/mongodb/connection/repl_set/options.js
new file mode 100644
index 0000000..a5658e3
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/repl_set/options.js
@@ -0,0 +1,126 @@
+var PingStrategy = require('./strategies/ping_strategy').PingStrategy
+  , StatisticsStrategy = require('./strategies/statistics_strategy').StatisticsStrategy
+  , ReadPreference = require('../read_preference').ReadPreference;
+
+var Options = function(options) {
+  options = options || {};
+  this._options = options;
+  this.ha = options.ha || true;
+  this.haInterval = options.haInterval || 2000;
+  this.reconnectWait = options.reconnectWait || 1000;
+  this.retries = options.retries || 30;
+  this.rs_name = options.rs_name;
+  this.socketOptions = options.socketOptions || {};
+  this.readPreference = options.readPreference;
+  this.readSecondary = options.read_secondary;
+  this.poolSize = options.poolSize == null ? 5 : options.poolSize;
+  this.strategy = options.strategy || 'ping';
+  this.secondaryAcceptableLatencyMS = options.secondaryAcceptableLatencyMS || 15;
+  this.connectArbiter = options.connectArbiter || false;
+  this.connectWithNoPrimary = options.connectWithNoPrimary || false;
+  this.logger = options.logger;
+  this.ssl = options.ssl || false;
+  this.sslValidate = options.sslValidate || false;
+  this.sslCA = options.sslCA;
+  this.sslCert = options.sslCert;
+  this.sslKey = options.sslKey;
+  this.sslPass = options.sslPass;
+  this.emitOpen = options.emitOpen || true;
+}
+
+Options.prototype.init = function() {
+  if(this.sslValidate && (!Array.isArray(this.sslCA) || this.sslCA.length == 0)) {
+    throw new Error("The driver expects an Array of CA certificates in the sslCA parameter when enabling sslValidate");
+  }  
+
+  // Make sure strategy is one of the two allowed
+  if(this.strategy != null && (this.strategy != 'ping' && this.strategy != 'statistical' && this.strategy != 'none')) 
+      throw new Error("Only ping or statistical strategies allowed");    
+  
+  if(this.strategy == null) this.strategy = 'ping';
+  
+  // Set logger if strategy exists
+  if(this.strategyInstance) this.strategyInstance.logger = this.logger;
+
+  // Unpack read Preference
+  var readPreference = this.readPreference;
+  // Validate correctness of Read preferences
+  if(readPreference != null) {
+    if(readPreference != ReadPreference.PRIMARY && readPreference != ReadPreference.PRIMARY_PREFERRED
+      && readPreference != ReadPreference.SECONDARY && readPreference != ReadPreference.SECONDARY_PREFERRED
+      && readPreference != ReadPreference.NEAREST && typeof readPreference != 'object' && readPreference['_type'] != 'ReadPreference') {
+      throw new Error("Illegal readPreference mode specified, " + readPreference);
+    }
+
+    this.readPreference = readPreference;
+  } else {
+    this.readPreference = null;
+  } 
+
+     // Ensure read_secondary is set correctly
+  if(this.readSecondary != null)
+    this.readSecondary = this.readPreference == ReadPreference.PRIMARY 
+        || this.readPreference == false  
+        || this.readPreference == null ? false : true;
+
+  // Ensure correct slave set
+  if(this.readSecondary) this.slaveOk = true;
+
+  // Set up logger if any set
+  this.logger = this.logger != null
+    && (typeof this.logger.debug == 'function')
+    && (typeof this.logger.error == 'function')
+    && (typeof this.logger.debug == 'function')
+      ? this.logger : {error:function(message, object) {}, log:function(message, object) {}, debug:function(message, object) {}};  
+
+  // Connection timeout
+  this.connectTimeoutMS = this.socketOptions.connectTimeoutMS
+    ? this.socketOptions.connectTimeoutMS
+    : 1000;
+
+  // Socket connection timeout
+  this.socketTimeoutMS = this.socketOptions.socketTimeoutMS
+    ? this.socketOptions.socketTimeoutMS
+    : 30000;
+}
+
+Options.prototype.decorateAndClean = function(servers, callBackStore) {
+  var self = this;
+
+  // var de duplicate list
+  var uniqueServers = {};
+  // De-duplicate any servers in the seed list
+  for(var i = 0; i < servers.length; i++) {
+    var server = servers[i];
+    // If server does not exist set it
+    if(uniqueServers[server.host + ":" + server.port] == null) {
+      uniqueServers[server.host + ":" + server.port] = server;
+    }
+  }
+
+  // Let's set the deduplicated list of servers
+  var finalServers = [];
+  // Add the servers
+  for(var key in uniqueServers) {
+    finalServers.push(uniqueServers[key]);
+  }
+
+  finalServers.forEach(function(server) {
+    // Ensure no server has reconnect on
+    server.options.auto_reconnect = false;
+    // Set up ssl options
+    server.ssl = self.ssl;
+    server.sslValidate = self.sslValidate;
+    server.sslCA = self.sslCA;
+    server.sslCert = self.sslCert;
+    server.sslKey = self.sslKey;
+    server.sslPass = self.sslPass;
+    server.poolSize = self.poolSize;
+    // Set callback store
+    server._callBackStore = callBackStore;
+  });
+
+  return finalServers;
+}
+
+exports.Options = Options;
diff --git a/node_modules/mongodb/lib/mongodb/connection/repl_set/repl_set.js b/node_modules/mongodb/lib/mongodb/connection/repl_set/repl_set.js
new file mode 100644
index 0000000..d11867b
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/repl_set/repl_set.js
@@ -0,0 +1,763 @@
+var ReadPreference = require('../read_preference').ReadPreference
+  , DbCommand = require('../../commands/db_command').DbCommand
+  , inherits = require('util').inherits
+  , format = require('util').format
+  , timers = require('timers')
+  , Server = require('../server').Server
+  , utils = require('../../utils')
+  , PingStrategy = require('./strategies/ping_strategy').PingStrategy
+  , StatisticsStrategy = require('./strategies/statistics_strategy').StatisticsStrategy
+  , Options = require('./options').Options
+  , ReplSetState = require('./repl_set_state').ReplSetState
+  , HighAvailabilityProcess = require('./ha').HighAvailabilityProcess
+  , Base = require('../base').Base;
+
+const STATE_STARTING_PHASE_1 = 0;
+const STATE_PRIMARY = 1;
+const STATE_SECONDARY = 2;
+const STATE_RECOVERING = 3;
+const STATE_FATAL_ERROR = 4;
+const STATE_STARTING_PHASE_2 = 5;
+const STATE_UNKNOWN = 6;
+const STATE_ARBITER = 7;
+const STATE_DOWN = 8;
+const STATE_ROLLBACK = 9;
+
+// Set processor, setImmediate if 0.10 otherwise nextTick
+var processor = timers.setImmediate ? timers.setImmediate : process.nextTick;
+
+/**
+ * ReplSet constructor provides replicaset functionality
+ *
+ * Options
+ *  - **ha** {Boolean, default:true}, turn on high availability.
+ *  - **haInterval** {Number, default:2000}, time between each replicaset status check.
+ *  - **reconnectWait** {Number, default:1000}, time to wait in miliseconds before attempting reconnect.
+ *  - **retries** {Number, default:30}, number of times to attempt a replicaset reconnect.
+ *  - **rs_name** {String}, the name of the replicaset to connect to.
+ *  - **socketOptions** {Object, default:null}, an object containing socket options to use (noDelay:(boolean), keepAlive:(number), connectTimeoutMS:(number), socketTimeoutMS:(number))
+ *  - **readPreference** {String}, the prefered read preference (ReadPreference.PRIMARY, ReadPreference.PRIMARY_PREFERRED, ReadPreference.SECONDARY, ReadPreference.SECONDARY_PREFERRED, ReadPreference.NEAREST).
+ *  - **strategy** {String, default:'ping'}, selection strategy for reads choose between (ping, statistical and none, default is ping)
+ *  - **secondaryAcceptableLatencyMS** {Number, default:15}, sets the range of servers to pick when using NEAREST (lowest ping ms + the latency fence, ex: range of 1 to (1 + 15) ms)
+ *  - **connectWithNoPrimary** {Boolean, default:false}, sets if the driver should connect even if no primary is available
+ *  - **connectArbiter** {Boolean, default:false}, sets if the driver should connect to arbiters or not.
+ *  - **logger** {Object, default:null}, an object representing a logger that you want to use, needs to support functions debug, log, error **({error:function(message, object) {}, log:function(message, object) {}, debug:function(message, object) {}})**.
+ *  - **poolSize** {Number, default:5}, number of connections in the connection pool for each server instance, set to 5 as default for legacy reasons.
+ *  - **ssl** {Boolean, default:false}, use ssl connection (needs to have a mongod server with ssl support)
+ *  - **sslValidate** {Boolean, default:false}, validate mongod server certificate against ca (needs to have a mongod server with ssl support, 2.4 or higher)
+ *  - **sslCA** {Array, default:null}, Array of valid certificates either as Buffers or Strings (needs to have a mongod server with ssl support, 2.4 or higher)
+ *  - **sslCert** {Buffer/String, default:null}, String or buffer containing the certificate we wish to present (needs to have a mongod server with ssl support, 2.4 or higher)
+ *  - **sslKey** {Buffer/String, default:null}, String or buffer containing the certificate private key we wish to present (needs to have a mongod server with ssl support, 2.4 or higher)
+ *  - **sslPass** {Buffer/String, default:null}, String or buffer containing the certificate password (needs to have a mongod server with ssl support, 2.4 or higher)
+ *
+ * @class Represents a Replicaset Configuration
+ * @param {Array} list of server objects participating in the replicaset.
+ * @param {Object} [options] additional options for the replicaset connection.
+ */
+var ReplSet = exports.ReplSet = function(servers, options) {
+  // Set up basic
+  if(!(this instanceof ReplSet))
+    return new ReplSet(servers, options);
+
+  // Set up event emitter
+  Base.call(this);
+
+  // Ensure we have a list of servers
+  if(!Array.isArray(servers)) throw Error("The parameter must be an array of servers and contain at least one server");
+  // Ensure no Mongos's
+  for(var i = 0; i < servers.length; i++) {
+    if(!(servers[i] instanceof Server)) throw new Error("list of servers must be of type Server");
+  }
+
+  // Save the options
+  this.options = new Options(options);
+  // Ensure basic validation of options
+  this.options.init();
+
+  // Server state
+  this._serverState = ReplSet.REPLSET_DISCONNECTED;
+  // Add high availability process
+  this._haProcess = new HighAvailabilityProcess(this, this.options);
+
+
+  // Let's iterate over all the provided server objects and decorate them
+  this.servers = this.options.decorateAndClean(servers, this._callBackStore);
+  // Throw error if no seed servers
+  if(this.servers.length == 0) throw new Error("No valid seed servers in the array");
+
+  // Let's set up our strategy object for picking secondaries
+  if(this.options.strategy == 'ping') {
+    // Create a new instance
+    this.strategyInstance = new PingStrategy(this, this.options.secondaryAcceptableLatencyMS);
+  } else if(this.options.strategy == 'statistical') {
+    // Set strategy as statistical
+    this.strategyInstance = new StatisticsStrategy(this);
+    // Add enable query information
+    this.enableRecordQueryStats(true);
+  }
+
+  this.emitOpen = this.options.emitOpen || true;
+  // Set up a clean state
+  this._state = new ReplSetState();
+  // Ensure up the server callbacks
+  for(var i = 0; i < this.servers.length; i++) {
+    this.servers[i]._callBackStore = this._callBackStore;
+    this.servers[i].name = format("%s:%s", this.servers[i].host, this.servers[i].port)
+    this.servers[i].replicasetInstance = this;
+    this.servers[i].options.auto_reconnect = false;
+    this.servers[i].inheritReplSetOptionsFrom(this);
+  }
+}
+
+/**
+ * @ignore
+ */
+inherits(ReplSet, Base);
+
+// Replicaset states
+ReplSet.REPLSET_CONNECTING = 'connecting';
+ReplSet.REPLSET_DISCONNECTED = 'disconnected';
+ReplSet.REPLSET_CONNECTED = 'connected';
+ReplSet.REPLSET_RECONNECTING = 'reconnecting';
+ReplSet.REPLSET_DESTROYED = 'destroyed';
+ReplSet.REPLSET_READ_ONLY = 'readonly';
+
+ReplSet.prototype.isAutoReconnect = function() {
+  return true;
+}
+
+ReplSet.prototype.canWrite = function() {
+  return this._state.master && this._state.master.isConnected();
+}
+
+ReplSet.prototype.canRead = function(read) {
+  if((read == ReadPreference.PRIMARY 
+      || read == null || read == false) && (this._state.master == null || !this._state.master.isConnected())) return false;
+  return Object.keys(this._state.secondaries).length > 0;
+}
+
+/**
+ * @ignore
+ */
+ReplSet.prototype.enableRecordQueryStats = function(enable) {
+  // Set the global enable record query stats
+  this.recordQueryStats = enable;
+
+  // Enable all the servers
+  for(var i = 0; i < this.servers.length; i++) {
+    this.servers[i].enableRecordQueryStats(enable);
+  }
+}
+
+/**
+ * @ignore
+ */
+ReplSet.prototype.setReadPreference = function(preference) {
+  this.options.readPreference = preference;
+}
+
+ReplSet.prototype.connect = function(parent, options, callback) {
+  if(this._serverState != ReplSet.REPLSET_DISCONNECTED) 
+    return callback(new Error("in process of connection"));
+
+  // If no callback throw
+  if(!(typeof callback == 'function')) 
+    throw new Error("cannot call ReplSet.prototype.connect with no callback function");
+
+  var self = this;
+  // Save db reference
+  this.options.db = parent;
+  // Set replicaset as connecting
+  this._serverState = ReplSet.REPLSET_CONNECTING
+  // Copy all the servers to our list of seeds
+  var candidateServers = this.servers.slice(0);
+  // Pop the first server
+  var server = candidateServers.pop();
+  server.name = format("%s:%s", server.host, server.port);
+  // Set up the options
+  var opts = {
+    returnIsMasterResults: true,
+    eventReceiver: server
+  }
+
+  // Register some event listeners
+  this.once("fullsetup", function(err, db, replset) {
+    // Set state to connected
+    self._serverState = ReplSet.REPLSET_CONNECTED;
+    // Stop any process running
+    if(self._haProcess) self._haProcess.stop();
+    // Start the HA process
+    self._haProcess.start();
+
+    // Emit fullsetup
+    processor(function() {
+      if(self.emitOpen)
+        parent.emit("open", null, self.options.db, self);
+      
+      parent.emit("fullsetup", null, self.options.db, self);
+    });
+
+    // If we have a strategy defined start it
+    if(self.strategyInstance) {
+      self.strategyInstance.start();
+    }
+
+    // Finishing up the call
+    callback(err, db, replset);
+  });
+
+  // Errors
+  this.once("connectionError", function(err, result) {
+    callback(err, result);
+  });
+
+  // Attempt to connect to the server
+  server.connect(this.options.db, opts, _connectHandler(this, candidateServers, server));
+}
+
+ReplSet.prototype.close = function(callback) {  
+  var self = this;
+  // Set as destroyed
+  this._serverState = ReplSet.REPLSET_DESTROYED;
+  // Stop the ha
+  this._haProcess.stop();
+  
+  // If we have a strategy stop it
+  if(this.strategyInstance) {
+    this.strategyInstance.stop();
+  }
+
+  // Kill all servers available
+  for(var name in this._state.addresses) {
+    this._state.addresses[name].close();
+  }
+
+  // Clean out the state
+  this._state = new ReplSetState(); 
+  
+  // Emit close event
+  processor(function() {
+    self._emitAcrossAllDbInstances(self, null, "close", null, null, true)    
+  });
+
+  // Callback
+  if(typeof callback == 'function') 
+    return callback(null, null);
+}
+
+/**
+ * Creates a new server for the `replset` based on `host`.
+ *
+ * @param {String} host - host:port pair (localhost:27017)
+ * @param {ReplSet} replset - the ReplSet instance
+ * @return {Server}
+ * @ignore
+ */
+var createServer = function(self, host, options) {
+  // copy existing socket options to new server
+  var socketOptions = {}
+  if(options.socketOptions) {
+    var keys = Object.keys(options.socketOptions);
+    for(var k = 0; k < keys.length; k++) {
+      socketOptions[keys[k]] = options.socketOptions[keys[k]];
+    }
+  }
+
+  var parts = host.split(/:/);
+  if(1 === parts.length) {
+    parts[1] = Connection.DEFAULT_PORT;
+  }
+
+  socketOptions.host = parts[0];
+  socketOptions.port = parseInt(parts[1], 10);
+
+  var serverOptions = {
+    readPreference: options.readPreference,
+    socketOptions: socketOptions,
+    poolSize: options.poolSize,
+    logger: options.logger,
+    auto_reconnect: false,
+    ssl: options.ssl,
+    sslValidate: options.sslValidate,
+    sslCA: options.sslCA,
+    sslCert: options.sslCert,
+    sslKey: options.sslKey,
+    sslPass: options.sslPass
+  }
+
+  var server = new Server(socketOptions.host, socketOptions.port, serverOptions);
+  // Set up shared state
+  server._callBackStore = self._callBackStore;
+  server.replicasetInstance = self;
+  server.enableRecordQueryStats(self.recordQueryStats);
+  // Set up event handlers
+  server.on("close", _handler("close", self, server));
+  server.on("error", _handler("error", self, server));
+  server.on("timeout", _handler("timeout", self, server));
+  return server;
+}
+
+var _handler = function(event, self, server) {
+  return function(err, doc) {
+    // The event happened to a primary
+    // Remove it from play
+    if(self._state.isPrimary(server)) {
+      var current_master = self._state.master;
+      self._state.master = null;
+      self._serverState = ReplSet.REPLSET_READ_ONLY;
+    
+      if(current_master != null) {
+        // Unpack variables
+        var host = current_master.socketOptions.host;
+        var port = current_master.socketOptions.port;
+
+        // Fire error on any unknown callbacks
+        self.__executeAllServerSpecificErrorCallbacks(host, port, err);        
+      }
+    } else if(self._state.isSecondary(server)) {
+      delete self._state.secondaries[server.name];
+    }
+
+    // If there is no more connections left and the setting is not destroyed
+    // set to disconnected
+    if(Object.keys(self._state.addresses).length == 0 
+      && self._serverState != ReplSet.REPLSET_DESTROYED) {
+        self._serverState = ReplSet.REPLSET_DISCONNECTED;
+
+        // Emit close across all the attached db instances
+        self._dbStore.emit("close", new Error("replicaset disconnected, no valid servers contactable over tcp"), null, true);
+    }
+
+    // Unpack variables
+    var host = server.socketOptions.host;
+    var port = server.socketOptions.port;
+
+    // Fire error on any unknown callbacks
+    self.__executeAllServerSpecificErrorCallbacks(host, port, err);
+  }
+}
+
+var locateNewServers = function(self, state, candidateServers, ismaster) {
+  // Retrieve the host
+  var hosts = ismaster.hosts;
+  // In candidate servers
+  var inCandidateServers = function(name, candidateServers) {
+    for(var i = 0; i < candidateServers.length; i++) {
+      if(candidateServers[i].name == name) return true;
+    }
+
+    return false;
+  }
+
+  // New servers
+  var newServers = [];
+  if(Array.isArray(hosts)) {
+    // Let's go over all the hosts
+    for(var i = 0; i < hosts.length; i++) {
+      if(!state.contains(hosts[i]) 
+        && !inCandidateServers(hosts[i], candidateServers)) {
+          newServers.push(createServer(self, hosts[i], self.options));
+      }
+    }    
+  }
+
+  // Return list of possible new servers
+  return newServers;
+}
+
+var _connectHandler = function(self, candidateServers, instanceServer) {
+  return function(err, doc) {
+    // If we have an error add to the list
+    if(err) self._state.errors[instanceServer.name] = instanceServer;
+
+    // No error let's analyse the ismaster command
+    if(!err) {      
+      var ismaster = doc.documents[0]
+      // console.dir(ismaster)
+      // If no replicaset name exists set the current one
+      if(self.options.rs_name == null) {
+        self.options.rs_name = ismaster.setName;
+      }
+
+      // If we have a member that is not part of the set let's finish up
+      if(typeof ismaster.setName == 'string' && ismaster.setName != self.options.rs_name) {
+        return self.emit("connectionError", new Error("Replicaset name " + ismaster.setName + " does not match specified name " + self.options.rs_name));
+      }
+
+      // Add the error handlers
+      instanceServer.on("close", _handler("close", self, instanceServer));
+      instanceServer.on("error", _handler("error", self, instanceServer));
+      instanceServer.on("timeout", _handler("timeout", self, instanceServer));
+      
+      // Set any tags on the instance server
+      instanceServer.name = ismaster.me;
+      instanceServer.tags = ismaster.tags;
+
+      // Add the server to the list
+      self._state.addServer(instanceServer, ismaster);
+
+      // Check if we have more servers to add (only check when done with initial set)
+      if(candidateServers.length == 0) {
+        // Get additional new servers that are not currently in set
+        var new_servers = locateNewServers(self, self._state, candidateServers, ismaster);
+
+        // If we have new servers join them
+        if(new_servers.length > 0) {
+          candidateServers = candidateServers.concat(new_servers);
+        }
+      }
+    }
+
+    // If the candidate server list is empty and no valid servers
+    if(candidateServers.length == 0 &&
+      !self._state.hasValidServers()) {
+        return self.emit("connectionError", new Error("No valid replicaset instance servers found"));
+    } else if(candidateServers.length == 0) {      
+      if(!self.options.connectWithNoPrimary && (self._state.master == null || !self._state.master.isConnected())) {
+        return self.emit("connectionError", new Error("No primary found in set"));
+      }
+      return self.emit("fullsetup", null, self.options.db, self);
+    }
+        
+    // Let's connect the next server    
+    var nextServer = candidateServers.pop();
+  
+    // Set up the options
+    var opts = {
+      returnIsMasterResults: true,
+      eventReceiver: nextServer
+    }
+
+    // Attempt to connect to the server
+    nextServer.connect(self.options.db, opts, _connectHandler(self, candidateServers, nextServer));
+  }
+}
+
+ReplSet.prototype.isDestroyed = function() {
+  return this._serverState == ReplSet.REPLSET_DESTROYED;
+}
+
+ReplSet.prototype.isConnected = function(read) {
+  var isConnected = false;  
+
+  if(read == null || read == ReadPreference.PRIMARY || read == false)
+    isConnected = this._state.master != null && this._state.master.isConnected();
+
+  if((read == ReadPreference.PRIMARY_PREFERRED || read == ReadPreference.SECONDARY_PREFERRED || read == ReadPreference.NEAREST)
+    && ((this._state.master != null && this._state.master.isConnected())
+    || (this._state && this._state.secondaries && Object.keys(this._state.secondaries).length > 0))) {
+      isConnected = true;
+  } else if(read == ReadPreference.SECONDARY) {
+    isConnected = this._state && this._state.secondaries && Object.keys(this._state.secondaries).length > 0;
+  }
+
+  // No valid connection return false
+  return isConnected;
+}
+
+ReplSet.prototype.isMongos = function() {
+  return false;
+}
+
+ReplSet.prototype.checkoutWriter = function() {
+  if(this._state.master) return this._state.master.checkoutWriter();
+  return new Error("no writer connection available");
+}
+
+ReplSet.prototype.allRawConnections = function() {
+  var connections = [];
+
+  for(var name in this._state.addresses) {
+    connections = connections.concat(this._state.addresses[name].allRawConnections());
+  }
+
+  return connections;
+}
+
+/**
+ * @ignore
+ */
+ReplSet.prototype.allServerInstances = function() {
+  var self = this;
+  // If no state yet return empty
+  if(!self._state) return [];
+  // Close all the servers (concatenate entire list of servers first for ease)
+  var allServers = self._state.master != null ? [self._state.master] : [];
+
+  // Secondary keys
+  var keys = Object.keys(self._state.secondaries);
+  // Add all secondaries
+  for(var i = 0; i < keys.length; i++) {
+    allServers.push(self._state.secondaries[keys[i]]);
+  }
+
+  // Return complete list of all servers
+  return allServers;
+}
+
+/**
+ * @ignore
+ */
+ReplSet.prototype.checkoutReader = function(readPreference, tags) {
+  var connection = null;
+
+  // If we have a read preference object unpack it
+  if(typeof readPreference == 'object' && readPreference['_type'] == 'ReadPreference') {
+    // Validate if the object is using a valid mode
+    if(!readPreference.isValid()) throw new Error("Illegal readPreference mode specified, " + readPreference.mode);
+    // Set the tag
+    tags = readPreference.tags;
+    readPreference = readPreference.mode;
+  } else if(typeof readPreference == 'object' && readPreference['_type'] != 'ReadPreference') {
+    return new Error("read preferences must be either a string or an instance of ReadPreference");
+  }
+
+  // Set up our read Preference, allowing us to override the readPreference
+  var finalReadPreference = readPreference != null ? readPreference : this.options.readPreference;
+
+  // Ensure we unpack a reference
+  if(finalReadPreference != null && typeof finalReadPreference == 'object' && finalReadPreference['_type'] == 'ReadPreference') {
+    // Validate if the object is using a valid mode
+    if(!finalReadPreference.isValid()) throw new Error("Illegal readPreference mode specified, " + finalReadPreference.mode);
+    // Set the tag
+    tags = finalReadPreference.tags;
+    readPreference = finalReadPreference.mode;
+  }
+
+  // Finalize the read preference setup
+  finalReadPreference = finalReadPreference == true ? ReadPreference.SECONDARY_PREFERRED : finalReadPreference;
+  finalReadPreference = finalReadPreference == null ? ReadPreference.PRIMARY : finalReadPreference;
+
+  // If we are reading from a primary
+  if(finalReadPreference == 'primary') {
+    // If we provide a tags set send an error
+    if(typeof tags == 'object' && tags != null) {
+      return new Error("PRIMARY cannot be combined with tags");
+    }
+
+    // If we provide a tags set send an error
+    if(this._state.master == null) {
+      return new Error("No replica set primary available for query with ReadPreference PRIMARY");
+    }
+
+    // Checkout a writer
+    return this.checkoutWriter();
+  }
+
+  // If we have specified to read from a secondary server grab a random one and read
+  // from it, otherwise just pass the primary connection
+  if((this.options.readSecondary || finalReadPreference == ReadPreference.SECONDARY_PREFERRED || finalReadPreference == ReadPreference.SECONDARY) && Object.keys(this._state.secondaries).length > 0) {
+    // If we have tags, look for servers matching the specific tag
+    if(this.strategyInstance != null) {
+      // Only pick from secondaries
+      var _secondaries = [];
+      for(var key in this._state.secondaries) {
+        _secondaries.push(this._state.secondaries[key]);
+      }
+
+      if(finalReadPreference == ReadPreference.SECONDARY) {
+        // Check out the nearest from only the secondaries
+        connection = this.strategyInstance.checkoutConnection(tags, _secondaries);
+      } else {
+        connection = this.strategyInstance.checkoutConnection(tags, _secondaries);
+        // No candidate servers that match the tags, error
+        if(connection == null || connection instanceof Error) {
+          // No secondary server avilable, attemp to checkout a primary server
+          connection = this.checkoutWriter();
+          // If no connection return an error
+          if(connection == null || connection instanceof Error) {
+            return new Error("No replica set members available for query");
+          }
+        }
+      }
+    } else if(tags != null && typeof tags == 'object') {
+      // Get connection
+      connection = _pickFromTags(this, tags);// = function(self, readPreference, tags) {
+      // No candidate servers that match the tags, error
+      if(connection == null) {
+        return new Error("No replica set members available for query");
+      }
+    } else {
+      connection = _roundRobin(this, tags);
+    }
+  } else if(finalReadPreference == ReadPreference.PRIMARY_PREFERRED) {
+    // Check if there is a primary available and return that if possible
+    connection = this.checkoutWriter();
+    // If no connection available checkout a secondary
+    if(connection == null || connection instanceof Error) {
+      // If we have tags, look for servers matching the specific tag
+      if(tags != null && typeof tags == 'object') {
+        // Get connection
+        connection = _pickFromTags(this, tags);// = function(self, readPreference, tags) {
+        // No candidate servers that match the tags, error
+        if(connection == null) {
+          return new Error("No replica set members available for query");
+        }
+      } else {
+        connection = _roundRobin(this, tags);
+      }
+    }
+  } else if(finalReadPreference == ReadPreference.SECONDARY_PREFERRED) {
+    // If we have tags, look for servers matching the specific tag
+    if(this.strategyInstance != null) {
+      connection = this.strategyInstance.checkoutConnection(tags);
+      
+      // No candidate servers that match the tags, error
+      if(connection == null || connection instanceof Error) {
+        // No secondary server avilable, attemp to checkout a primary server
+        connection = this.checkoutWriter();
+        // If no connection return an error
+        if(connection == null || connection instanceof Error) {
+          var preferenceName = finalReadPreference == ReadPreference.SECONDARY ? 'secondary' : finalReadPreference;
+          return new Error("No replica set member available for query with ReadPreference " + preferenceName + " and tags " + JSON.stringify(tags));
+        }
+      }
+    } else if(tags != null && typeof tags == 'object') {
+      // Get connection
+      connection = _pickFromTags(this, tags);// = function(self, readPreference, tags) {
+      // No candidate servers that match the tags, error
+      if(connection == null) {
+        // No secondary server avilable, attemp to checkout a primary server
+        connection = this.checkoutWriter();
+        // If no connection return an error
+        if(connection == null || connection instanceof Error) {
+          var preferenceName = finalReadPreference == ReadPreference.SECONDARY ? 'secondary' : finalReadPreference;
+          return new Error("No replica set member available for query with ReadPreference " + preferenceName + " and tags " + JSON.stringify(tags));
+        }
+      }
+    }
+  } else if(finalReadPreference == ReadPreference.NEAREST && this.strategyInstance != null) {
+    connection = this.strategyInstance.checkoutConnection(tags);
+  } else if(finalReadPreference == ReadPreference.NEAREST && this.strategyInstance == null) {
+    return new Error("A strategy for calculating nearness must be enabled such as ping or statistical");
+  } else if(finalReadPreference == ReadPreference.SECONDARY && Object.keys(this._state.secondaries).length == 0) {
+    if(tags != null && typeof tags == 'object') {
+      var preferenceName = finalReadPreference == ReadPreference.SECONDARY ? 'secondary' : finalReadPreference;
+      return new Error("No replica set member available for query with ReadPreference " + preferenceName + " and tags " + JSON.stringify(tags));
+    } else {
+      return new Error("No replica set secondary available for query with ReadPreference SECONDARY");
+    }
+  } else {
+    connection = this.checkoutWriter();
+  }
+
+  // Return the connection
+  return connection;
+}
+
+/**
+ * @ignore
+ */
+var _pickFromTags = function(self, tags) {
+  // If we have an array or single tag selection
+  var tagObjects = Array.isArray(tags) ? tags : [tags];
+  // Iterate over all tags until we find a candidate server
+  for(var _i = 0; _i < tagObjects.length; _i++) {
+    // Grab a tag object
+    var tagObject = tagObjects[_i];
+    // Matching keys
+    var matchingKeys = Object.keys(tagObject);
+    // Match all the servers that match the provdided tags
+    var keys = Object.keys(self._state.secondaries);
+    var candidateServers = [];
+
+    for(var i = 0; i < keys.length; i++) {
+      var server = self._state.secondaries[keys[i]];
+      // If we have tags match
+      if(server.tags != null) {
+        var matching = true;
+        // Ensure we have all the values
+        for(var j = 0; j < matchingKeys.length; j++) {
+          if(server.tags[matchingKeys[j]] != tagObject[matchingKeys[j]]) {
+            matching = false;
+            break;
+          }
+        }
+
+        // If we have a match add it to the list of matching servers
+        if(matching) {
+          candidateServers.push(server);
+        }
+      }
+    }
+
+    // If we have a candidate server return
+    if(candidateServers.length > 0) {
+      if(self.strategyInstance) return self.strategyInstance.checkoutConnection(tags, candidateServers);
+      // Set instance to return
+      return candidateServers[Math.floor(Math.random() * candidateServers.length)].checkoutReader();
+    }
+  }
+
+  // No connection found
+  return null;
+}
+
+/**
+ * Pick a secondary using round robin
+ *
+ * @ignore
+ */
+function _roundRobin (replset, tags) {
+  var keys = Object.keys(replset._state.secondaries);
+  var key = keys[replset._currentServerChoice++ % keys.length];
+
+  var conn = null != replset._state.secondaries[key]
+    ? replset._state.secondaries[key].checkoutReader()
+    : null;
+
+  // If connection is null fallback to first available secondary
+  if (null == conn) {
+    conn = pickFirstConnectedSecondary(replset, tags);
+  }
+
+  return conn;
+}
+
+/**
+ * @ignore
+ */
+var pickFirstConnectedSecondary = function pickFirstConnectedSecondary(self, tags) {
+  var keys = Object.keys(self._state.secondaries);
+  var connection;
+
+  // Find first available reader if any
+  for(var i = 0; i < keys.length; i++) {
+    connection = self._state.secondaries[keys[i]].checkoutReader();
+    if(connection) return connection;
+  }
+
+  // If we still have a null, read from primary if it's not secondary only
+  if(self._readPreference == ReadPreference.SECONDARY_PREFERRED) {
+    connection = self._state.master.checkoutReader();
+    if(connection) return connection;
+  }
+
+  var preferenceName = self._readPreference == ReadPreference.SECONDARY_PREFERRED
+    ? 'secondary'
+    : self._readPreference;
+
+  return new Error("No replica set member available for query with ReadPreference "
+                  + preferenceName + " and tags " + JSON.stringify(tags));
+}
+
+/**
+ * Get list of secondaries
+ * @ignore
+ */
+Object.defineProperty(ReplSet.prototype, "secondaries", {enumerable: true
+  , get: function() {
+      return utils.objectToArray(this._state.secondaries);
+    }
+});
+
+/**
+ * Get list of secondaries
+ * @ignore
+ */
+Object.defineProperty(ReplSet.prototype, "arbiters", {enumerable: true
+  , get: function() {
+      return utils.objectToArray(this._state.arbiters);
+    }
+});
+
diff --git a/node_modules/mongodb/lib/mongodb/connection/repl_set/repl_set_state.js b/node_modules/mongodb/lib/mongodb/connection/repl_set/repl_set_state.js
new file mode 100644
index 0000000..6f9e143
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/repl_set/repl_set_state.js
@@ -0,0 +1,70 @@
+/**
+ * Interval state object constructor
+ *
+ * @ignore
+ */
+var ReplSetState = function ReplSetState () {
+  this.errorMessages = [];
+  this.secondaries = {};
+  this.addresses = {};
+  this.arbiters = {};
+  this.passives = {};
+  this.members = [];
+  this.errors = {};
+  this.setName = null;
+  this.master = null;
+}
+
+ReplSetState.prototype.hasValidServers = function() {
+  var validServers = [];
+  if(this.master && this.master.isConnected()) return true;
+
+  if(this.secondaries) {
+    var keys = Object.keys(this.secondaries)
+    for(var i = 0; i < keys.length; i++) {
+      if(this.secondaries[keys[i]].isConnected())
+        return true;
+    }
+  }
+
+  return false;
+}
+
+ReplSetState.prototype.getAllReadServers = function() {
+  var candidate_servers = [];
+  for(var name in this.addresses) {
+    candidate_servers.push(this.addresses[name]);
+  }
+
+  // Return all possible read candidates
+  return candidate_servers;
+}
+
+ReplSetState.prototype.addServer = function(server, master) {
+  server.name = master.me;
+
+  if(master.ismaster) {
+    this.master = server;
+    this.addresses[server.name] = server;
+  } else if(master.secondary) {
+    this.secondaries[server.name] = server;
+    this.addresses[server.name] = server;
+  } else if(master.arbiters) {
+    this.arbiters[server.name] = server;
+    this.addresses[server.name] = server;
+  }
+}
+
+ReplSetState.prototype.contains = function(host) {
+  return this.addresses[host] != null;
+}
+
+ReplSetState.prototype.isPrimary = function(server) {
+  return this.master && this.master.name == server.name;
+}
+
+ReplSetState.prototype.isSecondary = function(server) {
+  return this.secondaries[server.name] != null;
+}
+
+exports.ReplSetState = ReplSetState;
diff --git a/node_modules/mongodb/lib/mongodb/connection/repl_set/strategies/ping_strategy.js b/node_modules/mongodb/lib/mongodb/connection/repl_set/strategies/ping_strategy.js
new file mode 100644
index 0000000..e5a7367
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/repl_set/strategies/ping_strategy.js
@@ -0,0 +1,304 @@
+var Server = require("../../server").Server
+  , format = require('util').format;
+
+// The ping strategy uses pings each server and records the
+// elapsed time for the server so it can pick a server based on lowest
+// return time for the db command {ping:true}
+var PingStrategy = exports.PingStrategy = function(replicaset, secondaryAcceptableLatencyMS) {
+  this.replicaset = replicaset;
+  this.secondaryAcceptableLatencyMS = secondaryAcceptableLatencyMS;
+  this.state = 'disconnected';
+  this.pingInterval = 5000;
+  // Class instance
+  this.Db = require("../../../db").Db;
+  // Active db connections
+  this.dbs = {};
+  // Current server index
+  this.index = 0;
+  // Logger api
+  this.Logger = null;
+}
+
+// Starts any needed code
+PingStrategy.prototype.start = function(callback) {
+  // already running?
+  if ('connected' == this.state) return;
+
+  this.state = 'connected';
+
+  // Start ping server
+  this._pingServer(callback);
+}
+
+// Stops and kills any processes running
+PingStrategy.prototype.stop = function(callback) {
+  // Stop the ping process
+  this.state = 'disconnected';
+
+  // Stop all the server instances
+  for(var key in this.dbs) {
+    this.dbs[key].close();
+  }
+
+  // optional callback
+  callback && callback(null, null);
+}
+
+PingStrategy.prototype.checkoutConnection = function(tags, secondaryCandidates) {
+  // Servers are picked based on the lowest ping time and then servers that lower than that + secondaryAcceptableLatencyMS
+  // Create a list of candidat servers, containing the primary if available
+  var candidateServers = [];
+  var self = this;
+
+  // If we have not provided a list of candidate servers use the default setup
+  if(!Array.isArray(secondaryCandidates)) {
+    candidateServers = this.replicaset._state.master != null ? [this.replicaset._state.master] : [];
+    // Add all the secondaries
+    var keys = Object.keys(this.replicaset._state.secondaries);
+    for(var i = 0; i < keys.length; i++) {
+      candidateServers.push(this.replicaset._state.secondaries[keys[i]])
+    }
+  } else {
+    candidateServers = secondaryCandidates;
+  }
+
+  // Final list of eligable server
+  var finalCandidates = [];
+
+  // If we have tags filter by tags
+  if(tags != null && typeof tags == 'object') {
+    // If we have an array or single tag selection
+    var tagObjects = Array.isArray(tags) ? tags : [tags];
+    // Iterate over all tags until we find a candidate server
+    for(var _i = 0; _i < tagObjects.length; _i++) {
+      // Grab a tag object
+      var tagObject = tagObjects[_i];
+      // Matching keys
+      var matchingKeys = Object.keys(tagObject);
+      // Remove any that are not tagged correctly
+      for(var i = 0; i < candidateServers.length; i++) {
+        var server = candidateServers[i];
+        // If we have tags match
+        if(server.tags != null) {
+          var matching = true;
+
+          // Ensure we have all the values
+          for(var j = 0; j < matchingKeys.length; j++) {
+            if(server.tags[matchingKeys[j]] != tagObject[matchingKeys[j]]) {
+              matching = false;
+              break;
+            }
+          }
+
+          // If we have a match add it to the list of matching servers
+          if(matching) {
+            finalCandidates.push(server);
+          }
+        }
+      }
+    }
+  } else {
+    // Final array candidates
+    var finalCandidates = candidateServers;
+  }
+
+  // Sort by ping time
+  finalCandidates.sort(function(a, b) {
+    return a.runtimeStats['pingMs'] > b.runtimeStats['pingMs'];
+  });
+
+  if(0 === finalCandidates.length)
+    return new Error("No replica set members available for query");
+
+  // find lowest server with a ping time
+  var lowest = finalCandidates.filter(function (server) {
+    return undefined != server.runtimeStats.pingMs;
+  })[0];
+
+  if(!lowest) {
+    lowest = finalCandidates[0];
+  }
+
+  // convert to integer
+  var lowestPing = lowest.runtimeStats.pingMs | 0;
+  
+  // determine acceptable latency
+  var acceptable = lowestPing + this.secondaryAcceptableLatencyMS;
+
+  // remove any server responding slower than acceptable
+  var len = finalCandidates.length;
+  while(len--) {
+    if(finalCandidates[len].runtimeStats['pingMs'] > acceptable) {
+      finalCandidates.splice(len, 1);
+    }
+  }
+
+  if(self.logger && self.logger.debug) {    
+    self.logger.debug("Ping strategy selection order for tags", tags);
+    finalCandidates.forEach(function(c) {
+      self.logger.debug(format("%s:%s = %s ms", c.host, c.port, c.runtimeStats['pingMs']), null);
+    })    
+  }
+
+  // If no candidates available return an error
+  if(finalCandidates.length == 0)
+    return new Error("No replica set members available for query");
+
+  // Ensure no we don't overflow
+  this.index = this.index % finalCandidates.length
+  // Pick a random acceptable server  
+  var connection = finalCandidates[this.index].checkoutReader();
+  // Point to next candidate (round robin style)
+  this.index = this.index + 1;
+
+  if(self.logger && self.logger.debug) {    
+    if(connection)
+      self.logger.debug("picked server %s:%s", connection.socketOptions.host, connection.socketOptions.port);
+  }
+
+  return connection;
+}
+
+PingStrategy.prototype._pingServer = function(callback) {
+  var self = this;
+
+  // Ping server function
+  var pingFunction = function() {
+    // Our state changed to disconnected or destroyed return
+    if(self.state == 'disconnected' || self.state == 'destroyed') return;
+    // If the replicaset is destroyed return
+    if(self.replicaset.isDestroyed() || self.replicaset._serverState == 'disconnected') return
+
+    // Create a list of all servers we can send the ismaster command to
+    var allServers = self.replicaset._state.master != null ? [self.replicaset._state.master] : [];
+
+    // Secondary keys
+    var keys = Object.keys(self.replicaset._state.secondaries);
+    // Add all secondaries
+    for(var i = 0; i < keys.length; i++) {
+      allServers.push(self.replicaset._state.secondaries[keys[i]]);
+    }
+
+    // Number of server entries
+    var numberOfEntries = allServers.length;
+
+    // We got keys
+    for(var i = 0; i < allServers.length; i++) {
+
+      // We got a server instance
+      var server = allServers[i];
+
+      // Create a new server object, avoid using internal connections as they might
+      // be in an illegal state
+      new function(serverInstance) {
+        var _db = self.dbs[serverInstance.host + ":" + serverInstance.port];
+        // If we have a db
+        if(_db != null) {
+          // Startup time of the command
+          var startTime = Date.now();
+
+          // Execute ping command in own scope
+          var _ping = function(__db, __serverInstance) {
+            // Execute ping on this connection
+            __db.executeDbCommand({ping:1}, {failFast:true}, function(err) {
+              if(err) {
+                delete self.dbs[__db.serverConfig.host + ":" + __db.serverConfig.port];
+                __db.close();
+                return done();
+              }
+
+              if(null != __serverInstance.runtimeStats && __serverInstance.isConnected()) {
+                __serverInstance.runtimeStats['pingMs'] = Date.now() - startTime;
+              }
+
+              done();
+            });            
+          };
+          // Ping
+          _ping(_db, serverInstance);
+        } else {
+          var connectTimeoutMS = self.replicaset.options.socketOptions 
+            ? self.replicaset.options.socketOptions.connectTimeoutMS : 0
+
+          // Create a new master connection
+          var _server = new Server(serverInstance.host, serverInstance.port, {
+            auto_reconnect: false,
+            returnIsMasterResults: true,
+            slaveOk: true,
+            poolSize: 1,
+            socketOptions: { connectTimeoutMS: connectTimeoutMS },
+            ssl: self.replicaset.ssl,
+            sslValidate: self.replicaset.sslValidate,
+            sslCA: self.replicaset.sslCA,
+            sslCert: self.replicaset.sslCert,
+            sslKey: self.replicaset.sslKey,
+            sslPass: self.replicaset.sslPass
+          });
+
+          // Create Db instance        
+          var _db = new self.Db('local', _server, { safe: true });
+          _db.on("close", function() {
+            delete self.dbs[this.serverConfig.host + ":" + this.serverConfig.port];
+          })
+
+          var _ping = function(__db, __serverInstance) {
+            if(self.state == 'disconnected') {
+              self.stop();
+              return;
+            }
+
+            __db.open(function(err, db) {              
+              if(self.state == 'disconnected' && __db != null) {
+                return __db.close();
+              }
+
+              if(err) {
+                delete self.dbs[__db.serverConfig.host + ":" + __db.serverConfig.port];
+                __db.close();
+                return done();
+              }
+
+              // Save instance
+              self.dbs[__db.serverConfig.host + ":" + __db.serverConfig.port] = __db;
+
+              // Startup time of the command
+              var startTime = Date.now();
+
+              // Execute ping on this connection
+              __db.executeDbCommand({ping:1}, {failFast:true}, function(err) {
+                if(err) {
+                  delete self.dbs[__db.serverConfig.host + ":" + __db.serverConfig.port];
+                  __db.close();
+                  return done();
+                }
+
+                if(null != __serverInstance.runtimeStats && __serverInstance.isConnected()) {
+                  __serverInstance.runtimeStats['pingMs'] = Date.now() - startTime;
+                }
+
+                done();
+              });
+            });            
+          };
+
+          _ping(_db, serverInstance);
+        }
+
+        function done() {
+          // Adjust the number of checks
+          numberOfEntries--;
+
+          // If we are done with all results coming back trigger ping again
+          if(0 === numberOfEntries && 'connected' == self.state) {
+            setTimeout(pingFunction, self.pingInterval);
+          }
+        }
+      }(server);
+    }
+  }
+
+  // Start pingFunction
+  pingFunction();
+
+  callback && callback(null);
+}
diff --git a/node_modules/mongodb/lib/mongodb/connection/repl_set/strategies/statistics_strategy.js b/node_modules/mongodb/lib/mongodb/connection/repl_set/strategies/statistics_strategy.js
new file mode 100644
index 0000000..f9b8c46
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/repl_set/strategies/statistics_strategy.js
@@ -0,0 +1,80 @@
+// The Statistics strategy uses the measure of each end-start time for each
+// query executed against the db to calculate the mean, variance and standard deviation
+// and pick the server which the lowest mean and deviation
+var StatisticsStrategy = exports.StatisticsStrategy = function(replicaset) {
+  this.replicaset = replicaset;
+  // Logger api
+  this.Logger = null;  
+}
+
+// Starts any needed code
+StatisticsStrategy.prototype.start = function(callback) {
+  callback && callback(null, null);
+}
+
+StatisticsStrategy.prototype.stop = function(callback) {
+  callback && callback(null, null);
+}
+
+StatisticsStrategy.prototype.checkoutConnection = function(tags, secondaryCandidates) {
+  // Servers are picked based on the lowest ping time and then servers that lower than that + secondaryAcceptableLatencyMS
+  // Create a list of candidat servers, containing the primary if available
+  var candidateServers = [];
+
+  // If we have not provided a list of candidate servers use the default setup
+  if(!Array.isArray(secondaryCandidates)) {
+    candidateServers = this.replicaset._state.master != null ? [this.replicaset._state.master] : [];
+    // Add all the secondaries
+    var keys = Object.keys(this.replicaset._state.secondaries);
+    for(var i = 0; i < keys.length; i++) {
+      candidateServers.push(this.replicaset._state.secondaries[keys[i]])
+    }
+  } else {
+    candidateServers = secondaryCandidates;
+  }
+
+  // Final list of eligable server
+  var finalCandidates = [];
+
+  // If we have tags filter by tags
+  if(tags != null && typeof tags == 'object') {
+    // If we have an array or single tag selection
+    var tagObjects = Array.isArray(tags) ? tags : [tags];
+    // Iterate over all tags until we find a candidate server
+    for(var _i = 0; _i < tagObjects.length; _i++) {
+      // Grab a tag object
+      var tagObject = tagObjects[_i];
+      // Matching keys
+      var matchingKeys = Object.keys(tagObject);
+      // Remove any that are not tagged correctly
+      for(var i = 0; i < candidateServers.length; i++) {
+        var server = candidateServers[i];
+        // If we have tags match
+        if(server.tags != null) {
+          var matching = true;
+
+          // Ensure we have all the values
+          for(var j = 0; j < matchingKeys.length; j++) {
+            if(server.tags[matchingKeys[j]] != tagObject[matchingKeys[j]]) {
+              matching = false;
+              break;
+            }
+          }
+
+          // If we have a match add it to the list of matching servers
+          if(matching) {
+            finalCandidates.push(server);
+          }
+        }
+      }
+    }
+  } else {
+    // Final array candidates
+    var finalCandidates = candidateServers;
+  }
+
+  // If no candidates available return an error
+  if(finalCandidates.length == 0) return new Error("No replica set members available for query");
+  // Pick a random server
+  return finalCandidates[Math.round(Math.random(1000000) * (finalCandidates.length - 1))].checkoutReader();
+}
diff --git a/node_modules/mongodb/lib/mongodb/connection/server.js b/node_modules/mongodb/lib/mongodb/connection/server.js
new file mode 100644
index 0000000..7b5df1e
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/server.js
@@ -0,0 +1,986 @@
+var Connection = require('./connection').Connection,
+  ReadPreference = require('./read_preference').ReadPreference,
+  DbCommand = require('../commands/db_command').DbCommand,
+  MongoReply = require('../responses/mongo_reply').MongoReply,
+  ConnectionPool = require('./connection_pool').ConnectionPool,
+  EventEmitter = require('events').EventEmitter,
+  Base = require('./base').Base,
+  utils = require('../utils'),
+  timers = require('timers'),
+  inherits = require('util').inherits;
+
+// Set processor, setImmediate if 0.10 otherwise nextTick
+var processor = timers.setImmediate ? timers.setImmediate : process.nextTick;
+
+/**
+ * Class representing a single MongoDB Server connection
+ *
+ * Options
+ *  - **readPreference** {String, default:null}, set's the read preference (ReadPreference.PRIMARY, ReadPreference.PRIMARY_PREFERRED, ReadPreference.SECONDARY, ReadPreference.SECONDARY_PREFERRED, ReadPreference.NEAREST)
+ *  - **ssl** {Boolean, default:false}, use ssl connection (needs to have a mongod server with ssl support)
+ *  - **sslValidate** {Boolean, default:false}, validate mongod server certificate against ca (needs to have a mongod server with ssl support, 2.4 or higher)
+ *  - **sslCA** {Array, default:null}, Array of valid certificates either as Buffers or Strings (needs to have a mongod server with ssl support, 2.4 or higher)
+ *  - **sslCert** {Buffer/String, default:null}, String or buffer containing the certificate we wish to present (needs to have a mongod server with ssl support, 2.4 or higher)
+ *  - **sslKey** {Buffer/String, default:null}, String or buffer containing the certificate private key we wish to present (needs to have a mongod server with ssl support, 2.4 or higher)
+ *  - **sslPass** {Buffer/String, default:null}, String or buffer containing the certificate password (needs to have a mongod server with ssl support, 2.4 or higher)
+ *  - **poolSize** {Number, default:5}, number of connections in the connection pool, set to 5 as default for legacy reasons.
+ *  - **socketOptions** {Object, default:null}, an object containing socket options to use (noDelay:(boolean), keepAlive:(number), connectTimeoutMS:(number), socketTimeoutMS:(number))
+ *  - **logger** {Object, default:null}, an object representing a logger that you want to use, needs to support functions debug, log, error **({error:function(message, object) {}, log:function(message, object) {}, debug:function(message, object) {}})**.
+ *  - **auto_reconnect** {Boolean, default:false}, reconnect on error.
+ *  - **disableDriverBSONSizeCheck** {Boolean, default:false}, force the server to error if the BSON message is to big
+ *
+ * @class Represents a Server connection.
+ * @param {String} host the server host
+ * @param {Number} port the server port
+ * @param {Object} [options] optional options for insert command
+ */
+function Server(host, port, options) {
+  // Set up Server instance
+  if(!(this instanceof Server)) return new Server(host, port, options);
+
+  // Set up event emitter
+  Base.call(this);
+
+  // Ensure correct values
+  if(port != null && typeof port == 'object') {
+    options = port;
+    port = Connection.DEFAULT_PORT;
+  }
+
+  var self = this;
+  this.host = host;
+  this.port = port;
+  this.options = options == null ? {} : options;
+  this.internalConnection;
+  this.internalMaster = false;
+  this.connected = false;  
+  this.poolSize = this.options.poolSize == null ? 5 : this.options.poolSize;
+  this.disableDriverBSONSizeCheck = this.options.disableDriverBSONSizeCheck != null ? this.options.disableDriverBSONSizeCheck : false;
+  this._used = false;
+  this.replicasetInstance = null;
+
+  // Emit open setup
+  this.emitOpen = this.options.emitOpen || true;
+  // Set ssl as connection method
+  this.ssl = this.options.ssl == null ? false : this.options.ssl;
+  // Set ssl validation
+  this.sslValidate = this.options.sslValidate == null ? false : this.options.sslValidate;
+  // Set the ssl certificate authority (array of Buffer/String keys)
+  this.sslCA = Array.isArray(this.options.sslCA) ? this.options.sslCA : null;
+  // Certificate to present to the server
+  this.sslCert = this.options.sslCert;
+  // Certificate private key if in separate file
+  this.sslKey = this.options.sslKey;
+  // Password to unlock private key
+  this.sslPass = this.options.sslPass;
+
+  // Ensure we are not trying to validate with no list of certificates
+  if(this.sslValidate && (!Array.isArray(this.sslCA) || this.sslCA.length == 0)) {
+    throw new Error("The driver expects an Array of CA certificates in the sslCA parameter when enabling sslValidate");
+  }
+
+  // Get the readPreference
+  var readPreference = this.options['readPreference'];
+  // If readPreference is an object get the mode string
+  var validateReadPreference = readPreference != null && typeof readPreference == 'object' ? readPreference.mode : readPreference;
+  // Read preference setting
+  if(validateReadPreference != null) {
+    if(validateReadPreference != ReadPreference.PRIMARY && validateReadPreference != ReadPreference.SECONDARY && validateReadPreference != ReadPreference.NEAREST
+      && validateReadPreference != ReadPreference.SECONDARY_PREFERRED && validateReadPreference != ReadPreference.PRIMARY_PREFERRED) {
+        throw new Error("Illegal readPreference mode specified, " + validateReadPreference);
+    }
+
+    // Set read Preference
+    this._readPreference = readPreference;
+  } else {
+    this._readPreference = null;
+  }
+
+  // Contains the isMaster information returned from the server
+  this.isMasterDoc;
+
+  // Set default connection pool options
+  this.socketOptions = this.options.socketOptions != null ? this.options.socketOptions : {};
+  if(this.disableDriverBSONSizeCheck) this.socketOptions.disableDriverBSONSizeCheck = this.disableDriverBSONSizeCheck;
+
+  // Set ssl up if it's defined
+  if(this.ssl) {
+    this.socketOptions.ssl = true;
+    // Set ssl validation
+    this.socketOptions.sslValidate = this.sslValidate == null ? false : this.sslValidate;
+    // Set the ssl certificate authority (array of Buffer/String keys)
+    this.socketOptions.sslCA = Array.isArray(this.sslCA) ? this.sslCA : null;
+    // Set certificate to present
+    this.socketOptions.sslCert = this.sslCert;
+    // Set certificate to present
+    this.socketOptions.sslKey = this.sslKey;
+    // Password to unlock private key
+    this.socketOptions.sslPass = this.sslPass;
+  }
+
+  // Set up logger if any set
+  this.logger = this.options.logger != null
+    && (typeof this.options.logger.debug == 'function')
+    && (typeof this.options.logger.error == 'function')
+    && (typeof this.options.logger.log == 'function')
+      ? this.options.logger : {error:function(message, object) {}, log:function(message, object) {}, debug:function(message, object) {}};
+
+  // Just keeps list of events we allow
+  this.eventHandlers = {error:[], parseError:[], poolReady:[], message:[], close:[], timeout:[]};
+  // Internal state of server connection
+  this._serverState = 'disconnected';
+  // Contains state information about server connection
+  this._state = {'runtimeStats': {'queryStats':new RunningStats()}};
+  // Do we record server stats or not
+  this.recordQueryStats = false;
+};
+
+/**
+ * @ignore
+ */
+inherits(Server, Base);
+
+//
+//  Deprecated, USE ReadPreferences class
+//
+Server.READ_PRIMARY = ReadPreference.PRIMARY;
+Server.READ_SECONDARY = ReadPreference.SECONDARY_PREFERRED;
+Server.READ_SECONDARY_ONLY = ReadPreference.SECONDARY;
+
+/**
+ * Always ourselves
+ * @ignore
+ */
+Server.prototype.setReadPreference = function(readPreference) {
+  this._readPreference = readPreference;  
+}
+
+/**
+ * @ignore
+ */
+Server.prototype.isMongos = function() {
+  return this.isMasterDoc != null && this.isMasterDoc['msg'] == "isdbgrid" ? true : false;
+}
+
+/**
+ * @ignore
+ */
+Server.prototype._isUsed = function() {
+  return this._used;
+}
+
+/**
+ * @ignore
+ */
+Server.prototype.close = function(callback) {
+  // Set server status as disconnected
+  this._serverState = 'destroyed';
+  // Remove all local listeners
+  this.removeAllListeners();
+
+  if(this.connectionPool != null) {
+    // Remove all the listeners on the pool so it does not fire messages all over the place
+    this.connectionPool.removeAllEventListeners();
+    // Close the connection if it's open
+    this.connectionPool.stop(true);
+  }
+
+  // Emit close event
+  if(this.db && !this.isSetMember()) {
+    var self = this;
+    processor(function() {
+      self._emitAcrossAllDbInstances(self, null, "close", null, null, true)
+    })
+  }
+
+  // Peform callback if present
+  if(typeof callback === 'function') callback(null);
+};
+
+Server.prototype.isDestroyed = function() {
+  return this._serverState == 'destroyed';
+}
+
+/**
+ * @ignore
+ */
+Server.prototype.isConnected = function() {
+  return this.connectionPool.isConnected();
+}
+
+/**
+ * @ignore
+ */
+Server.prototype.canWrite = Server.prototype.isConnected;
+Server.prototype.canRead = Server.prototype.isConnected;
+
+Server.prototype.isAutoReconnect = function() {
+  if(this.isSetMember()) return false;
+  return this.options.auto_reconnect != null ? this.options.auto_reconnect : true;
+}
+
+/**
+ * @ignore
+ */
+Server.prototype.allServerInstances = function() {
+  return [this];
+}
+
+/**
+ * @ignore
+ */
+Server.prototype.isSetMember = function() {
+  return this.replicasetInstance != null || this.mongosInstance != null;
+}
+
+/**
+ * Assigns a replica set to this `server`.
+ *
+ * @param {ReplSet} replset
+ * @ignore
+ */
+Server.prototype.assignReplicaSet = function (replset) {
+  this.replicasetInstance = replset;
+  this.inheritReplSetOptionsFrom(replset);
+  this.enableRecordQueryStats(replset.recordQueryStats);
+}
+
+/**
+ * Takes needed options from `replset` and overwrites
+ * our own options.
+ *
+ * @param {ReplSet} replset
+ * @ignore
+ */
+Server.prototype.inheritReplSetOptionsFrom = function (replset) {
+  this.socketOptions = {};
+  this.socketOptions.connectTimeoutMS = replset.options.socketOptions.connectTimeoutMS || 30000;
+
+  if(replset.options.ssl) {
+    // Set ssl on
+    this.socketOptions.ssl = true;
+    // Set ssl validation
+    this.socketOptions.sslValidate = replset.options.sslValidate == null ? false : replset.options.sslValidate;
+    // Set the ssl certificate authority (array of Buffer/String keys)
+    this.socketOptions.sslCA = Array.isArray(replset.options.sslCA) ? replset.options.sslCA : null;
+    // Set certificate to present
+    this.socketOptions.sslCert = replset.options.sslCert;
+    // Set certificate to present
+    this.socketOptions.sslKey = replset.options.sslKey;
+    // Password to unlock private key
+    this.socketOptions.sslPass = replset.options.sslPass;
+  }
+
+  // If a socket option object exists clone it
+  if(utils.isObject(replset.options.socketOptions)) {
+    var keys = Object.keys(replset.options.socketOptions);
+    for(var i = 0; i < keys.length; i++)
+      this.socketOptions[keys[i]] = replset.options.socketOptions[keys[i]];
+  }
+}
+
+/**
+ * Opens this server connection.
+ *
+ * @ignore
+ */
+Server.prototype.connect = function(dbInstance, options, callback) {
+  if('function' === typeof options) callback = options, options = {};
+  if(options == null) options = {};
+  if(!('function' === typeof callback)) callback = null;
+  var self = this;
+  // Save the options
+  this.options = options;
+
+  // Currently needed to work around problems with multiple connections in a pool with ssl
+  // TODO fix if possible
+  if(this.ssl == true) {
+    // Set up socket options for ssl
+    this.socketOptions.ssl = true;
+    // Set ssl validation
+    this.socketOptions.sslValidate = this.sslValidate == null ? false : this.sslValidate;
+    // Set the ssl certificate authority (array of Buffer/String keys)
+    this.socketOptions.sslCA = Array.isArray(this.sslCA) ? this.sslCA : null;
+    // Set certificate to present
+    this.socketOptions.sslCert = this.sslCert;
+    // Set certificate to present
+    this.socketOptions.sslKey = this.sslKey;
+    // Password to unlock private key
+    this.socketOptions.sslPass = this.sslPass;
+  }
+
+  // Let's connect
+  var server = this;
+  // Let's us override the main receiver of events
+  var eventReceiver = options.eventReceiver != null ? options.eventReceiver : this;
+  // Save reference to dbInstance
+  this.db = dbInstance;  // `db` property matches ReplSet and Mongos
+  this.dbInstances = [dbInstance];
+
+  // Force connection pool if there is one
+  if(server.connectionPool) server.connectionPool.stop();
+  // Set server state to connecting
+  this._serverState = 'connecting';
+
+  if(server.connectionPool != null) {
+    // Remove all the listeners on the pool so it does not fire messages all over the place
+    this.connectionPool.removeAllEventListeners();
+    // Close the connection if it's open
+    this.connectionPool.stop(true);    
+  }
+
+  this.connectionPool = new ConnectionPool(this.host, this.port, this.poolSize, dbInstance.bson,  this.socketOptions);
+  var connectionPool = this.connectionPool;
+  // If ssl is not enabled don't wait between the pool connections
+  if(this.ssl == null || !this.ssl) connectionPool._timeToWait = null;
+  // Set logger on pool
+  connectionPool.logger = this.logger;
+  connectionPool.bson = dbInstance.bson;
+
+  // Set basic parameters passed in
+  var returnIsMasterResults = options.returnIsMasterResults == null ? false : options.returnIsMasterResults;
+
+  // Create a default connect handler, overriden when using replicasets
+  var connectCallback = function(_server) {
+    return function(err, reply) {  
+      // ensure no callbacks get called twice
+      var internalCallback = callback;
+      callback = null;
+      // Assign the server
+      _server = _server != null ? _server : server;
+      
+      // If something close down the connection and removed the callback before
+      // proxy killed connection etc, ignore the erorr as close event was isssued
+      if(err != null && internalCallback == null) return;
+      // Internal callback
+      if(err != null) return internalCallback(err, null, _server);
+      _server.master = reply.documents[0].ismaster == 1 ? true : false;
+      _server.connectionPool.setMaxBsonSize(reply.documents[0].maxBsonObjectSize);
+      _server.connectionPool.setMaxMessageSizeBytes(reply.documents[0].maxMessageSizeBytes);
+      // Set server state to connEcted
+      _server._serverState = 'connected';
+      // Set server as connected
+      _server.connected = true;
+      // Save document returned so we can query it
+      _server.isMasterDoc = reply.documents[0];
+      
+      if(self.emitOpen)
+        _server._emitAcrossAllDbInstances(_server, eventReceiver, "open", null, returnIsMasterResults ? reply : dbInstance, null);        
+
+      // If we have it set to returnIsMasterResults
+      if(returnIsMasterResults) {
+        internalCallback(null, reply, _server);
+      } else {
+        internalCallback(null, dbInstance, _server);
+      }
+    }
+  };
+
+  // Let's us override the main connect callback
+  var connectHandler = options.connectHandler == null ? connectCallback(server) : options.connectHandler;
+
+  // Set up on connect method
+  connectionPool.on("poolReady", function() {
+    // Create db command and Add the callback to the list of callbacks by the request id (mapping outgoing messages to correct callbacks)
+    var db_command = DbCommand.NcreateIsMasterCommand(dbInstance, dbInstance.databaseName);
+    // Check out a reader from the pool
+    var connection = connectionPool.checkoutConnection();
+    // Register handler for messages
+    server._registerHandler(db_command, false, connection, connectHandler);
+    // Write the command out
+    connection.write(db_command);
+  })
+
+  // Set up item connection
+  connectionPool.on("message", function(message) {
+    // Attempt to parse the message
+    try {
+      // Create a new mongo reply
+      var mongoReply = new MongoReply()
+      // Parse the header
+      mongoReply.parseHeader(message, connectionPool.bson)
+
+      // If message size is not the same as the buffer size
+      // something went terribly wrong somewhere
+      if(mongoReply.messageLength != message.length) {
+        // Emit the error
+        if(eventReceiver.listeners("error") && eventReceiver.listeners("error").length > 0) eventReceiver.emit("error", new Error("bson length is different from message length"), server);
+        // Remove all listeners
+        server.removeAllListeners();
+      } else {
+        var startDate = new Date().getTime();
+
+        // Callback instance
+        var callbackInfo = server._findHandler(mongoReply.responseTo.toString());
+
+        // The command executed another request, log the handler again under that request id
+        if(mongoReply.requestId > 0 && mongoReply.cursorId.toString() != "0" 
+          && callbackInfo && callbackInfo.info && callbackInfo.info.exhaust) {
+            server._reRegisterHandler(mongoReply.requestId, callbackInfo);
+        }
+
+        // Only execute callback if we have a caller
+        // chained is for findAndModify as it does not respect write concerns
+        if(callbackInfo && callbackInfo.callback && callbackInfo.info && Array.isArray(callbackInfo.info.chained)) {
+          // Check if callback has already been fired (missing chain command)
+          var chained = callbackInfo.info.chained;
+          var numberOfFoundCallbacks = 0;
+          for(var i = 0; i < chained.length; i++) {
+            if(server._hasHandler(chained[i])) numberOfFoundCallbacks++;
+          }
+
+          // If we have already fired then clean up rest of chain and move on
+          if(numberOfFoundCallbacks != chained.length) {
+            for(var i = 0; i < chained.length; i++) {
+              server._removeHandler(chained[i]);
+            }
+
+            // Just return from function
+            return;
+          }
+
+          // Parse the body
+          mongoReply.parseBody(message, connectionPool.bson, callbackInfo.info.raw, function(err) {
+            if(err != null) {
+              // If pool connection is already closed
+              if(server._serverState === 'disconnected') return;
+              // Set server state to disconnected
+              server._serverState = 'disconnected';
+              // Remove all listeners and close the connection pool
+              server.removeAllListeners();
+              connectionPool.stop(true);
+
+              // If we have a callback return the error
+              if(typeof callback === 'function') {
+                // ensure no callbacks get called twice
+                var internalCallback = callback;
+                callback = null;
+                // Perform callback
+                internalCallback(new Error("connection closed due to parseError"), null, server);
+              } else if(server.isSetMember()) {
+                if(server.listeners("parseError") && server.listeners("parseError").length > 0) server.emit("parseError", new Error("connection closed due to parseError"), server);
+              } else {
+                if(eventReceiver.listeners("parseError") && eventReceiver.listeners("parseError").length > 0) eventReceiver.emit("parseError", new Error("connection closed due to parseError"), server);
+              }
+
+              // If we are a single server connection fire errors correctly
+              if(!server.isSetMember()) {
+                // Fire all callback errors
+                server.__executeAllCallbacksWithError(new Error("connection closed due to parseError"));
+                // Emit error
+                server._emitAcrossAllDbInstances(server, eventReceiver, "parseError", server, null, true);
+              }
+              // Short cut
+              return;
+            }
+
+            // Fetch the callback
+            var callbackInfo = server._findHandler(mongoReply.responseTo.toString());
+            // If we have an error let's execute the callback and clean up all other
+            // chained commands
+            var firstResult = mongoReply && mongoReply.documents;
+
+            // Check for an error, if we have one let's trigger the callback and clean up
+            // The chained callbacks
+            if(firstResult[0].err != null || firstResult[0].errmsg != null) {
+              // Cleanup the remaining callback
+              if(Array.isArray(callbackInfo.info.chained)) {
+                for(var i = 0; i < callbackInfo.info.chained.length; i++) {
+                  if(callbackInfo.info.chained[i] != mongoReply.responseTo)
+                    server._removeHandler(callbackInfo.info.chained[i]);
+                }
+              }
+              // Trigger the callback for the error
+              server._callHandler(mongoReply.responseTo, mongoReply, null);
+            } else {
+              var chainedIds = callbackInfo.info.chained;
+
+              if(chainedIds.length > 0 && chainedIds[chainedIds.length - 1] == mongoReply.responseTo) {
+                // Cleanup all other chained calls
+                chainedIds.pop();
+                // Remove listeners
+                for(var i = 0; i < chainedIds.length; i++) server._removeHandler(chainedIds[i]);
+                // Call the handler
+                server._callHandler(mongoReply.responseTo, callbackInfo.info.results.shift(), null);
+              } else{                
+                // Add the results to all the results
+                for(var i = 0; i < chainedIds.length; i++) {
+                  var handler = server._findHandler(chainedIds[i]);
+                  // Check if we have an object, if it's the case take the current object commands and
+                  // and add this one
+                  if(handler.info != null) {
+                    handler.info.results = Array.isArray(callbackInfo.info.results) ? callbackInfo.info.results : [];
+                    handler.info.results.push(mongoReply);
+                  }
+                }
+              }
+            }
+          });
+        } else if(callbackInfo && callbackInfo.callback && callbackInfo.info) {
+          // Parse the body
+          mongoReply.parseBody(message, connectionPool.bson, callbackInfo.info.raw, function(err) {
+            if(err != null) {
+              // If pool connection is already closed
+              if(server._serverState === 'disconnected') return;
+              // Set server state to disconnected
+              server._serverState = 'disconnected';
+              // Remove all listeners and close the connection pool
+              server.removeAllListeners();
+              connectionPool.stop(true);
+
+              // If we have a callback return the error
+              if(typeof callback === 'function') {
+                // ensure no callbacks get called twice
+                var internalCallback = callback;
+                callback = null;
+                // Perform callback
+                internalCallback(new Error("connection closed due to parseError"), null, server);
+              } else if(server.isSetMember()) {
+                if(server.listeners("parseError") && server.listeners("parseError").length > 0) server.emit("parseError", new Error("connection closed due to parseError"), server);
+              } else {
+                if(eventReceiver.listeners("parseError") && eventReceiver.listeners("parseError").length > 0) eventReceiver.emit("parseError", new Error("connection closed due to parseError"), server);
+              }
+
+              // If we are a single server connection fire errors correctly
+              if(!server.isSetMember()) {
+                // Fire all callback errors
+                server.__executeAllCallbacksWithError(new Error("connection closed due to parseError"));
+                // Emit error
+                server._emitAcrossAllDbInstances(server, eventReceiver, "parseError", server, null, true);
+              }
+              // Short cut
+              return;
+            }
+
+            // Let's record the stats info if it's enabled
+            if(server.recordQueryStats == true && server._state['runtimeStats'] != null
+              && server._state.runtimeStats['queryStats'] instanceof RunningStats) {
+              console.log("============================= log stats")
+              // Add data point to the running statistics object
+              server._state.runtimeStats.queryStats.push(new Date().getTime() - callbackInfo.info.start);
+            }
+
+            server._callHandler(mongoReply.responseTo, mongoReply, null);
+          });
+        }
+      }
+    } catch (err) {
+      // Throw error in next tick
+      processor(function() {
+        throw err;
+      })
+    }
+  });
+
+  // Handle timeout
+  connectionPool.on("timeout", function(err) {
+    // If pool connection is already closed
+    if(server._serverState === 'disconnected' 
+      || server._serverState === 'destroyed') return;
+    // Set server state to disconnected
+    server._serverState = 'disconnected';
+    // If we have a callback return the error
+    if(typeof callback === 'function') {
+      // ensure no callbacks get called twice
+      var internalCallback = callback;
+      callback = null;
+      // Perform callback
+      internalCallback(err, null, server);
+    } else if(server.isSetMember()) {
+      if(server.listeners("timeout") && server.listeners("timeout").length > 0) server.emit("timeout", err, server);
+    } else {
+      if(eventReceiver.listeners("timeout") && eventReceiver.listeners("timeout").length > 0) eventReceiver.emit("timeout", err, server);
+    }
+
+    // If we are a single server connection fire errors correctly
+    if(!server.isSetMember()) {
+      // Fire all callback errors
+      server.__executeAllCallbacksWithError(err);
+      // Emit error
+      server._emitAcrossAllDbInstances(server, eventReceiver, "timeout", err, server, true);
+    }
+  });
+
+  // Handle errors
+  connectionPool.on("error", function(message, connection, error_options) {
+    // If pool connection is already closed
+    if(server._serverState === 'disconnected' 
+      || server._serverState === 'destroyed') return;
+    // Set server state to disconnected
+    server._serverState = 'disconnected';
+    // Error message
+    var error_message = new Error(message && message.err ? message.err : message);
+    // Error message coming from ssl
+    if(error_options && error_options.ssl) error_message.ssl = true;
+    // If we have a callback return the error
+    if(typeof callback === 'function') {
+      // ensure no callbacks get called twice
+      var internalCallback = callback;
+      callback = null;
+      // Perform callback
+      internalCallback(error_message, null, server);
+    } else if(server.isSetMember()) {
+      if(server.listeners("error") && server.listeners("error").length > 0) server.emit("error", error_message, server);
+    } else {
+      if(eventReceiver.listeners("error") && eventReceiver.listeners("error").length > 0) eventReceiver.emit("error", error_message, server);
+    }
+
+    // If we are a single server connection fire errors correctly
+    if(!server.isSetMember()) {
+      // Fire all callback errors
+      server.__executeAllCallbacksWithError(error_message);
+      // Emit error
+      server._emitAcrossAllDbInstances(server, eventReceiver, "error", error_message, server, true);
+    }
+
+    // If we have autoConnect enabled let's fire up an attempt to reconnect
+    if(server.isAutoReconnect() 
+      && !server.isSetMember()
+      && (server._serverState != 'destroyed')
+      && !server._reconnectInProgreess) {
+
+      // Set the number of retries
+      server._reconnect_retries = server.db.numberOfRetries;
+      // Attempt reconnect
+      server._reconnectInProgreess = true;
+      setTimeout(__attemptReconnect(server), server.db.retryMiliSeconds);
+    }    
+  });
+
+  // Handle close events
+  connectionPool.on("close", function() {
+    // If pool connection is already closed
+    if(server._serverState === 'disconnected' 
+      || server._serverState === 'destroyed') return;
+    // Set server state to disconnected
+    server._serverState = 'disconnected';
+    // If we have a callback return the error
+    if(typeof callback == 'function') {
+      // ensure no callbacks get called twice
+      var internalCallback = callback;
+      callback = null;
+      // Perform callback
+      internalCallback(new Error("connection closed"), null, server);
+    } else if(server.isSetMember()) {
+      if(server.listeners("close") && server.listeners("close").length > 0) server.emit("close", new Error("connection closed"), server);
+    } else {
+      if(eventReceiver.listeners("close") && eventReceiver.listeners("close").length > 0) eventReceiver.emit("close", new Error("connection closed"), server);
+    }
+
+    // If we are a single server connection fire errors correctly
+    if(!server.isSetMember()) {
+      // Fire all callback errors
+      server.__executeAllCallbacksWithError(new Error("connection closed"));
+      // Emit error
+      server._emitAcrossAllDbInstances(server, eventReceiver, "close", server, null, true);
+    }
+
+    // If we have autoConnect enabled let's fire up an attempt to reconnect
+    if(server.isAutoReconnect() 
+      && !server.isSetMember()
+      && (server._serverState != 'destroyed')
+      && !server._reconnectInProgreess) {
+
+      // Set the number of retries
+      server._reconnect_retries = server.db.numberOfRetries;  
+      // Attempt reconnect
+      server._reconnectInProgreess = true;
+      setTimeout(__attemptReconnect(server), server.db.retryMiliSeconds);
+    }    
+  });
+
+  /**
+   * @ignore
+   */
+  var __attemptReconnect = function(server) {
+    return function() {
+      // Attempt reconnect
+      server.connect(server.db, server.options, function(err, result) {
+        server._reconnect_retries = server._reconnect_retries - 1;
+
+        if(err) {
+          // Retry
+          if(server._reconnect_retries == 0 || server._serverState == 'destroyed') {
+            server._serverState = 'connected';
+            server._reconnectInProgreess = false
+            // Fire all callback errors
+            return server.__executeAllCallbacksWithError(new Error("failed to reconnect to server"));
+          } else {
+            return setTimeout(__attemptReconnect(server), server.db.retryMiliSeconds);
+          }
+        } else {
+          // Set as authenticating (isConnected will be false)
+          server._serverState = 'authenticating';
+          // Apply any auths, we don't try to catch any errors here
+          // as there are nowhere to simply propagate them to
+          self._apply_auths(server.db, function(err, result) {            
+            server._serverState = 'connected';
+            server._reconnectInProgreess = false;
+            server._commandsStore.execute_queries();
+            server._commandsStore.execute_writes();
+          });
+        } 
+      });      
+    }
+  }
+
+  // If we have a parser error we are in an unknown state, close everything and emit
+  // error
+  connectionPool.on("parseError", function(message) {
+    // If pool connection is already closed
+    if(server._serverState === 'disconnected' 
+      || server._serverState === 'destroyed') return;
+    // Set server state to disconnected
+    server._serverState = 'disconnected';
+    // If we have a callback return the error
+    if(typeof callback === 'function') {
+      // ensure no callbacks get called twice
+      var internalCallback = callback;
+      callback = null;
+      // Perform callback
+      internalCallback(new Error("connection closed due to parseError"), null, server);
+    } else if(server.isSetMember()) {
+      if(server.listeners("parseError") && server.listeners("parseError").length > 0) server.emit("parseError", new Error("connection closed due to parseError"), server);
+    } else {
+      if(eventReceiver.listeners("parseError") && eventReceiver.listeners("parseError").length > 0) eventReceiver.emit("parseError", new Error("connection closed due to parseError"), server);
+    }
+
+    // If we are a single server connection fire errors correctly
+    if(!server.isSetMember()) {
+      // Fire all callback errors
+      server.__executeAllCallbacksWithError(new Error("connection closed due to parseError"));
+      // Emit error
+      server._emitAcrossAllDbInstances(server, eventReceiver, "parseError", server, null, true);
+    }
+  });
+
+  // Boot up connection poole, pass in a locator of callbacks
+  connectionPool.start();
+}
+
+/**
+ * @ignore
+ */
+Server.prototype.allRawConnections = function() {
+  return this.connectionPool.getAllConnections();
+}
+
+/**
+ * Check if a writer can be provided
+ * @ignore
+ */
+var canCheckoutWriter = function(self, read) {
+  // We cannot write to an arbiter or secondary server
+  if(self.isMasterDoc && self.isMasterDoc['arbiterOnly'] == true) {
+    return new Error("Cannot write to an arbiter");
+  } if(self.isMasterDoc['secondary'] == true) {
+    return new Error("Cannot write to a secondary");
+  } else if(read == true && self._readPreference == ReadPreference.SECONDARY && self.isMasterDoc['ismaster'] == true) {
+    return new Error("Cannot read from primary when secondary only specified");
+  }
+
+  // Return no error
+  return null;
+}
+
+/**
+ * @ignore
+ */
+Server.prototype.checkoutWriter = function(read) {
+  if(read == true) return this.connectionPool.checkoutConnection();
+  // Check if are allowed to do a checkout (if we try to use an arbiter f.ex)
+  var result = canCheckoutWriter(this, read);
+  // If the result is null check out a writer
+  if(result == null && this.connectionPool != null) {
+    return this.connectionPool.checkoutConnection();
+  } else if(result == null) {
+    return null;
+  } else {
+    return result;
+  }
+}
+
+/**
+ * Check if a reader can be provided
+ * @ignore
+ */
+var canCheckoutReader = function(self) {
+  // We cannot write to an arbiter or secondary server
+  if(self.isMasterDoc && self.isMasterDoc['arbiterOnly'] == true) {
+    return new Error("Cannot write to an arbiter");
+  } else if(self._readPreference != null) {
+    // If the read preference is Primary and the instance is not a master return an error
+    if((self._readPreference == ReadPreference.PRIMARY) && self.isMasterDoc['ismaster'] != true) {
+      return new Error("Read preference is Server.PRIMARY and server is not master");
+    } else if(self._readPreference == ReadPreference.SECONDARY && self.isMasterDoc['ismaster'] == true) {
+      return new Error("Cannot read from primary when secondary only specified");
+    }
+  }
+
+  // Return no error
+  return null;
+}
+
+/**
+ * @ignore
+ */
+Server.prototype.checkoutReader = function(read) {
+  // Check if are allowed to do a checkout (if we try to use an arbiter f.ex)
+  var result = canCheckoutReader(this);
+  // If the result is null check out a writer
+  if(result == null && this.connectionPool != null) {
+    return this.connectionPool.checkoutConnection();
+  } else if(result == null) {
+    return null;
+  } else {
+    return result;
+  }
+}
+
+/**
+ * @ignore
+ */
+Server.prototype.enableRecordQueryStats = function(enable) {
+  this.recordQueryStats = enable;
+}
+
+/**
+ * Internal statistics object used for calculating average and standard devitation on
+ * running queries
+ * @ignore
+ */
+var RunningStats = function() {
+  var self = this;
+  this.m_n = 0;
+  this.m_oldM = 0.0;
+  this.m_oldS = 0.0;
+  this.m_newM = 0.0;
+  this.m_newS = 0.0;
+
+  // Define getters
+  Object.defineProperty(this, "numDataValues", { enumerable: true
+    , get: function () { return this.m_n; }
+  });
+
+  Object.defineProperty(this, "mean", { enumerable: true
+    , get: function () { return (this.m_n > 0) ? this.m_newM : 0.0; }
+  });
+
+  Object.defineProperty(this, "variance", { enumerable: true
+    , get: function () { return ((this.m_n > 1) ? this.m_newS/(this.m_n - 1) : 0.0); }
+  });
+
+  Object.defineProperty(this, "standardDeviation", { enumerable: true
+    , get: function () { return Math.sqrt(this.variance); }
+  });
+
+  Object.defineProperty(this, "sScore", { enumerable: true
+    , get: function () {
+      var bottom = this.mean + this.standardDeviation;
+      if(bottom == 0) return 0;
+      return ((2 * this.mean * this.standardDeviation)/(bottom));
+    }
+  });
+}
+
+/**
+ * @ignore
+ */
+RunningStats.prototype.push = function(x) {
+  // Update the number of samples
+  this.m_n = this.m_n + 1;
+  // See Knuth TAOCP vol 2, 3rd edition, page 232
+  if(this.m_n == 1) {
+    this.m_oldM = this.m_newM = x;
+    this.m_oldS = 0.0;
+  } else {
+    this.m_newM = this.m_oldM + (x - this.m_oldM) / this.m_n;
+    this.m_newS = this.m_oldS + (x - this.m_oldM) * (x - this.m_newM);
+
+    // set up for next iteration
+    this.m_oldM = this.m_newM;
+    this.m_oldS = this.m_newS;
+  }
+}
+
+/**
+ * @ignore
+ */
+Object.defineProperty(Server.prototype, "autoReconnect", { enumerable: true
+  , get: function () {
+      return this.options['auto_reconnect'] == null ? false : this.options['auto_reconnect'];
+    }
+});
+
+/**
+ * @ignore
+ */
+Object.defineProperty(Server.prototype, "connection", { enumerable: true
+  , get: function () {
+      return this.internalConnection;
+    }
+  , set: function(connection) {
+      this.internalConnection = connection;
+    }
+});
+
+/**
+ * @ignore
+ */
+Object.defineProperty(Server.prototype, "master", { enumerable: true
+  , get: function () {
+      return this.internalMaster;
+    }
+  , set: function(value) {
+      this.internalMaster = value;
+    }
+});
+
+/**
+ * @ignore
+ */
+Object.defineProperty(Server.prototype, "primary", { enumerable: true
+  , get: function () {
+      return this;
+    }
+});
+
+/**
+ * Getter for query Stats
+ * @ignore
+ */
+Object.defineProperty(Server.prototype, "queryStats", { enumerable: true
+  , get: function () {
+      return this._state.runtimeStats.queryStats;
+    }
+});
+
+/**
+ * @ignore
+ */
+Object.defineProperty(Server.prototype, "runtimeStats", { enumerable: true
+  , get: function () {
+      return this._state.runtimeStats;
+    }
+});
+
+/**
+ * Get Read Preference method
+ * @ignore
+ */
+Object.defineProperty(Server.prototype, "readPreference", { enumerable: true
+  , get: function () {
+      if(this._readPreference == null && this.readSecondary) {
+        return Server.READ_SECONDARY;
+      } else if(this._readPreference == null && !this.readSecondary) {
+        return Server.READ_PRIMARY;
+      } else {
+        return this._readPreference;
+      }
+    }
+});
+
+/**
+ * @ignore
+ */
+exports.Server = Server;
diff --git a/node_modules/mongodb/lib/mongodb/connection/url_parser.js b/node_modules/mongodb/lib/mongodb/connection/url_parser.js
new file mode 100644
index 0000000..9adf526
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/connection/url_parser.js
@@ -0,0 +1,241 @@
+var fs = require('fs'),
+  ReadPreference = require('./read_preference').ReadPreference;
+
+exports.parse = function(url, options) {
+  // Ensure we have a default options object if none set
+  options = options || {};
+  // Variables
+  var connection_part = '';
+  var auth_part = '';
+  var query_string_part = '';
+  var dbName = 'admin';
+
+  // Must start with mongodb
+  if(url.indexOf("mongodb://") != 0)
+    throw Error("URL must be in the format mongodb://user:pass@host:port/dbname");
+  // If we have a ? mark cut the query elements off
+  if(url.indexOf("?") != -1) {
+    query_string_part = url.substr(url.indexOf("?") + 1);
+    connection_part = url.substring("mongodb://".length, url.indexOf("?"))
+  } else {
+    connection_part = url.substring("mongodb://".length);
+  }
+
+  // Check if we have auth params
+  if(connection_part.indexOf("@") != -1) {
+    auth_part = connection_part.split("@")[0];
+    connection_part = connection_part.split("@")[1];
+  }
+
+  // Check if the connection string has a db
+  if(connection_part.indexOf(".sock") != -1) {
+    if(connection_part.indexOf(".sock/") != -1) {
+      dbName = connection_part.split(".sock/")[1];
+      connection_part = connection_part.split("/", connection_part.indexOf(".sock") + ".sock".length);
+    } 
+  } else if(connection_part.indexOf("/") != -1) {
+    dbName = connection_part.split("/")[1];
+    connection_part = connection_part.split("/")[0];
+  }
+
+  // Result object
+  var object = {};
+
+  // Pick apart the authentication part of the string
+  var authPart = auth_part || '';
+  var auth = authPart.split(':', 2);
+  if(options['uri_decode_auth']){
+    auth[0] = decodeURIComponent(auth[0]);
+    if(auth[1]){
+      auth[1] = decodeURIComponent(auth[1]);
+    }
+  }
+
+  // Add auth to final object if we have 2 elements
+  if(auth.length == 2) object.auth = {user: auth[0], password: auth[1]};
+
+  // Variables used for temporary storage
+  var hostPart;
+  var urlOptions;
+  var servers;
+  var serverOptions = {socketOptions: {}};
+  var dbOptions = {read_preference_tags: []};
+  var replSetServersOptions = {socketOptions: {}};
+  // Add server options to final object
+  object.server_options = serverOptions;
+  object.db_options = dbOptions;
+  object.rs_options = replSetServersOptions;
+  object.mongos_options = {};
+
+  // Let's check if we are using a domain socket
+  if(url.match(/\.sock/)) {
+    // Split out the socket part
+    var domainSocket = url.substring(
+        url.indexOf("mongodb://") + "mongodb://".length
+      , url.lastIndexOf(".sock") + ".sock".length);
+    // Clean out any auth stuff if any
+    if(domainSocket.indexOf("@") != -1) domainSocket = domainSocket.split("@")[1];
+    servers = [{domain_socket: domainSocket}];
+  } else {
+    // Split up the db
+    hostPart = connection_part;
+    // Parse all server results
+    servers = hostPart.split(',').map(function(h) {
+      var hostPort = h.split(':', 2);
+      var _host = hostPort[0] || 'localhost';
+      var _port = hostPort[1] != null ? parseInt(hostPort[1], 10) : 27017;
+      // Check for localhost?safe=true style case
+      if(_host.indexOf("?") != -1) _host = _host.split(/\?/)[0];
+
+      // Return the mapped object
+      return {host: _host, port: _port};
+    });
+  }
+
+  // Get the db name
+  object.dbName = dbName || 'admin';
+  // Split up all the options
+  urlOptions = (query_string_part || '').split(/[&;]/);    
+  // Ugh, we have to figure out which options go to which constructor manually.
+  urlOptions.forEach(function(opt) {
+    if(!opt) return;
+    var splitOpt = opt.split('='), name = splitOpt[0], value = splitOpt[1];
+    // Options implementations
+    switch(name) {
+      case 'slaveOk':
+      case 'slave_ok':
+        serverOptions.slave_ok = (value == 'true');
+        break;
+      case 'maxPoolSize':
+      case 'poolSize':
+        serverOptions.poolSize = parseInt(value, 10);
+        replSetServersOptions.poolSize = parseInt(value, 10);
+        break;
+      case 'autoReconnect':
+      case 'auto_reconnect':
+        serverOptions.auto_reconnect = (value == 'true');
+        break;
+      case 'minPoolSize':
+        throw new Error("minPoolSize not supported");
+      case 'maxIdleTimeMS':
+        throw new Error("maxIdleTimeMS not supported");
+      case 'waitQueueMultiple':
+        throw new Error("waitQueueMultiple not supported");
+      case 'waitQueueTimeoutMS':
+        throw new Error("waitQueueTimeoutMS not supported");
+      case 'uuidRepresentation':
+        throw new Error("uuidRepresentation not supported");
+      case 'ssl':
+        if(value == 'prefer') {
+          serverOptions.ssl = value;
+          replSetServersOptions.ssl = value;
+          break;
+        }
+        serverOptions.ssl = (value == 'true');
+        replSetServersOptions.ssl = (value == 'true');
+        break;
+      case 'replicaSet':
+      case 'rs_name':
+        replSetServersOptions.rs_name = value;
+        break;
+      case 'reconnectWait':
+        replSetServersOptions.reconnectWait = parseInt(value, 10);
+        break;
+      case 'retries':
+        replSetServersOptions.retries = parseInt(value, 10);
+        break;
+      case 'readSecondary':
+      case 'read_secondary':
+        replSetServersOptions.read_secondary = (value == 'true');
+        break;
+      case 'fsync':
+        dbOptions.fsync = (value == 'true');
+        break;
+      case 'journal':
+        dbOptions.journal = (value == 'true');
+        break;
+      case 'safe':
+        dbOptions.safe = (value == 'true');
+        break;
+      case 'nativeParser':
+      case 'native_parser':
+        dbOptions.native_parser = (value == 'true');
+        break;
+      case 'connectTimeoutMS':
+        serverOptions.socketOptions.connectTimeoutMS = parseInt(value, 10);
+        replSetServersOptions.socketOptions.connectTimeoutMS = parseInt(value, 10);
+        break;
+      case 'socketTimeoutMS':
+        serverOptions.socketOptions.socketTimeoutMS = parseInt(value, 10);
+        replSetServersOptions.socketOptions.socketTimeoutMS = parseInt(value, 10);
+        break;
+      case 'w':
+        dbOptions.w = parseInt(value, 10);
+        break;
+      case 'authSource':
+        dbOptions.authSource = value;
+        break;
+      case 'authMechanism':
+        if(value == 'GSSAPI') {
+          // If no password provided decode only the principal
+          if(object.auth == null) {
+            var urlDecodeAuthPart = decodeURIComponent(authPart);
+            if(urlDecodeAuthPart.indexOf("@") == -1) throw new Error("GSSAPI requires a provided principal");
+            object.auth = {user: urlDecodeAuthPart, password: null};
+          } else {
+            object.auth.user = decodeURIComponent(object.auth.user);
+          }
+        }
+        // Only support GSSAPI or MONGODB-CR for now
+        if(value != 'GSSAPI' && value != 'MONGODB-CR') throw new Error("only GSSAPI or MONGODB-CR is supported by authMechanism");
+        dbOptions.authMechanism = value;
+        break;
+      case 'wtimeoutMS':
+        dbOptions.wtimeoutMS = parseInt(value, 10);
+        break;
+      case 'readPreference':
+        if(!ReadPreference.isValid(value)) throw new Error("readPreference must be either primary/primaryPreferred/secondary/secondaryPreferred/nearest");
+        dbOptions.read_preference = value;
+        break;
+      case 'readPreferenceTags':
+        // Contains the tag object
+        var tagObject = {};
+        if(value == null || value == '') {
+          dbOptions.read_preference_tags.push(tagObject);
+          break;
+        }
+
+        // Split up the tags
+        var tags = value.split(/\,/);
+        for(var i = 0; i < tags.length; i++) {
+          var parts = tags[i].trim().split(/\:/);
+          tagObject[parts[0]] = parts[1];
+        }
+
+        // Set the preferences tags
+        dbOptions.read_preference_tags.push(tagObject);
+        break;
+      default:
+        break;
+    }
+  });
+
+  // No tags: should be null (not [])
+  if(dbOptions.read_preference_tags.length === 0) {
+    dbOptions.read_preference_tags = null;
+  }
+
+  // Validate if there are an invalid write concern combinations
+  if((dbOptions.w == -1 || dbOptions.w == 0) && (
+      dbOptions.journal == true
+      || dbOptions.fsync == true
+      || dbOptions.safe == true)) throw new Error("w set to -1 or 0 cannot be combined with safe/w/journal/fsync")
+
+  // If no read preference set it to primary
+  if(!dbOptions.read_preference) dbOptions.read_preference = 'primary';
+
+  // Add servers to result
+  object.servers = servers;
+  // Returned parsed object
+  return object;
+}
diff --git a/node_modules/mongodb/lib/mongodb/cursor.js b/node_modules/mongodb/lib/mongodb/cursor.js
new file mode 100644
index 0000000..5eab489
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/cursor.js
@@ -0,0 +1,938 @@
+var QueryCommand = require('./commands/query_command').QueryCommand,
+  GetMoreCommand = require('./commands/get_more_command').GetMoreCommand,
+  KillCursorCommand = require('./commands/kill_cursor_command').KillCursorCommand,
+  Long = require('bson').Long,
+  ReadPreference = require('./connection/read_preference').ReadPreference,
+  CursorStream = require('./cursorstream'),
+  timers = require('timers'),
+  utils = require('./utils');
+
+// Set processor, setImmediate if 0.10 otherwise nextTick
+var processor = timers.setImmediate ? timers.setImmediate : process.nextTick;
+
+/**
+ * Constructor for a cursor object that handles all the operations on query result
+ * using find. This cursor object is unidirectional and cannot traverse backwards. Clients should not be creating a cursor directly,
+ * but use find to acquire a cursor. (INTERNAL TYPE)
+ *
+ * Options
+ *  - **skip** {Number} skip number of documents to skip.
+ *  - **limit** {Number}, limit the number of results to return. -1 has a special meaning and is used by Db.eval. A value of 1 will also be treated as if it were -1.
+ *  - **sort** {Array | Object}, set to sort the documents coming back from the query. Array of indexes, [['a', 1]] etc.
+ *  - **hint**  {Object}, hint force the query to use a specific index.
+ *  - **explain** {Boolean}, explain return the explaination of the query.
+ *  - **snapshot** {Boolean}, snapshot Snapshot mode assures no duplicates are returned.
+ *  - **timeout** {Boolean}, timeout allow the query to timeout.
+ *  - **tailable** {Boolean}, tailable allow the cursor to be tailable.
+ *  - **awaitdata** {Boolean}, awaitdata allow the cursor to wait for data, only applicable for tailable cursor.
+ *  - **batchSize** {Number}, batchSize the number of the subset of results to request the database to return for every request. This should initially be greater than 1 otherwise the database will automatically close the cursor. The batch size can be set to 1 with cursorInstance.batchSize after performing the initial query to the database.
+ *  - **raw** {Boolean}, raw return all query documents as raw buffers (default false).
+ *  - **read** {Boolean}, read specify override of read from source (primary/secondary).
+ *  - **returnKey** {Boolean}, returnKey only return the index key.
+ *  - **maxScan** {Number}, maxScan limit the number of items to scan.
+ *  - **min** {Number}, min set index bounds.
+ *  - **max** {Number}, max set index bounds.
+ *  - **showDiskLoc** {Boolean}, showDiskLoc show disk location of results.
+ *  - **comment** {String}, comment you can put a $comment field on a query to make looking in the profiler logs simpler.
+ *  - **numberOfRetries** {Number}, numberOfRetries if using awaidata specifies the number of times to retry on timeout.
+ *  - **dbName** {String}, dbName override the default dbName.
+ *  - **tailableRetryInterval** {Number}, tailableRetryInterval specify the miliseconds between getMores on tailable cursor.
+ *  - **exhaust** {Boolean}, exhaust have the server send all the documents at once as getMore packets.
+ *  - **partial** {Boolean}, partial have the sharded system return a partial result from mongos.
+ *
+ * @class Represents a Cursor.
+ * @param {Db} db the database object to work with.
+ * @param {Collection} collection the collection to query.
+ * @param {Object} selector the query selector.
+ * @param {Object} fields an object containing what fields to include or exclude from objects returned.
+ * @param {Object} [options] additional options for the collection.
+*/
+function Cursor(db, collection, selector, fields, options) {
+  this.db = db;
+  this.collection = collection;
+  this.selector = selector;
+  this.fields = fields;
+  options = !options ? {} : options;
+
+  this.skipValue = options.skip == null ? 0 : options.skip;
+  this.limitValue = options.limit == null ? 0 : options.limit;
+  this.sortValue = options.sort;
+  this.hint = options.hint;
+  this.explainValue = options.explain;
+  this.snapshot = options.snapshot;
+  this.timeout = options.timeout == null ? true : options.timeout;
+  this.tailable = options.tailable;
+  this.awaitdata = options.awaitdata;
+  this.numberOfRetries = options.numberOfRetries == null ? 5 : options.numberOfRetries;
+  this.currentNumberOfRetries = this.numberOfRetries;
+  this.batchSizeValue = options.batchSize == null ? 0 : options.batchSize;
+  this.raw = options.raw == null ? false : options.raw;
+  this.read = options.read == null ? ReadPreference.PRIMARY : options.read;
+  this.returnKey = options.returnKey;
+  this.maxScan = options.maxScan;
+  this.min = options.min;
+  this.max = options.max;
+  this.showDiskLoc = options.showDiskLoc;
+  this.comment = options.comment;
+  this.tailableRetryInterval = options.tailableRetryInterval || 100;
+  this.exhaust = options.exhaust || false;
+  this.partial = options.partial || false;
+  this.slaveOk = options.slaveOk || false;
+
+  this.totalNumberOfRecords = 0;
+  this.items = [];
+  this.cursorId = Long.fromInt(0);
+
+  // This name
+  this.dbName = options.dbName;
+
+  // State variables for the cursor
+  this.state = Cursor.INIT;
+  // Keep track of the current query run
+  this.queryRun = false;
+  this.getMoreTimer = false;
+
+  // If we are using a specific db execute against it
+  if(this.dbName != null) {
+    this.collectionName = this.dbName + "." + this.collection.collectionName;
+  } else {
+    this.collectionName = (this.db.databaseName ? this.db.databaseName + "." : '') + this.collection.collectionName;
+  }
+};
+
+/**
+ * Resets this cursor to its initial state. All settings like the query string,
+ * tailable, batchSizeValue, skipValue and limits are preserved.
+ *
+ * @return {Cursor} returns itself with rewind applied.
+ * @api public
+ */
+Cursor.prototype.rewind = function() {
+  var self = this;
+
+  if (self.state != Cursor.INIT) {
+    if (self.state != Cursor.CLOSED) {
+      self.close(function() {});
+    }
+
+    self.numberOfReturned = 0;
+    self.totalNumberOfRecords = 0;
+    self.items = [];
+    self.cursorId = Long.fromInt(0);
+    self.state = Cursor.INIT;
+    self.queryRun = false;
+  }
+
+  return self;
+};
+
+
+/**
+ * Returns an array of documents. The caller is responsible for making sure that there
+ * is enough memory to store the results. Note that the array only contain partial
+ * results when this cursor had been previouly accessed. In that case,
+ * cursor.rewind() can be used to reset the cursor.
+ *
+ * @param {Function} callback This will be called after executing this method successfully. The first parameter will contain the Error object if an error occured, or null otherwise. The second parameter will contain an array of BSON deserialized objects as a result of the query.
+ * @return {null}
+ * @api public
+ */
+Cursor.prototype.toArray = function(callback) {
+  var self = this;
+
+  if(!callback) {
+    throw new Error('callback is mandatory');
+  }
+
+  if(this.tailable) {
+    callback(new Error("Tailable cursor cannot be converted to array"), null);
+  } else if(this.state != Cursor.CLOSED) {
+    // return toArrayExhaust(self, callback);
+    // If we are using exhaust we can't use the quick fire method
+    if(self.exhaust) return toArrayExhaust(self, callback);
+    // Quick fire using trampoline to avoid nextTick
+    self.nextObject({noReturn: true}, function(err, result) {
+      if(err) return callback(utils.toError(err), null);
+      if(self.cursorId.toString() == "0") {
+        self.state = Cursor.CLOSED;
+        return callback(null, self.items);
+      }
+
+      // Let's issue getMores until we have no more records waiting
+      getAllByGetMore(self, function(err, done) {
+        self.state = Cursor.CLOSED;
+        if(err) return callback(utils.toError(err), null);
+        // Let's release the internal list
+        var items = self.items;        
+        self.items = null;
+        // Return all the items
+        callback(null, items);
+      });
+    })
+
+  } else {
+    callback(new Error("Cursor is closed"), null);
+  }
+}
+
+var toArrayExhaust = function(self, callback) {
+  var items = [];
+
+  self.each(function(err, item) {
+    if(err != null) {
+      return callback(utils.toError(err), null);
+    }
+
+    if(item != null && Array.isArray(items)) {
+      items.push(item);
+    } else {
+      var resultItems = items;
+      items = null;
+      self.items = [];
+      callback(null, resultItems);
+    }
+  });
+}
+
+var getAllByGetMore = function(self, callback) {
+  getMore(self, {noReturn: true}, function(err, result) {
+    if(err) return callback(utils.toError(err));
+    if(result == null) return callback(null, null);
+    if(self.cursorId.toString() == "0") return callback(null, null);
+    getAllByGetMore(self, callback);
+  })
+}
+
+/**
+ * Iterates over all the documents for this cursor. As with **{cursor.toArray}**,
+ * not all of the elements will be iterated if this cursor had been previouly accessed.
+ * In that case, **{cursor.rewind}** can be used to reset the cursor. However, unlike
+ * **{cursor.toArray}**, the cursor will only hold a maximum of batch size elements
+ * at any given time if batch size is specified. Otherwise, the caller is responsible
+ * for making sure that the entire result can fit the memory.
+ *
+ * @param {Function} callback this will be called for while iterating every document of the query result. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the document.
+ * @return {null}
+ * @api public
+ */
+Cursor.prototype.each = function(callback) {
+  var self = this;
+  var fn;
+
+  if (!callback) {
+    throw new Error('callback is mandatory');
+  }
+
+  if(this.state != Cursor.CLOSED) {
+    // If we are using exhaust we can't use the quick fire method
+    if(self.exhaust) return eachExhaust(self, callback);
+    // Quick fire using trampoline to avoid nextTick
+    if(this.items.length > 0) {
+      // Trampoline all the entries
+      while(fn = loop(self, callback)) fn(self, callback);
+      // Call each again
+      self.each(callback);
+    } else {
+      self.nextObject(function(err, item) {
+
+        if(err) {
+          self.state = Cursor.CLOSED;
+          return callback(utils.toError(err), item);
+        }
+
+        if(item == null) return callback(null, null);
+        callback(null, item);
+        self.each(callback);
+      })
+    }
+  } else {
+    callback(new Error("Cursor is closed"), null);
+  }
+}
+
+// Special for exhaust command as we don't initiate the actual result sets
+// the server just sends them as they arrive meaning we need to get the IO event
+// loop happen so we can receive more data from the socket or we return to early
+// after the first fetch and loose all the incoming getMore's automatically issued
+// from the server.
+var eachExhaust = function(self, callback) {
+  //FIX: stack overflow (on deep callback) (cred: https://github.com/limp/node-mongodb-native/commit/27da7e4b2af02035847f262b29837a94bbbf6ce2)
+  processor(function(){
+    // Fetch the next object until there is no more objects
+    self.nextObject(function(err, item) {
+      if(err != null) return callback(err, null);
+      if(item != null) {
+        callback(null, item);
+        eachExhaust(self, callback);
+      } else {
+        // Close the cursor if done
+        self.state = Cursor.CLOSED;
+        callback(err, null);
+      }
+    });
+  });  
+}
+
+// Trampoline emptying the number of retrieved items
+// without incurring a nextTick operation
+var loop = function(self, callback) {
+  // No more items we are done
+  if(self.items.length == 0) return;
+  // Get the next document
+  var doc = self.items.shift();
+  // Callback
+  callback(null, doc);
+  // Loop
+  return loop;
+}
+
+/**
+ * Determines how many result the query for this cursor will return
+ *
+ * @param {Boolean} applySkipLimit if set to true will apply the skip and limits set on the cursor. Defaults to false.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the number of results or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Cursor.prototype.count = function(applySkipLimit, callback) {
+  if(typeof applySkipLimit == 'function') {
+    callback = applySkipLimit;
+    applySkipLimit = false;
+  }
+
+  var options = {};
+  if(applySkipLimit) {
+    if(typeof this.skipValue == 'number') options.skip = this.skipValue;
+    if(typeof this.limitValue == 'number') options.limit = this.limitValue;    
+  }
+
+  // Call count command
+  this.collection.count(this.selector, options, callback);
+};
+
+/**
+ * Sets the sort parameter of this cursor to the given value.
+ *
+ * This method has the following method signatures:
+ * (keyOrList, callback)
+ * (keyOrList, direction, callback)
+ *
+ * @param {String|Array|Object} keyOrList This can be a string or an array. If passed as a string, the string will be the field to sort. If passed an array, each element will represent a field to be sorted and should be an array that contains the format [string, direction].
+ * @param {String|Number} direction this determines how the results are sorted. "asc", "ascending" or 1 for asceding order while "desc", "desceding or -1 for descending order. Note that the strings are case insensitive.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain an error object when the cursor is already closed while the second parameter will contain a reference to this object upon successful execution.
+ * @return {Cursor} an instance of this object.
+ * @api public
+ */
+Cursor.prototype.sort = function(keyOrList, direction, callback) {
+  callback = callback || function(){};
+  if(typeof direction === "function") { callback = direction; direction = null; }
+
+  if(this.tailable) {
+    callback(new Error("Tailable cursor doesn't support sorting"), null);
+  } else if(this.queryRun == true || this.state == Cursor.CLOSED) {
+    callback(new Error("Cursor is closed"), null);
+  } else {
+    var order = keyOrList;
+
+    if(direction != null) {
+      order = [[keyOrList, direction]];
+    }
+
+    this.sortValue = order;
+    callback(null, this);
+  }
+  return this;
+};
+
+/**
+ * Sets the limit parameter of this cursor to the given value.
+ *
+ * @param {Number} limit the new limit.
+ * @param {Function} [callback] this optional callback will be called after executing this method. The first parameter will contain an error object when the limit given is not a valid number or when the cursor is already closed while the second parameter will contain a reference to this object upon successful execution.
+ * @return {Cursor} an instance of this object.
+ * @api public
+ */
+Cursor.prototype.limit = function(limit, callback) {
+  if(this.tailable) {
+    if(callback) {
+      callback(new Error("Tailable cursor doesn't support limit"), null);
+    } else {
+      throw new Error("Tailable cursor doesn't support limit");
+    }
+  } else if(this.queryRun == true || this.state == Cursor.CLOSED) {
+    if(callback) {
+      callback(new Error("Cursor is closed"), null);
+    } else {
+      throw new Error("Cursor is closed");
+    }
+  } else {
+    if(limit != null && limit.constructor != Number) {
+      if(callback) {
+        callback(new Error("limit requires an integer"), null);
+      } else {
+        throw new Error("limit requires an integer");
+      }
+    } else {
+      this.limitValue = limit;
+      if(callback) return callback(null, this);
+    }
+  }
+
+  return this;
+};
+
+/**
+ * Sets the read preference for the cursor
+ *
+ * @param {String} the read preference for the cursor, one of Server.READ_PRIMARY, Server.READ_SECONDARY, Server.READ_SECONDARY_ONLY
+ * @param {Function} [callback] this optional callback will be called after executing this method. The first parameter will contain an error object when the read preference given is not a valid number or when the cursor is already closed while the second parameter will contain a reference to this object upon successful execution.
+ * @return {Cursor} an instance of this object.
+ * @api public
+ */
+Cursor.prototype.setReadPreference = function(readPreference, tags, callback) {
+  if(typeof tags == 'function') callback = tags;
+
+  var _mode = readPreference != null && typeof readPreference == 'object' ? readPreference.mode : readPreference;
+
+  if(this.queryRun == true || this.state == Cursor.CLOSED) {
+    if(callback == null) throw new Error("Cannot change read preference on executed query or closed cursor");
+    callback(new Error("Cannot change read preference on executed query or closed cursor"));
+  } else if(_mode != null && _mode != 'primary'
+    && _mode != 'secondaryOnly' && _mode != 'secondary' 
+    && _mode != 'nearest' && _mode != 'primaryPreferred' && _mode != 'secondaryPreferred') {
+      if(callback == null) throw new Error("only readPreference of primary, secondary, secondaryPreferred, primaryPreferred or nearest supported");
+      callback(new Error("only readPreference of primary, secondary, secondaryPreferred, primaryPreferred or nearest supported"));
+  } else {
+    this.read = readPreference;
+    if(callback != null) callback(null, this);
+  }
+
+  return this;
+}
+
+/**
+ * Sets the skip parameter of this cursor to the given value.
+ *
+ * @param {Number} skip the new skip value.
+ * @param {Function} [callback] this optional callback will be called after executing this method. The first parameter will contain an error object when the skip value given is not a valid number or when the cursor is already closed while the second parameter will contain a reference to this object upon successful execution.
+ * @return {Cursor} an instance of this object.
+ * @api public
+ */
+Cursor.prototype.skip = function(skip, callback) {
+  callback = callback || function(){};
+
+  if(this.tailable) {
+    callback(new Error("Tailable cursor doesn't support skip"), null);
+  } else if(this.queryRun == true || this.state == Cursor.CLOSED) {
+    callback(new Error("Cursor is closed"), null);
+  } else {
+    if(skip != null && skip.constructor != Number) {
+      callback(new Error("skip requires an integer"), null);
+    } else {
+      this.skipValue = skip;
+      callback(null, this);
+    }
+  }
+
+  return this;
+};
+
+/**
+ * Sets the batch size parameter of this cursor to the given value.
+ *
+ * @param {Number} batchSize the new batch size.
+ * @param {Function} [callback] this optional callback will be called after executing this method. The first parameter will contain an error object when the batchSize given is not a valid number or when the cursor is already closed while the second parameter will contain a reference to this object upon successful execution.
+ * @return {Cursor} an instance of this object.
+ * @api public
+ */
+Cursor.prototype.batchSize = function(batchSize, callback) {
+  if(this.state == Cursor.CLOSED) {
+    if(callback != null) {
+      return callback(new Error("Cursor is closed"), null);
+    } else {
+      throw new Error("Cursor is closed");
+    }
+  } else if(batchSize != null && batchSize.constructor != Number) {
+    if(callback != null) {
+      return callback(new Error("batchSize requires an integer"), null);
+    } else {
+      throw new Error("batchSize requires an integer");
+    }
+  } else {
+    this.batchSizeValue = batchSize;
+    if(callback != null) return callback(null, this);
+  }
+
+  return this;
+};
+
+/**
+ * The limit used for the getMore command
+ *
+ * @return {Number} The number of records to request per batch.
+ * @ignore
+ * @api private
+ */
+var limitRequest = function(self) {
+  var requestedLimit = self.limitValue;
+  var absLimitValue = Math.abs(self.limitValue);
+  var absBatchValue = Math.abs(self.batchSizeValue);
+
+  if(absLimitValue > 0) {
+    if (absBatchValue > 0) {
+      requestedLimit = Math.min(absLimitValue, absBatchValue);
+    }
+  } else {
+    requestedLimit = self.batchSizeValue;
+  }
+
+  return requestedLimit;
+};
+
+
+/**
+ * Generates a QueryCommand object using the parameters of this cursor.
+ *
+ * @return {QueryCommand} The command object
+ * @ignore
+ * @api private
+ */
+var generateQueryCommand = function(self) {
+  // Unpack the options
+  var queryOptions = QueryCommand.OPTS_NONE;
+  if(!self.timeout) {
+    queryOptions |= QueryCommand.OPTS_NO_CURSOR_TIMEOUT;
+  }
+
+  if(self.tailable != null) {
+    queryOptions |= QueryCommand.OPTS_TAILABLE_CURSOR;
+    self.skipValue = self.limitValue = 0;
+
+    // if awaitdata is set
+    if(self.awaitdata != null) {
+      queryOptions |= QueryCommand.OPTS_AWAIT_DATA;
+    }
+  }
+
+  if(self.exhaust) {
+    queryOptions |= QueryCommand.OPTS_EXHAUST;
+  }
+
+  // Unpack the read preference to set slave ok correctly
+  var read = self.read instanceof ReadPreference ? self.read.mode : self.read;
+
+  // if(self.read == 'secondary')
+  if(read == ReadPreference.PRIMARY_PREFERRED
+    || read == ReadPreference.SECONDARY
+    || read == ReadPreference.SECONDARY_PREFERRED
+    || read == ReadPreference.NEAREST) {
+      queryOptions |= QueryCommand.OPTS_SLAVE;
+  }
+
+  // Override slaveOk from the user
+  if(self.slaveOk) {
+    queryOptions |= QueryCommand.OPTS_SLAVE;
+  }
+
+  if(self.partial) {
+    queryOptions |= QueryCommand.OPTS_PARTIAL;
+  }
+
+  // limitValue of -1 is a special case used by Db#eval
+  var numberToReturn = self.limitValue == -1 ? -1 : limitRequest(self);
+
+  // Check if we need a special selector
+  if(self.sortValue != null || self.explainValue != null || self.hint != null || self.snapshot != null
+      || self.returnKey != null || self.maxScan != null || self.min != null || self.max != null
+      || self.showDiskLoc != null || self.comment != null) {
+
+    // Build special selector
+    var specialSelector = {'$query':self.selector};
+    if(self.sortValue != null) specialSelector['orderby'] = utils.formattedOrderClause(self.sortValue);
+    if(self.hint != null && self.hint.constructor == Object) specialSelector['$hint'] = self.hint;
+    if(self.snapshot != null) specialSelector['$snapshot'] = true;
+    if(self.returnKey != null) specialSelector['$returnKey'] = self.returnKey;
+    if(self.maxScan != null) specialSelector['$maxScan'] = self.maxScan;
+    if(self.min != null) specialSelector['$min'] = self.min;
+    if(self.max != null) specialSelector['$max'] = self.max;
+    if(self.showDiskLoc != null) specialSelector['$showDiskLoc'] = self.showDiskLoc;
+    if(self.comment != null) specialSelector['$comment'] = self.comment;
+    // If we have explain set only return a single document with automatic cursor close
+    if(self.explainValue != null) {
+      numberToReturn = (-1)*Math.abs(numberToReturn);
+      specialSelector['$explain'] = true;
+    }
+
+    // Return the query
+    return new QueryCommand(self.db, self.collectionName, queryOptions, self.skipValue, numberToReturn, specialSelector, self.fields);
+  } else {
+    return new QueryCommand(self.db, self.collectionName, queryOptions, self.skipValue, numberToReturn, self.selector, self.fields);
+  }
+};
+
+/**
+ * @return {Object} Returns an object containing the sort value of this cursor with
+ *     the proper formatting that can be used internally in this cursor.
+ * @ignore
+ * @api private
+ */
+Cursor.prototype.formattedOrderClause = function() {
+  return utils.formattedOrderClause(this.sortValue);
+};
+
+/**
+ * Converts the value of the sort direction into its equivalent numerical value.
+ *
+ * @param sortDirection {String|number} Range of acceptable values:
+ *     'ascending', 'descending', 'asc', 'desc', 1, -1
+ *
+ * @return {number} The equivalent numerical value
+ * @throws Error if the given sortDirection is invalid
+ * @ignore
+ * @api private
+ */
+Cursor.prototype.formatSortValue = function(sortDirection) {
+  return utils.formatSortValue(sortDirection);
+};
+
+/**
+ * Gets the next document from the cursor.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain an error object on error while the second parameter will contain a document from the returned result or null if there are no more results.
+ * @api public
+ */
+Cursor.prototype.nextObject = function(options, callback) {
+  var self = this;
+
+  if(typeof options == 'function') {
+    callback = options;
+    options = {};
+  }
+
+  if(self.state == Cursor.INIT) {
+    var cmd;
+    try {
+      cmd = generateQueryCommand(self);
+    } catch (err) {
+      return callback(err, null);
+    }
+
+    var queryOptions = {exhaust: self.exhaust, raw:self.raw, read:self.read, connection:self.connection};
+    // Execute command
+    var commandHandler = function(err, result) {
+      // If on reconnect, the command got given a different connection, switch
+      // the whole cursor to it.
+      self.connection = queryOptions.connection;
+      self.state = Cursor.OPEN;
+      if(err != null && result == null) return callback(utils.toError(err), null);
+
+      if(err == null && (result == null || result.documents == null)) {
+        return self.close(function() {callback(null, null);});
+      }
+
+      if(err == null && result && result.documents[0] && result.documents[0]['$err']) {
+        return self.close(function() {callback(utils.toError(result.documents[0]['$err']), null);});
+      }
+
+      self.queryRun = true;
+      self.state = Cursor.OPEN; // Adjust the state of the cursor
+      self.cursorId = result.cursorId;
+      self.totalNumberOfRecords = result.numberReturned;
+
+      // Add the new documents to the list of items, using forloop to avoid
+      // new array allocations and copying
+      for(var i = 0; i < result.documents.length; i++) {
+        self.items.push(result.documents[i]);
+      }
+
+      // If we have noReturn set just return (not modifying the internal item list)
+      // used for toArray
+      if(options.noReturn) {
+        return callback(null, true);
+      }
+
+      // Ignore callbacks until the cursor is dead for exhausted
+      if(self.exhaust && result.cursorId.toString() == "0") {
+        self.nextObject(callback);
+      } else if(self.exhaust == false || self.exhaust == null) {
+        self.nextObject(callback);
+      }
+    };
+
+    // If we have no connection set on this cursor check one out
+    if(self.connection == null) {
+      try {
+        // self.connection = this.read == null ? self.db.serverConfig.checkoutWriter() : self.db.serverConfig.checkoutReader(this.read);
+        self.connection = self.db.serverConfig.checkoutReader(this.read);
+      } catch(err) {
+        return callback(utils.toError(err), null);
+      }
+    }
+
+    // Execute the command
+    self.db._executeQueryCommand(cmd, queryOptions, commandHandler);
+    // Set the command handler to null
+    commandHandler = null;
+  } else if(self.items.length) {
+    callback(null, self.items.shift());
+  } else if(self.cursorId.greaterThan(Long.fromInt(0))) {
+    getMore(self, callback);
+  } else {
+    // Force cursor to stay open
+    return self.close(function() {callback(null, null);});
+  }
+}
+
+/**
+ * Gets more results from the database if any.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain an error object on error while the second parameter will contain a document from the returned result or null if there are no more results.
+ * @ignore
+ * @api private
+ */
+var getMore = function(self, options, callback) {
+  var limit = 0;
+
+  if(typeof options == 'function') {
+    callback = options;
+    options = {};
+  }
+
+  if(self.state == Cursor.GET_MORE) return callback(null, null);
+
+  // Set get more in progress
+  self.state = Cursor.GET_MORE;
+
+  // Set options
+  if (!self.tailable && self.limitValue > 0) {
+    limit = self.limitValue - self.totalNumberOfRecords;
+    if (limit < 1) {
+      self.close(function() {callback(null, null);});
+      return;
+    }
+  }
+
+  try {
+    var getMoreCommand = new GetMoreCommand(
+        self.db
+      , self.collectionName
+      , limitRequest(self)
+      , self.cursorId
+    );
+
+    // Set up options
+    var command_options = {read: self.read, raw: self.raw, connection:self.connection };
+
+    // Execute the command
+    self.db._executeQueryCommand(getMoreCommand, command_options, function(err, result) {
+      var cbValue;
+
+      // Get more done
+      self.state = Cursor.OPEN;
+
+      if(err != null) {
+        return callback(utils.toError(err), null);
+      }
+
+      try {
+        var isDead = 1 === result.responseFlag && result.cursorId.isZero();
+
+        self.cursorId = result.cursorId;
+        self.totalNumberOfRecords += result.numberReturned;
+
+        // Determine if there's more documents to fetch
+        if(result.numberReturned > 0) {
+          if (self.limitValue > 0) {
+            var excessResult = self.totalNumberOfRecords - self.limitValue;
+
+            if (excessResult > 0) {
+              result.documents.splice(-1 * excessResult, excessResult);
+            }
+          }
+
+          // Reset the tries for awaitdata if we are using it
+          self.currentNumberOfRetries = self.numberOfRetries;
+          // Get the documents
+          for(var i = 0; i < result.documents.length; i++) {
+            self.items.push(result.documents[i]);
+          }
+
+          // Don's shift a document out as we need it for toArray
+          if(options.noReturn) {
+            cbValue = true;
+          } else {
+            cbValue = self.items.shift();
+          }          
+        } else if(self.tailable && !isDead && self.awaitdata) {
+          // Excute the tailable cursor once more, will timeout after ~4 sec if awaitdata used
+          self.currentNumberOfRetries = self.currentNumberOfRetries - 1;
+          if(self.currentNumberOfRetries == 0) {
+            self.close(function() {
+              callback(new Error("tailable cursor timed out"), null);
+            });
+          } else {
+            getMore(self, callback);
+          }
+        } else if(self.tailable && !isDead) {
+          self.getMoreTimer = setTimeout(function() { getMore(self, callback); }, self.tailableRetryInterval);
+        } else {
+          self.close(function() {callback(null, null); });
+        }
+
+        result = null;
+      } catch(err) {
+        callback(utils.toError(err), null);
+      }
+      if (cbValue != null) callback(null, cbValue);
+    });
+
+    getMoreCommand = null;
+  } catch(err) {
+    // Get more done
+    self.state = Cursor.OPEN;
+
+    var handleClose = function() {
+      callback(utils.toError(err), null);
+    };
+
+    self.close(handleClose);
+    handleClose = null;
+  }
+}
+
+/**
+ * Gets a detailed information about how the query is performed on this cursor and how
+ * long it took the database to process it.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will always be null while the second parameter will be an object containing the details.
+ * @api public
+ */
+Cursor.prototype.explain = function(callback) {
+  var limit = (-1)*Math.abs(this.limitValue);
+
+  // Create a new cursor and fetch the plan
+  var cursor = new Cursor(this.db, this.collection, this.selector, this.fields, {
+      skip: this.skipValue
+    , limit:limit
+    , sort: this.sortValue
+    , hint: this.hint
+    , explain: true
+    , snapshot: this.snapshot
+    , timeout: this.timeout
+    , tailable: this.tailable
+    , batchSize: this.batchSizeValue
+    , slaveOk: this.slaveOk
+    , raw: this.raw
+    , read: this.read
+    , returnKey: this.returnKey
+    , maxScan: this.maxScan
+    , min: this.min
+    , max: this.max
+    , showDiskLoc: this.showDiskLoc
+    , comment: this.comment
+    , awaitdata: this.awaitdata
+    , numberOfRetries: this.numberOfRetries
+    , dbName: this.dbName
+  });
+  
+  // Fetch the explaination document
+  cursor.nextObject(function(err, item) {
+    if(err != null) return callback(utils.toError(err), null);
+    // close the cursor
+    cursor.close(function(err, result) {
+      if(err != null) return callback(utils.toError(err), null);
+      callback(null, item);
+    });
+  });
+};
+
+/**
+ * Returns a Node ReadStream interface for this cursor.
+ *
+ * Options
+ *  - **transform** {Function} function of type function(object) { return transformed }, allows for transformation of data before emitting.
+ *
+ * @return {CursorStream} returns a stream object.
+ * @api public
+ */
+Cursor.prototype.stream = function stream(options) {
+  return new CursorStream(this, options);
+}
+
+/**
+ * Close the cursor.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will always contain null while the second parameter will contain a reference to this cursor.
+ * @return {null}
+ * @api public
+ */
+Cursor.prototype.close = function(callback) {
+  var self = this
+  this.getMoreTimer && clearTimeout(this.getMoreTimer);
+  // Close the cursor if not needed
+  if(this.cursorId instanceof Long && this.cursorId.greaterThan(Long.fromInt(0))) {
+    try {
+      var command = new KillCursorCommand(this.db, [this.cursorId]);
+      // Added an empty callback to ensure we don't throw any null exceptions
+      this.db._executeQueryCommand(command, {read:self.read, raw:self.raw, connection:self.connection}, function() {});
+    } catch(err) {}
+  }
+
+  // Null out the connection
+  self.connection = null;
+  // Reset cursor id
+  this.cursorId = Long.fromInt(0);
+  // Set to closed status
+  this.state = Cursor.CLOSED;
+
+  if(callback) {
+    callback(null, self);
+    self.items = [];
+  }
+
+  return this;
+};
+
+/**
+ * Check if the cursor is closed or open.
+ *
+ * @return {Boolean} returns the state of the cursor.
+ * @api public
+ */
+Cursor.prototype.isClosed = function() {
+  return this.state == Cursor.CLOSED ? true : false;
+};
+
+/**
+ * Init state
+ *
+ * @classconstant INIT
+ **/
+Cursor.INIT = 0;
+
+/**
+ * Cursor open
+ *
+ * @classconstant OPEN
+ **/
+Cursor.OPEN = 1;
+
+/**
+ * Cursor closed
+ *
+ * @classconstant CLOSED
+ **/
+Cursor.CLOSED = 2;
+
+/**
+ * Cursor performing a get more
+ *
+ * @classconstant OPEN
+ **/
+Cursor.GET_MORE = 3;
+
+/**
+ * @ignore
+ * @api private
+ */
+exports.Cursor =  Cursor;
diff --git a/node_modules/mongodb/lib/mongodb/cursorstream.js b/node_modules/mongodb/lib/mongodb/cursorstream.js
new file mode 100644
index 0000000..2752091
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/cursorstream.js
@@ -0,0 +1,164 @@
+var timers = require('timers');
+
+// Set processor, setImmediate if 0.10 otherwise nextTick
+var processor = timers.setImmediate ? timers.setImmediate : process.nextTick;
+
+/**
+ * Module dependecies.
+ */
+var Stream = require('stream').Stream;
+
+/**
+ * CursorStream
+ *
+ * Returns a stream interface for the **cursor**.
+ *
+ * Options
+ *  - **transform** {Function} function of type function(object) { return transformed }, allows for transformation of data before emitting.
+ *
+ * Events
+ *  - **data** {function(item) {}} the data event triggers when a document is ready.
+ *  - **error** {function(err) {}} the error event triggers if an error happens.
+ *  - **close** {function() {}} the end event triggers when there is no more documents available.
+ *
+ * @class Represents a CursorStream.
+ * @param {Cursor} cursor a cursor object that the stream wraps.
+ * @return {Stream}
+ */
+function CursorStream(cursor, options) {
+  if(!(this instanceof CursorStream)) return new CursorStream(cursor);
+  options = options ? options : {};
+
+  Stream.call(this);
+
+  this.readable = true;
+  this.paused = false;
+  this._cursor = cursor;
+  this._destroyed = null;
+  this.options = options;
+
+  // give time to hook up events
+  var self = this;
+  process.nextTick(function() {
+    self._init();      
+  });
+}
+
+/**
+ * Inherit from Stream
+ * @ignore
+ * @api private
+ */
+CursorStream.prototype.__proto__ = Stream.prototype;
+
+/**
+ * Flag stating whether or not this stream is readable.
+ */
+CursorStream.prototype.readable;
+
+/**
+ * Flag stating whether or not this stream is paused.
+ */
+CursorStream.prototype.paused;
+
+/**
+ * Initialize the cursor.
+ * @ignore
+ * @api private
+ */
+CursorStream.prototype._init = function () {
+  if (this._destroyed) return;
+  this._next();
+}
+
+/**
+ * Pull the next document from the cursor.
+ * @ignore
+ * @api private
+ */
+CursorStream.prototype._next = function () {
+  if(this.paused || this._destroyed) return;
+
+  var self = this;
+  // Get the next object
+  processor(function() {
+    if(self.paused || self._destroyed) return;
+
+    self._cursor.nextObject(function (err, doc) {
+      self._onNextObject(err, doc);
+    });    
+  });
+}
+
+/**
+ * Handle each document as its returned from the cursor.
+ * @ignore
+ * @api private
+ */
+CursorStream.prototype._onNextObject = function (err, doc) {
+  if(err) return this.destroy(err);
+
+  // when doc is null we hit the end of the cursor
+  if(!doc && (this._cursor.state == 1 || this._cursor.state == 2)) {
+    this.emit('end')
+    return this.destroy();
+  } else if(doc) {
+    var data = typeof this.options.transform == 'function' ? this.options.transform(doc) : doc;
+    this.emit('data', data);
+    this._next();
+  }
+}
+
+/**
+ * Pauses the stream.
+ *
+ * @api public
+ */
+CursorStream.prototype.pause = function () {
+  this.paused = true;
+}
+
+/**
+ * Resumes the stream.
+ *
+ * @api public
+ */
+CursorStream.prototype.resume = function () {
+  var self = this;
+
+  // Don't do anything if we are not paused
+  if(!this.paused) return;
+  if(!this._cursor.state == 3) return;
+
+  process.nextTick(function() {
+    self.paused = false;
+    // Only trigger more fetching if the cursor is open
+    self._next();
+  })
+}
+
+/**
+ * Destroys the stream, closing the underlying
+ * cursor. No more events will be emitted.
+ *
+ * @api public
+ */
+CursorStream.prototype.destroy = function (err) {
+  if (this._destroyed) return;
+  this._destroyed = true;
+  this.readable = false;
+
+  this._cursor.close();
+
+  if(err) {
+    this.emit('error', err);
+  }
+
+  this.emit('close');
+}
+
+// TODO - maybe implement the raw option to pass binary?
+//CursorStream.prototype.setEncoding = function () {
+//}
+
+module.exports = exports = CursorStream;
diff --git a/node_modules/mongodb/lib/mongodb/db.js b/node_modules/mongodb/lib/mongodb/db.js
new file mode 100644
index 0000000..04620f3
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/db.js
@@ -0,0 +1,1932 @@
+/**
+ * Module dependencies.
+ * @ignore
+ */
+var QueryCommand = require('./commands/query_command').QueryCommand
+  , DbCommand = require('./commands/db_command').DbCommand
+  , MongoReply = require('./responses/mongo_reply').MongoReply
+  , Admin = require('./admin').Admin
+  , Collection = require('./collection').Collection
+  , Server = require('./connection/server').Server
+  , ReplSet = require('./connection/repl_set/repl_set').ReplSet
+  , ReadPreference = require('./connection/read_preference').ReadPreference
+  , Mongos = require('./connection/mongos').Mongos
+  , Cursor = require('./cursor').Cursor
+  , EventEmitter = require('events').EventEmitter
+  , inherits = require('util').inherits
+  , crypto = require('crypto')
+  , timers = require('timers')
+  , utils = require('./utils')
+  , mongodb_cr_authenticate = require('./auth/mongodb_cr.js').authenticate
+  , mongodb_gssapi_authenticate = require('./auth/mongodb_gssapi.js').authenticate
+  , mongodb_sspi_authenticate = require('./auth/mongodb_sspi.js').authenticate;
+
+var hasKerberos = false;
+// Check if we have a the kerberos library
+try {
+  require('kerberos');
+  hasKerberos = true;
+} catch(err) {}
+
+// Set processor, setImmediate if 0.10 otherwise nextTick
+var processor = timers.setImmediate ? timers.setImmediate : process.nextTick;
+
+/**
+ * Create a new Db instance.
+ *
+ * Options
+ *  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **readPreference** {String}, the prefered read preference (ReadPreference.PRIMARY, ReadPreference.PRIMARY_PREFERRED, ReadPreference.SECONDARY, ReadPreference.SECONDARY_PREFERRED, ReadPreference.NEAREST).
+ *  - **native_parser** {Boolean, default:false}, use c++ bson parser.
+ *  - **forceServerObjectId** {Boolean, default:false}, force server to create _id fields instead of client.
+ *  - **pkFactory** {Object}, object overriding the basic ObjectID primary key generation.
+ *  - **serializeFunctions** {Boolean, default:false}, serialize functions.
+ *  - **raw** {Boolean, default:false}, peform operations using raw bson buffers.
+ *  - **recordQueryStats** {Boolean, default:false}, record query statistics during execution.
+ *  - **retryMiliSeconds** {Number, default:5000}, number of miliseconds between retries.
+ *  - **numberOfRetries** {Number, default:5}, number of retries off connection.
+ *  - **logger** {Object, default:null}, an object representing a logger that you want to use, needs to support functions debug, log, error **({error:function(message, object) {}, log:function(message, object) {}, debug:function(message, object) {}})**.
+ *  - **slaveOk** {Number, default:null}, force setting of SlaveOk flag on queries (only use when explicitly connecting to a secondary server).
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @class Represents a Db
+ * @param {String} databaseName name of the database.
+ * @param {Object} serverConfig server config object.
+ * @param {Object} [options] additional options for the collection.
+ */
+function Db(databaseName, serverConfig, options) {
+  if(!(this instanceof Db)) return new Db(databaseName, serverConfig, options);
+  EventEmitter.call(this);
+
+  var self = this;
+  this.databaseName = databaseName;
+  this.serverConfig = serverConfig;
+  this.options = options == null ? {} : options;
+  // State to check against if the user force closed db
+  this._applicationClosed = false;
+  // Fetch the override flag if any
+  var overrideUsedFlag = this.options['override_used_flag'] == null ? false : this.options['override_used_flag'];
+
+  // Verify that nobody is using this config
+  if(!overrideUsedFlag && this.serverConfig != null && typeof this.serverConfig == 'object' && this.serverConfig._isUsed && this.serverConfig._isUsed()) {    
+    throw new Error("A Server or ReplSet instance cannot be shared across multiple Db instances");
+  } else if(!overrideUsedFlag && typeof this.serverConfig == 'object'){
+    // Set being used
+    this.serverConfig._used = true;
+  }
+
+  // Allow slaveOk override
+  this.slaveOk = this.options["slave_ok"] == null ? false : this.options["slave_ok"];
+  this.slaveOk = this.options["slaveOk"] == null ? this.slaveOk : this.options["slaveOk"];
+
+  // Ensure we have a valid db name
+  validateDatabaseName(databaseName);
+
+  // Contains all the connections for the db
+  try {
+    this.native_parser = this.options.native_parser;
+    // The bson lib
+    var bsonLib = this.bsonLib = this.options.native_parser ? require('bson').BSONNative : require('bson').BSONPure;
+    // Fetch the serializer object
+    var BSON = bsonLib.BSON;
+    // Create a new instance
+    this.bson = new BSON([bsonLib.Long, bsonLib.ObjectID, bsonLib.Binary, bsonLib.Code, bsonLib.DBRef, bsonLib.Symbol, bsonLib.Double, bsonLib.Timestamp, bsonLib.MaxKey, bsonLib.MinKey]);
+    // Backward compatibility to access types
+    this.bson_deserializer = bsonLib;
+    this.bson_serializer = bsonLib;
+  } catch (err) {
+    // If we tried to instantiate the native driver
+    var msg = "Native bson parser not compiled, please compile "
+            + "or avoid using native_parser=true";
+    throw Error(msg);
+  }
+
+  // Internal state of the server
+  this._state = 'disconnected';
+
+  this.pkFactory = this.options.pk == null ? bsonLib.ObjectID : this.options.pk;
+  this.forceServerObjectId = this.options.forceServerObjectId != null ? this.options.forceServerObjectId : false;
+
+  // Added safe
+  this.safe = this.options.safe == null ? false : this.options.safe;  
+
+  // If we have not specified a "safe mode" we just print a warning to the console
+  if(this.options.safe == null && this.options.w == null && this.options.journal == null && this.options.fsync == null) {
+    console.log("========================================================================================");
+    console.log("=  Please ensure that you set the default write concern for the database by setting    =");
+    console.log("=   one of the options                                                                 =");
+    console.log("=                                                                                      =");
+    console.log("=     w: (value of > -1 or the string 'majority'), where < 1 means                     =");
+    console.log("=        no write acknowlegement                                                       =");
+    console.log("=     journal: true/false, wait for flush to journal before acknowlegement             =");
+    console.log("=     fsync: true/false, wait for flush to file system before acknowlegement           =");
+    console.log("=                                                                                      =");
+    console.log("=  For backward compatibility safe is still supported and                              =");
+    console.log("=   allows values of [true | false | {j:true} | {w:n, wtimeout:n} | {fsync:true}]      =");
+    console.log("=   the default value is false which means the driver receives does not                =");
+    console.log("=   return the information of the success/error of the insert/update/remove            =");
+    console.log("=                                                                                      =");
+    console.log("=   ex: new Db(new Server('localhost', 27017), {safe:false})                           =");
+    console.log("=                                                                                      =");
+    console.log("=   http://www.mongodb.org/display/DOCS/getLastError+Command                           =");
+    console.log("=                                                                                      =");
+    console.log("=  The default of no acknowlegement will change in the very near future                =");
+    console.log("=                                                                                      =");
+    console.log("=  This message will disappear when the default safe is set on the driver Db           =");
+    console.log("========================================================================================");
+  }
+
+  // Internal states variables
+  this.notReplied ={};
+  this.isInitializing = true;
+  this.openCalled = false;
+
+  // Command queue, keeps a list of incoming commands that need to be executed once the connection is up
+  this.commands = [];
+
+  // Set up logger
+  this.logger = this.options.logger != null
+    && (typeof this.options.logger.debug == 'function')
+    && (typeof this.options.logger.error == 'function')
+    && (typeof this.options.logger.log == 'function')
+      ? this.options.logger : {error:function(message, object) {}, log:function(message, object) {}, debug:function(message, object) {}};
+
+  // Associate the logger with the server config
+  this.serverConfig.logger = this.logger;
+  if(this.serverConfig.strategyInstance) this.serverConfig.strategyInstance.logger = this.logger;
+  this.tag = new Date().getTime();
+  // Just keeps list of events we allow
+  this.eventHandlers = {error:[], parseError:[], poolReady:[], message:[], close:[]};
+
+  // Controls serialization options
+  this.serializeFunctions = this.options.serializeFunctions != null ? this.options.serializeFunctions : false;
+
+  // Raw mode
+  this.raw = this.options.raw != null ? this.options.raw : false;
+
+  // Record query stats
+  this.recordQueryStats = this.options.recordQueryStats != null ? this.options.recordQueryStats : false;
+
+  // If we have server stats let's make sure the driver objects have it enabled
+  if(this.recordQueryStats == true) {
+    this.serverConfig.enableRecordQueryStats(true);
+  }
+
+  // Retry information
+  this.retryMiliSeconds = this.options.retryMiliSeconds != null ? this.options.retryMiliSeconds : 1000;
+  this.numberOfRetries = this.options.numberOfRetries != null ? this.options.numberOfRetries : 60;
+
+  // Set default read preference if any
+  this.readPreference = this.options.readPreference;
+
+  // Set read preference on serverConfig if none is set
+  // but the db one was
+  if(this.serverConfig.options.readPreference == null
+    && this.readPreference != null) {
+      this.serverConfig.setReadPreference(this.readPreference);
+  }
+
+  // Ensure we keep a reference to this db
+  this.serverConfig._dbStore.add(this);
+};
+
+/**
+ * @ignore
+ */
+function validateDatabaseName(databaseName) {
+  if(typeof databaseName !== 'string') throw new Error("database name must be a string");
+  if(databaseName.length === 0) throw new Error("database name cannot be the empty string");
+
+  var invalidChars = [" ", ".", "$", "/", "\\"];
+  for(var i = 0; i < invalidChars.length; i++) {
+    if(databaseName.indexOf(invalidChars[i]) != -1) throw new Error("database names cannot contain the character '" + invalidChars[i] + "'");
+  }
+}
+
+/**
+ * @ignore
+ */
+inherits(Db, EventEmitter);
+
+/**
+ * Initialize the database connection.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the index information or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.open = function(callback) {
+  var self = this;
+
+  // Check that the user has not called this twice
+  if(this.openCalled) {
+    // Close db
+    this.close();
+    // Throw error
+    throw new Error("db object already connecting, open cannot be called multiple times");
+  }
+
+  // If we have a specified read preference
+  if(this.readPreference != null) this.serverConfig.setReadPreference(this.readPreference);
+
+  // Set that db has been opened
+  this.openCalled = true;
+
+  // Set the status of the server
+  self._state = 'connecting';
+  
+  // Set up connections
+  if(self.serverConfig instanceof Server || self.serverConfig instanceof ReplSet || self.serverConfig instanceof Mongos) {
+    // Ensure we have the original options passed in for the server config
+    var connect_options = {};
+    for(var name in self.serverConfig.options) {
+      connect_options[name] = self.serverConfig.options[name]
+    }
+    connect_options.firstCall = true;
+
+    // Attempt to connect
+    self.serverConfig.connect(self, connect_options, function(err, result) {
+      if(err != null) {
+        // Set that db has been closed
+        self.openCalled = false;
+        // Return error from connection
+        return callback(err, null);
+      }
+      // Set the status of the server
+      self._state = 'connected';
+      // If we have queued up commands execute a command to trigger replays
+      if(self.commands.length > 0) _execute_queued_command(self);
+      // Callback
+      return callback(null, self);
+    });
+  } else {
+    return callback(Error("Server parameter must be of type Server, ReplSet or Mongos"), null);
+  }
+};
+
+/**
+ * Create a new Db instance sharing the current socket connections.
+ *
+ * @param {String} dbName the name of the database we want to use.
+ * @return {Db} a db instance using the new database.
+ * @api public
+ */
+Db.prototype.db = function(dbName) {
+  // Copy the options and add out internal override of the not shared flag
+  var options = {};
+  for(var key in this.options) {
+    options[key] = this.options[key];
+  }
+
+  // Add override flag
+  options['override_used_flag'] = true;
+  // Create a new db instance
+  var newDbInstance = new Db(dbName, this.serverConfig, options);
+  // Add the instance to the list of approved db instances
+  var allServerInstances = this.serverConfig.allServerInstances();
+  // Add ourselves to all server callback instances
+  for(var i = 0; i < allServerInstances.length; i++) {
+    // var server = allServerInstances[i];
+    // server.dbInstances.push(newDbInstance);
+    this.serverConfig._dbStore.add(newDbInstance);
+  }
+  // Return new db object
+  return newDbInstance;  
+}
+
+/**
+ * Close the current db connection, including all the child db instances. Emits close event if no callback is provided.
+ *
+ * @param {Boolean} [forceClose] connection can never be reused.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.close = function(forceClose, callback) {
+  var self = this;
+  // Ensure we force close all connections
+  this._applicationClosed = false;
+
+  if(typeof forceClose == 'function') {
+    callback = forceClose;
+  } else if(typeof forceClose == 'boolean') {
+    this._applicationClosed = forceClose;
+  }
+
+  this.serverConfig.close(function(err, result) {
+    // You can reuse the db as everything is shut down
+    self.openCalled = false;
+    // If we have a callback call it
+    if(callback) callback(err, result);    
+  });
+};
+
+/**
+ * Access the Admin database
+ *
+ * @param {Function} [callback] returns the results.
+ * @return {Admin} the admin db object.
+ * @api public
+ */
+Db.prototype.admin = function(callback) {
+  if(callback == null) return new Admin(this);
+  callback(null, new Admin(this));
+};
+
+/**
+ * Returns a cursor to all the collection information.
+ *
+ * @param {String} [collectionName] the collection name we wish to retrieve the information from.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the options or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.collectionsInfo = function(collectionName, callback) {
+  if(callback == null && typeof collectionName == 'function') { callback = collectionName; collectionName = null; }
+  // Create selector
+  var selector = {};
+  // If we are limiting the access to a specific collection name
+  if(collectionName != null) selector.name = this.databaseName + "." + collectionName;
+
+  // Return Cursor
+  // callback for backward compatibility
+  if(callback) {
+    callback(null, new Cursor(this, new Collection(this, DbCommand.SYSTEM_NAMESPACE_COLLECTION), selector));
+  } else {
+    return new Cursor(this, new Collection(this, DbCommand.SYSTEM_NAMESPACE_COLLECTION), selector);
+  }
+};
+
+/**
+ * Get the list of all collection names for the specified db
+ *
+ * Options
+ *  - **namesOnly** {String, default:false}, Return only the full collection namespace.
+ *
+ * @param {String} [collectionName] the collection name we wish to filter by.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the collection names or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.collectionNames = function(collectionName, options, callback) {
+  var self = this;
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  collectionName = args.length ? args.shift() : null;
+  options = args.length ? args.shift() || {} : {};
+
+  // Ensure no breaking behavior
+  if(collectionName != null && typeof collectionName == 'object') {
+    options = collectionName;
+    collectionName = null;
+  }
+
+  // Let's make our own callback to reuse the existing collections info method
+  self.collectionsInfo(collectionName, function(err, cursor) {
+    if(err != null) return callback(err, null);
+
+    cursor.toArray(function(err, documents) {
+      if(err != null) return callback(err, null);
+
+      // List of result documents that have been filtered
+      var filtered_documents = documents.filter(function(document) {
+        return !(document.name.indexOf(self.databaseName) == -1 || document.name.indexOf('$') != -1);
+      });
+
+      // If we are returning only the names
+      if(options.namesOnly) {
+        filtered_documents = filtered_documents.map(function(document) { return document.name });
+      }
+
+      // Return filtered items
+      callback(null, filtered_documents);
+    });
+  });
+};
+
+/**
+ * Fetch a specific collection (containing the actual collection information). If the application does not use strict mode you can
+ * can use it without a callback in the following way. var collection = db.collection('mycollection');
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **serializeFunctions** {Boolean, default:false}, serialize functions on the document.
+ *  - **raw** {Boolean, default:false}, perform all operations using raw bson objects.
+ *  - **pkFactory** {Object}, object overriding the basic ObjectID primary key generation.
+ *  - **readPreference** {String}, the prefered read preference (ReadPreference.PRIMARY, ReadPreference.PRIMARY_PREFERRED, ReadPreference.SECONDARY, ReadPreference.SECONDARY_PREFERRED, ReadPreference.NEAREST).
+ *  - **strict**, (Boolean, default:false) throws an error if the collection does not exist
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {String} collectionName the collection name we wish to access.
+ * @param {Object} [options] returns option results.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the collection or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.collection = function(collectionName, options, callback) {
+  var self = this;
+  if(typeof options === "function") { callback = options; options = {}; }
+  // Execute safe
+
+  if(options && (options.strict)) {
+    self.collectionNames(collectionName, function(err, collections) {
+      if(err != null) return callback(err, null);
+
+      if(collections.length == 0) {
+        return callback(new Error("Collection " + collectionName + " does not exist. Currently in safe mode."), null);
+      } else {
+        try {
+          var collection = new Collection(self, collectionName, self.pkFactory, options);
+        } catch(err) {
+          return callback(err, null);
+        }
+        return callback(null, collection);
+      }
+    });
+  } else {
+    try {
+      var collection = new Collection(self, collectionName, self.pkFactory, options);
+    } catch(err) {
+      if(callback == null) {
+        throw err;
+      } else {
+        return callback(err, null);
+      }
+    }
+
+    // If we have no callback return collection object
+    return callback == null ? collection : callback(null, collection);
+  }
+};
+
+/**
+ * Fetch all collections for the current db.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the collections or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.collections = function(callback) {
+  var self = this;
+  // Let's get the collection names
+  self.collectionNames(function(err, documents) {
+    if(err != null) return callback(err, null);
+    var collections = [];
+    documents.forEach(function(document) {
+      collections.push(new Collection(self, document.name.replace(self.databaseName + ".", ''), self.pkFactory));
+    });
+    // Return the collection objects
+    callback(null, collections);
+  });
+};
+
+/**
+ * Evaluate javascript on the server
+ *
+ * Options
+ *  - **nolock** {Boolean, default:false}, Tell MongoDB not to block on the evaulation of the javascript.
+ *
+ * @param {Code} code javascript to execute on server.
+ * @param {Object|Array} [parameters] the parameters for the call.
+ * @param {Object} [options] the options
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from eval or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.eval = function(code, parameters, options, callback) {
+  // Unpack calls
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  parameters = args.length ? args.shift() : parameters;
+  options = args.length ? args.shift() || {} : {};
+
+  var finalCode = code;
+  var finalParameters = [];
+  // If not a code object translate to one
+  if(!(finalCode instanceof this.bsonLib.Code)) {
+    finalCode = new this.bsonLib.Code(finalCode);
+  }
+
+  // Ensure the parameters are correct
+  if(parameters != null && parameters.constructor != Array && typeof parameters !== 'function') {
+    finalParameters = [parameters];
+  } else if(parameters != null && parameters.constructor == Array && typeof parameters !== 'function') {
+    finalParameters = parameters;
+  }
+
+  // Create execution selector
+  var selector = {'$eval':finalCode, 'args':finalParameters};
+  // Check if the nolock parameter is passed in
+  if(options['nolock']) {
+    selector['nolock'] = options['nolock'];
+  }
+
+  // Set primary read preference
+  options.readPreference = ReadPreference.PRIMARY;
+
+  // Execute the eval
+  this.collection(DbCommand.SYSTEM_COMMAND_COLLECTION).findOne(selector, options, function(err, result) {
+    if(err) return callback(err);
+
+    if(result && result.ok == 1) {
+      callback(null, result.retval);
+    } else if(result) {
+      callback(new Error("eval failed: " + result.errmsg), null); return;
+    } else {
+      callback(err, result);
+    }
+  });
+};
+
+/**
+ * Dereference a dbref, against a db
+ *
+ * @param {DBRef} dbRef db reference object we wish to resolve.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from dereference or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.dereference = function(dbRef, callback) {
+  var db = this;
+  // If we have a db reference then let's get the db first
+  if(dbRef.db != null) db = this.db(dbRef.db);
+  // Fetch the collection and find the reference
+  var collection = db.collection(dbRef.namespace);
+  collection.findOne({'_id':dbRef.oid}, function(err, result) {
+    callback(err, result);
+  });
+};
+
+/**
+ * Logout user from server, fire off on all connections and remove all auth info
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from logout or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.logout = function(options, callback) {
+  var self = this;
+  // Unpack calls
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  options = args.length ? args.shift() || {} : {};
+
+  // Number of connections we need to logout from
+  var numberOfConnections = this.serverConfig.allRawConnections().length;
+
+  // Let's generate the logout command object
+  var logoutCommand = DbCommand.logoutCommand(self, {logout:1}, options);
+  self._executeQueryCommand(logoutCommand, {onAll:true}, function(err, result) {
+    // Count down
+    numberOfConnections = numberOfConnections - 1;
+    // Work around the case where the number of connections are 0
+    if(numberOfConnections <= 0 && typeof callback == 'function') {
+      var internalCallback = callback;
+      callback = null;
+
+      // Remove the db from auths
+      self.serverConfig.auth.remove(self.databaseName);
+
+      // Handle any errors
+      if(err == null && result.documents[0].ok == 1) {
+        internalCallback(null, true);
+      } else {
+        err != null ? internalCallback(err, false) : internalCallback(new Error(result.documents[0].errmsg), false);
+      }
+    }
+  });
+}
+
+/**
+ * Authenticate a user against the server.
+ * authMechanism
+ * Options
+ *  - **authSource** {String}, The database that the credentials are for,
+ *    different from the name of the current DB, for example admin
+ *  - **authMechanism** {String, default:MONGODB-CR}, The authentication mechanism to use, GSSAPI or MONGODB-CR
+ *
+ * @param {String} username username.
+ * @param {String} password password.
+ * @param {Object} [options] the options
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from authentication or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.authenticate = function(username, password, options, callback) {
+  var self = this;
+
+  if(typeof callback === 'undefined') {
+    callback = options;
+    options = {};
+  }
+
+  // Set default mechanism
+  if(!options.authMechanism) {
+    options.authMechanism = 'MONGODB-CR';
+  } else if(options.authMechanism != 'GSSAPI' && options.authMechanism != 'MONGODB-CR') {
+    return callback(new Error("only GSSAPI or MONGODB-CR is supported by authMechanism"));
+  }
+
+  // the default db to authenticate against is 'this'
+  // if authententicate is called from a retry context, it may be another one, like admin
+  var authdb = options.authdb ? options.authdb : self.databaseName;
+  authdb = options.authSource ? options.authSource : authdb;
+
+  // Callback
+  var _callback = function(err, result) {
+    if(self.listeners("authenticated").length > 9) {
+      self.emit("authenticated", err, result);
+    }
+
+    // Return to caller
+    callback(err, result);
+  }
+
+  // If classic auth delegate to auth command
+  if(options.authMechanism == 'MONGODB-CR') {
+    mongodb_cr_authenticate(self, username, password, authdb, options, _callback);
+  } else if(options.authMechanism == 'GSSAPI') {
+    //
+    // Kerberos library is not installed, throw and error
+    if(hasKerberos == false) {
+      console.log("========================================================================================");
+      console.log("=  Please make sure that you install the Kerberos library to use GSSAPI                =");
+      console.log("=                                                                                      =");
+      console.log("=  npm install -g kerberos                                                             =");
+      console.log("=                                                                                      =");
+      console.log("=  The Kerberos package is not installed by default for simplicities sake              =");
+      console.log("=  and needs to be global install                                                      =");
+      console.log("========================================================================================");
+      throw new Error("Kerberos library not installed");
+    }
+
+    if(process.platform == 'win32') {
+      mongodb_sspi_authenticate(self, username, password, authdb, options, _callback);
+    } else {
+      // We have the kerberos library, execute auth process
+      mongodb_gssapi_authenticate(self, username, password, authdb, options, _callback);      
+    }
+  }
+};
+
+/**
+ * Add a user to the database.
+ *
+ * Options
+ *  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {String} username username.
+ * @param {String} password password.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from addUser or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.addUser = function(username, password, options, callback) {
+  var self = this;
+  var args = Array.prototype.slice.call(arguments, 2);
+  callback = args.pop();
+  options = args.length ? args.shift() || {} : {};
+
+  // Get the error options
+  var errorOptions = _getWriteConcern(this, options, callback);
+  errorOptions.w = errorOptions.w == null ? 1 : errorOptions.w;
+  // Use node md5 generator
+  var md5 = crypto.createHash('md5');
+  // Generate keys used for authentication
+  md5.update(username + ":mongo:" + password);
+  var userPassword = md5.digest('hex');
+  // Fetch a user collection
+  var collection = this.collection(DbCommand.SYSTEM_USER_COLLECTION);
+  // Check if we are inserting the first user
+  collection.count({}, function(err, count) {
+    // We got an error (f.ex not authorized)
+    if(err != null) return callback(err, null);
+    // Check if the user exists and update i
+    collection.find({user: username}, {dbName: options['dbName']}).toArray(function(err, documents) {
+      // We got an error (f.ex not authorized)
+      if(err != null) return callback(err, null);
+      // Add command keys
+      var commandOptions = errorOptions;
+      commandOptions.dbName = options['dbName'];
+      commandOptions.upsert = true;
+
+      // We have a user, let's update the password or upsert if not
+      collection.update({user: username},{$set: {user: username, pwd: userPassword}}, commandOptions, function(err, results) {
+        if(count == 0 && err) {
+          callback(null, [{user:username, pwd:userPassword}]);
+        } else if(err) {
+          callback(err, null)
+        } else {
+          callback(null, [{user:username, pwd:userPassword}]);
+        }
+      });
+    });
+  });
+};
+
+/**
+ * Remove a user from a database
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {String} username username.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from removeUser or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.removeUser = function(username, options, callback) {
+  var self = this;
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  options = args.length ? args.shift() || {} : {};
+
+  // Figure out the safe mode settings
+  var safe = self.safe != null && self.safe == false ? {w: 1} : self.safe;
+  // Override with options passed in if applicable
+  safe = options != null && options['safe'] != null ? options['safe'] : safe;
+  // Ensure it's at least set to safe
+  safe = safe == null ? {w: 1} : safe;
+
+  // Fetch a user collection
+  var collection = this.collection(DbCommand.SYSTEM_USER_COLLECTION);
+  collection.findOne({user: username}, {dbName: options['dbName']}, function(err, user) {
+    if(user != null) {
+      // Add command keys
+      var commandOptions = safe;
+      commandOptions.dbName = options['dbName'];
+
+      collection.remove({user: username}, commandOptions, function(err, result) {
+        callback(err, true);
+      });
+    } else {
+      callback(err, false);
+    }
+  });
+};
+
+/**
+ * Creates a collection on a server pre-allocating space, need to create f.ex capped collections.
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **serializeFunctions** {Boolean, default:false}, serialize functions on the document.
+ *  - **raw** {Boolean, default:false}, perform all operations using raw bson objects.
+ *  - **pkFactory** {Object}, object overriding the basic ObjectID primary key generation.
+ *  - **capped** {Boolean, default:false}, create a capped collection.
+ *  - **size** {Number}, the size of the capped collection in bytes.
+ *  - **max** {Number}, the maximum number of documents in the capped collection.
+ *  - **autoIndexId** {Boolean, default:true}, create an index on the _id field of the document, True by default on MongoDB 2.2 or higher off for version < 2.2.
+ *  - **readPreference** {String}, the prefered read preference (ReadPreference.PRIMARY, ReadPreference.PRIMARY_PREFERRED, ReadPreference.SECONDARY, ReadPreference.SECONDARY_PREFERRED, ReadPreference.NEAREST).
+ *  - **strict**, (Boolean, default:false) throws an error if collection already exists
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {String} collectionName the collection name we wish to access.
+ * @param {Object} [options] returns option results.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from createCollection or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.createCollection = function(collectionName, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  options = args.length ? args.shift() : null;
+  var self = this;
+
+  // Figure out the safe mode settings
+  var safe = self.safe != null && self.safe == false ? {w: 1} : self.safe;
+  // Override with options passed in if applicable
+  safe = options != null && options['safe'] != null ? options['safe'] : safe;
+  // Ensure it's at least set to safe
+  safe = safe == null ? {w: 1} : safe;
+
+  // Check if we have the name
+  this.collectionNames(collectionName, function(err, collections) {
+    if(err != null) return callback(err, null);
+
+    var found = false;
+    collections.forEach(function(collection) {
+      if(collection.name == self.databaseName + "." + collectionName) found = true;
+    });
+
+    // If the collection exists either throw an exception (if db in safe mode) or return the existing collection
+    if(found && options && options.strict) {
+      return callback(new Error("Collection " + collectionName + " already exists. Currently in safe mode."), null);
+    } else if(found){
+      try {
+        var collection = new Collection(self, collectionName, self.pkFactory, options);
+      } catch(err) {
+        return callback(err, null);
+      }
+      return callback(null, collection);
+    }
+
+    // Create a new collection and return it
+    self._executeQueryCommand(DbCommand.createCreateCollectionCommand(self, collectionName, options), {read:false, safe:safe}, function(err, result) {
+      var document = result.documents[0];
+      // If we have no error let's return the collection
+      if(err == null && document.ok == 1) {
+        try {
+          var collection = new Collection(self, collectionName, self.pkFactory, options);
+        } catch(err) {
+          return callback(err, null);
+        }
+        return callback(null, collection);
+      } else {
+        if (null == err) err = utils.toError(document);
+        callback(err, null);
+      }
+    });
+  });
+};
+
+/**
+ * Execute a command hash against MongoDB. This lets you acess any commands not available through the api on the server.
+ *
+ * @param {Object} selector the command hash to send to the server, ex: {ping:1}.
+ * @param {Function} callback this will be called after executing this method. The command always return the whole result of the command as the second parameter.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.command = function(selector, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  options = args.length ? args.shift() || {} : {};
+
+  // Set up the options
+  var cursor = new Cursor(this
+    , new Collection(this, DbCommand.SYSTEM_COMMAND_COLLECTION), selector, {}, {
+      limit: -1, timeout: QueryCommand.OPTS_NO_CURSOR_TIMEOUT, dbName: options['dbName']
+    });
+
+  // Set read preference if we set one
+  var readPreference = options['readPreference'] ? options['readPreference'] : false;
+
+  // Ensure only commands who support read Prefrences are exeuted otherwise override and use Primary
+  if(readPreference != false) {
+    if(selector['group'] || selector['aggregate'] || selector['collStats'] || selector['dbStats']
+      || selector['count'] || selector['distinct'] || selector['geoNear'] || selector['geoSearch'] || selector['geoWalk']
+      || (selector['mapreduce'] && selector.out == 'inline')) {
+      // Set the read preference
+      cursor.setReadPreference(readPreference);
+    } else {
+      cursor.setReadPreference(ReadPreference.PRIMARY);
+    }
+  }
+
+  // Return the next object
+  cursor.nextObject(callback);
+};
+
+/**
+ * Drop a collection from the database, removing it permanently. New accesses will create a new collection.
+ *
+ * @param {String} collectionName the name of the collection we wish to drop.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from dropCollection or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.dropCollection = function(collectionName, callback) {
+  var self = this;
+  callback || (callback = function(){});
+
+  // Drop the collection
+  this._executeQueryCommand(DbCommand.createDropCollectionCommand(this, collectionName), function(err, result) {
+    if(err == null && result.documents[0].ok == 1) {
+      return callback(null, true);
+    }
+
+    if(null == err) err = utils.toError(result.documents[0]);
+    callback(err, null);
+  });
+};
+
+/**
+ * Rename a collection.
+ * 
+ * Options
+ *  - **dropTarget** {Boolean, default:false}, drop the target name collection if it previously exists.
+ *
+ * @param {String} fromCollection the name of the current collection we wish to rename.
+ * @param {String} toCollection the new name of the collection.
+ * @param {Object} [options] returns option results.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from renameCollection or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.renameCollection = function(fromCollection, toCollection, options, callback) {
+  var self = this;
+
+  if(typeof options == 'function') {
+    callback = options;
+    options = {}
+  }
+
+  callback || (callback = function(){});
+  // Execute the command, return the new renamed collection if successful
+  this._executeQueryCommand(DbCommand.createRenameCollectionCommand(this, fromCollection, toCollection, options), function(err, result) {
+    if(err == null && result.documents[0].ok == 1) {
+      return callback(null, new Collection(self, toCollection, self.pkFactory));
+    }
+
+    if(null == err) err = utils.toError(result.documents[0]);
+    callback(err, null);
+  });
+};
+
+/**
+ * Return last error message for the given connection, note options can be combined.
+ *
+ * Options
+ *  - **fsync** {Boolean, default:false}, option forces the database to fsync all files before returning.
+ *  - **j** {Boolean, default:false}, awaits the journal commit before returning, > MongoDB 2.0.
+ *  - **w** {Number}, until a write operation has been replicated to N servers.
+ *  - **wtimeout** {Number}, number of miliseconds to wait before timing out.
+ *
+ * Connection Options
+ *  - **connection** {Connection}, fire the getLastError down a specific connection.
+ *
+ * @param {Object} [options] returns option results.
+ * @param {Object} [connectionOptions] returns option results.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from lastError or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.lastError = function(options, connectionOptions, callback) {
+  // Unpack calls
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  options = args.length ? args.shift() || {} : {};
+  connectionOptions = args.length ? args.shift() || {} : {};
+
+  this._executeQueryCommand(DbCommand.createGetLastErrorCommand(options, this), connectionOptions, function(err, error) {
+    callback(err, error && error.documents);
+  });
+};
+
+/**
+ * Legacy method calls.
+ *
+ * @ignore
+ * @api private
+ */
+Db.prototype.error = Db.prototype.lastError;
+Db.prototype.lastStatus = Db.prototype.lastError;
+
+/**
+ * Return all errors up to the last time db reset_error_history was called.
+ *
+ * Options
+ *  - **connection** {Connection}, fire the getLastError down a specific connection.
+ *
+ * @param {Object} [options] returns option results.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from previousErrors or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.previousErrors = function(options, callback) {
+  // Unpack calls
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  options = args.length ? args.shift() || {} : {};
+
+  this._executeQueryCommand(DbCommand.createGetPreviousErrorsCommand(this), options, function(err, error) {
+    callback(err, error.documents);
+  });
+};
+
+/**
+ * Runs a command on the database.
+ * @ignore
+ * @api private
+ */
+Db.prototype.executeDbCommand = function(command_hash, options, callback) {
+  if(callback == null) { callback = options; options = {}; }
+  this._executeQueryCommand(DbCommand.createDbSlaveOkCommand(this, command_hash, options), options, callback);
+};
+
+/**
+ * Runs a command on the database as admin.
+ * @ignore
+ * @api private
+ */
+Db.prototype.executeDbAdminCommand = function(command_hash, options, callback) {
+  if(callback == null) { callback = options; options = {}; }
+  this._executeQueryCommand(DbCommand.createAdminDbCommand(this, command_hash), options, callback);
+};
+
+/**
+ * Resets the error history of the mongo instance.
+ *
+ * Options
+ *  - **connection** {Connection}, fire the getLastError down a specific connection.
+ *
+ * @param {Object} [options] returns option results.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from resetErrorHistory or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.resetErrorHistory = function(options, callback) {
+  // Unpack calls
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  options = args.length ? args.shift() || {} : {};
+
+  this._executeQueryCommand(DbCommand.createResetErrorHistoryCommand(this), options, function(err, error) {
+    callback(err, error.documents);
+  });
+};
+
+/**
+ * Creates an index on the collection.
+ *
+ * Options
+*  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **unique** {Boolean, default:false}, creates an unique index.
+ *  - **sparse** {Boolean, default:false}, creates a sparse index.
+ *  - **background** {Boolean, default:false}, creates the index in the background, yielding whenever possible.
+ *  - **dropDups** {Boolean, default:false}, a unique index cannot be created on a key that has pre-existing duplicate values. If you would like to create the index anyway, keeping the first document the database indexes and deleting all subsequent documents that have duplicate value
+ *  - **min** {Number}, for geospatial indexes set the lower bound for the co-ordinates.
+ *  - **max** {Number}, for geospatial indexes set the high bound for the co-ordinates.
+ *  - **v** {Number}, specify the format version of the indexes.
+ *  - **expireAfterSeconds** {Number}, allows you to expire data on indexes applied to a data (MongoDB 2.2 or higher)
+ *  - **name** {String}, override the autogenerated index name (useful if the resulting name is larger than 128 bytes)
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ *
+ * @param {String} collectionName name of the collection to create the index on.
+ * @param {Object} fieldOrSpec fieldOrSpec that defines the index.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from createIndex or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.createIndex = function(collectionName, fieldOrSpec, options, callback) {
+  var self = this;
+  var args = Array.prototype.slice.call(arguments, 2);
+  callback = args.pop();
+  options = args.length ? args.shift() || {} : {};
+  options = typeof callback === 'function' ? options : callback;
+  options = options == null ? {} : options;
+
+  // Get the error options
+  var errorOptions = _getWriteConcern(this, options, callback);
+  // Create command
+  var command = DbCommand.createCreateIndexCommand(this, collectionName, fieldOrSpec, options);
+  // Default command options
+  var commandOptions = {};
+
+  // If we have error conditions set handle them
+  if(_hasWriteConcern(errorOptions) && typeof callback == 'function') {
+    // Insert options
+    commandOptions['read'] = false;
+    // If we have safe set set async to false
+    if(errorOptions == null) commandOptions['async'] = true;
+
+    // Set safe option
+    commandOptions['safe'] = errorOptions;
+    // If we have an error option
+    if(typeof errorOptions == 'object') {
+      var keys = Object.keys(errorOptions);
+      for(var i = 0; i < keys.length; i++) {
+        commandOptions[keys[i]] = errorOptions[keys[i]];
+      }
+    }
+
+    // Execute insert command
+    this._executeInsertCommand(command, commandOptions, function(err, result) {
+      if(err != null) return callback(err, null);
+
+      result = result && result.documents;
+      if (result[0].err) {
+        callback(utils.toError(result[0]));
+      } else {
+        callback(null, command.documents[0].name);
+      }
+    });
+  } else if(_hasWriteConcern(errorOptions) && callback == null) {
+    throw new Error("Cannot use a writeConcern without a provided callback");
+  } else {
+    // Execute insert command
+    var result = this._executeInsertCommand(command, commandOptions);
+    // If no callback just return
+    if(!callback) return;
+    // If error return error
+    if(result instanceof Error) {
+      return callback(result);
+    }
+    // Otherwise just return
+    return callback(null, null);
+  }
+};
+
+/**
+ * Ensures that an index exists, if it does not it creates it
+ *
+ * Options
+ *  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **unique** {Boolean, default:false}, creates an unique index.
+ *  - **sparse** {Boolean, default:false}, creates a sparse index.
+ *  - **background** {Boolean, default:false}, creates the index in the background, yielding whenever possible.
+ *  - **dropDups** {Boolean, default:false}, a unique index cannot be created on a key that has pre-existing duplicate values. If you would like to create the index anyway, keeping the first document the database indexes and deleting all subsequent documents that have duplicate value
+ *  - **min** {Number}, for geospatial indexes set the lower bound for the co-ordinates.
+ *  - **max** {Number}, for geospatial indexes set the high bound for the co-ordinates.
+ *  - **v** {Number}, specify the format version of the indexes.
+ *  - **expireAfterSeconds** {Number}, allows you to expire data on indexes applied to a data (MongoDB 2.2 or higher)
+ *  - **name** {String}, override the autogenerated index name (useful if the resulting name is larger than 128 bytes)
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @param {String} collectionName name of the collection to create the index on.
+ * @param {Object} fieldOrSpec fieldOrSpec that defines the index.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from ensureIndex or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.ensureIndex = function(collectionName, fieldOrSpec, options, callback) {
+  var self = this;
+
+  if (typeof callback === 'undefined' && typeof options === 'function') {
+    callback = options;
+    options = {};
+  }
+
+  if (options == null) {
+    options = {};
+  }
+
+  // Get the error options
+  var errorOptions = _getWriteConcern(this, options, callback);
+  // Make sure we don't try to do a write concern without a callback
+  if(_hasWriteConcern(errorOptions) && callback == null)
+    throw new Error("Cannot use a writeConcern without a provided callback");
+  // Create command
+  var command = DbCommand.createCreateIndexCommand(this, collectionName, fieldOrSpec, options);
+  var index_name = command.documents[0].name;
+
+  // Default command options
+  var commandOptions = {};
+  // Check if the index allready exists
+  this.indexInformation(collectionName, function(err, collectionInfo) {
+    if(err != null) return callback(err, null);
+
+    if(!collectionInfo[index_name])  {
+      // If we have error conditions set handle them
+      if(_hasWriteConcern(errorOptions) && typeof callback == 'function') {
+        // Insert options
+        commandOptions['read'] = false;
+        // If we have safe set set async to false
+        if(errorOptions == null) commandOptions['async'] = true;
+
+        // If we have an error option
+        if(typeof errorOptions == 'object') {
+          var keys = Object.keys(errorOptions);
+          for(var i = 0; i < keys.length; i++) {
+            commandOptions[keys[i]] = errorOptions[keys[i]];
+          }
+        }
+
+        if(typeof callback === 'function' 
+          && commandOptions.w < 1 && !commandOptions.fsync && !commandOptions.journal) {
+          commandOptions.w = 1;
+        }
+
+        self._executeInsertCommand(command, commandOptions, function(err, result) {
+          // Only callback if we have one specified
+          if(typeof callback === 'function') {
+            if(err != null) return callback(err, null);
+
+            result = result && result.documents;
+            if (result[0].err) {
+              callback(utils.toError(result[0]));
+            } else {
+              callback(null, command.documents[0].name);
+            }
+          }
+        });
+      } else {
+        // Execute insert command
+        var result = self._executeInsertCommand(command, commandOptions);
+        // If no callback just return
+        if(!callback) return;
+        // If error return error
+        if(result instanceof Error) {
+          return callback(result);
+        }
+        // Otherwise just return
+        return callback(null, index_name);
+      }
+    } else {
+      if(typeof callback === 'function') return callback(null, index_name);
+    }
+  });
+};
+
+/**
+ * Returns the information available on allocated cursors.
+ *
+ * Options
+ *  - **readPreference** {String}, the prefered read preference (ReadPreference.PRIMARY, ReadPreference.PRIMARY_PREFERRED, ReadPreference.SECONDARY, ReadPreference.SECONDARY_PREFERRED, ReadPreference.NEAREST).
+ *
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from cursorInfo or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.cursorInfo = function(options, callback) {
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  options = args.length ? args.shift() || {} : {};
+
+  this._executeQueryCommand(DbCommand.createDbSlaveOkCommand(this, {'cursorInfo':1}), options, function(err, result) {
+    callback(err, result.documents[0]);
+  });
+};
+
+/**
+ * Drop an index on a collection.
+ *
+ * @param {String} collectionName the name of the collection where the command will drop an index.
+ * @param {String} indexName name of the index to drop.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from dropIndex or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.dropIndex = function(collectionName, indexName, callback) {  
+  this._executeQueryCommand(DbCommand.createDropIndexCommand(this, collectionName, indexName), callback);
+};
+
+/**
+ * Reindex all indexes on the collection
+ * Warning: reIndex is a blocking operation (indexes are rebuilt in the foreground) and will be slow for large collections.
+ *
+ * @param {String} collectionName the name of the collection.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from reIndex or null if an error occured.
+ * @api public
+**/
+Db.prototype.reIndex = function(collectionName, callback) {
+  this._executeQueryCommand(DbCommand.createReIndexCommand(this, collectionName), function(err, result) {
+    if(err != null) {
+      callback(err, false);
+    } else if(result.documents[0].errmsg == null) {
+      callback(null, true);
+    } else {
+      callback(new Error(result.documents[0].errmsg), false);
+    }
+  });
+};
+
+/**
+ * Retrieves this collections index info.
+ *
+ * Options
+ *  - **full** {Boolean, default:false}, returns the full raw index information.
+ *  - **readPreference** {String}, the preferred read preference ((Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *
+ * @param {String} collectionName the name of the collection.
+ * @param {Object} [options] additional options during update.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from indexInformation or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.indexInformation = function(collectionName, options, callback) {
+  if(typeof callback === 'undefined') {
+    if(typeof options === 'undefined') {
+      callback = collectionName;
+      collectionName = null;
+    } else {
+      callback = options;
+    }
+    options = {};
+  }
+
+  // If we specified full information
+  var full = options['full'] == null ? false : options['full'];
+  // Build selector for the indexes
+  var selector = collectionName != null ? {ns: (this.databaseName + "." + collectionName)} : {};
+
+  // Set read preference if we set one
+  var readPreference = options['readPreference'] ? options['readPreference'] : ReadPreference.PRIMARY;
+
+  // Iterate through all the fields of the index
+  this.collection(DbCommand.SYSTEM_INDEX_COLLECTION, function(err, collection) {
+    // Perform the find for the collection
+    collection.find(selector).setReadPreference(readPreference).toArray(function(err, indexes) {
+      if(err != null) return callback(err, null);
+      // Contains all the information
+      var info = {};
+
+      // if full defined just return all the indexes directly
+      if(full) return callback(null, indexes);
+
+      // Process all the indexes
+      for(var i = 0; i < indexes.length; i++) {
+        var index = indexes[i];
+        // Let's unpack the object
+        info[index.name] = [];
+        for(var name in index.key) {
+          info[index.name].push([name, index.key[name]]);
+        }
+      }
+
+      // Return all the indexes
+      callback(null, info);
+    });
+  });
+};
+
+/**
+ * Drop a database.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from dropDatabase or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.dropDatabase = function(callback) {
+  var self = this;
+
+  this._executeQueryCommand(DbCommand.createDropDatabaseCommand(this), function(err, result) {
+    if(err == null && result.documents[0].ok == 1) {
+      callback(null, true);
+    } else {
+      if(err) {
+        callback(err, false);
+      } else {
+        callback(utils.toError(result.documents[0]), false);
+      }
+    }
+  });
+};
+
+/**
+ * Get all the db statistics.
+ *
+ * Options
+ *  - **scale** {Number}, divide the returned sizes by scale value.
+ *  - **readPreference** {String}, the preferred read preference ((Server.PRIMARY, Server.PRIMARY_PREFERRED, Server.SECONDARY, Server.SECONDARY_PREFERRED, Server.NEAREST).
+ *
+ * @param {Objects} [options] options for the stats command
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from stats or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.prototype.stats = function stats(options, callback) {
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  // Fetch all commands
+  options = args.length ? args.shift() || {} : {};
+
+  // Build command object
+  var commandObject = {
+    dbStats:this.collectionName,
+  }
+
+  // Check if we have the scale value
+  if(options['scale'] != null) commandObject['scale'] = options['scale'];
+
+  // Execute the command
+  this.command(commandObject, options, callback);
+}
+
+/**
+ * @ignore
+ */
+var __executeQueryCommand = function(self, db_command, options, callback) {
+  // Options unpacking
+  var read = options['read'] != null ? options['read'] : false;
+  var raw = options['raw'] != null ? options['raw'] : self.raw;
+  var onAll = options['onAll'] != null ? options['onAll'] : false;
+  var specifiedConnection = options['connection'] != null ? options['connection'] : null;
+
+  // Correct read preference to default primary if set to false, null or primary
+  if(!(typeof read == 'object') && read._type == 'ReadPreference') {
+    read = (read == null || read == 'primary' || read == false) ? ReadPreference.PRIMARY : read;
+    if(!ReadPreference.isValid(read)) return callback(new Error("Illegal readPreference mode specified, " + read));
+  } else if(typeof read == 'object' && read._type == 'ReadPreference') {
+    if(!read.isValid()) return callback(new Error("Illegal readPreference mode specified, " + read.mode));
+  }
+
+  // If we have a read preference set and we are a mongos pass the read preference on to the mongos instance,
+  if(self.serverConfig.isMongos() && read != null && read != false) {
+    db_command.setMongosReadPreference(read);
+  }
+
+  // If we got a callback object
+  if(typeof callback === 'function' && !onAll) {
+    // Override connection if we passed in a specific connection
+    var connection = specifiedConnection != null ? specifiedConnection : null;
+
+    if(connection instanceof Error) return callback(connection, null);
+
+    // Fetch either a reader or writer dependent on the specified read option if no connection
+    // was passed in
+    if(connection == null) {
+      connection = self.serverConfig.checkoutReader(read);
+    }
+
+    if(connection == null) {
+      return callback(new Error("no open connections"));
+    } else if(connection instanceof Error || connection['message'] != null) {
+      return callback(connection);
+    }
+
+    // Exhaust Option
+    var exhaust = options.exhaust || false;
+    
+    // Register the handler in the data structure
+    self.serverConfig._registerHandler(db_command, raw, connection, exhaust, callback);
+    
+    // Ensure the connection is valid
+    if(!connection.isConnected()) {
+      if(read == ReadPreference.PRIMARY 
+        || read == ReadPreference.PRIMARY_PREFERRED
+        || (read != null && typeof read == 'object' && read.mode)
+        || read == null) {
+        
+        // Save the command
+        self.serverConfig._commandsStore.read_from_writer(
+          {   type: 'query'
+            , db_command: db_command
+            , options: options
+            , callback: callback
+            , db: self
+            , executeQueryCommand: __executeQueryCommand
+            , executeInsertCommand: __executeInsertCommand
+          }
+        );
+      } else {
+        self.serverConfig._commandsStore.read(
+          {   type: 'query'
+            , db_command: db_command
+            , options: options
+            , callback: callback 
+            , db: self
+            , executeQueryCommand: __executeQueryCommand
+            , executeInsertCommand: __executeInsertCommand
+          }
+        );
+      }      
+    }
+
+    // Write the message out and handle any errors if there are any
+    connection.write(db_command, function(err) {
+      if(err != null) {
+        // Call the handler with an error
+        if(Array.isArray(db_command))
+          self.serverConfig._callHandler(db_command[0].getRequestId(), null, err);
+        else
+          self.serverConfig._callHandler(db_command.getRequestId(), null, err);
+      }
+    });
+  } else if(typeof callback === 'function' && onAll) {
+    var connections = self.serverConfig.allRawConnections();
+    var numberOfEntries = connections.length;
+    // Go through all the connections
+    for(var i = 0; i < connections.length; i++) {
+      // Fetch a connection
+      var connection = connections[i];
+
+      // Ensure we have a valid connection
+      if(connection == null) {
+        return callback(new Error("no open connections"));
+      } else if(connection instanceof Error) {
+        return callback(connection);
+      }
+
+      // Register the handler in the data structure
+      self.serverConfig._registerHandler(db_command, raw, connection, callback);
+
+      // Write the message out
+      connection.write(db_command, function(err) {
+        // Adjust the number of entries we need to process
+        numberOfEntries = numberOfEntries - 1;
+        // Remove listener
+        if(err != null) {
+          // Clean up listener and return error
+          self.serverConfig._removeHandler(db_command.getRequestId());
+        }
+
+        // No more entries to process callback with the error
+        if(numberOfEntries <= 0) {
+          callback(err);
+        }
+      });
+
+      // Update the db_command request id
+      db_command.updateRequestId();
+    }
+  } else {
+    // Fetch either a reader or writer dependent on the specified read option
+    // var connection = read == null || read == 'primary' || read == false ? self.serverConfig.checkoutWriter(true) : self.serverConfig.checkoutReader(read);
+    var connection = self.serverConfig.checkoutReader(read);
+    // Override connection if needed
+    connection = specifiedConnection != null ? specifiedConnection : connection;
+    // Ensure we have a valid connection
+    if(connection == null || connection instanceof Error || connection['message'] != null) return null;
+    // Write the message out
+    connection.write(db_command, function(err) {
+      if(err != null) {
+        // Emit the error
+        self.emit("error", err);
+      }
+    });
+  }
+}
+
+/**
+ * Execute db query command (not safe)
+ * @ignore
+ * @api private
+ */
+Db.prototype._executeQueryCommand = function(db_command, options, callback) {
+  var self = this;
+
+  // Unpack the parameters
+  if (typeof callback === 'undefined') {
+    callback = options;
+    options = {};
+  }
+
+  // fast fail option used for HA, no retry
+  var failFast = options['failFast'] != null
+    ? options['failFast']
+    : false;
+
+  // Check if the user force closed the command
+  if(this._applicationClosed) {
+    var err = new Error("db closed by application");
+    if('function' == typeof callback) {
+      return callback(err, null);
+    } else {
+      throw err;
+    }
+  }
+
+  if(this.serverConfig.isDestroyed()) return callback(new Error("Connection was destroyed by application"));
+
+  // Get the configuration
+  var config = this.serverConfig;
+  var read = options.read;
+
+  if(!config.canRead(read) && !config.canWrite() && config.isAutoReconnect()) {
+    if(read == ReadPreference.PRIMARY 
+      || read == ReadPreference.PRIMARY_PREFERRED
+      || (read != null && typeof read == 'object' && read.mode)
+      || read == null) {
+      
+      // Save the command
+      self.serverConfig._commandsStore.read_from_writer(
+        {   type: 'query'
+          , db_command: db_command
+          , options: options
+          , callback: callback
+          , db: self
+          , executeQueryCommand: __executeQueryCommand
+          , executeInsertCommand: __executeInsertCommand
+        }
+      );
+    } else {
+      self.serverConfig._commandsStore.read(
+        {   type: 'query'
+          , db_command: db_command
+          , options: options
+          , callback: callback 
+          , db: self
+          , executeQueryCommand: __executeQueryCommand
+          , executeInsertCommand: __executeInsertCommand
+        }
+      );
+    }
+  } else if(!config.canRead(read) && !config.canWrite() && !config.isAutoReconnect()) {
+    return callback(new Error("no open connections"), null);
+  } else {
+    // Execute the command
+    __executeQueryCommand(self, db_command, options, function (err, result, conn) {
+      if(callback) callback(err, result, conn);
+    });    
+  }
+};
+
+/**
+ * @ignore
+ */
+var __executeInsertCommand = function(self, db_command, options, callback) {
+  // Always checkout a writer for this kind of operations
+  var connection = self.serverConfig.checkoutWriter();
+  // Get safe mode
+  var safe = options['safe'] != null ? options['safe'] : false;
+  var raw = options['raw'] != null ? options['raw'] : self.raw;
+  var specifiedConnection = options['connection'] != null ? options['connection'] : null;
+  // Override connection if needed
+  connection = specifiedConnection != null ? specifiedConnection : connection;
+
+  // Ensure we have a valid connection
+  if(typeof callback === 'function') {
+    // Ensure we have a valid connection
+    /*if(connection == null && self.serverConfig.isAutoReconnect()) {
+      return self.serverConfig._commandsStore.write(
+        {   type:'insert'
+          , 'db_command':db_command
+          , 'options':options
+          , 'callback':callback
+          , db: self
+          , executeQueryCommand: __executeQueryCommand
+          , executeInsertCommand: __executeInsertCommand
+        }
+      );
+    } else*/ if(connection == null) {
+      return callback(new Error("no open connections"));
+    } else if(connection instanceof Error) {
+      return callback(connection);
+    }
+
+    var errorOptions = _getWriteConcern(self, options, callback);
+    if(errorOptions.w > 0 || errorOptions.w == 'majority' || errorOptions.j || errorOptions.journal || errorOptions.fsync) {      
+      // db command is now an array of commands (original command + lastError)
+      db_command = [db_command, DbCommand.createGetLastErrorCommand(safe, self)];
+      // Register the handler in the data structure
+      self.serverConfig._registerHandler(db_command[1], raw, connection, callback);      
+    }
+  }
+
+  // If we have no callback and there is no connection
+  if(connection == null) return null;
+  if(connection instanceof Error && typeof callback == 'function') return callback(connection, null);
+  if(connection instanceof Error) return null;
+  if(connection == null && typeof callback == 'function') return callback(new Error("no primary server found"), null);
+
+  // Ensure we truly are connected
+  if(!connection.isConnected()) {
+    return self.serverConfig._commandsStore.write(
+      {   type:'insert'
+        , 'db_command':db_command
+        , 'options':options
+        , 'callback':callback
+        , db: self
+        , executeQueryCommand: __executeQueryCommand
+        , executeInsertCommand: __executeInsertCommand
+      }
+    );
+  }
+
+  // Write the message out
+  connection.write(db_command, function(err) {
+    // Return the callback if it's not a safe operation and the callback is defined
+    if(typeof callback === 'function' && (safe == null || safe == false)) {
+      // Perform the callback
+      callback(err, null);
+    } else if(typeof callback === 'function') {
+      // Call the handler with an error
+      self.serverConfig._callHandler(db_command[1].getRequestId(), null, err);
+    } else if(typeof callback == 'function' && safe && safe.w == -1) {
+      // Call the handler with no error
+      self.serverConfig._callHandler(db_command[1].getRequestId(), null, null);
+    } else if(!safe || safe.w == -1) {
+      self.emit("error", err);
+    }
+  });
+}
+
+/**
+ * Execute an insert Command
+ * @ignore
+ * @api private
+ */
+Db.prototype._executeInsertCommand = function(db_command, options, callback) {
+  var self = this;
+
+  // Unpack the parameters
+  if(callback == null && typeof options === 'function') {
+    callback = options;
+    options = {};
+  }
+
+  // Ensure options are not null
+  options = options == null ? {} : options;
+
+  // Check if the user force closed the command
+  if(this._applicationClosed) {
+    if(typeof callback == 'function') {
+      return callback(new Error("db closed by application"), null);
+    } else {
+      throw new Error("db closed by application");
+    }
+  }
+
+  if(this.serverConfig.isDestroyed()) return callback(new Error("Connection was destroyed by application"));
+
+  // Get config
+  var config = self.serverConfig;
+  // Check if we are connected
+  if(!config.canWrite() && config.isAutoReconnect()) {
+    self.serverConfig._commandsStore.write(
+      {   type:'insert'
+        , 'db_command':db_command
+        , 'options':options
+        , 'callback':callback
+        , db: self
+        , executeQueryCommand: __executeQueryCommand
+        , executeInsertCommand: __executeInsertCommand
+      }
+    );
+  } else if(!config.canWrite() && !config.isAutoReconnect()) {
+    return callback(new Error("no open connections"), null);
+  } else {
+    // Execute write command
+    __executeInsertCommand(self, db_command, options, callback);
+  }
+}
+
+/**
+ * Update command is the same
+ * @ignore
+ * @api private
+ */
+Db.prototype._executeUpdateCommand = Db.prototype._executeInsertCommand;
+/**
+ * Remove command is the same
+ * @ignore
+ * @api private
+ */
+Db.prototype._executeRemoveCommand = Db.prototype._executeInsertCommand;
+
+/**
+ * Wrap a Mongo error document into an Error instance.
+ * Deprecated. Use utils.toError instead.
+ *
+ * @ignore
+ * @api private
+ * @deprecated
+ */
+Db.prototype.wrap = utils.toError;
+
+/**
+ * Default URL
+ *
+ * @classconstant DEFAULT_URL
+ **/
+Db.DEFAULT_URL = 'mongodb://localhost:27017/default';
+
+/**
+ * Connect to MongoDB using a url as documented at
+ *
+ *  docs.mongodb.org/manual/reference/connection-string/
+ *
+ * Options
+ *  - **uri_decode_auth** {Boolean, default:false} uri decode the user name and password for authentication
+ *  - **db** {Object, default: null} a hash off options to set on the db object, see **Db constructor**
+ *  - **server** {Object, default: null} a hash off options to set on the server objects, see **Server** constructor**
+ *  - **replSet** {Object, default: null} a hash off options to set on the replSet object, see **ReplSet** constructor**
+ *  - **mongos** {Object, default: null} a hash off options to set on the mongos object, see **Mongos** constructor**
+ *
+ * @param {String} url connection url for MongoDB.
+ * @param {Object} [options] optional options for insert command
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the db instance or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+Db.connect = function(url, options, callback) {
+  // Ensure correct mapping of the callback
+  if(typeof options == 'function') {
+    callback = options;
+    options = {};
+  }
+
+  // Ensure same behavior as previous version w:0
+  if(url.indexOf("safe") == -1 
+    && url.indexOf("w") == -1 
+    && url.indexOf("journal") == -1 && url.indexOf("j") == -1
+    && url.indexOf("fsync") == -1) options.w = 0;
+
+  // Avoid circular require problem
+  var MongoClient = require('./mongo_client.js').MongoClient;
+  // Attempt to connect
+  MongoClient.connect.call(MongoClient, url, options, callback);
+}
+
+/**
+ * State of the db connection
+ * @ignore
+ */
+Object.defineProperty(Db.prototype, "state", { enumerable: true
+  , get: function () {
+      return this.serverConfig._serverState;
+    }
+});
+
+/**
+ * @ignore
+ */
+var _hasWriteConcern = function(errorOptions) {
+  return errorOptions == true
+    || errorOptions.w > 0
+    || errorOptions.w == 'majority'
+    || errorOptions.j == true
+    || errorOptions.journal == true
+    || errorOptions.fsync == true
+}
+
+/**
+ * @ignore
+ */
+var _setWriteConcernHash = function(options) {
+  var finalOptions = {};
+  if(options.w != null) finalOptions.w = options.w;  
+  if(options.journal == true) finalOptions.j = options.journal;
+  if(options.j == true) finalOptions.j = options.j;
+  if(options.fsync == true) finalOptions.fsync = options.fsync;
+  if(options.wtimeout != null) finalOptions.wtimeout = options.wtimeout;  
+  return finalOptions;
+}
+
+/**
+ * @ignore
+ */
+var _getWriteConcern = function(self, options, callback) {
+  // Final options
+  var finalOptions = {w:1};
+  // Local options verification
+  if(options.w != null || typeof options.j == 'boolean' || typeof options.journal == 'boolean' || typeof options.fsync == 'boolean') {
+    finalOptions = _setWriteConcernHash(options);
+  } else if(options.safe != null && typeof options.safe == 'object') {
+    finalOptions = _setWriteConcernHash(options.safe);
+  } else if(typeof options.safe == "boolean") {
+    finalOptions = {w: (options.safe ? 1 : 0)};
+  } else if(self.options.w != null || typeof self.options.j == 'boolean' || typeof self.options.journal == 'boolean' || typeof self.options.fsync == 'boolean') {
+    finalOptions = _setWriteConcernHash(self.options);
+  } else if(self.safe.w != null || typeof self.safe.j == 'boolean' || typeof self.safe.journal == 'boolean' || typeof self.safe.fsync == 'boolean') {
+    finalOptions = _setWriteConcernHash(self.safe);
+  } else if(typeof self.safe == "boolean") {
+    finalOptions = {w: (self.safe ? 1 : 0)};
+  }
+
+  // Ensure we don't have an invalid combination of write concerns
+  if(finalOptions.w < 1 
+    && (finalOptions.journal == true || finalOptions.j == true || finalOptions.fsync == true)) throw new Error("No acknowlegement using w < 1 cannot be combined with journal:true or fsync:true");
+
+  // Return the options
+  return finalOptions;
+}
+
+/**
+ * Legacy support
+ *
+ * @ignore
+ * @api private
+ */
+exports.connect = Db.connect;
+exports.Db = Db;
+
+/**
+ * Remove all listeners to the db instance.
+ * @ignore
+ * @api private
+ */
+Db.prototype.removeAllEventListeners = function() {
+  this.removeAllListeners("close");
+  this.removeAllListeners("error");
+  this.removeAllListeners("timeout");
+  this.removeAllListeners("parseError");
+  this.removeAllListeners("poolReady");
+  this.removeAllListeners("message");
+}
diff --git a/node_modules/mongodb/lib/mongodb/gridfs/chunk.js b/node_modules/mongodb/lib/mongodb/gridfs/chunk.js
new file mode 100644
index 0000000..59c6a26
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/gridfs/chunk.js
@@ -0,0 +1,221 @@
+var Binary = require('bson').Binary,
+  ObjectID = require('bson').ObjectID;
+
+/**
+ * Class for representing a single chunk in GridFS.
+ *
+ * @class
+ *
+ * @param file {GridStore} The {@link GridStore} object holding this chunk.
+ * @param mongoObject {object} The mongo object representation of this chunk.
+ *
+ * @throws Error when the type of data field for {@link mongoObject} is not
+ *     supported. Currently supported types for data field are instances of
+ *     {@link String}, {@link Array}, {@link Binary} and {@link Binary}
+ *     from the bson module
+ *
+ * @see Chunk#buildMongoObject
+ */
+var Chunk = exports.Chunk = function(file, mongoObject, writeConcern) {
+  if(!(this instanceof Chunk)) return new Chunk(file, mongoObject);
+
+  this.file = file;
+  var self = this;
+  var mongoObjectFinal = mongoObject == null ? {} : mongoObject;
+  this.writeConcern = writeConcern || {w:1};
+  this.objectId = mongoObjectFinal._id == null ? new ObjectID() : mongoObjectFinal._id;
+  this.chunkNumber = mongoObjectFinal.n == null ? 0 : mongoObjectFinal.n;
+  this.data = new Binary();
+
+  if(mongoObjectFinal.data == null) {
+  } else if(typeof mongoObjectFinal.data == "string") {
+    var buffer = new Buffer(mongoObjectFinal.data.length);
+    buffer.write(mongoObjectFinal.data, 'binary', 0);
+    this.data = new Binary(buffer);
+  } else if(Array.isArray(mongoObjectFinal.data)) {
+    var buffer = new Buffer(mongoObjectFinal.data.length);
+    buffer.write(mongoObjectFinal.data.join(''), 'binary', 0);
+    this.data = new Binary(buffer);
+  } else if(mongoObjectFinal.data instanceof Binary || Object.prototype.toString.call(mongoObjectFinal.data) == "[object Binary]") {
+    this.data = mongoObjectFinal.data;
+  } else if(Buffer.isBuffer(mongoObjectFinal.data)) {
+  } else {
+    throw Error("Illegal chunk format");
+  }
+  // Update position
+  this.internalPosition = 0;
+};
+
+/**
+ * Writes a data to this object and advance the read/write head.
+ *
+ * @param data {string} the data to write 
+ * @param callback {function(*, GridStore)} This will be called after executing
+ *     this method. The first parameter will contain null and the second one
+ *     will contain a reference to this object.
+ */
+Chunk.prototype.write = function(data, callback) {
+  this.data.write(data, this.internalPosition);
+  this.internalPosition = this.data.length();
+  if(callback != null) return callback(null, this);
+  return this;
+};
+
+/**
+ * Reads data and advances the read/write head.
+ *
+ * @param length {number} The length of data to read.
+ *
+ * @return {string} The data read if the given length will not exceed the end of
+ *     the chunk. Returns an empty String otherwise.
+ */
+Chunk.prototype.read = function(length) {
+  // Default to full read if no index defined
+  length = length == null || length == 0 ? this.length() : length;
+
+  if(this.length() - this.internalPosition + 1 >= length) {
+    var data = this.data.read(this.internalPosition, length);
+    this.internalPosition = this.internalPosition + length;
+    return data;
+  } else {
+    return '';
+  }
+};
+
+Chunk.prototype.readSlice = function(length) {
+  if ((this.length() - this.internalPosition) >= length) {
+    var data = null;
+    if (this.data.buffer != null) { //Pure BSON
+      data = this.data.buffer.slice(this.internalPosition, this.internalPosition + length);
+    } else { //Native BSON
+      data = new Buffer(length);
+      length = this.data.readInto(data, this.internalPosition);
+    }
+    this.internalPosition = this.internalPosition + length;
+    return data;
+  } else {
+    return null;
+  }
+};
+
+/**
+ * Checks if the read/write head is at the end.
+ *
+ * @return {boolean} Whether the read/write head has reached the end of this
+ *     chunk.
+ */
+Chunk.prototype.eof = function() {
+  return this.internalPosition == this.length() ? true : false;
+};
+
+/**
+ * Reads one character from the data of this chunk and advances the read/write
+ * head.
+ *
+ * @return {string} a single character data read if the the read/write head is
+ *     not at the end of the chunk. Returns an empty String otherwise.
+ */
+Chunk.prototype.getc = function() {
+  return this.read(1);
+};
+
+/**
+ * Clears the contents of the data in this chunk and resets the read/write head
+ * to the initial position.
+ */
+Chunk.prototype.rewind = function() {
+  this.internalPosition = 0;
+  this.data = new Binary();
+};
+
+/**
+ * Saves this chunk to the database. Also overwrites existing entries having the
+ * same id as this chunk.
+ *
+ * @param callback {function(*, GridStore)} This will be called after executing
+ *     this method. The first parameter will contain null and the second one
+ *     will contain a reference to this object.
+ */
+Chunk.prototype.save = function(callback) {
+  var self = this;
+
+  self.file.chunkCollection(function(err, collection) {
+    if(err) return callback(err);
+
+    collection.remove({'_id':self.objectId}, self.writeConcern, function(err, result) {
+      if(err) return callback(err);
+
+      if(self.data.length() > 0) {
+        self.buildMongoObject(function(mongoObject) {
+          var options = {forceServerObjectId:true};
+          for(var name in self.writeConcern) {
+            options[name] = self.writeConcern[name];
+          }
+
+          collection.insert(mongoObject, options, function(err, collection) {
+            callback(err, self);
+          });
+        });
+      } else {
+        callback(null, self);
+      }
+    });
+  });
+};
+
+/**
+ * Creates a mongoDB object representation of this chunk.
+ *
+ * @param callback {function(Object)} This will be called after executing this 
+ *     method. The object will be passed to the first parameter and will have
+ *     the structure:
+ *        
+ *        <pre><code>
+ *        {
+ *          '_id' : , // {number} id for this chunk
+ *          'files_id' : , // {number} foreign key to the file collection
+ *          'n' : , // {number} chunk number
+ *          'data' : , // {bson#Binary} the chunk data itself
+ *        }
+ *        </code></pre>
+ *
+ * @see <a href="http://www.mongodb.org/display/DOCS/GridFS+Specification#GridFSSpecification-{{chunks}}">MongoDB GridFS Chunk Object Structure</a>
+ */
+Chunk.prototype.buildMongoObject = function(callback) {
+  var mongoObject = {
+    'files_id': this.file.fileId,
+    'n': this.chunkNumber,
+    'data': this.data};
+  // If we are saving using a specific ObjectId
+  if(this.objectId != null) mongoObject._id = this.objectId;
+
+  callback(mongoObject);
+};
+
+/**
+ * @return {number} the length of the data
+ */
+Chunk.prototype.length = function() {
+  return this.data.length();
+};
+
+/**
+ * The position of the read/write head
+ * @name position
+ * @lends Chunk#
+ * @field
+ */
+Object.defineProperty(Chunk.prototype, "position", { enumerable: true
+  , get: function () {
+      return this.internalPosition;
+    }
+  , set: function(value) {
+      this.internalPosition = value;
+    }
+});
+
+/**
+ * The default chunk size
+ * @constant
+ */
+Chunk.DEFAULT_CHUNK_SIZE = 1024 * 256;
diff --git a/node_modules/mongodb/lib/mongodb/gridfs/grid.js b/node_modules/mongodb/lib/mongodb/gridfs/grid.js
new file mode 100644
index 0000000..aa695b7
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/gridfs/grid.js
@@ -0,0 +1,103 @@
+var GridStore = require('./gridstore').GridStore,
+  ObjectID = require('bson').ObjectID;
+
+/**
+ * A class representation of a simple Grid interface.
+ *
+ * @class Represents the Grid.
+ * @param {Db} db A database instance to interact with.
+ * @param {String} [fsName] optional different root collection for GridFS.
+ * @return {Grid}
+ */
+function Grid(db, fsName) {
+
+  if(!(this instanceof Grid)) return new Grid(db, fsName);
+
+  this.db = db;
+  this.fsName = fsName == null ? GridStore.DEFAULT_ROOT_COLLECTION : fsName;
+}
+
+/**
+ * Puts binary data to the grid
+ *
+ * Options
+ *  - **_id** {Any}, unique id for this file
+ *  - **root** {String}, root collection to use. Defaults to **{GridStore.DEFAULT_ROOT_COLLECTION}**.
+ *  - **content_type** {String}, mime type of the file. Defaults to **{GridStore.DEFAULT_CONTENT_TYPE}**.
+ *  - **chunk_size** {Number}, size for the chunk. Defaults to **{Chunk.DEFAULT_CHUNK_SIZE}**.
+ *  - **metadata** {Object}, arbitrary data the user wants to store.
+ *
+ * @param {Buffer} data buffer with Binary Data.
+ * @param {Object} [options] the options for the files.
+ * @param {Function} callback this will be called after this method is executed. The first parameter will contain an Error object if an error occured or null otherwise. The second parameter will contain a reference to this object.
+ * @return {null}
+ * @api public
+ */
+Grid.prototype.put = function(data, options, callback) {
+  var self = this;
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  options = args.length ? args.shift() : {};
+  // If root is not defined add our default one
+  options['root'] = options['root'] == null ? this.fsName : options['root'];
+
+  // Return if we don't have a buffer object as data
+  if(!(Buffer.isBuffer(data))) return callback(new Error("Data object must be a buffer object"), null);
+  // Get filename if we are using it
+  var filename = options['filename'] || null;
+  // Get id if we are using it
+  var id = options['_id'] || null;
+  // Create gridstore
+  var gridStore = new GridStore(this.db, id, filename, "w", options);
+  gridStore.open(function(err, gridStore) {
+    if(err) return callback(err, null);
+
+    gridStore.write(data, function(err, result) {
+      if(err) return callback(err, null);
+
+      gridStore.close(function(err, result) {
+        if(err) return callback(err, null);
+        callback(null, result);
+      })
+    })
+  })
+}
+
+/**
+ * Get binary data to the grid
+ *
+ * @param {Any} id for file.
+ * @param {Function} callback this will be called after this method is executed. The first parameter will contain an Error object if an error occured or null otherwise. The second parameter will contain a reference to this object.
+ * @return {null}
+ * @api public
+ */
+Grid.prototype.get = function(id, callback) {
+  // Create gridstore
+  var gridStore = new GridStore(this.db, id, null, "r", {root:this.fsName});
+  gridStore.open(function(err, gridStore) {
+    if(err) return callback(err, null);
+
+    // Return the data
+    gridStore.read(function(err, data) {
+      return callback(err, data)
+    });
+  })
+}
+
+/**
+ * Delete file from grid
+ *
+ * @param {Any} id for file.
+ * @param {Function} callback this will be called after this method is executed. The first parameter will contain an Error object if an error occured or null otherwise. The second parameter will contain a reference to this object.
+ * @return {null}
+ * @api public
+ */
+Grid.prototype.delete = function(id, callback) {
+  // Create gridstore
+  GridStore.unlink(this.db, id, {root:this.fsName}, function(err, result) {
+    if(err) return callback(err, false);
+    return callback(null, true);
+  });
+}
+
+exports.Grid = Grid;
diff --git a/node_modules/mongodb/lib/mongodb/gridfs/gridstore.js b/node_modules/mongodb/lib/mongodb/gridfs/gridstore.js
new file mode 100644
index 0000000..339da72
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/gridfs/gridstore.js
@@ -0,0 +1,1559 @@
+/**
+ * @fileOverview GridFS is a tool for MongoDB to store files to the database.
+ * Because of the restrictions of the object size the database can hold, a
+ * facility to split a file into several chunks is needed. The {@link GridStore}
+ * class offers a simplified api to interact with files while managing the
+ * chunks of split files behind the scenes. More information about GridFS can be
+ * found <a href="http://www.mongodb.org/display/DOCS/GridFS">here</a>.
+ */
+var Chunk = require('./chunk').Chunk,
+  DbCommand = require('../commands/db_command').DbCommand,
+  ObjectID = require('bson').ObjectID,
+  Buffer = require('buffer').Buffer,
+  fs = require('fs'),
+  timers = require('timers'),
+  util = require('util'),
+  inherits = util.inherits,
+  ReadStream = require('./readstream').ReadStream,
+  Stream = require('stream');
+
+// Set processor, setImmediate if 0.10 otherwise nextTick
+var processor = timers.setImmediate ? timers.setImmediate : process.nextTick;
+processor = process.nextTick
+
+var REFERENCE_BY_FILENAME = 0,
+  REFERENCE_BY_ID = 1;
+
+/**
+ * A class representation of a file stored in GridFS.
+ *
+ * Modes
+ *  - **"r"** - read only. This is the default mode.
+ *  - **"w"** - write in truncate mode. Existing data will be overwriten.
+ *  - **w+"** - write in edit mode.
+ *
+ * Options
+ *  - **root** {String}, root collection to use. Defaults to **{GridStore.DEFAULT_ROOT_COLLECTION}**.
+ *  - **content_type** {String}, mime type of the file. Defaults to **{GridStore.DEFAULT_CONTENT_TYPE}**.
+ *  - **chunk_size** {Number}, size for the chunk. Defaults to **{Chunk.DEFAULT_CHUNK_SIZE}**.
+ *  - **metadata** {Object}, arbitrary data the user wants to store.
+ *  - **readPreference** {String}, the prefered read preference (ReadPreference.PRIMARY, ReadPreference.PRIMARY_PREFERRED, ReadPreference.SECONDARY, ReadPreference.SECONDARY_PREFERRED, ReadPreference.NEAREST).
+ *  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *
+ * @class Represents the GridStore.
+ * @param {Db} db A database instance to interact with.
+ * @param {Any} [id] optional unique id for this file
+ * @param {String} [filename] optional filename for this file, no unique constrain on the field
+ * @param {String} mode set the mode for this file.
+ * @param {Object} options optional properties to specify.
+ * @return {GridStore}
+ */
+var GridStore = function GridStore(db, id, filename, mode, options) {
+  if(!(this instanceof GridStore)) return new GridStore(db, id, filename, mode, options);
+
+  var self = this;
+  this.db = db;
+
+  // Call stream constructor
+  if(typeof Stream == 'function') {
+    Stream.call(this);
+  } else {
+    // 0.4.X backward compatibility fix
+    Stream.Stream.call(this);
+  }
+
+  // Handle options
+  if(typeof options === 'undefined') options = {};
+  // Handle mode
+  if(typeof mode === 'undefined') {
+    mode = filename;
+    filename = undefined;
+  } else if(typeof mode == 'object') {
+    options = mode;
+    mode = filename;
+    filename = undefined;
+  }
+
+  if(id instanceof ObjectID) {
+    this.referenceBy = REFERENCE_BY_ID;
+    this.fileId = id;
+    this.filename = filename;
+  } else if(typeof filename == 'undefined') {
+    this.referenceBy = REFERENCE_BY_FILENAME;
+    this.filename = id;
+    if (mode.indexOf('w') != null) {
+      this.fileId = new ObjectID();
+    }
+  } else {
+    this.referenceBy = REFERENCE_BY_ID;
+    this.fileId = id;
+    this.filename = filename;
+  }
+
+  // Set up the rest
+  this.mode = mode == null ? "r" : mode;
+  this.options = options == null ? {w:1} : options;
+  
+  // If we have no write concerns set w:1 as default
+  if(this.options.w == null 
+    && this.options.j == null
+    && this.options.fsync == null) this.options.w = 1;
+
+  // Set the root if overridden
+  this.root = this.options['root'] == null ? exports.GridStore.DEFAULT_ROOT_COLLECTION : this.options['root'];
+  this.position = 0;
+  this.readPreference = this.options.readPreference || 'primary';
+  this.writeConcern =  _getWriteConcern(this, this.options);
+  // Set default chunk size
+  this.internalChunkSize = this.options['chunkSize'] == null ? Chunk.DEFAULT_CHUNK_SIZE : this.options['chunkSize'];
+}
+
+/**
+ *  Code for the streaming capabilities of the gridstore object
+ *  Most code from Aaron heckmanns project https://github.com/aheckmann/gridfs-stream
+ *  Modified to work on the gridstore object itself
+ *  @ignore
+ */
+if(typeof Stream == 'function') {
+  GridStore.prototype = { __proto__: Stream.prototype }
+} else {
+  // Node 0.4.X compatibility code
+  GridStore.prototype = { __proto__: Stream.Stream.prototype }
+}
+
+// Move pipe to _pipe
+GridStore.prototype._pipe = GridStore.prototype.pipe;
+
+/**
+ * Opens the file from the database and initialize this object. Also creates a
+ * new one if file does not exist.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain an **{Error}** object and the second parameter will be null if an error occured. Otherwise, the first parameter will be null and the second will contain the reference to this object.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.open = function(callback) {
+  if( this.mode != "w" && this.mode != "w+" && this.mode != "r"){
+    callback(new Error("Illegal mode " + this.mode), null);
+    return;
+  }
+
+  var self = this;
+
+  if((self.mode == "w" || self.mode == "w+") && self.db.serverConfig.primary != null) {
+    // Get files collection
+    self.collection(function(err, collection) {
+      if(err) return callback(err);
+
+      // Put index on filename
+      collection.ensureIndex([['filename', 1]], function(err, index) {
+        if(err) return callback(err);
+
+        // Get chunk collection
+        self.chunkCollection(function(err, chunkCollection) {
+          if(err) return callback(err);
+
+          // Ensure index on chunk collection
+          chunkCollection.ensureIndex([['files_id', 1], ['n', 1]], function(err, index) {
+            if(err) return callback(err);
+            _open(self, callback);
+          });
+        });
+      });
+    });
+  } else {
+    // Open the gridstore
+    _open(self, callback);
+  }
+};
+
+/**
+ * Hidding the _open function
+ * @ignore
+ * @api private
+ */
+var _open = function(self, callback) {
+  self.collection(function(err, collection) {
+    if(err!==null) {
+      callback(new Error("at collection: "+err), null);
+      return;
+    }
+
+    // Create the query
+    var query = self.referenceBy == REFERENCE_BY_ID ? {_id:self.fileId} : {filename:self.filename};
+    query = null == self.fileId && this.filename == null ? null : query;
+
+    // Fetch the chunks
+    if(query != null) {
+      collection.find(query, {readPreference:self.readPreference}, function(err, cursor) {
+        if(err) return error(err);
+
+        // Fetch the file
+        cursor.nextObject(function(err, doc) {
+          if(err) return error(err);
+
+          // Check if the collection for the files exists otherwise prepare the new one
+          if(doc != null) {
+            self.fileId = doc._id;
+            self.filename = doc.filename;
+            self.contentType = doc.contentType;
+            self.internalChunkSize = doc.chunkSize;
+            self.uploadDate = doc.uploadDate;
+            self.aliases = doc.aliases;
+            self.length = doc.length;
+            self.metadata = doc.metadata;
+            self.internalMd5 = doc.md5;
+          } else if (self.mode != 'r') {
+            self.fileId = self.fileId == null ? new ObjectID() : self.fileId;
+            self.contentType = exports.GridStore.DEFAULT_CONTENT_TYPE;
+            self.internalChunkSize = self.internalChunkSize == null ? Chunk.DEFAULT_CHUNK_SIZE : self.internalChunkSize;
+            self.length = 0;
+          } else {
+            self.length = 0;
+            var txtId = self.fileId instanceof ObjectID ? self.fileId.toHexString() : self.fileId;
+            return error(new Error((self.referenceBy == REFERENCE_BY_ID ? txtId : self.filename) + " does not exist", self));
+          }
+
+          // Process the mode of the object
+          if(self.mode == "r") {
+            nthChunk(self, 0, function(err, chunk) {
+              if(err) return error(err);
+              self.currentChunk = chunk;
+              self.position = 0;
+              callback(null, self);
+            });
+          } else if(self.mode == "w") {
+            // Delete any existing chunks
+            deleteChunks(self, function(err, result) {
+              if(err) return error(err);
+              self.currentChunk = new Chunk(self, {'n':0}, self.writeConcern);
+              self.contentType = self.options['content_type'] == null ? self.contentType : self.options['content_type'];
+              self.internalChunkSize = self.options['chunk_size'] == null ? self.internalChunkSize : self.options['chunk_size'];
+              self.metadata = self.options['metadata'] == null ? self.metadata : self.options['metadata'];
+              self.position = 0;
+              callback(null, self);
+            });
+          } else if(self.mode == "w+") {
+            nthChunk(self, lastChunkNumber(self), function(err, chunk) {
+              if(err) return error(err);
+              // Set the current chunk
+              self.currentChunk = chunk == null ? new Chunk(self, {'n':0}, self.writeConcern) : chunk;
+              self.currentChunk.position = self.currentChunk.data.length();
+              self.metadata = self.options['metadata'] == null ? self.metadata : self.options['metadata'];
+              self.position = self.length;
+              callback(null, self);
+            });
+          }
+        });
+      });
+    } else {
+      // Write only mode
+      self.fileId = null == self.fileId ? new ObjectID() : self.fileId;
+      self.contentType = exports.GridStore.DEFAULT_CONTENT_TYPE;
+      self.internalChunkSize = self.internalChunkSize == null ? Chunk.DEFAULT_CHUNK_SIZE : self.internalChunkSize;
+      self.length = 0;
+
+      self.chunkCollection(function(err, collection2) {
+        if(err) return error(err);
+
+        // No file exists set up write mode
+        if(self.mode == "w") {
+          // Delete any existing chunks
+          deleteChunks(self, function(err, result) {
+            if(err) return error(err);
+            self.currentChunk = new Chunk(self, {'n':0}, self.writeConcern);
+            self.contentType = self.options['content_type'] == null ? self.contentType : self.options['content_type'];
+            self.internalChunkSize = self.options['chunk_size'] == null ? self.internalChunkSize : self.options['chunk_size'];
+            self.metadata = self.options['metadata'] == null ? self.metadata : self.options['metadata'];
+            self.position = 0;
+            callback(null, self);
+          });
+        } else if(self.mode == "w+") {
+          nthChunk(self, lastChunkNumber(self), function(err, chunk) {
+            if(err) return error(err);
+            // Set the current chunk
+            self.currentChunk = chunk == null ? new Chunk(self, {'n':0}, self.writeConcern) : chunk;
+            self.currentChunk.position = self.currentChunk.data.length();
+            self.metadata = self.options['metadata'] == null ? self.metadata : self.options['metadata'];
+            self.position = self.length;
+            callback(null, self);
+          });
+        }
+      });
+    }
+  });
+
+  // only pass error to callback once
+  function error (err) {
+    if(error.err) return;
+    callback(error.err = err);
+  }
+};
+
+/**
+ * Stores a file from the file system to the GridFS database.
+ *
+ * @param {String|Buffer|FileHandle} file the file to store.
+ * @param {Function} callback this will be called after this method is executed. The first parameter will be null and the the second will contain the reference to this object.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.writeFile = function (file, callback) {
+  var self = this;
+  if (typeof file === 'string') {
+    fs.open(file, 'r', 0666, function (err, fd) {
+      if(err) return callback(err);
+      self.writeFile(fd, callback);
+    });
+    return;
+  }
+
+  self.open(function (err, self) {
+    if(err) return callback(err, self);
+
+    fs.fstat(file, function (err, stats) {
+      if(err) return callback(err, self);
+
+      var offset = 0;
+      var index = 0;
+      var numberOfChunksLeft = Math.min(stats.size / self.chunkSize);
+
+      // Write a chunk
+      var writeChunk = function() {
+        fs.read(file, self.chunkSize, offset, 'binary', function(err, data, bytesRead) {
+          if(err) return callback(err, self);
+
+          offset = offset + bytesRead;
+
+          // Create a new chunk for the data
+          var chunk = new Chunk(self, {n:index++}, self.writeConcern);
+          chunk.write(data, function(err, chunk) {
+            if(err) return callback(err, self);
+
+            chunk.save(function(err, result) {
+              if(err) return callback(err, self);
+
+              self.position = self.position + data.length;
+
+              // Point to current chunk
+              self.currentChunk = chunk;
+
+              if(offset >= stats.size) {
+                fs.close(file);
+                self.close(function(err, result) {
+                  if(err) return callback(err, self);
+                  return callback(null, self);
+                });
+              } else {
+                return processor(writeChunk);
+              }
+            });
+          });
+        });
+      }
+
+      // Process the first write
+      processor(writeChunk);
+    });
+  });
+};
+
+/**
+ * Writes some data. This method will work properly only if initialized with mode
+ * "w" or "w+".
+ *
+ * @param string {string} The data to write.
+ * @param close {boolean=false} opt_argument Closes this file after writing if
+ *     true.
+ * @param callback {function(*, GridStore)} This will be called after executing
+ *     this method. The first parameter will contain null and the second one
+ *     will contain a reference to this object.
+ *
+ * @ignore
+ * @api private
+ */
+var writeBuffer = function(self, buffer, close, callback) {
+  if(typeof close === "function") { callback = close; close = null; }
+  var finalClose = (close == null) ? false : close;
+
+  if(self.mode[0] != "w") {
+    callback(new Error((self.referenceBy == REFERENCE_BY_ID ? self.toHexString() : self.filename) + " not opened for writing"), null);
+  } else {
+    if(self.currentChunk.position + buffer.length >= self.chunkSize) {
+      // Write out the current Chunk and then keep writing until we have less data left than a chunkSize left
+      // to a new chunk (recursively)
+      var previousChunkNumber = self.currentChunk.chunkNumber;
+      var leftOverDataSize = self.chunkSize - self.currentChunk.position;
+      var firstChunkData = buffer.slice(0, leftOverDataSize);
+      var leftOverData = buffer.slice(leftOverDataSize);
+      // A list of chunks to write out
+      var chunksToWrite = [self.currentChunk.write(firstChunkData)];
+      // If we have more data left than the chunk size let's keep writing new chunks
+      while(leftOverData.length >= self.chunkSize) {
+        // Create a new chunk and write to it
+        var newChunk = new Chunk(self, {'n': (previousChunkNumber + 1)}, self.writeConcern);
+        var firstChunkData = leftOverData.slice(0, self.chunkSize);
+        leftOverData = leftOverData.slice(self.chunkSize);
+        // Update chunk number
+        previousChunkNumber = previousChunkNumber + 1;
+        // Write data
+        newChunk.write(firstChunkData);
+        // Push chunk to save list
+        chunksToWrite.push(newChunk);
+      }
+
+      // Set current chunk with remaining data
+      self.currentChunk = new Chunk(self, {'n': (previousChunkNumber + 1)}, self.writeConcern);
+      // If we have left over data write it
+      if(leftOverData.length > 0) self.currentChunk.write(leftOverData);
+
+      // Update the position for the gridstore
+      self.position = self.position + buffer.length;
+      // Total number of chunks to write
+      var numberOfChunksToWrite = chunksToWrite.length;
+      // Write out all the chunks and then return
+      for(var i = 0; i < chunksToWrite.length; i++) {
+        var chunk = chunksToWrite[i];
+        chunk.save(function(err, result) {
+          if(err) return callback(err);
+
+          numberOfChunksToWrite = numberOfChunksToWrite - 1;
+
+          if(numberOfChunksToWrite <= 0) {
+            return callback(null, self);
+          }
+        })
+      }
+    } else {
+      // Update the position for the gridstore
+      self.position = self.position + buffer.length;
+      // We have less data than the chunk size just write it and callback
+      self.currentChunk.write(buffer);
+      callback(null, self);
+    }
+  }
+};
+
+/**
+ * Creates a mongoDB object representation of this object.
+ *
+ * @param callback {function(object)} This will be called after executing this
+ *     method. The object will be passed to the first parameter and will have
+ *     the structure:
+ *
+ *        <pre><code>
+ *        {
+ *          '_id' : , // {number} id for this file
+ *          'filename' : , // {string} name for this file
+ *          'contentType' : , // {string} mime type for this file
+ *          'length' : , // {number} size of this file?
+ *          'chunksize' : , // {number} chunk size used by this file
+ *          'uploadDate' : , // {Date}
+ *          'aliases' : , // {array of string}
+ *          'metadata' : , // {string}
+ *        }
+ *        </code></pre>
+ *
+ * @ignore
+ * @api private
+ */
+var buildMongoObject = function(self, callback) {
+  // // Keeps the final chunk number
+  // var chunkNumber = 0;
+  // var previousChunkSize = 0;
+  // // Get the correct chunk Number, if we have an empty chunk return the previous chunk number
+  // if(null != self.currentChunk && self.currentChunk.chunkNumber > 0 && self.currentChunk.position == 0) {
+  //   chunkNumber = self.currentChunk.chunkNumber - 1;
+  // } else {
+  //   chunkNumber = self.currentChunk.chunkNumber;
+  //   previousChunkSize = self.currentChunk.position;
+  // }
+
+  // // Calcuate the length
+  // var length = self.currentChunk != null ? (chunkNumber * self.chunkSize + previousChunkSize) : 0;
+  var mongoObject = {
+    '_id': self.fileId,
+    'filename': self.filename,
+    'contentType': self.contentType,
+    'length': self.position ? self.position : 0,
+    'chunkSize': self.chunkSize,
+    'uploadDate': self.uploadDate,
+    'aliases': self.aliases,
+    'metadata': self.metadata
+  };
+
+  var md5Command = {filemd5:self.fileId, root:self.root};
+  self.db.command(md5Command, function(err, results) {
+    mongoObject.md5 = results.md5;
+    callback(mongoObject);
+  });
+};
+
+/**
+ * Saves this file to the database. This will overwrite the old entry if it
+ * already exists. This will work properly only if mode was initialized to
+ * "w" or "w+".
+ *
+ * @param {Function} callback this will be called after executing this method. Passes an **{Error}** object to the first parameter and null to the second if an error occured. Otherwise, passes null to the first and a reference to this object to the second.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.close = function(callback) {
+  var self = this;
+
+  if(self.mode[0] == "w") {
+    if(self.currentChunk != null && self.currentChunk.position > 0) {
+      self.currentChunk.save(function(err, chunk) {
+        if(err && typeof callback == 'function') return callback(err);
+
+        self.collection(function(err, files) {
+          if(err && typeof callback == 'function') return callback(err);
+
+          // Build the mongo object
+          if(self.uploadDate != null) {
+            files.remove({'_id':self.fileId}, {safe:true}, function(err, collection) {
+              if(err && typeof callback == 'function') return callback(err);
+
+              buildMongoObject(self, function(mongoObject) {
+                files.save(mongoObject, self.writeConcern, function(err) {
+                  if(typeof callback == 'function')
+                    callback(err, mongoObject);
+                });
+              });
+            });
+          } else {
+            self.uploadDate = new Date();
+            buildMongoObject(self, function(mongoObject) {
+              files.save(mongoObject, self.writeConcern, function(err) {
+                if(typeof callback == 'function')
+                  callback(err, mongoObject);
+              });
+            });
+          }
+        });
+      });
+    } else {
+      self.collection(function(err, files) {
+        if(err && typeof callback == 'function') return callback(err);
+
+        self.uploadDate = new Date();
+        buildMongoObject(self, function(mongoObject) {
+          files.save(mongoObject, self.writeConcern, function(err) {
+            if(typeof callback == 'function')
+              callback(err, mongoObject);
+          });
+        });
+      });
+    }
+  } else if(self.mode[0] == "r") {
+    if(typeof callback == 'function')
+      callback(null, null);
+  } else {
+    if(typeof callback == 'function')
+      callback(new Error("Illegal mode " + self.mode), null);
+  }
+};
+
+/**
+ * Gets the nth chunk of this file.
+ *
+ * @param chunkNumber {number} The nth chunk to retrieve.
+ * @param callback {function(*, Chunk|object)} This will be called after
+ *     executing this method. null will be passed to the first parameter while
+ *     a new {@link Chunk} instance will be passed to the second parameter if
+ *     the chunk was found or an empty object {} if not.
+ *
+ * @ignore
+ * @api private
+ */
+var nthChunk = function(self, chunkNumber, callback) {
+  self.chunkCollection(function(err, collection) {
+    if(err) return callback(err);
+
+    collection.find({'files_id':self.fileId, 'n':chunkNumber}, {readPreference: self.readPreference}, function(err, cursor) {
+      if(err) return callback(err);
+
+      cursor.nextObject(function(err, chunk) {
+        if(err) return callback(err);
+
+        var finalChunk = chunk == null ? {} : chunk;
+        callback(null, new Chunk(self, finalChunk, self.writeConcern));
+      });
+    });
+  });
+};
+
+/**
+ *
+ * @ignore
+ * @api private
+ */
+GridStore.prototype._nthChunk = function(chunkNumber, callback) {
+  nthChunk(this, chunkNumber, callback);
+}
+
+/**
+ * @return {Number} The last chunk number of this file.
+ *
+ * @ignore
+ * @api private
+ */
+var lastChunkNumber = function(self) {
+  return Math.floor(self.length/self.chunkSize);
+};
+
+/**
+ * Retrieve this file's chunks collection.
+ *
+ * @param {Function} callback this will be called after executing this method. An exception object will be passed to the first parameter when an error occured or null otherwise. A new **{Collection}** object will be passed to the second parameter if no error occured.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.chunkCollection = function(callback) {
+  this.db.collection((this.root + ".chunks"), callback);
+};
+
+/**
+ * Deletes all the chunks of this file in the database.
+ *
+ * @param callback {function(*, boolean)} This will be called after this method
+ *     executes. Passes null to the first and true to the second argument.
+ *
+ * @ignore
+ * @api private
+ */
+var deleteChunks = function(self, callback) {
+  if(self.fileId != null) {
+    self.chunkCollection(function(err, collection) {
+      if(err) return callback(err, false);
+      collection.remove({'files_id':self.fileId}, {safe:true}, function(err, result) {
+        if(err) return callback(err, false);
+        callback(null, true);
+      });
+    });
+  } else {
+    callback(null, true);
+  }
+};
+
+/**
+ * Deletes all the chunks of this file in the database.
+ *
+ * @param {Function} callback this will be called after this method executes. Passes null to the first and true to the second argument.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.unlink = function(callback) {
+  var self = this;
+  deleteChunks(this, function(err) {
+    if(err!==null) {
+      err.message = "at deleteChunks: " + err.message;
+      return callback(err);
+    }
+
+    self.collection(function(err, collection) {
+      if(err!==null) {
+        err.message = "at collection: " + err.message;
+        return callback(err);
+      }
+
+      collection.remove({'_id':self.fileId}, {safe:true}, function(err) {
+        callback(err, self);
+      });
+    });
+  });
+};
+
+/**
+ * Retrieves the file collection associated with this object.
+ *
+ * @param {Function} callback this will be called after executing this method. An exception object will be passed to the first parameter when an error occured or null otherwise. A new **{Collection}** object will be passed to the second parameter if no error occured.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.collection = function(callback) {
+  this.db.collection(this.root + ".files", callback);
+};
+
+/**
+ * Reads the data of this file.
+ *
+ * @param {String} [separator] the character to be recognized as the newline separator.
+ * @param {Function} callback This will be called after this method is executed. The first parameter will be null and the second parameter will contain an array of strings representing the entire data, each element representing a line including the separator character.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.readlines = function(separator, callback) {
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  separator = args.length ? args.shift() : "\n";
+
+  this.read(function(err, data) {
+    if(err) return callback(err);
+
+    var items = data.toString().split(separator);
+    items = items.length > 0 ? items.splice(0, items.length - 1) : [];
+    for(var i = 0; i < items.length; i++) {
+      items[i] = items[i] + separator;
+    }
+
+    callback(null, items);
+  });
+};
+
+/**
+ * Deletes all the chunks of this file in the database if mode was set to "w" or
+ * "w+" and resets the read/write head to the initial position.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain null and the second one will contain a reference to this object.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.rewind = function(callback) {
+  var self = this;
+
+  if(this.currentChunk.chunkNumber != 0) {
+    if(this.mode[0] == "w") {
+      deleteChunks(self, function(err, gridStore) {
+        if(err) return callback(err);
+        self.currentChunk = new Chunk(self, {'n': 0}, self.writeConcern);
+        self.position = 0;
+        callback(null, self);
+      });
+    } else {
+      self.currentChunk(0, function(err, chunk) {
+        if(err) return callback(err);
+        self.currentChunk = chunk;
+        self.currentChunk.rewind();
+        self.position = 0;
+        callback(null, self);
+      });
+    }
+  } else {
+    self.currentChunk.rewind();
+    self.position = 0;
+    callback(null, self);
+  }
+};
+
+/**
+ * Retrieves the contents of this file and advances the read/write head. Works with Buffers only.
+ *
+ * There are 3 signatures for this method:
+ *
+ * (callback)
+ * (length, callback)
+ * (length, buffer, callback)
+ *
+ * @param {Number} [length] the number of characters to read. Reads all the characters from the read/write head to the EOF if not specified.
+ * @param {String|Buffer} [buffer] a string to hold temporary data. This is used for storing the string data read so far when recursively calling this method.
+ * @param {Function} callback this will be called after this method is executed. null will be passed to the first parameter and a string containing the contents of the buffer concatenated with the contents read from this file will be passed to the second.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.read = function(length, buffer, callback) {
+  var self = this;
+
+  var args = Array.prototype.slice.call(arguments, 0);
+  callback = args.pop();
+  length = args.length ? args.shift() : null;
+  buffer = args.length ? args.shift() : null;
+
+  // The data is a c-terminated string and thus the length - 1
+  var finalLength = length == null ? self.length - self.position : length;
+  var finalBuffer = buffer == null ? new Buffer(finalLength) : buffer;
+  // Add a index to buffer to keep track of writing position or apply current index
+  finalBuffer._index = buffer != null && buffer._index != null ? buffer._index : 0;
+
+  if((self.currentChunk.length() - self.currentChunk.position + finalBuffer._index) >= finalLength) {
+    var slice = self.currentChunk.readSlice(finalLength - finalBuffer._index);
+    // Copy content to final buffer
+    slice.copy(finalBuffer, finalBuffer._index);
+    // Update internal position
+    self.position = self.position + finalBuffer.length;
+    // Check if we don't have a file at all
+    if(finalLength == 0 && finalBuffer.length == 0) return callback(new Error("File does not exist"), null);
+    // Else return data
+    callback(null, finalBuffer);
+  } else {
+    var slice = self.currentChunk.readSlice(self.currentChunk.length() - self.currentChunk.position);
+    // Copy content to final buffer
+    slice.copy(finalBuffer, finalBuffer._index);
+    // Update index position
+    finalBuffer._index += slice.length;
+
+    // Load next chunk and read more
+    nthChunk(self, self.currentChunk.chunkNumber + 1, function(err, chunk) {
+      if(err) return callback(err);
+
+      if(chunk.length() > 0) {
+        self.currentChunk = chunk;
+        self.read(length, finalBuffer, callback);
+      } else {
+        if (finalBuffer._index > 0) {
+          callback(null, finalBuffer)
+        } else {
+          callback(new Error("no chunks found for file, possibly corrupt"), null);
+        }
+      }
+    });
+  }
+}
+
+/**
+ * Retrieves the position of the read/write head of this file.
+ *
+ * @param {Function} callback This gets called after this method terminates. null is passed to the first parameter and the position is passed to the second.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.tell = function(callback) {
+  callback(null, this.position);
+};
+
+/**
+ * Moves the read/write head to a new location.
+ *
+ * There are 3 signatures for this method
+ *
+ * Seek Location Modes
+ *  - **GridStore.IO_SEEK_SET**, **(default)** set the position from the start of the file.
+ *  - **GridStore.IO_SEEK_CUR**, set the position from the current position in the file.
+ *  - **GridStore.IO_SEEK_END**, set the position from the end of the file.
+ *
+ * @param {Number} [position] the position to seek to
+ * @param {Number} [seekLocation] seek mode. Use one of the Seek Location modes.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain null and the second one will contain a reference to this object.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.seek = function(position, seekLocation, callback) {
+  var self = this;
+
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  seekLocation = args.length ? args.shift() : null;
+
+  var seekLocationFinal = seekLocation == null ? exports.GridStore.IO_SEEK_SET : seekLocation;
+  var finalPosition = position;
+  var targetPosition = 0;
+
+  // Calculate the position
+  if(seekLocationFinal == exports.GridStore.IO_SEEK_CUR) {
+    targetPosition = self.position + finalPosition;
+  } else if(seekLocationFinal == exports.GridStore.IO_SEEK_END) {
+    targetPosition = self.length + finalPosition;
+  } else {
+    targetPosition = finalPosition;
+  }
+
+  // Get the chunk
+  var newChunkNumber = Math.floor(targetPosition/self.chunkSize);
+  if(newChunkNumber != self.currentChunk.chunkNumber) {
+    var seekChunk = function() {
+      nthChunk(self, newChunkNumber, function(err, chunk) {
+        self.currentChunk = chunk;
+        self.position = targetPosition;
+        self.currentChunk.position = (self.position % self.chunkSize);
+        callback(err, self);
+      });
+    };
+
+    if(self.mode[0] == 'w') {
+      self.currentChunk.save(function(err) {
+        if(err) return callback(err);
+        seekChunk();
+      });
+    } else {
+      seekChunk();
+    }
+  } else {
+    self.position = targetPosition;
+    self.currentChunk.position = (self.position % self.chunkSize);
+    callback(null, self);
+  }
+};
+
+/**
+ * Verify if the file is at EOF.
+ *
+ * @return {Boolean} true if the read/write head is at the end of this file.
+ * @api public
+ */
+GridStore.prototype.eof = function() {
+  return this.position == this.length ? true : false;
+};
+
+/**
+ * Retrieves a single character from this file.
+ *
+ * @param {Function} callback this gets called after this method is executed. Passes null to the first parameter and the character read to the second or null to the second if the read/write head is at the end of the file.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.getc = function(callback) {
+  var self = this;
+
+  if(self.eof()) {
+    callback(null, null);
+  } else if(self.currentChunk.eof()) {
+    nthChunk(self, self.currentChunk.chunkNumber + 1, function(err, chunk) {
+      self.currentChunk = chunk;
+      self.position = self.position + 1;
+      callback(err, self.currentChunk.getc());
+    });
+  } else {
+    self.position = self.position + 1;
+    callback(null, self.currentChunk.getc());
+  }
+};
+
+/**
+ * Writes a string to the file with a newline character appended at the end if
+ * the given string does not have one.
+ *
+ * @param {String} string the string to write.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain null and the second one will contain a reference to this object.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.puts = function(string, callback) {
+  var finalString = string.match(/\n$/) == null ? string + "\n" : string;
+  this.write(finalString, callback);
+};
+
+/**
+ * Returns read stream based on this GridStore file
+ *
+ * Events
+ *  - **data** {function(item) {}} the data event triggers when a document is ready.
+ *  - **end** {function() {}} the end event triggers when there is no more documents available.
+ *  - **close** {function() {}} the close event triggers when the stream is closed.
+ *  - **error** {function(err) {}} the error event triggers if an error happens.
+ *
+ * @param {Boolean} autoclose if true current GridStore will be closed when EOF and 'close' event will be fired
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.stream = function(autoclose) {
+  return new ReadStream(autoclose, this);
+};
+
+/**
+* The collection to be used for holding the files and chunks collection.
+*
+* @classconstant DEFAULT_ROOT_COLLECTION
+**/
+GridStore.DEFAULT_ROOT_COLLECTION = 'fs';
+
+/**
+* Default file mime type
+*
+* @classconstant DEFAULT_CONTENT_TYPE
+**/
+GridStore.DEFAULT_CONTENT_TYPE = 'binary/octet-stream';
+
+/**
+* Seek mode where the given length is absolute.
+*
+* @classconstant IO_SEEK_SET
+**/
+GridStore.IO_SEEK_SET = 0;
+
+/**
+* Seek mode where the given length is an offset to the current read/write head.
+*
+* @classconstant IO_SEEK_CUR
+**/
+GridStore.IO_SEEK_CUR = 1;
+
+/**
+* Seek mode where the given length is an offset to the end of the file.
+*
+* @classconstant IO_SEEK_END
+**/
+GridStore.IO_SEEK_END = 2;
+
+/**
+ * Checks if a file exists in the database.
+ *
+ * Options
+ *  - **readPreference** {String}, the prefered read preference (ReadPreference.PRIMARY, ReadPreference.PRIMARY_PREFERRED, ReadPreference.SECONDARY, ReadPreference.SECONDARY_PREFERRED, ReadPreference.NEAREST).
+ *
+ * @param {Db} db the database to query.
+ * @param {String} name the name of the file to look for.
+ * @param {String} [rootCollection] the root collection that holds the files and chunks collection. Defaults to **{GridStore.DEFAULT_ROOT_COLLECTION}**.
+ * @param {Function} callback this will be called after this method executes. Passes null to the first and passes true to the second if the file exists and false otherwise.
+ * @return {null}
+ * @api public
+ */
+GridStore.exist = function(db, fileIdObject, rootCollection, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 2);
+  callback = args.pop();
+  rootCollection = args.length ? args.shift() : null;
+  options = args.length ? args.shift() : {};
+
+  // Establish read preference
+  var readPreference = options.readPreference || 'primary';
+  // Fetch collection
+  var rootCollectionFinal = rootCollection != null ? rootCollection : GridStore.DEFAULT_ROOT_COLLECTION;
+  db.collection(rootCollectionFinal + ".files", function(err, collection) {
+    if(err) return callback(err);
+
+    // Build query
+    var query = (typeof fileIdObject == 'string' || Object.prototype.toString.call(fileIdObject) == '[object RegExp]' )
+      ? {'filename':fileIdObject}
+      : {'_id':fileIdObject};    // Attempt to locate file
+
+    collection.find(query, {readPreference:readPreference}, function(err, cursor) {
+      if(err) return callback(err);
+
+      cursor.nextObject(function(err, item) {
+        if(err) return callback(err);
+        callback(null, item == null ? false : true);
+      });
+    });
+  });
+};
+
+/**
+ * Gets the list of files stored in the GridFS.
+ *
+ * @param {Db} db the database to query.
+ * @param {String} [rootCollection] the root collection that holds the files and chunks collection. Defaults to **{GridStore.DEFAULT_ROOT_COLLECTION}**.
+ * @param {Function} callback this will be called after this method executes. Passes null to the first and passes an array of strings containing the names of the files.
+ * @return {null}
+ * @api public
+ */
+GridStore.list = function(db, rootCollection, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = args.pop();
+  rootCollection = args.length ? args.shift() : null;
+  options = args.length ? args.shift() : {};
+
+  // Ensure we have correct values
+  if(rootCollection != null && typeof rootCollection == 'object') {
+    options = rootCollection;
+    rootCollection = null;
+  }
+
+  // Establish read preference
+  var readPreference = options.readPreference || 'primary';
+  // Check if we are returning by id not filename
+  var byId = options['id'] != null ? options['id'] : false;
+  // Fetch item
+  var rootCollectionFinal = rootCollection != null ? rootCollection : GridStore.DEFAULT_ROOT_COLLECTION;
+  var items = [];
+  db.collection((rootCollectionFinal + ".files"), function(err, collection) {
+    if(err) return callback(err);
+
+    collection.find({}, {readPreference:readPreference}, function(err, cursor) {
+      if(err) return callback(err);
+
+      cursor.each(function(err, item) {
+        if(item != null) {
+          items.push(byId ? item._id : item.filename);
+        } else {
+          callback(err, items);
+        }
+      });
+    });
+  });
+};
+
+/**
+ * Reads the contents of a file.
+ *
+ * This method has the following signatures
+ *
+ * (db, name, callback)
+ * (db, name, length, callback)
+ * (db, name, length, offset, callback)
+ * (db, name, length, offset, options, callback)
+ *
+ * @param {Db} db the database to query.
+ * @param {String} name the name of the file.
+ * @param {Number} [length] the size of data to read.
+ * @param {Number} [offset] the offset from the head of the file of which to start reading from.
+ * @param {Object} [options] the options for the file.
+ * @param {Function} callback this will be called after this method executes. A string with an error message will be passed to the first parameter when the length and offset combination exceeds the length of the file while an Error object will be passed if other forms of error occured, otherwise, a string is passed. The second parameter will contain the data read if successful or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+GridStore.read = function(db, name, length, offset, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 2);
+  callback = args.pop();
+  length = args.length ? args.shift() : null;
+  offset = args.length ? args.shift() : null;
+  options = args.length ? args.shift() : null;
+
+  new GridStore(db, name, "r", options).open(function(err, gridStore) {
+    if(err) return callback(err);
+    // Make sure we are not reading out of bounds
+    if(offset && offset >= gridStore.length) return callback("offset larger than size of file", null);
+    if(length && length > gridStore.length) return callback("length is larger than the size of the file", null);
+    if(offset && length && (offset + length) > gridStore.length) return callback("offset and length is larger than the size of the file", null);
+
+    if(offset != null) {
+      gridStore.seek(offset, function(err, gridStore) {
+        if(err) return callback(err);
+        gridStore.read(length, callback);
+      });
+    } else {
+      gridStore.read(length, callback);
+    }
+  });
+};
+
+/**
+ * Reads the data of this file.
+ *
+ * @param {Db} db the database to query.
+ * @param {String} name the name of the file.
+ * @param {String} [separator] the character to be recognized as the newline separator.
+ * @param {Object} [options] file options.
+ * @param {Function} callback this will be called after this method is executed. The first parameter will be null and the second parameter will contain an array of strings representing the entire data, each element representing a line including the separator character.
+ * @return {null}
+ * @api public
+ */
+GridStore.readlines = function(db, name, separator, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 2);
+  callback = args.pop();
+  separator = args.length ? args.shift() : null;
+  options = args.length ? args.shift() : null;
+
+  var finalSeperator = separator == null ? "\n" : separator;
+  new GridStore(db, name, "r", options).open(function(err, gridStore) {
+    if(err) return callback(err);
+    gridStore.readlines(finalSeperator, callback);
+  });
+};
+
+/**
+ * Deletes the chunks and metadata information of a file from GridFS.
+ *
+ * @param {Db} db the database to interact with.
+ * @param {String|Array} names the name/names of the files to delete.
+ * @param {Object} [options] the options for the files.
+ * @callback {Function} this will be called after this method is executed. The first parameter will contain an Error object if an error occured or null otherwise. The second parameter will contain a reference to this object.
+ * @return {null}
+ * @api public
+ */
+GridStore.unlink = function(db, names, options, callback) {
+  var self = this;
+  var args = Array.prototype.slice.call(arguments, 2);
+  callback = args.pop();
+  options = args.length ? args.shift() : null;
+
+  if(names.constructor == Array) {
+    var tc = 0;
+    for(var i = 0; i < names.length; i++) {
+      ++tc;
+      self.unlink(db, names[i], function(result) {
+        if(--tc == 0) {
+            callback(null, self);
+        }
+      });
+    }
+  } else {
+    new GridStore(db, names, "w", options).open(function(err, gridStore) {
+      if(err) return callback(err);
+      deleteChunks(gridStore, function(err, result) {
+        if(err) return callback(err);
+        gridStore.collection(function(err, collection) {
+          if(err) return callback(err);
+          collection.remove({'_id':gridStore.fileId}, {safe:true}, function(err, collection) {
+            callback(err, self);
+          });
+        });
+      });
+    });
+  }
+};
+
+/**
+ * Returns the current chunksize of the file.
+ *
+ * @field chunkSize
+ * @type {Number}
+ * @getter
+ * @setter
+ * @property return number of bytes in the current chunkSize.
+ */
+Object.defineProperty(GridStore.prototype, "chunkSize", { enumerable: true
+ , get: function () {
+     return this.internalChunkSize;
+   }
+ , set: function(value) {
+     if(!(this.mode[0] == "w" && this.position == 0 && this.uploadDate == null)) {
+       this.internalChunkSize = this.internalChunkSize;
+     } else {
+       this.internalChunkSize = value;
+     }
+   }
+});
+
+/**
+ * The md5 checksum for this file.
+ *
+ * @field md5
+ * @type {Number}
+ * @getter
+ * @setter
+ * @property return this files md5 checksum.
+ */
+Object.defineProperty(GridStore.prototype, "md5", { enumerable: true
+ , get: function () {
+     return this.internalMd5;
+   }
+});
+
+/**
+ *  GridStore Streaming methods
+ *  Handles the correct return of the writeable stream status
+ *  @ignore
+ */
+Object.defineProperty(GridStore.prototype, "writable", { enumerable: true
+ , get: function () {
+    if(this._writeable == null) {
+      this._writeable = this.mode != null && this.mode.indexOf("w") != -1;
+    }
+    // Return the _writeable
+    return this._writeable;
+  }
+ , set: function(value) {
+    this._writeable = value;
+  }
+});
+
+/**
+ *  Handles the correct return of the readable stream status
+ *  @ignore
+ */
+Object.defineProperty(GridStore.prototype, "readable", { enumerable: true
+ , get: function () {
+    if(this._readable == null) {
+      this._readable = this.mode != null && this.mode.indexOf("r") != -1;
+    }
+    return this._readable;
+  }
+ , set: function(value) {
+    this._readable = value;
+  }
+});
+
+GridStore.prototype.paused;
+
+/**
+ *  Handles the correct setting of encoding for the stream
+ *  @ignore
+ */
+GridStore.prototype.setEncoding = fs.ReadStream.prototype.setEncoding;
+
+/**
+ *  Handles the end events
+ *  @ignore
+ */
+GridStore.prototype.end = function end(data) {
+  var self = this;
+  // allow queued data to write before closing
+  if(!this.writable) return;
+  this.writable = false;
+
+  if(data) {
+    this._q.push(data);
+  }
+
+  this.on('drain', function () {
+    self.close(function (err) {
+      if (err) return _error(self, err);
+      self.emit('close');
+    });
+  });
+
+  _flush(self);
+}
+
+/**
+ *  Handles the normal writes to gridstore
+ *  @ignore
+ */
+var _writeNormal = function(self, data, close, callback) {
+  // If we have a buffer write it using the writeBuffer method
+  if(Buffer.isBuffer(data)) {
+    return writeBuffer(self, data, close, callback);
+  } else {
+    // Wrap the string in a buffer and write
+    return writeBuffer(self, new Buffer(data, 'binary'), close, callback);
+  }
+}
+
+/**
+ * Writes some data. This method will work properly only if initialized with mode "w" or "w+".
+ *
+ * @param {String|Buffer} data the data to write.
+ * @param {Boolean} [close] closes this file after writing if set to true.
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain null and the second one will contain a reference to this object.
+ * @return {null}
+ * @api public
+ */
+GridStore.prototype.write = function write(data, close, callback) {
+  // If it's a normal write delegate the call
+  if(typeof close == 'function' || typeof callback == 'function') {
+    return _writeNormal(this, data, close, callback);
+  }
+
+  // Otherwise it's a stream write
+  var self = this;
+  if (!this.writable) {
+    throw new Error('GridWriteStream is not writable');
+  }
+
+  // queue data until we open.
+  if (!this._opened) {
+    // Set up a queue to save data until gridstore object is ready
+    this._q = [];
+    _openStream(self);
+    this._q.push(data);
+    return false;
+  }
+
+  // Push data to queue
+  this._q.push(data);
+  _flush(this);
+  // Return write successful
+  return true;
+}
+
+/**
+ *  Handles the destroy part of a stream
+ *  @ignore
+ */
+GridStore.prototype.destroy = function destroy() {
+  // close and do not emit any more events. queued data is not sent.
+  if(!this.writable) return;
+  this.readable = false;
+  if(this.writable) {
+    this.writable = false;
+    this._q.length = 0;
+    this.emit('close');
+  }
+}
+
+/**
+ *  Handles the destroySoon part of a stream
+ *  @ignore
+ */
+GridStore.prototype.destroySoon = function destroySoon() {
+  // as soon as write queue is drained, destroy.
+  // may call destroy immediately if no data is queued.
+  if(!this._q.length) {
+    return this.destroy();
+  }
+  this._destroying = true;
+}
+
+/**
+ *  Handles the pipe part of the stream
+ *  @ignore
+ */
+GridStore.prototype.pipe = function(destination, options) {
+  var self = this;
+  // Open the gridstore
+  this.open(function(err, result) {
+    if(err) _errorRead(self, err);
+    if(!self.readable) return;
+    // Set up the pipe
+    self._pipe(destination, options);
+    // Emit the stream is open
+    self.emit('open');
+    // Read from the stream
+    _read(self);
+  })
+}
+
+/**
+ *  Internal module methods
+ *  @ignore
+ */
+var _read = function _read(self) {
+  if (!self.readable || self.paused || self.reading) {
+    return;
+  }
+
+  self.reading = true;
+  var stream = self._stream = self.stream();
+  stream.paused = self.paused;
+
+  stream.on('data', function (data) {
+    if (self._decoder) {
+      var str = self._decoder.write(data);
+      if (str.length) self.emit('data', str);
+    } else {
+      self.emit('data', data);
+    }
+  });
+
+  stream.on('end', function (data) {
+    self.emit('end', data);
+  });
+
+  stream.on('error', function (data) {
+    _errorRead(self, data);
+  });
+
+  stream.on('close', function (data) {
+    self.emit('close', data);
+  });
+
+  self.pause = function () {
+    // native doesn't always pause.
+    // bypass its pause() method to hack it
+    self.paused = stream.paused = true;
+  }
+
+  self.resume = function () {
+    if(!self.paused) return;
+
+    self.paused = false;
+    stream.resume();
+    self.readable = stream.readable;
+  }
+
+  self.destroy = function () {
+    self.readable = false;
+    stream.destroy();
+  }
+}
+
+/**
+ * pause
+ * @ignore
+ */
+GridStore.prototype.pause = function pause () {
+  // Overridden when the GridStore opens.
+  this.paused = true;
+}
+
+/**
+ * resume
+ * @ignore
+ */
+GridStore.prototype.resume = function resume () {
+  // Overridden when the GridStore opens.
+  this.paused = false;
+}
+
+/**
+ *  Internal module methods
+ *  @ignore
+ */
+var _flush = function _flush(self, _force) {
+  if (!self._opened) return;
+  if (!_force && self._flushing) return;
+  self._flushing = true;
+
+  // write the entire q to gridfs
+  if (!self._q.length) {
+    self._flushing = false;
+    self.emit('drain');
+
+    if(self._destroying) {
+      self.destroy();
+    }
+    return;
+  }
+
+  self.write(self._q.shift(), function (err, store) {
+    if (err) return _error(self, err);
+    self.emit('progress', store.position);
+    _flush(self, true);
+  });
+}
+
+var _openStream = function _openStream (self) {
+  if(self._opening == true) return;
+  self._opening = true;
+
+  // Open the store
+  self.open(function (err, gridstore) {
+    if (err) return _error(self, err);
+    self._opened = true;
+    self.emit('open');
+    _flush(self);
+  });
+}
+
+var _error = function _error(self, err) {
+  self.destroy();
+  self.emit('error', err);
+}
+
+var _errorRead = function _errorRead (self, err) {
+  self.readable = false;
+  self.emit('error', err);
+}
+
+/**
+ * @ignore
+ */
+var _hasWriteConcern = function(errorOptions) {
+  return errorOptions == true
+    || errorOptions.w > 0
+    || errorOptions.w == 'majority'
+    || errorOptions.j == true
+    || errorOptions.journal == true
+    || errorOptions.fsync == true
+}
+
+/**
+ * @ignore
+ */
+var _setWriteConcernHash = function(options) {
+  var finalOptions = {};
+  if(options.w != null) finalOptions.w = options.w;  
+  if(options.journal == true) finalOptions.j = options.journal;
+  if(options.j == true) finalOptions.j = options.j;
+  if(options.fsync == true) finalOptions.fsync = options.fsync;
+  if(options.wtimeout != null) finalOptions.wtimeout = options.wtimeout;  
+  return finalOptions;
+}
+
+/**
+ * @ignore
+ */
+var _getWriteConcern = function(self, options, callback) {
+  // Final options
+  var finalOptions = {w:1};
+  options = options || {};
+  // Local options verification
+  if(options.w != null || typeof options.j == 'boolean' || typeof options.journal == 'boolean' || typeof options.fsync == 'boolean') {
+    finalOptions = _setWriteConcernHash(options);
+  } else if(typeof options.safe == "boolean") {
+    finalOptions = {w: (options.safe ? 1 : 0)};
+  } else if(options.safe != null && typeof options.safe == 'object') {
+    finalOptions = _setWriteConcernHash(options.safe);
+  } else if(self.db.safe.w != null || typeof self.db.safe.j == 'boolean' || typeof self.db.safe.journal == 'boolean' || typeof self.db.safe.fsync == 'boolean') {
+    finalOptions = _setWriteConcernHash(self.db.safe);
+  } else if(self.db.options.w != null || typeof self.db.options.j == 'boolean' || typeof self.db.options.journal == 'boolean' || typeof self.db.options.fsync == 'boolean') {
+    finalOptions = _setWriteConcernHash(self.db.options);
+  } else if(typeof self.db.safe == "boolean") {
+    finalOptions = {w: (self.db.safe ? 1 : 0)};
+  }
+
+  // Ensure we don't have an invalid combination of write concerns
+  if(finalOptions.w < 1 
+    && (finalOptions.journal == true || finalOptions.j == true || finalOptions.fsync == true)) throw new Error("No acknowlegement using w < 1 cannot be combined with journal:true or fsync:true");
+
+  // Return the options
+  return finalOptions;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+exports.GridStore = GridStore;
diff --git a/node_modules/mongodb/lib/mongodb/gridfs/readstream.js b/node_modules/mongodb/lib/mongodb/gridfs/readstream.js
new file mode 100644
index 0000000..8ff9973
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/gridfs/readstream.js
@@ -0,0 +1,193 @@
+var Stream = require('stream').Stream,
+  timers = require('timers'),
+  util = require('util');
+
+// Set processor, setImmediate if 0.10 otherwise nextTick
+var processor = timers.setImmediate ? timers.setImmediate : process.nextTick;
+processor = process.nextTick
+
+/**
+ * ReadStream
+ *
+ * Returns a stream interface for the **file**.
+ *
+ * Events
+ *  - **data** {function(item) {}} the data event triggers when a document is ready.
+ *  - **end** {function() {}} the end event triggers when there is no more documents available.
+ *  - **close** {function() {}} the close event triggers when the stream is closed.
+ *  - **error** {function(err) {}} the error event triggers if an error happens.
+ *
+ * @class Represents a GridFS File Stream.
+ * @param {Boolean} autoclose automatically close file when the stream reaches the end.
+ * @param {GridStore} cursor a cursor object that the stream wraps.
+ * @return {ReadStream}
+ */
+function ReadStream(autoclose, gstore) {
+  if (!(this instanceof ReadStream)) return new ReadStream(autoclose, gstore);
+  Stream.call(this);
+
+  this.autoclose = !!autoclose;
+  this.gstore = gstore;
+
+  this.finalLength = gstore.length - gstore.position;
+  this.completedLength = 0;
+  this.currentChunkNumber = gstore.currentChunk.chunkNumber;
+
+  this.paused = false;
+  this.readable = true;
+  this.pendingChunk = null;
+  this.executing = false;  
+  
+  // Calculate the number of chunks
+  this.numberOfChunks = Math.ceil(gstore.length/gstore.chunkSize);
+
+  // This seek start position inside the current chunk
+  this.seekStartPosition = gstore.position - (this.currentChunkNumber * gstore.chunkSize);
+  
+  var self = this;
+  processor(function() {
+    self._execute();
+  });
+};
+
+/**
+ * Inherit from Stream
+ * @ignore
+ * @api private
+ */
+ReadStream.prototype.__proto__ = Stream.prototype;
+
+/**
+ * Flag stating whether or not this stream is readable.
+ */
+ReadStream.prototype.readable;
+
+/**
+ * Flag stating whether or not this stream is paused.
+ */
+ReadStream.prototype.paused;
+
+/**
+ * @ignore
+ * @api private
+ */
+ReadStream.prototype._execute = function() {
+  if(this.paused === true || this.readable === false) {
+    return;
+  }
+
+  var gstore = this.gstore;
+  var self = this;
+  // Set that we are executing
+  this.executing = true;
+
+  var last = false;
+  var toRead = 0;
+
+  if(gstore.currentChunk.chunkNumber >= (this.numberOfChunks - 1)) {
+    self.executing = false;    
+    last = true;    
+  }
+
+  // Data setup
+  var data = null;
+
+  // Read a slice (with seek set if none)
+  if(this.seekStartPosition > 0 && (gstore.currentChunk.length() - this.seekStartPosition) > 0) {
+    data = gstore.currentChunk.readSlice(gstore.currentChunk.length() - this.seekStartPosition);
+    this.seekStartPosition = 0;
+  } else {
+    data = gstore.currentChunk.readSlice(gstore.currentChunk.length());
+  }
+
+  // Return the data
+  if(data != null && gstore.currentChunk.chunkNumber == self.currentChunkNumber) {
+    self.currentChunkNumber = self.currentChunkNumber + 1;
+    self.completedLength += data.length;
+    self.pendingChunk = null;
+    self.emit("data", data);
+  }
+
+  if(last === true) {
+    self.readable = false;
+    self.emit("end");
+    
+    if(self.autoclose === true) {
+      if(gstore.mode[0] == "w") {
+        gstore.close(function(err, doc) {
+          if (err) {
+            self.emit("error", err);
+            return;
+          }
+          self.readable = false;          
+          self.emit("close", doc);
+        });
+      } else {
+        self.readable = false;
+        self.emit("close");
+      }
+    }
+  } else {
+    gstore._nthChunk(gstore.currentChunk.chunkNumber + 1, function(err, chunk) {
+      if(err) {
+        self.readable = false;
+        self.emit("error", err);
+        self.executing = false;
+        return;
+      }
+
+      self.pendingChunk = chunk;
+      if(self.paused === true) {
+        self.executing = false;
+        return;
+      }
+
+      gstore.currentChunk = self.pendingChunk;
+      self._execute();        
+    });
+  }
+};
+
+/**
+ * Pauses this stream, then no farther events will be fired.
+ *
+ * @ignore
+ * @api public
+ */
+ReadStream.prototype.pause = function() {
+  if(!this.executing) {
+    this.paused = true;    
+  }
+};
+
+/**
+ * Destroys the stream, then no farther events will be fired.
+ *
+ * @ignore
+ * @api public
+ */
+ReadStream.prototype.destroy = function() {
+  this.readable = false;
+  // Emit close event
+  this.emit("close");
+};
+
+/**
+ * Resumes this stream.
+ *
+ * @ignore
+ * @api public
+ */
+ReadStream.prototype.resume = function() {
+  if(this.paused === false || !this.readable) {
+    return;
+  }
+    
+  this.paused = false;
+  var self = this;
+  processor(function() {
+    self._execute();
+  });
+};
+
+exports.ReadStream = ReadStream;
diff --git a/node_modules/mongodb/lib/mongodb/index.js b/node_modules/mongodb/lib/mongodb/index.js
new file mode 100644
index 0000000..b2fdadf
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/index.js
@@ -0,0 +1,66 @@
+try {
+  exports.BSONPure = require('bson').BSONPure;
+  exports.BSONNative = require('bson').BSONNative;
+} catch(err) {
+  // do nothing
+}
+
+[ 'commands/base_command'
+  , 'admin'
+  , 'collection'
+  , 'connection/read_preference'
+  , 'connection/connection'
+  , 'connection/server'
+  , 'connection/mongos'
+  , 'connection/repl_set/repl_set'
+  , 'mongo_client'
+  , 'cursor'
+  , 'db'
+  , 'mongo_client'
+  , 'gridfs/grid'
+  ,	'gridfs/chunk'
+  , 'gridfs/gridstore'].forEach(function (path) {
+  	var module = require('./' + path);
+  	for (var i in module) {
+  		exports[i] = module[i];
+    }
+});
+
+// backwards compat
+exports.ReplSetServers = exports.ReplSet;
+// Add BSON Classes
+exports.Binary = require('bson').Binary;
+exports.Code = require('bson').Code;
+exports.DBRef = require('bson').DBRef;
+exports.Double = require('bson').Double;
+exports.Long = require('bson').Long;
+exports.MinKey = require('bson').MinKey;
+exports.MaxKey = require('bson').MaxKey;
+exports.ObjectID = require('bson').ObjectID;
+exports.Symbol = require('bson').Symbol;
+exports.Timestamp = require('bson').Timestamp;  
+// Add BSON Parser
+exports.BSON = require('bson').BSONPure.BSON;
+
+// Get the Db object
+var Db = require('./db').Db;
+// Set up the connect function
+var connect = Db.connect;
+var obj = connect;
+// Map all values to the exports value
+for(var name in exports) {
+  obj[name] = exports[name];
+}
+
+// Add the pure and native backward compatible functions
+exports.pure = exports.native = function() {
+  return obj;
+}
+
+// Map all values to the exports value
+for(var name in exports) {
+  connect[name] = exports[name];
+}
+
+// Set our exports to be the connect function
+module.exports = connect;
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/mongo_client.js b/node_modules/mongodb/lib/mongodb/mongo_client.js
new file mode 100644
index 0000000..1593fd7
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/mongo_client.js
@@ -0,0 +1,369 @@
+var Db = require('./db').Db
+  , Server = require('./connection/server').Server
+  , Mongos = require('./connection/mongos').Mongos
+  , ReplSet = require('./connection/repl_set/repl_set').ReplSet
+  , ReadPreference = require('./connection/read_preference').ReadPreference
+  , inherits = require('util').inherits
+  , EventEmitter = require('events').EventEmitter
+  , parse = require('./connection/url_parser').parse;
+
+/**
+ * Create a new MongoClient instance.
+ *
+ * Options
+ *  - **w**, {Number/String, > -1 || 'majority' || tag name} the write concern for the operation where < 1 is no acknowlegement of write and w >= 1, w = 'majority' or tag acknowledges the write
+ *  - **wtimeout**, {Number, 0} set the timeout for waiting for write concern to finish (combines with w option)
+ *  - **fsync**, (Boolean, default:false) write waits for fsync before returning
+ *  - **journal**, (Boolean, default:false) write waits for journal sync before returning
+ *  - **readPreference** {String}, the prefered read preference (ReadPreference.PRIMARY, ReadPreference.PRIMARY_PREFERRED, ReadPreference.SECONDARY, ReadPreference.SECONDARY_PREFERRED, ReadPreference.NEAREST).
+ *  - **native_parser** {Boolean, default:false}, use c++ bson parser.
+ *  - **forceServerObjectId** {Boolean, default:false}, force server to create _id fields instead of client.
+ *  - **pkFactory** {Object}, object overriding the basic ObjectID primary key generation.
+ *  - **serializeFunctions** {Boolean, default:false}, serialize functions.
+ *  - **raw** {Boolean, default:false}, peform operations using raw bson buffers.
+ *  - **recordQueryStats** {Boolean, default:false}, record query statistics during execution.
+ *  - **retryMiliSeconds** {Number, default:5000}, number of miliseconds between retries.
+ *  - **numberOfRetries** {Number, default:5}, number of retries off connection.
+ * 
+ * Deprecated Options 
+ *  - **safe** {true | {w:n, wtimeout:n} | {fsync:true}, default:false}, executes with a getLastError command returning the results of the command on MongoDB.
+ *
+ * @class Represents a MongoClient
+ * @param {Object} serverConfig server config object.
+ * @param {Object} [options] additional options for the collection.
+ */
+function MongoClient(serverConfig, options) {
+  if(serverConfig != null) {
+    options = options == null ? {} : options;
+    // If no write concern is set set the default to w:1
+    if(options != null && !options.journal && !options.w && !options.fsync) {
+      options.w = 1;
+    }
+    
+    // The internal db instance we are wrapping
+    this._db = new Db('test', serverConfig, options);    
+  }
+}
+
+/**
+ * @ignore
+ */
+inherits(MongoClient, EventEmitter);
+
+/**
+ * Connect to MongoDB using a url as documented at
+ *
+ *  docs.mongodb.org/manual/reference/connection-string/
+ *
+ * Options
+ *  - **uri_decode_auth** {Boolean, default:false} uri decode the user name and password for authentication
+ *  - **db** {Object, default: null} a hash off options to set on the db object, see **Db constructor**
+ *  - **server** {Object, default: null} a hash off options to set on the server objects, see **Server** constructor**
+ *  - **replSet** {Object, default: null} a hash off options to set on the replSet object, see **ReplSet** constructor**
+ *  - **mongos** {Object, default: null} a hash off options to set on the mongos object, see **Mongos** constructor**
+ *
+ * @param {String} url connection url for MongoDB.
+ * @param {Object} [options] optional options for insert command
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the initialized db object or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+MongoClient.prototype.connect = function(url, options, callback) {
+  var self = this;
+
+  if(typeof options == 'function') {
+    callback = options;
+    options = {};
+  }
+
+  MongoClient.connect(url, options, function(err, db) {
+    if(err) return callback(err, db);
+    // Emit open and perform callback
+    self.emit("open", err, db);
+    callback(err, db);
+  });
+}
+
+/**
+ * Initialize the database connection.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the connected mongoclient or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+MongoClient.prototype.open = function(callback) {
+  // Self reference
+  var self = this;
+  // Open the db
+  this._db.open(function(err, db) {
+    if(err) return callback(err, null);
+
+    // Emit open event
+    self.emit("open", err, db);
+    // Callback
+    callback(null, self);
+  })
+}
+
+/**
+ * Close the current db connection, including all the child db instances. Emits close event if no callback is provided.
+ *
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the results from the close method or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+MongoClient.prototype.close = function(callback) {
+  this._db.close(callback);
+}
+
+/**
+ * Create a new Db instance sharing the current socket connections.
+ *
+ * @param {String} dbName the name of the database we want to use.
+ * @return {Db} a db instance using the new database.
+ * @api public
+ */
+MongoClient.prototype.db = function(dbName) {
+  return this._db.db(dbName);
+}
+
+/**
+ * Connect to MongoDB using a url as documented at
+ *
+ *  docs.mongodb.org/manual/reference/connection-string/
+ *
+ * Options
+ *  - **uri_decode_auth** {Boolean, default:false} uri decode the user name and password for authentication
+ *  - **db** {Object, default: null} a hash off options to set on the db object, see **Db constructor**
+ *  - **server** {Object, default: null} a hash off options to set on the server objects, see **Server** constructor**
+ *  - **replSet** {Object, default: null} a hash off options to set on the replSet object, see **ReplSet** constructor**
+ *  - **mongos** {Object, default: null} a hash off options to set on the mongos object, see **Mongos** constructor**
+ *
+ * @param {String} url connection url for MongoDB.
+ * @param {Object} [options] optional options for insert command
+ * @param {Function} callback this will be called after executing this method. The first parameter will contain the Error object if an error occured, or null otherwise. While the second parameter will contain the initialized db object or null if an error occured.
+ * @return {null}
+ * @api public
+ */
+MongoClient.connect = function(url, options, callback) {
+  var args = Array.prototype.slice.call(arguments, 1);
+  callback = typeof args[args.length - 1] == 'function' ? args.pop() : null;
+  options = args.length ? args.shift() : null;
+  options = options || {};
+  
+  // Set default empty server options  
+  var serverOptions = options.server || {};
+  var mongosOptions = options.mongos || {};
+  var replSetServersOptions = options.replSet || options.replSetServers || {};
+  var dbOptions = options.db || {};
+
+  // If callback is null throw an exception
+  if(callback == null) throw new Error("no callback function provided");
+
+  // Parse the string
+  var object = parse(url, options);
+  // Merge in any options for db in options object
+  if(dbOptions) {
+    for(var name in dbOptions) object.db_options[name] = dbOptions[name];
+  }
+
+  // Added the url to the options
+  object.db_options.url = url;
+
+  // Merge in any options for server in options object
+  if(serverOptions) {
+    for(var name in serverOptions) object.server_options[name] = serverOptions[name];
+  }
+
+  // Merge in any replicaset server options
+  if(replSetServersOptions) {
+    for(var name in replSetServersOptions) object.rs_options[name] = replSetServersOptions[name];    
+  }
+
+  // Merge in any replicaset server options
+  if(mongosOptions) {
+    for(var name in mongosOptions) object.mongos_options[name] = mongosOptions[name];    
+  }
+
+  // We need to ensure that the list of servers are only either direct members or mongos
+  // they cannot be a mix of monogs and mongod's
+  var totalNumberOfServers = object.servers.length;
+  var totalNumberOfMongosServers = 0;
+  var totalNumberOfMongodServers = 0;
+  var serverConfig = null;
+  var errorServers = {};
+
+  // Failure modes
+  if(object.servers.length == 0) throw new Error("connection string must contain at least one seed host");
+
+  // If we have no db setting for the native parser try to set the c++ one first
+  object.db_options.native_parser = _setNativeParser(object.db_options);
+  // If no auto_reconnect is set, set it to true as default for single servers
+  if(typeof object.server_options.auto_reconnect != 'boolean') {
+    object.server_options.auto_reconnect = true;
+  }
+
+  // If we have more than a server, it could be replicaset or mongos list
+  // need to verify that it's one or the other and fail if it's a mix
+  // Connect to all servers and run ismaster
+  for(var i = 0; i < object.servers.length; i++) {
+    // Set up socket options
+    var _server_options = {poolSize:1, socketOptions:{connectTimeoutMS:1000}, auto_reconnect:false};
+
+    // Ensure we have ssl setup for the servers
+    if(object.rs_options.ssl) {
+      _server_options.ssl = object.rs_options.ssl;
+      _server_options.sslValidate = object.rs_options.sslValidate;
+      _server_options.sslCA = object.rs_options.sslCA;
+      _server_options.sslCert = object.rs_options.sslCert;
+      _server_options.sslKey = object.rs_options.sslKey;
+      _server_options.sslPass = object.rs_options.sslPass;
+    } else if(object.server_options.ssl) {
+      _server_options.ssl = object.server_options.ssl;
+      _server_options.sslValidate = object.server_options.sslValidate;
+      _server_options.sslCA = object.server_options.sslCA;
+      _server_options.sslCert = object.server_options.sslCert;
+      _server_options.sslKey = object.server_options.sslKey;
+      _server_options.sslPass = object.server_options.sslPass;
+    }
+
+    // Set up the Server object
+    var _server = object.servers[i].domain_socket 
+        ? new Server(object.servers[i].domain_socket, _server_options)
+        : new Server(object.servers[i].host, object.servers[i].port, _server_options);
+
+    var connectFunction = function(__server) { 
+      // Attempt connect
+      new Db(object.dbName, __server, {safe:false, native_parser:false}).open(function(err, db) {
+        // Update number of servers
+        totalNumberOfServers = totalNumberOfServers - 1;          
+        // If no error do the correct checks
+        if(!err) {
+          // Close the connection
+          db.close(true);
+          var isMasterDoc = db.serverConfig.isMasterDoc;
+          // Check what type of server we have
+          if(isMasterDoc.setName) totalNumberOfMongodServers++;
+          if(isMasterDoc.msg && isMasterDoc.msg == "isdbgrid") totalNumberOfMongosServers++;
+        } else {
+          errorServers[__server.host + ":" + __server.port] = __server;
+        }
+
+        if(totalNumberOfServers == 0) {
+          // If we have a mix of mongod and mongos, throw an error
+          if(totalNumberOfMongosServers > 0 && totalNumberOfMongodServers > 0)
+            return callback(new Error("cannot combine a list of replicaset seeds and mongos seeds"));
+          
+          if(totalNumberOfMongodServers == 0 && object.servers.length == 1) {
+            var obj = object.servers[0];
+            serverConfig = obj.domain_socket ? 
+                new Server(obj.domain_socket, object.server_options)
+              : new Server(obj.host, obj.port, object.server_options);            
+          } else if(totalNumberOfMongodServers > 0 || totalNumberOfMongosServers > 0) {
+            var finalServers = object.servers
+              .filter(function(serverObj) {
+                return errorServers[serverObj.host + ":" + serverObj.port] == null;
+              })
+              .map(function(serverObj) {
+                  return new Server(serverObj.host, serverObj.port, object.server_options);
+              });
+            // Clean out any error servers
+            errorServers = {};
+            // Set up the final configuration
+            if(totalNumberOfMongodServers > 0) {
+              serverConfig = new ReplSet(finalServers, object.rs_options);                
+            } else {
+              serverConfig = new Mongos(finalServers, object.mongos_options);                         
+            }
+          }
+
+          if(serverConfig == null) return callback(new Error("Could not locate any valid servers in initial seed list"));
+          // Ensure no firing off open event before we are ready
+          serverConfig.emitOpen = false;
+          // Set up all options etc and connect to the database
+          _finishConnecting(serverConfig, object, options, callback)
+        }
+      });        
+    }
+
+    // Wrap the context of the call
+    connectFunction(_server);    
+  }    
+}
+
+var _setNativeParser = function(db_options) {
+  if(typeof db_options.native_parser == 'boolean') return db_options.native_parser;
+
+  try {
+    require('bson').BSONNative.BSON;
+    return true;
+  } catch(err) {
+    return false;
+  }
+}
+
+var _finishConnecting = function(serverConfig, object, options, callback) {
+  // Safe settings
+  var safe = {};
+  // Build the safe parameter if needed
+  if(object.db_options.journal) safe.j = object.db_options.journal;
+  if(object.db_options.w) safe.w = object.db_options.w;
+  if(object.db_options.fsync) safe.fsync = object.db_options.fsync;
+  if(object.db_options.wtimeoutMS) safe.wtimeout = object.db_options.wtimeoutMS;
+
+  // If we have a read Preference set
+  if(object.db_options.read_preference) {
+    var readPreference = new ReadPreference(object.db_options.read_preference);
+    // If we have the tags set up
+    if(object.db_options.read_preference_tags)
+      readPreference = new ReadPreference(object.db_options.read_preference, object.db_options.read_preference_tags);
+    // Add the read preference
+    object.db_options.readPreference = readPreference;
+  }
+
+  // No safe mode if no keys
+  if(Object.keys(safe).length == 0) safe = false;
+
+  // Add the safe object
+  object.db_options.safe = safe;
+
+  // Set up the db options
+  var db = new Db(object.dbName, serverConfig, object.db_options);
+  // Open the db
+  db.open(function(err, db){
+    if(err) return callback(err, null);
+
+    if(db.options !== null && !db.options.safe && !db.options.journal 
+      && !db.options.w && !db.options.fsync && typeof db.options.w != 'number'
+      && (db.options.safe == false && object.db_options.url.indexOf("safe=") == -1)) {
+        db.options.w = 1;
+    }
+
+    if(err == null && object.auth){
+      // What db to authenticate against
+      var authentication_db = db;
+      if(object.db_options && object.db_options.authSource) {
+        authentication_db = db.db(object.db_options.authSource);
+      }
+
+      // Build options object
+      var options = {};
+      if(object.db_options.authMechanism) options.authMechanism = object.db_options.authMechanism;
+
+      // Authenticate
+      authentication_db.authenticate(object.auth.user, object.auth.password, options, function(err, success){
+        if(success){
+          callback(null, db);
+        } else {
+          if(db) db.close();
+          callback(err ? err : new Error('Could not authenticate user ' + auth[0]), null);
+        }
+      });
+    } else {
+      callback(err, db);
+    }
+  });
+}
+
+
+exports.MongoClient = MongoClient;
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/responses/mongo_reply.js b/node_modules/mongodb/lib/mongodb/responses/mongo_reply.js
new file mode 100644
index 0000000..b27b812
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/responses/mongo_reply.js
@@ -0,0 +1,144 @@
+var Long = require('bson').Long
+  , timers = require('timers');
+
+// Set processor, setImmediate if 0.10 otherwise nextTick
+var processor = timers.setImmediate ? timers.setImmediate : process.nextTick;
+
+/**
+  Reply message from mongo db
+**/
+var MongoReply = exports.MongoReply = function() {
+  this.documents = [];
+  this.index = 0;
+};
+
+MongoReply.prototype.parseHeader = function(binary_reply, bson) {
+  // Unpack the standard header first
+  this.messageLength = binary_reply[this.index] | binary_reply[this.index + 1] << 8 | binary_reply[this.index + 2] << 16 | binary_reply[this.index + 3] << 24;
+  this.index = this.index + 4;
+  // Fetch the request id for this reply
+  this.requestId = binary_reply[this.index] | binary_reply[this.index + 1] << 8 | binary_reply[this.index + 2] << 16 | binary_reply[this.index + 3] << 24;
+  this.index = this.index + 4;
+  // Fetch the id of the request that triggered the response
+  this.responseTo = binary_reply[this.index] | binary_reply[this.index + 1] << 8 | binary_reply[this.index + 2] << 16 | binary_reply[this.index + 3] << 24;
+  // Skip op-code field
+  this.index = this.index + 4 + 4;
+  // Unpack the reply message
+  this.responseFlag = binary_reply[this.index] | binary_reply[this.index + 1] << 8 | binary_reply[this.index + 2] << 16 | binary_reply[this.index + 3] << 24;
+  this.index = this.index + 4;
+  // Unpack the cursor id (a 64 bit long integer)
+  var low_bits = binary_reply[this.index] | binary_reply[this.index + 1] << 8 | binary_reply[this.index + 2] << 16 | binary_reply[this.index + 3] << 24;
+  this.index = this.index + 4;
+  var high_bits = binary_reply[this.index] | binary_reply[this.index + 1] << 8 | binary_reply[this.index + 2] << 16 | binary_reply[this.index + 3] << 24;
+  this.index = this.index + 4;
+  this.cursorId = new Long(low_bits, high_bits);
+  // Unpack the starting from
+  this.startingFrom = binary_reply[this.index] | binary_reply[this.index + 1] << 8 | binary_reply[this.index + 2] << 16 | binary_reply[this.index + 3] << 24;
+  this.index = this.index + 4;
+  // Unpack the number of objects returned
+  this.numberReturned = binary_reply[this.index] | binary_reply[this.index + 1] << 8 | binary_reply[this.index + 2] << 16 | binary_reply[this.index + 3] << 24;
+  this.index = this.index + 4;
+}
+
+MongoReply.prototype.parseBody = function(binary_reply, bson, raw, callback) {
+  raw = raw == null ? false : raw;
+  // Just set a doc limit for deserializing
+  var docLimitSize = 1024*20;
+
+  // If our message length is very long, let's switch to process.nextTick for messages
+  if(this.messageLength > docLimitSize) {
+    var batchSize = this.numberReturned;
+    this.documents = new Array(this.numberReturned);
+
+    // Just walk down until we get a positive number >= 1
+    for(var i = 50; i > 0; i--) {
+      if((this.numberReturned/i) >= 1) {
+        batchSize = i;
+        break;
+      }
+    }
+
+    // Actual main creator of the processFunction setting internal state to control the flow
+    var parseFunction = function(_self, _binary_reply, _batchSize, _numberReturned) {
+      var object_index = 0;
+      // Internal loop process that will use nextTick to ensure we yield some time
+      var processFunction = function() {
+        // Adjust batchSize if we have less results left than batchsize
+        if((_numberReturned - object_index) < _batchSize) {
+          _batchSize = _numberReturned - object_index;
+        }
+
+        // If raw just process the entries
+        if(raw) {
+          // Iterate over the batch
+          for(var i = 0; i < _batchSize; i++) {
+            // Are we done ?
+            if(object_index <= _numberReturned) {
+              // Read the size of the bson object
+              var bsonObjectSize = _binary_reply[_self.index] | _binary_reply[_self.index + 1] << 8 | _binary_reply[_self.index + 2] << 16 | _binary_reply[_self.index + 3] << 24;
+              // If we are storing the raw responses to pipe straight through
+              _self.documents[object_index] = binary_reply.slice(_self.index, _self.index + bsonObjectSize);
+              // Adjust binary index to point to next block of binary bson data
+              _self.index = _self.index + bsonObjectSize;
+              // Update number of docs parsed
+              object_index = object_index + 1;
+            }
+          }
+        } else {
+          try {
+            // Parse documents
+            _self.index = bson.deserializeStream(binary_reply, _self.index, _batchSize, _self.documents, object_index);
+            // Adjust index
+            object_index = object_index + _batchSize;
+          } catch (err) {
+            return callback(err);
+          }
+        }
+
+        // If we have more documents process NextTick
+        if(object_index < _numberReturned) {
+          processor(processFunction);
+        } else {
+          callback(null);
+        }
+      }
+
+      // Return the process function
+      return processFunction;
+    }(this, binary_reply, batchSize, this.numberReturned)();
+  } else {
+    try {
+      // Let's unpack all the bson documents, deserialize them and store them
+      for(var object_index = 0; object_index < this.numberReturned; object_index++) {
+        // Read the size of the bson object
+        var bsonObjectSize = binary_reply[this.index] | binary_reply[this.index + 1] << 8 | binary_reply[this.index + 2] << 16 | binary_reply[this.index + 3] << 24;
+        // If we are storing the raw responses to pipe straight through
+        if(raw) {
+          // Deserialize the object and add to the documents array
+          this.documents.push(binary_reply.slice(this.index, this.index + bsonObjectSize));
+        } else {
+          // Deserialize the object and add to the documents array
+          this.documents.push(bson.deserialize(binary_reply.slice(this.index, this.index + bsonObjectSize)));
+        }
+        // Adjust binary index to point to next block of binary bson data
+        this.index = this.index + bsonObjectSize;
+      }
+    } catch(err) {
+      return callback(err);
+    }
+
+    // No error return
+    callback(null);
+  }
+}
+
+MongoReply.prototype.is_error = function(){
+  if(this.documents.length == 1) {
+    return this.documents[0].ok == 1 ? false : true;
+  }
+  return false;
+};
+
+MongoReply.prototype.error_message = function() {
+  return this.documents.length == 1 && this.documents[0].ok == 1 ? '' : this.documents[0].errmsg;
+};
\ No newline at end of file
diff --git a/node_modules/mongodb/lib/mongodb/utils.js b/node_modules/mongodb/lib/mongodb/utils.js
new file mode 100644
index 0000000..087789d
--- /dev/null
+++ b/node_modules/mongodb/lib/mongodb/utils.js
@@ -0,0 +1,137 @@
+/**
+ * Sort functions, Normalize and prepare sort parameters
+ */
+var formatSortValue = exports.formatSortValue = function(sortDirection) {
+  var value = ("" + sortDirection).toLowerCase();
+
+  switch (value) {
+    case 'ascending':
+    case 'asc':
+    case '1':
+      return 1;
+    case 'descending':
+    case 'desc':
+    case '-1':
+      return -1;
+    default:
+      throw new Error("Illegal sort clause, must be of the form "
+                    + "[['field1', '(ascending|descending)'], "
+                    + "['field2', '(ascending|descending)']]");
+  }
+};
+
+var formattedOrderClause = exports.formattedOrderClause = function(sortValue) {
+  var orderBy = {};
+
+  if (Array.isArray(sortValue)) {
+    for(var i = 0; i < sortValue.length; i++) {
+      if(sortValue[i].constructor == String) {
+        orderBy[sortValue[i]] = 1;
+      } else {
+        orderBy[sortValue[i][0]] = formatSortValue(sortValue[i][1]);
+      }      
+    }
+  } else if(Object.prototype.toString.call(sortValue) === '[object Object]') {
+    orderBy = sortValue;
+  } else if (sortValue.constructor == String) {
+    orderBy[sortValue] = 1;
+  } else {
+    throw new Error("Illegal sort clause, must be of the form " +
+      "[['field1', '(ascending|descending)'], ['field2', '(ascending|descending)']]");
+  }
+
+  return orderBy;
+};
+
+exports.encodeInt = function(value) {
+  var buffer = new Buffer(4);
+  buffer[3] = (value >> 24) & 0xff;      
+  buffer[2] = (value >> 16) & 0xff;
+  buffer[1] = (value >> 8) & 0xff;
+  buffer[0] = value & 0xff;
+  return buffer;
+}
+
+exports.encodeIntInPlace = function(value, buffer, index) {
+  buffer[index + 3] = (value >> 24) & 0xff;			
+	buffer[index + 2] = (value >> 16) & 0xff;
+	buffer[index + 1] = (value >> 8) & 0xff;
+	buffer[index] = value & 0xff;
+}
+
+exports.encodeCString = function(string) {
+  var buf = new Buffer(string, 'utf8');
+  return [buf, new Buffer([0])];
+}
+
+exports.decodeUInt32 = function(array, index) {
+  return array[index] | array[index + 1] << 8 | array[index + 2] << 16 | array[index + 3] << 24;
+}
+
+// Decode the int
+exports.decodeUInt8 = function(array, index) {
+  return array[index];
+}
+
+/**
+ * Context insensitive type checks
+ */
+
+var toString = Object.prototype.toString;
+
+exports.isObject = function (arg) {
+  return '[object Object]' == toString.call(arg)
+}
+
+exports.isArray = function (arg) {
+  return Array.isArray(arg) ||
+    'object' == typeof arg && '[object Array]' == toString.call(arg)
+}
+
+exports.isDate = function (arg) {
+  return 'object' == typeof arg && '[object Date]' == toString.call(arg)
+}
+
+exports.isRegExp = function (arg) {
+  return 'object' == typeof arg && '[object RegExp]' == toString.call(arg)
+}
+
+/**
+ * Wrap a Mongo error document in an Error instance
+ * @ignore
+ * @api private
+ */
+exports.toError = function(error) {
+  if (error instanceof Error) return error;
+
+  var msg = error.err || error.errmsg || error;
+  var e = new Error(msg);
+  e.name = 'MongoError';
+
+  // Get all object keys
+  var keys = typeof error == 'object'
+    ? Object.keys(error)
+    : [];
+
+  for(var i = 0; i < keys.length; i++) {
+    e[keys[i]] = error[keys[i]];
+  }
+
+  return e;
+}
+
+/**
+ * Convert a single level object to an array
+ * @ignore
+ * @api private
+ */
+exports.objectToArray = function(object) {
+  var list = [];
+
+  for(var name in object) {
+    list.push(object[name])
+  }
+
+  return list;
+}
+
diff --git a/node_modules/mongodb/node_modules/bson/.travis.yml b/node_modules/mongodb/node_modules/bson/.travis.yml
new file mode 100644
index 0000000..94740d0
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/.travis.yml
@@ -0,0 +1,5 @@
+language: node_js
+node_js:
+  - 0.6
+  - 0.8
+  - 0.9 # development version of 0.8, may be unstable
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/Makefile b/node_modules/mongodb/node_modules/bson/Makefile
new file mode 100644
index 0000000..77ce4e0
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/Makefile
@@ -0,0 +1,19 @@
+NODE = node
+NPM = npm
+NODEUNIT = node_modules/nodeunit/bin/nodeunit
+
+all:	clean node_gyp
+
+test: clean node_gyp
+	npm test
+
+node_gyp: clean
+	node-gyp configure build
+
+clean:
+	node-gyp clean
+
+browserify:
+	node_modules/.bin/onejs build browser_build/package.json browser_build/bson.js
+
+.PHONY: all
diff --git a/node_modules/mongodb/node_modules/bson/README.md b/node_modules/mongodb/node_modules/bson/README.md
new file mode 100644
index 0000000..1a6fc2b
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/README.md
@@ -0,0 +1,45 @@
+Javascript + C++ BSON parser
+============================
+
+This BSON parser is primarily meant for usage with the `mongodb` node.js driver. However thanks to such wonderful tools at `onejs` we are able to package up a BSON parser that will work in the browser aswell. The current build is located in the `browser_build/bson.js` file.
+
+A simple example on how to use it
+
+    <head>
+      <script src="https://raw.github.com/mongodb/js-bson/master/browser_build/bson.js">
+      </script>
+    </head>
+    <body onload="start();">
+    <script>
+      function start() {
+        var BSON = bson().BSON;
+        var Long = bson().Long;
+
+        var doc = {long: Long.fromNumber(100)}
+
+        // Serialize a document
+        var data = BSON.serialize(doc, false, true, false);
+        // De serialize it again
+        var doc_2 = BSON.deserialize(data);
+      }
+    </script>
+    </body>
+
+  It's got two simple methods to use in your application.
+
+  * BSON.serialize(object, checkKeys, asBuffer, serializeFunctions)
+     * @param {Object} object the Javascript object to serialize.
+     * @param {Boolean} checkKeys the serializer will check if keys are valid.
+     * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.
+     * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**
+     * @return {TypedArray/Array} returns a TypedArray or Array depending on what your browser supports
+ 
+  * BSON.deserialize(buffer, options, isArray)
+     * Options
+       * **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
+       * **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
+       * **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
+     * @param {TypedArray/Array} a TypedArray/Array containing the BSON data
+     * @param {Object} [options] additional options used for the deserialization.
+     * @param {Boolean} [isArray] ignore used for recursive parsing.
+     * @return {Object} returns the deserialized Javascript Object.
diff --git a/node_modules/mongodb/node_modules/bson/binding.gyp b/node_modules/mongodb/node_modules/bson/binding.gyp
new file mode 100644
index 0000000..42445d3
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/binding.gyp
@@ -0,0 +1,17 @@
+{
+  'targets': [
+    {
+      'target_name': 'bson',
+      'sources': [ 'ext/bson.cc' ],
+      'cflags!': [ '-fno-exceptions' ],
+      'cflags_cc!': [ '-fno-exceptions' ],
+      'conditions': [
+        ['OS=="mac"', {
+          'xcode_settings': {
+            'GCC_ENABLE_CPP_EXCEPTIONS': 'YES'
+          }
+        }]
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/browser_build/bson.js b/node_modules/mongodb/node_modules/bson/browser_build/bson.js
new file mode 100644
index 0000000..7132496
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/browser_build/bson.js
@@ -0,0 +1,4815 @@
+var bson = (function(){
+
+  var pkgmap        = {},
+      global        = {},
+      nativeRequire = typeof require != 'undefined' && require,
+      lib, ties, main, async;
+
+  function exports(){ return main(); };
+
+  exports.main     = exports;
+  exports.module   = module;
+  exports.packages = pkgmap;
+  exports.pkg      = pkg;
+  exports.require  = function require(uri){ return pkgmap.main.index.require(uri); };
+
+
+  ties             = {};
+
+  aliases          = {};
+
+
+  return exports;
+
+function join() {
+  return normalize(Array.prototype.join.call(arguments, "/"));
+};
+
+function normalize(path) {
+  var ret = [], parts = path.split('/'), cur, prev;
+
+  var i = 0, l = parts.length-1;
+  for (; i <= l; i++) {
+    cur = parts[i];
+
+    if (cur === "." && prev !== undefined) continue;
+
+    if (cur === ".." && ret.length && prev !== ".." && prev !== "." && prev !== undefined) {
+      ret.pop();
+      prev = ret.slice(-1)[0];
+    } else {
+      if (prev === ".") ret.pop();
+      ret.push(cur);
+      prev = cur;
+    }
+  }
+
+  return ret.join("/");
+};
+
+function dirname(path) {
+  return path && path.substr(0, path.lastIndexOf("/")) || ".";
+};
+
+function findModule(workingModule, uri){
+  var moduleId      = join(dirname(workingModule.id), uri).replace(/\.js$/, ''),
+      moduleIndexId = join(moduleId, 'index'),
+      pkg           = workingModule.pkg,
+      module;
+
+  var i = pkg.modules.length,
+      id;
+
+  while(i-->0){
+    id = pkg.modules[i].id;
+    if(id==moduleId || id == moduleIndexId){
+      module = pkg.modules[i];
+      break;
+    }
+  }
+
+  return module;
+}
+
+function newRequire(callingModule){
+  function require(uri){
+    var module, pkg;
+
+    if(/^\./.test(uri)){
+      module = findModule(callingModule, uri);
+    } else if ( ties && ties.hasOwnProperty( uri ) ) {
+      return ties[uri];
+    } else if ( aliases && aliases.hasOwnProperty( uri ) ) {
+      return require(aliases[uri]);
+    } else {
+      pkg = pkgmap[uri];
+
+      if(!pkg && nativeRequire){
+        try {
+          pkg = nativeRequire(uri);
+        } catch (nativeRequireError) {}
+
+        if(pkg) return pkg;
+      }
+
+      if(!pkg){
+        throw new Error('Cannot find module "'+uri+'" @[module: '+callingModule.id+' package: '+callingModule.pkg.name+']');
+      }
+
+      module = pkg.index;
+    }
+
+    if(!module){
+      throw new Error('Cannot find module "'+uri+'" @[module: '+callingModule.id+' package: '+callingModule.pkg.name+']');
+    }
+
+    module.parent = callingModule;
+    return module.call();
+  };
+
+
+  return require;
+}
+
+
+function module(parent, id, wrapper){
+  var mod    = { pkg: parent, id: id, wrapper: wrapper },
+      cached = false;
+
+  mod.exports = {};
+  mod.require = newRequire(mod);
+
+  mod.call = function(){
+    if(cached) {
+      return mod.exports;
+    }
+
+    cached = true;
+
+    global.require = mod.require;
+
+    mod.wrapper(mod, mod.exports, global, global.require);
+    return mod.exports;
+  };
+
+  if(parent.mainModuleId == mod.id){
+    parent.index = mod;
+    parent.parents.length === 0 && ( main = mod.call );
+  }
+
+  parent.modules.push(mod);
+}
+
+function pkg(/* [ parentId ...], wrapper */){
+  var wrapper = arguments[ arguments.length - 1 ],
+      parents = Array.prototype.slice.call(arguments, 0, arguments.length - 1),
+      ctx     = wrapper(parents);
+
+
+  pkgmap[ctx.name] = ctx;
+
+  arguments.length == 1 && ( pkgmap.main = ctx );
+
+  return function(modules){
+    var id;
+    for(id in modules){
+      module(ctx, id, modules[id]);
+    }
+  };
+}
+
+
+}(this));
+
+bson.pkg(function(parents){
+
+  return {
+    'name'         : 'bson',
+    'mainModuleId' : 'bson',
+    'modules'      : [],
+    'parents'      : parents
+  };
+
+})({ 'binary': function(module, exports, global, require, undefined){
+  /**
+ * Module dependencies.
+ */
+if(typeof window === 'undefined') { 
+  var Buffer = require('buffer').Buffer; // TODO just use global Buffer
+}
+
+// Binary default subtype
+var BSON_BINARY_SUBTYPE_DEFAULT = 0;
+
+/**
+ * @ignore
+ * @api private
+ */
+var writeStringToArray = function(data) {
+  // Create a buffer
+  var buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(data.length)) : new Array(data.length);
+  // Write the content to the buffer
+  for(var i = 0; i < data.length; i++) {
+    buffer[i] = data.charCodeAt(i);
+  }  
+  // Write the string to the buffer
+  return buffer;
+}
+
+/**
+ * Convert Array ot Uint8Array to Binary String
+ *
+ * @ignore
+ * @api private
+ */
+var convertArraytoUtf8BinaryString = function(byteArray, startIndex, endIndex) {
+  var result = "";
+  for(var i = startIndex; i < endIndex; i++) {
+   result = result + String.fromCharCode(byteArray[i]);
+  }
+  return result;  
+};
+
+/**
+ * A class representation of the BSON Binary type.
+ * 
+ * Sub types
+ *  - **BSON.BSON_BINARY_SUBTYPE_DEFAULT**, default BSON type.
+ *  - **BSON.BSON_BINARY_SUBTYPE_FUNCTION**, BSON function type.
+ *  - **BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY**, BSON byte array type.
+ *  - **BSON.BSON_BINARY_SUBTYPE_UUID**, BSON uuid type.
+ *  - **BSON.BSON_BINARY_SUBTYPE_MD5**, BSON md5 type.
+ *  - **BSON.BSON_BINARY_SUBTYPE_USER_DEFINED**, BSON user defined type.
+ *
+ * @class Represents the Binary BSON type.
+ * @param {Buffer} buffer a buffer object containing the binary data.
+ * @param {Number} [subType] the option binary type.
+ * @return {Grid}
+ */
+function Binary(buffer, subType) {
+  if(!(this instanceof Binary)) return new Binary(buffer, subType);
+  
+  this._bsontype = 'Binary';
+
+  if(buffer instanceof Number) {
+    this.sub_type = buffer;
+    this.position = 0;
+  } else {    
+    this.sub_type = subType == null ? BSON_BINARY_SUBTYPE_DEFAULT : subType;
+    this.position = 0;
+  }
+
+  if(buffer != null && !(buffer instanceof Number)) {
+    // Only accept Buffer, Uint8Array or Arrays
+    if(typeof buffer == 'string') {
+      // Different ways of writing the length of the string for the different types
+      if(typeof Buffer != 'undefined') {
+        this.buffer = new Buffer(buffer);
+      } else if(typeof Uint8Array != 'undefined' || (Object.prototype.toString.call(buffer) == '[object Array]')) {
+        this.buffer = writeStringToArray(buffer);
+      } else {
+        throw new Error("only String, Buffer, Uint8Array or Array accepted");
+      }
+    } else {
+      this.buffer = buffer;      
+    }
+    this.position = buffer.length;
+  } else {
+    if(typeof Buffer != 'undefined') {
+      this.buffer =  new Buffer(Binary.BUFFER_SIZE);      
+    } else if(typeof Uint8Array != 'undefined'){
+      this.buffer = new Uint8Array(new ArrayBuffer(Binary.BUFFER_SIZE));
+    } else {
+      this.buffer = new Array(Binary.BUFFER_SIZE);
+    }
+    // Set position to start of buffer
+    this.position = 0;
+  }
+};
+
+/**
+ * Updates this binary with byte_value.
+ *
+ * @param {Character} byte_value a single byte we wish to write.
+ * @api public
+ */
+Binary.prototype.put = function put(byte_value) {
+  // If it's a string and a has more than one character throw an error
+  if(byte_value['length'] != null && typeof byte_value != 'number' && byte_value.length != 1) throw new Error("only accepts single character String, Uint8Array or Array");
+  if(typeof byte_value != 'number' && byte_value < 0 || byte_value > 255) throw new Error("only accepts number in a valid unsigned byte range 0-255");
+  
+  // Decode the byte value once
+  var decoded_byte = null;
+  if(typeof byte_value == 'string') {
+    decoded_byte = byte_value.charCodeAt(0);      
+  } else if(byte_value['length'] != null) {
+    decoded_byte = byte_value[0];
+  } else {
+    decoded_byte = byte_value;
+  }
+  
+  if(this.buffer.length > this.position) {
+    this.buffer[this.position++] = decoded_byte;
+  } else {
+    if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {    
+      // Create additional overflow buffer
+      var buffer = new Buffer(Binary.BUFFER_SIZE + this.buffer.length);
+      // Combine the two buffers together
+      this.buffer.copy(buffer, 0, 0, this.buffer.length);
+      this.buffer = buffer;
+      this.buffer[this.position++] = decoded_byte;
+    } else {
+      var buffer = null;
+      // Create a new buffer (typed or normal array)
+      if(Object.prototype.toString.call(this.buffer) == '[object Uint8Array]') {
+        buffer = new Uint8Array(new ArrayBuffer(Binary.BUFFER_SIZE + this.buffer.length));
+      } else {
+        buffer = new Array(Binary.BUFFER_SIZE + this.buffer.length);
+      }      
+      
+      // We need to copy all the content to the new array
+      for(var i = 0; i < this.buffer.length; i++) {
+        buffer[i] = this.buffer[i];
+      }
+      
+      // Reassign the buffer
+      this.buffer = buffer;
+      // Write the byte
+      this.buffer[this.position++] = decoded_byte;
+    }
+  }
+};
+
+/**
+ * Writes a buffer or string to the binary.
+ *
+ * @param {Buffer|String} string a string or buffer to be written to the Binary BSON object.
+ * @param {Number} offset specify the binary of where to write the content.
+ * @api public
+ */
+Binary.prototype.write = function write(string, offset) {
+  offset = typeof offset == 'number' ? offset : this.position;
+
+  // If the buffer is to small let's extend the buffer
+  if(this.buffer.length < offset + string.length) {
+    var buffer = null;
+    // If we are in node.js
+    if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {      
+      buffer = new Buffer(this.buffer.length + string.length);
+      this.buffer.copy(buffer, 0, 0, this.buffer.length);      
+    } else if(Object.prototype.toString.call(this.buffer) == '[object Uint8Array]') {
+      // Create a new buffer
+      buffer = new Uint8Array(new ArrayBuffer(this.buffer.length + string.length))
+      // Copy the content
+      for(var i = 0; i < this.position; i++) {
+        buffer[i] = this.buffer[i];
+      }
+    }
+    
+    // Assign the new buffer
+    this.buffer = buffer;
+  }
+
+  if(typeof Buffer != 'undefined' && Buffer.isBuffer(string) && Buffer.isBuffer(this.buffer)) {
+    string.copy(this.buffer, offset, 0, string.length);
+    this.position = (offset + string.length) > this.position ? (offset + string.length) : this.position;
+    // offset = string.length
+  } else if(typeof Buffer != 'undefined' && typeof string == 'string' && Buffer.isBuffer(this.buffer)) {
+    this.buffer.write(string, 'binary', offset);
+    this.position = (offset + string.length) > this.position ? (offset + string.length) : this.position;
+    // offset = string.length;
+  } else if(Object.prototype.toString.call(string) == '[object Uint8Array]' 
+    || Object.prototype.toString.call(string) == '[object Array]' && typeof string != 'string') {      
+    for(var i = 0; i < string.length; i++) {
+      this.buffer[offset++] = string[i];
+    }    
+
+    this.position = offset > this.position ? offset : this.position;
+  } else if(typeof string == 'string') {
+    for(var i = 0; i < string.length; i++) {
+      this.buffer[offset++] = string.charCodeAt(i);
+    }
+
+    this.position = offset > this.position ? offset : this.position;
+  }
+};
+
+/**
+ * Reads **length** bytes starting at **position**.
+ *
+ * @param {Number} position read from the given position in the Binary.
+ * @param {Number} length the number of bytes to read.
+ * @return {Buffer}
+ * @api public
+ */
+Binary.prototype.read = function read(position, length) {
+  length = length && length > 0
+    ? length
+    : this.position;
+  
+  // Let's return the data based on the type we have
+  if(this.buffer['slice']) {
+    return this.buffer.slice(position, position + length);
+  } else {
+    // Create a buffer to keep the result
+    var buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(length)) : new Array(length);
+    for(var i = 0; i < length; i++) {
+      buffer[i] = this.buffer[position++];
+    }
+  }
+  // Return the buffer
+  return buffer;
+};
+
+/**
+ * Returns the value of this binary as a string.
+ *
+ * @return {String}
+ * @api public
+ */
+Binary.prototype.value = function value(asRaw) {
+  asRaw = asRaw == null ? false : asRaw;  
+  
+  // If it's a node.js buffer object
+  if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {
+    return asRaw ? this.buffer.slice(0, this.position) : this.buffer.toString('binary', 0, this.position);
+  } else {
+    if(asRaw) {
+      // we support the slice command use it
+      if(this.buffer['slice'] != null) {
+        return this.buffer.slice(0, this.position);
+      } else {
+        // Create a new buffer to copy content to
+        var newBuffer = Object.prototype.toString.call(this.buffer) == '[object Uint8Array]' ? new Uint8Array(new ArrayBuffer(this.position)) : new Array(this.position);
+        // Copy content
+        for(var i = 0; i < this.position; i++) {
+          newBuffer[i] = this.buffer[i];
+        }
+        // Return the buffer
+        return newBuffer;
+      }
+    } else {
+      return convertArraytoUtf8BinaryString(this.buffer, 0, this.position);
+    }
+  }
+};
+
+/**
+ * Length.
+ *
+ * @return {Number} the length of the binary.
+ * @api public
+ */
+Binary.prototype.length = function length() {
+  return this.position;
+};
+
+/**
+ * @ignore
+ * @api private
+ */
+Binary.prototype.toJSON = function() {
+  return this.buffer != null ? this.buffer.toString('base64') : '';
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+Binary.prototype.toString = function(format) {
+  return this.buffer != null ? this.buffer.slice(0, this.position).toString(format) : '';
+}
+
+Binary.BUFFER_SIZE = 256;
+
+/**
+ * Default BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_DEFAULT = 0;
+/**
+ * Function BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_FUNCTION = 1;
+/**
+ * Byte Array BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_BYTE_ARRAY = 2;
+/**
+ * OLD UUID BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_UUID_OLD = 3;
+/**
+ * UUID BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_UUID = 4;
+/**
+ * MD5 BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_MD5 = 5;
+/**
+ * User BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_USER_DEFINED = 128;
+
+/**
+ * Expose.
+ */
+exports.Binary = Binary;
+
+
+}, 
+
+
+
+'binary_parser': function(module, exports, global, require, undefined){
+  /**
+ * Binary Parser.
+ * Jonas Raoni Soares Silva
+ * http://jsfromhell.com/classes/binary-parser [v1.0]
+ */
+var chr = String.fromCharCode;
+
+var maxBits = [];
+for (var i = 0; i < 64; i++) {
+	maxBits[i] = Math.pow(2, i);
+}
+
+function BinaryParser (bigEndian, allowExceptions) {
+  if(!(this instanceof BinaryParser)) return new BinaryParser(bigEndian, allowExceptions);
+  
+	this.bigEndian = bigEndian;
+	this.allowExceptions = allowExceptions;
+};
+
+BinaryParser.warn = function warn (msg) {
+	if (this.allowExceptions) {
+		throw new Error(msg);
+  }
+
+	return 1;
+};
+
+BinaryParser.decodeFloat = function decodeFloat (data, precisionBits, exponentBits) {
+	var b = new this.Buffer(this.bigEndian, data);
+
+	b.checkBuffer(precisionBits + exponentBits + 1);
+
+	var bias = maxBits[exponentBits - 1] - 1
+    , signal = b.readBits(precisionBits + exponentBits, 1)
+    , exponent = b.readBits(precisionBits, exponentBits)
+    , significand = 0
+    , divisor = 2
+    , curByte = b.buffer.length + (-precisionBits >> 3) - 1;
+
+	do {
+		for (var byteValue = b.buffer[ ++curByte ], startBit = precisionBits % 8 || 8, mask = 1 << startBit; mask >>= 1; ( byteValue & mask ) && ( significand += 1 / divisor ), divisor *= 2 );
+	} while (precisionBits -= startBit);
+
+	return exponent == ( bias << 1 ) + 1 ? significand ? NaN : signal ? -Infinity : +Infinity : ( 1 + signal * -2 ) * ( exponent || significand ? !exponent ? Math.pow( 2, -bias + 1 ) * significand : Math.pow( 2, exponent - bias ) * ( 1 + significand ) : 0 );
+};
+
+BinaryParser.decodeInt = function decodeInt (data, bits, signed, forceBigEndian) {
+  var b = new this.Buffer(this.bigEndian || forceBigEndian, data)
+      , x = b.readBits(0, bits)
+      , max = maxBits[bits]; //max = Math.pow( 2, bits );
+  
+  return signed && x >= max / 2
+      ? x - max
+      : x;
+};
+
+BinaryParser.encodeFloat = function encodeFloat (data, precisionBits, exponentBits) {
+	var bias = maxBits[exponentBits - 1] - 1
+    , minExp = -bias + 1
+    , maxExp = bias
+    , minUnnormExp = minExp - precisionBits
+    , n = parseFloat(data)
+    , status = isNaN(n) || n == -Infinity || n == +Infinity ? n : 0
+    ,	exp = 0
+    , len = 2 * bias + 1 + precisionBits + 3
+    , bin = new Array(len)
+    , signal = (n = status !== 0 ? 0 : n) < 0
+    , intPart = Math.floor(n = Math.abs(n))
+    , floatPart = n - intPart
+    , lastBit
+    , rounded
+    , result
+    , i
+    , j;
+
+	for (i = len; i; bin[--i] = 0);
+
+	for (i = bias + 2; intPart && i; bin[--i] = intPart % 2, intPart = Math.floor(intPart / 2));
+
+	for (i = bias + 1; floatPart > 0 && i; (bin[++i] = ((floatPart *= 2) >= 1) - 0 ) && --floatPart);
+
+	for (i = -1; ++i < len && !bin[i];);
+
+	if (bin[(lastBit = precisionBits - 1 + (i = (exp = bias + 1 - i) >= minExp && exp <= maxExp ? i + 1 : bias + 1 - (exp = minExp - 1))) + 1]) {
+		if (!(rounded = bin[lastBit])) {
+			for (j = lastBit + 2; !rounded && j < len; rounded = bin[j++]);
+		}
+
+		for (j = lastBit + 1; rounded && --j >= 0; (bin[j] = !bin[j] - 0) && (rounded = 0));
+	}
+
+	for (i = i - 2 < 0 ? -1 : i - 3; ++i < len && !bin[i];);
+
+	if ((exp = bias + 1 - i) >= minExp && exp <= maxExp) {
+		++i;
+  } else if (exp < minExp) {
+		exp != bias + 1 - len && exp < minUnnormExp && this.warn("encodeFloat::float underflow");
+		i = bias + 1 - (exp = minExp - 1);
+	}
+
+	if (intPart || status !== 0) {
+		this.warn(intPart ? "encodeFloat::float overflow" : "encodeFloat::" + status);
+		exp = maxExp + 1;
+		i = bias + 2;
+
+		if (status == -Infinity) {
+			signal = 1;
+    } else if (isNaN(status)) {
+			bin[i] = 1;
+    }
+	}
+
+	for (n = Math.abs(exp + bias), j = exponentBits + 1, result = ""; --j; result = (n % 2) + result, n = n >>= 1);
+
+	for (n = 0, j = 0, i = (result = (signal ? "1" : "0") + result + bin.slice(i, i + precisionBits).join("")).length, r = []; i; j = (j + 1) % 8) {
+		n += (1 << j) * result.charAt(--i);
+		if (j == 7) {
+			r[r.length] = String.fromCharCode(n);
+			n = 0;
+		}
+	}
+
+	r[r.length] = n
+    ? String.fromCharCode(n)
+    : "";
+
+	return (this.bigEndian ? r.reverse() : r).join("");
+};
+
+BinaryParser.encodeInt = function encodeInt (data, bits, signed, forceBigEndian) {
+	var max = maxBits[bits];
+
+  if (data >= max || data < -(max / 2)) {
+    this.warn("encodeInt::overflow");
+    data = 0;
+  }
+
+	if (data < 0) {
+    data += max;
+  }
+
+	for (var r = []; data; r[r.length] = String.fromCharCode(data % 256), data = Math.floor(data / 256));
+
+	for (bits = -(-bits >> 3) - r.length; bits--; r[r.length] = "\0");
+
+  return ((this.bigEndian || forceBigEndian) ? r.reverse() : r).join("");
+};
+
+BinaryParser.toSmall    = function( data ){ return this.decodeInt( data,  8, true  ); };
+BinaryParser.fromSmall  = function( data ){ return this.encodeInt( data,  8, true  ); };
+BinaryParser.toByte     = function( data ){ return this.decodeInt( data,  8, false ); };
+BinaryParser.fromByte   = function( data ){ return this.encodeInt( data,  8, false ); };
+BinaryParser.toShort    = function( data ){ return this.decodeInt( data, 16, true  ); };
+BinaryParser.fromShort  = function( data ){ return this.encodeInt( data, 16, true  ); };
+BinaryParser.toWord     = function( data ){ return this.decodeInt( data, 16, false ); };
+BinaryParser.fromWord   = function( data ){ return this.encodeInt( data, 16, false ); };
+BinaryParser.toInt      = function( data ){ return this.decodeInt( data, 32, true  ); };
+BinaryParser.fromInt    = function( data ){ return this.encodeInt( data, 32, true  ); };
+BinaryParser.toLong     = function( data ){ return this.decodeInt( data, 64, true  ); };
+BinaryParser.fromLong   = function( data ){ return this.encodeInt( data, 64, true  ); };
+BinaryParser.toDWord    = function( data ){ return this.decodeInt( data, 32, false ); };
+BinaryParser.fromDWord  = function( data ){ return this.encodeInt( data, 32, false ); };
+BinaryParser.toQWord    = function( data ){ return this.decodeInt( data, 64, true ); };
+BinaryParser.fromQWord  = function( data ){ return this.encodeInt( data, 64, true ); };
+BinaryParser.toFloat    = function( data ){ return this.decodeFloat( data, 23, 8   ); };
+BinaryParser.fromFloat  = function( data ){ return this.encodeFloat( data, 23, 8   ); };
+BinaryParser.toDouble   = function( data ){ return this.decodeFloat( data, 52, 11  ); };
+BinaryParser.fromDouble = function( data ){ return this.encodeFloat( data, 52, 11  ); };
+
+// Factor out the encode so it can be shared by add_header and push_int32
+BinaryParser.encode_int32 = function encode_int32 (number, asArray) {
+  var a, b, c, d, unsigned;
+  unsigned = (number < 0) ? (number + 0x100000000) : number;
+  a = Math.floor(unsigned / 0xffffff);
+  unsigned &= 0xffffff;
+  b = Math.floor(unsigned / 0xffff);
+  unsigned &= 0xffff;
+  c = Math.floor(unsigned / 0xff);
+  unsigned &= 0xff;
+  d = Math.floor(unsigned);
+  return asArray ? [chr(a), chr(b), chr(c), chr(d)] : chr(a) + chr(b) + chr(c) + chr(d);
+};
+
+BinaryParser.encode_int64 = function encode_int64 (number) {
+  var a, b, c, d, e, f, g, h, unsigned;
+  unsigned = (number < 0) ? (number + 0x10000000000000000) : number;
+  a = Math.floor(unsigned / 0xffffffffffffff);
+  unsigned &= 0xffffffffffffff;
+  b = Math.floor(unsigned / 0xffffffffffff);
+  unsigned &= 0xffffffffffff;
+  c = Math.floor(unsigned / 0xffffffffff);
+  unsigned &= 0xffffffffff;
+  d = Math.floor(unsigned / 0xffffffff);
+  unsigned &= 0xffffffff;
+  e = Math.floor(unsigned / 0xffffff);
+  unsigned &= 0xffffff;
+  f = Math.floor(unsigned / 0xffff);
+  unsigned &= 0xffff;
+  g = Math.floor(unsigned / 0xff);
+  unsigned &= 0xff;
+  h = Math.floor(unsigned);
+  return chr(a) + chr(b) + chr(c) + chr(d) + chr(e) + chr(f) + chr(g) + chr(h);
+};
+
+/**
+ * UTF8 methods
+ */
+
+// Take a raw binary string and return a utf8 string
+BinaryParser.decode_utf8 = function decode_utf8 (binaryStr) {
+  var len = binaryStr.length
+    , decoded = ''
+    , i = 0
+    , c = 0
+    , c1 = 0
+    , c2 = 0
+    , c3;
+
+  while (i < len) {
+    c = binaryStr.charCodeAt(i);
+    if (c < 128) {
+      decoded += String.fromCharCode(c);
+      i++;
+    } else if ((c > 191) && (c < 224)) {
+	    c2 = binaryStr.charCodeAt(i+1);
+      decoded += String.fromCharCode(((c & 31) << 6) | (c2 & 63));
+      i += 2;
+    } else {
+	    c2 = binaryStr.charCodeAt(i+1);
+	    c3 = binaryStr.charCodeAt(i+2);
+      decoded += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
+      i += 3;
+    }
+  }
+
+  return decoded;
+};
+
+// Encode a cstring
+BinaryParser.encode_cstring = function encode_cstring (s) {
+  return unescape(encodeURIComponent(s)) + BinaryParser.fromByte(0);
+};
+
+// Take a utf8 string and return a binary string
+BinaryParser.encode_utf8 = function encode_utf8 (s) {
+  var a = ""
+    , c;
+
+  for (var n = 0, len = s.length; n < len; n++) {
+    c = s.charCodeAt(n);
+
+    if (c < 128) {
+	    a += String.fromCharCode(c);
+    } else if ((c > 127) && (c < 2048)) {
+	    a += String.fromCharCode((c>>6) | 192) ;
+	    a += String.fromCharCode((c&63) | 128);
+    } else {
+      a += String.fromCharCode((c>>12) | 224);
+      a += String.fromCharCode(((c>>6) & 63) | 128);
+      a += String.fromCharCode((c&63) | 128);
+    }
+  }
+
+  return a;
+};
+
+BinaryParser.hprint = function hprint (s) {
+  var number;
+
+  for (var i = 0, len = s.length; i < len; i++) {
+    if (s.charCodeAt(i) < 32) {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(16)
+        : s.charCodeAt(i).toString(16);        
+      process.stdout.write(number + " ")
+    } else {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(16)
+        : s.charCodeAt(i).toString(16);
+        process.stdout.write(number + " ")
+    }
+  }
+  
+  process.stdout.write("\n\n");
+};
+
+BinaryParser.ilprint = function hprint (s) {
+  var number;
+
+  for (var i = 0, len = s.length; i < len; i++) {
+    if (s.charCodeAt(i) < 32) {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(10)
+        : s.charCodeAt(i).toString(10);
+
+      require('util').debug(number+' : ');
+    } else {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(10)
+        : s.charCodeAt(i).toString(10);
+      require('util').debug(number+' : '+ s.charAt(i));
+    }
+  }
+};
+
+BinaryParser.hlprint = function hprint (s) {
+  var number;
+
+  for (var i = 0, len = s.length; i < len; i++) {
+    if (s.charCodeAt(i) < 32) {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(16)
+        : s.charCodeAt(i).toString(16);
+      require('util').debug(number+' : ');
+    } else {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(16)
+        : s.charCodeAt(i).toString(16);
+      require('util').debug(number+' : '+ s.charAt(i));
+    }
+  }
+};
+
+/**
+ * BinaryParser buffer constructor.
+ */
+function BinaryParserBuffer (bigEndian, buffer) {
+  this.bigEndian = bigEndian || 0;
+  this.buffer = [];
+  this.setBuffer(buffer);
+};
+
+BinaryParserBuffer.prototype.setBuffer = function setBuffer (data) {
+  var l, i, b;
+
+	if (data) {
+    i = l = data.length;
+    b = this.buffer = new Array(l);
+		for (; i; b[l - i] = data.charCodeAt(--i));
+		this.bigEndian && b.reverse();
+	}
+};
+
+BinaryParserBuffer.prototype.hasNeededBits = function hasNeededBits (neededBits) {
+	return this.buffer.length >= -(-neededBits >> 3);
+};
+
+BinaryParserBuffer.prototype.checkBuffer = function checkBuffer (neededBits) {
+	if (!this.hasNeededBits(neededBits)) {
+		throw new Error("checkBuffer::missing bytes");
+  }
+};
+
+BinaryParserBuffer.prototype.readBits = function readBits (start, length) {
+	//shl fix: Henri Torgemane ~1996 (compressed by Jonas Raoni)
+
+	function shl (a, b) {
+		for (; b--; a = ((a %= 0x7fffffff + 1) & 0x40000000) == 0x40000000 ? a * 2 : (a - 0x40000000) * 2 + 0x7fffffff + 1);
+		return a;
+	}
+
+	if (start < 0 || length <= 0) {
+		return 0;
+  }
+
+	this.checkBuffer(start + length);
+
+  var offsetLeft
+    , offsetRight = start % 8
+    , curByte = this.buffer.length - ( start >> 3 ) - 1
+    , lastByte = this.buffer.length + ( -( start + length ) >> 3 )
+    , diff = curByte - lastByte
+    , sum = ((this.buffer[ curByte ] >> offsetRight) & ((1 << (diff ? 8 - offsetRight : length)) - 1)) + (diff && (offsetLeft = (start + length) % 8) ? (this.buffer[lastByte++] & ((1 << offsetLeft) - 1)) << (diff-- << 3) - offsetRight : 0);
+
+	for(; diff; sum += shl(this.buffer[lastByte++], (diff-- << 3) - offsetRight));
+
+	return sum;
+};
+
+/**
+ * Expose.
+ */
+BinaryParser.Buffer = BinaryParserBuffer;
+
+exports.BinaryParser = BinaryParser;
+
+}, 
+
+
+
+'bson': function(module, exports, global, require, undefined){
+  var Long = require('./long').Long
+  , Double = require('./double').Double
+  , Timestamp = require('./timestamp').Timestamp
+  , ObjectID = require('./objectid').ObjectID
+  , Symbol = require('./symbol').Symbol
+  , Code = require('./code').Code
+  , MinKey = require('./min_key').MinKey
+  , MaxKey = require('./max_key').MaxKey
+  , DBRef = require('./db_ref').DBRef
+  , Binary = require('./binary').Binary
+  , BinaryParser = require('./binary_parser').BinaryParser
+  , writeIEEE754 = require('./float_parser').writeIEEE754
+  , readIEEE754 = require('./float_parser').readIEEE754
+
+// To ensure that 0.4 of node works correctly
+var isDate = function isDate(d) {
+  return typeof d === 'object' && Object.prototype.toString.call(d) === '[object Date]';
+}
+
+/**
+ * Create a new BSON instance
+ *
+ * @class Represents the BSON Parser
+ * @return {BSON} instance of BSON Parser.
+ */
+function BSON () {};
+
+/**
+ * @ignore
+ * @api private
+ */
+// BSON MAX VALUES
+BSON.BSON_INT32_MAX = 0x7FFFFFFF;
+BSON.BSON_INT32_MIN = -0x80000000;
+
+BSON.BSON_INT64_MAX = Math.pow(2, 63) - 1;
+BSON.BSON_INT64_MIN = -Math.pow(2, 63);
+
+// JS MAX PRECISE VALUES
+BSON.JS_INT_MAX = 0x20000000000000;  // Any integer up to 2^53 can be precisely represented by a double.
+BSON.JS_INT_MIN = -0x20000000000000;  // Any integer down to -2^53 can be precisely represented by a double.
+
+// Internal long versions
+var JS_INT_MAX_LONG = Long.fromNumber(0x20000000000000);  // Any integer up to 2^53 can be precisely represented by a double.
+var JS_INT_MIN_LONG = Long.fromNumber(-0x20000000000000);  // Any integer down to -2^53 can be precisely represented by a double.
+
+/**
+ * Number BSON Type
+ *
+ * @classconstant BSON_DATA_NUMBER
+ **/
+BSON.BSON_DATA_NUMBER = 1;
+/**
+ * String BSON Type
+ *
+ * @classconstant BSON_DATA_STRING
+ **/
+BSON.BSON_DATA_STRING = 2;
+/**
+ * Object BSON Type
+ *
+ * @classconstant BSON_DATA_OBJECT
+ **/
+BSON.BSON_DATA_OBJECT = 3;
+/**
+ * Array BSON Type
+ *
+ * @classconstant BSON_DATA_ARRAY
+ **/
+BSON.BSON_DATA_ARRAY = 4;
+/**
+ * Binary BSON Type
+ *
+ * @classconstant BSON_DATA_BINARY
+ **/
+BSON.BSON_DATA_BINARY = 5;
+/**
+ * ObjectID BSON Type
+ *
+ * @classconstant BSON_DATA_OID
+ **/
+BSON.BSON_DATA_OID = 7;
+/**
+ * Boolean BSON Type
+ *
+ * @classconstant BSON_DATA_BOOLEAN
+ **/
+BSON.BSON_DATA_BOOLEAN = 8;
+/**
+ * Date BSON Type
+ *
+ * @classconstant BSON_DATA_DATE
+ **/
+BSON.BSON_DATA_DATE = 9;
+/**
+ * null BSON Type
+ *
+ * @classconstant BSON_DATA_NULL
+ **/
+BSON.BSON_DATA_NULL = 10;
+/**
+ * RegExp BSON Type
+ *
+ * @classconstant BSON_DATA_REGEXP
+ **/
+BSON.BSON_DATA_REGEXP = 11;
+/**
+ * Code BSON Type
+ *
+ * @classconstant BSON_DATA_CODE
+ **/
+BSON.BSON_DATA_CODE = 13;
+/**
+ * Symbol BSON Type
+ *
+ * @classconstant BSON_DATA_SYMBOL
+ **/
+BSON.BSON_DATA_SYMBOL = 14;
+/**
+ * Code with Scope BSON Type
+ *
+ * @classconstant BSON_DATA_CODE_W_SCOPE
+ **/
+BSON.BSON_DATA_CODE_W_SCOPE = 15;
+/**
+ * 32 bit Integer BSON Type
+ *
+ * @classconstant BSON_DATA_INT
+ **/
+BSON.BSON_DATA_INT = 16;
+/**
+ * Timestamp BSON Type
+ *
+ * @classconstant BSON_DATA_TIMESTAMP
+ **/
+BSON.BSON_DATA_TIMESTAMP = 17;
+/**
+ * Long BSON Type
+ *
+ * @classconstant BSON_DATA_LONG
+ **/
+BSON.BSON_DATA_LONG = 18;
+/**
+ * MinKey BSON Type
+ *
+ * @classconstant BSON_DATA_MIN_KEY
+ **/
+BSON.BSON_DATA_MIN_KEY = 0xff;
+/**
+ * MaxKey BSON Type
+ *
+ * @classconstant BSON_DATA_MAX_KEY
+ **/
+BSON.BSON_DATA_MAX_KEY = 0x7f;
+
+/**
+ * Binary Default Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_DEFAULT
+ **/
+BSON.BSON_BINARY_SUBTYPE_DEFAULT = 0;
+/**
+ * Binary Function Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_FUNCTION
+ **/
+BSON.BSON_BINARY_SUBTYPE_FUNCTION = 1;
+/**
+ * Binary Byte Array Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_BYTE_ARRAY
+ **/
+BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY = 2;
+/**
+ * Binary UUID Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_UUID
+ **/
+BSON.BSON_BINARY_SUBTYPE_UUID = 3;
+/**
+ * Binary MD5 Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_MD5
+ **/
+BSON.BSON_BINARY_SUBTYPE_MD5 = 4;
+/**
+ * Binary User Defined Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_USER_DEFINED
+ **/
+BSON.BSON_BINARY_SUBTYPE_USER_DEFINED = 128;
+
+/**
+ * Calculate the bson size for a passed in Javascript object.
+ *
+ * @param {Object} object the Javascript object to calculate the BSON byte size for.
+ * @param {Boolean} [serializeFunctions] serialize all functions in the object **(default:false)**.
+ * @return {Number} returns the number of bytes the BSON object will take up.
+ * @api public
+ */
+BSON.calculateObjectSize = function calculateObjectSize(object, serializeFunctions) {
+  var totalLength = (4 + 1);
+
+  if(Array.isArray(object)) {
+    for(var i = 0; i < object.length; i++) {
+      totalLength += calculateElement(i.toString(), object[i], serializeFunctions)
+    }
+  } else {
+		// If we have toBSON defined, override the current object
+		if(object.toBSON) {
+			object = object.toBSON();
+		}
+
+		// Calculate size
+    for(var key in object) {
+      totalLength += calculateElement(key, object[key], serializeFunctions)
+    }
+  }
+
+  return totalLength;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+function calculateElement(name, value, serializeFunctions) {
+  var isBuffer = typeof Buffer !== 'undefined';
+
+  switch(typeof value) {
+    case 'string':
+      return 1 + (!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1 + 4 + (!isBuffer ? numberOfBytes(value) : Buffer.byteLength(value, 'utf8')) + 1;
+    case 'number':
+      if(Math.floor(value) === value && value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
+        if(value >= BSON.BSON_INT32_MIN && value <= BSON.BSON_INT32_MAX) { // 32 bit
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (4 + 1);
+        } else {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
+        }
+      } else {  // 64 bit
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
+      }
+    case 'undefined':
+      return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1);
+    case 'boolean':
+      return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1 + 1);
+    case 'object':
+      if(value == null || value instanceof MinKey || value instanceof MaxKey || value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1);
+      } else if(value instanceof ObjectID || value['_bsontype'] == 'ObjectID') {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (12 + 1);
+      } else if(value instanceof Date || isDate(value)) {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
+      } else if(typeof Buffer !== 'undefined' && Buffer.isBuffer(value)) {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1 + 4 + 1) + value.length;
+      } else if(value instanceof Long || value instanceof Double || value instanceof Timestamp
+          || value['_bsontype'] == 'Long' || value['_bsontype'] == 'Double' || value['_bsontype'] == 'Timestamp') {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
+      } else if(value instanceof Code || value['_bsontype'] == 'Code') {
+        // Calculate size depending on the availability of a scope
+        if(value.scope != null && Object.keys(value.scope).length > 0) {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + 4 + (!isBuffer ? numberOfBytes(value.code.toString()) : Buffer.byteLength(value.code.toString(), 'utf8')) + 1 + BSON.calculateObjectSize(value.scope, serializeFunctions);
+        } else {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + (!isBuffer ? numberOfBytes(value.code.toString()) : Buffer.byteLength(value.code.toString(), 'utf8')) + 1;
+        }
+      } else if(value instanceof Binary || value['_bsontype'] == 'Binary') {
+        // Check what kind of subtype we have
+        if(value.sub_type == Binary.SUBTYPE_BYTE_ARRAY) {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (value.position + 1 + 4 + 1 + 4);
+        } else {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (value.position + 1 + 4 + 1);
+        }
+      } else if(value instanceof Symbol || value['_bsontype'] == 'Symbol') {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + ((!isBuffer ? numberOfBytes(value.value) : Buffer.byteLength(value.value, 'utf8')) + 4 + 1 + 1);
+      } else if(value instanceof DBRef || value['_bsontype'] == 'DBRef') {
+        // Set up correct object for serialization
+        var ordered_values = {
+            '$ref': value.namespace
+          , '$id' : value.oid
+        };
+
+        // Add db reference if it exists
+        if(null != value.db) {
+          ordered_values['$db'] = value.db;
+        }
+
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + BSON.calculateObjectSize(ordered_values, serializeFunctions);
+      } else if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]') {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + (!isBuffer ? numberOfBytes(value.source) : Buffer.byteLength(value.source, 'utf8')) + 1
+            + (value.global ? 1 : 0) + (value.ignoreCase ? 1 : 0) + (value.multiline ? 1 : 0) + 1
+      } else {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + BSON.calculateObjectSize(value, serializeFunctions) + 1;
+      }
+    case 'function':
+      // WTF for 0.4.X where typeof /someregexp/ === 'function'
+      if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]' || String.call(value) == '[object RegExp]') {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + (!isBuffer ? numberOfBytes(value.source) : Buffer.byteLength(value.source, 'utf8')) + 1
+          + (value.global ? 1 : 0) + (value.ignoreCase ? 1 : 0) + (value.multiline ? 1 : 0) + 1
+      } else {
+        if(serializeFunctions && value.scope != null && Object.keys(value.scope).length > 0) {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + 4 + (!isBuffer ? numberOfBytes(value.toString()) : Buffer.byteLength(value.toString(), 'utf8')) + 1 + BSON.calculateObjectSize(value.scope, serializeFunctions);
+        } else if(serializeFunctions) {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + (!isBuffer ? numberOfBytes(value.toString()) : Buffer.byteLength(value.toString(), 'utf8')) + 1;
+        }
+      }
+  }
+
+  return 0;
+}
+
+/**
+ * Serialize a Javascript object using a predefined Buffer and index into the buffer, useful when pre-allocating the space for serialization.
+ *
+ * @param {Object} object the Javascript object to serialize.
+ * @param {Boolean} checkKeys the serializer will check if keys are valid.
+ * @param {Buffer} buffer the Buffer you pre-allocated to store the serialized BSON object.
+ * @param {Number} index the index in the buffer where we wish to start serializing into.
+ * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
+ * @return {Number} returns the new write index in the Buffer.
+ * @api public
+ */
+BSON.serializeWithBufferAndIndex = function serializeWithBufferAndIndex(object, checkKeys, buffer, index, serializeFunctions) {
+  // Default setting false
+  serializeFunctions = serializeFunctions == null ? false : serializeFunctions;
+  // Write end information (length of the object)
+  var size = buffer.length;
+  // Write the size of the object
+  buffer[index++] = size & 0xff;
+  buffer[index++] = (size >> 8) & 0xff;
+  buffer[index++] = (size >> 16) & 0xff;
+  buffer[index++] = (size >> 24) & 0xff;
+  return serializeObject(object, checkKeys, buffer, index, serializeFunctions) - 1;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+var serializeObject = function(object, checkKeys, buffer, index, serializeFunctions) {
+  // Process the object
+  if(Array.isArray(object)) {
+    for(var i = 0; i < object.length; i++) {
+      index = packElement(i.toString(), object[i], checkKeys, buffer, index, serializeFunctions);
+    }
+  } else {
+		// If we have toBSON defined, override the current object
+		if(object.toBSON) {
+			object = object.toBSON();
+		}
+
+		// Serialize the object
+    for(var key in object) {
+      // Check the key and throw error if it's illegal
+      if(checkKeys ==  true && (key != '$db' && key != '$ref' && key != '$id')) {
+        BSON.checkKey(key);
+      }
+
+      // Pack the element
+      index = packElement(key, object[key], checkKeys, buffer, index, serializeFunctions);
+    }
+  }
+
+  // Write zero
+  buffer[index++] = 0;
+  return index;
+}
+
+var stringToBytes = function(str) {
+  var ch, st, re = [];
+  for (var i = 0; i < str.length; i++ ) {
+    ch = str.charCodeAt(i);  // get char
+    st = [];                 // set up "stack"
+    do {
+      st.push( ch & 0xFF );  // push byte to stack
+      ch = ch >> 8;          // shift value down by 1 byte
+    }
+    while ( ch );
+    // add stack contents to result
+    // done because chars have "wrong" endianness
+    re = re.concat( st.reverse() );
+  }
+  // return an array of bytes
+  return re;
+}
+
+var numberOfBytes = function(str) {
+  var ch, st, re = 0;
+  for (var i = 0; i < str.length; i++ ) {
+    ch = str.charCodeAt(i);  // get char
+    st = [];                 // set up "stack"
+    do {
+      st.push( ch & 0xFF );  // push byte to stack
+      ch = ch >> 8;          // shift value down by 1 byte
+    }
+    while ( ch );
+    // add stack contents to result
+    // done because chars have "wrong" endianness
+    re = re + st.length;
+  }
+  // return an array of bytes
+  return re;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+var writeToTypedArray = function(buffer, string, index) {
+  var bytes = stringToBytes(string);
+  for(var i = 0; i < bytes.length; i++) {
+    buffer[index + i] = bytes[i];
+  }
+  return bytes.length;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+var supportsBuffer = typeof Buffer != 'undefined';
+
+/**
+ * @ignore
+ * @api private
+ */
+var packElement = function(name, value, checkKeys, buffer, index, serializeFunctions) {
+  var startIndex = index;
+
+  switch(typeof value) {
+    case 'string':
+      // Encode String type
+      buffer[index++] = BSON.BSON_DATA_STRING;
+      // Number of written bytes
+      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+      // Encode the name
+      index = index + numberOfWrittenBytes + 1;
+      buffer[index - 1] = 0;
+
+      // Calculate size
+      var size = supportsBuffer ? Buffer.byteLength(value) + 1 : numberOfBytes(value) + 1;
+      // Write the size of the string to buffer
+      buffer[index + 3] = (size >> 24) & 0xff;
+      buffer[index + 2] = (size >> 16) & 0xff;
+      buffer[index + 1] = (size >> 8) & 0xff;
+      buffer[index] = size & 0xff;
+      // Ajust the index
+      index = index + 4;
+      // Write the string
+      supportsBuffer ? buffer.write(value, index, 'utf8') : writeToTypedArray(buffer, value, index);
+      // Update index
+      index = index + size - 1;
+      // Write zero
+      buffer[index++] = 0;
+      // Return index
+      return index;
+    case 'number':
+      // We have an integer value
+      if(Math.floor(value) === value && value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
+        // If the value fits in 32 bits encode as int, if it fits in a double
+        // encode it as a double, otherwise long
+        if(value >= BSON.BSON_INT32_MIN && value <= BSON.BSON_INT32_MAX) {
+          // Set int type 32 bits or less
+          buffer[index++] = BSON.BSON_DATA_INT;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Write the int value
+          buffer[index++] = value & 0xff;
+          buffer[index++] = (value >> 8) & 0xff;
+          buffer[index++] = (value >> 16) & 0xff;
+          buffer[index++] = (value >> 24) & 0xff;
+        } else if(value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
+          // Encode as double
+          buffer[index++] = BSON.BSON_DATA_NUMBER;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Write float
+          writeIEEE754(buffer, value, index, 'little', 52, 8);
+          // Ajust index
+          index = index + 8;
+        } else {
+          // Set long type
+          buffer[index++] = BSON.BSON_DATA_LONG;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          var longVal = Long.fromNumber(value);
+          var lowBits = longVal.getLowBits();
+          var highBits = longVal.getHighBits();
+          // Encode low bits
+          buffer[index++] = lowBits & 0xff;
+          buffer[index++] = (lowBits >> 8) & 0xff;
+          buffer[index++] = (lowBits >> 16) & 0xff;
+          buffer[index++] = (lowBits >> 24) & 0xff;
+          // Encode high bits
+          buffer[index++] = highBits & 0xff;
+          buffer[index++] = (highBits >> 8) & 0xff;
+          buffer[index++] = (highBits >> 16) & 0xff;
+          buffer[index++] = (highBits >> 24) & 0xff;
+        }
+      } else {
+        // Encode as double
+        buffer[index++] = BSON.BSON_DATA_NUMBER;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Write float
+        writeIEEE754(buffer, value, index, 'little', 52, 8);
+        // Ajust index
+        index = index + 8;
+      }
+
+      return index;
+    case 'undefined':
+      // Set long type
+      buffer[index++] = BSON.BSON_DATA_NULL;
+      // Number of written bytes
+      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+      // Encode the name
+      index = index + numberOfWrittenBytes + 1;
+      buffer[index - 1] = 0;
+      return index;
+    case 'boolean':
+      // Write the type
+      buffer[index++] = BSON.BSON_DATA_BOOLEAN;
+      // Number of written bytes
+      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+      // Encode the name
+      index = index + numberOfWrittenBytes + 1;
+      buffer[index - 1] = 0;
+      // Encode the boolean value
+      buffer[index++] = value ? 1 : 0;
+      return index;
+    case 'object':
+      if(value === null || value instanceof MinKey || value instanceof MaxKey
+          || value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
+        // Write the type of either min or max key
+        if(value === null) {
+          buffer[index++] = BSON.BSON_DATA_NULL;
+        } else if(value instanceof MinKey) {
+          buffer[index++] = BSON.BSON_DATA_MIN_KEY;
+        } else {
+          buffer[index++] = BSON.BSON_DATA_MAX_KEY;
+        }
+
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        return index;
+      } else if(value instanceof ObjectID || value['_bsontype'] == 'ObjectID') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_OID;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+
+        // Write objectid
+        supportsBuffer ? buffer.write(value.id, index, 'binary') : writeToTypedArray(buffer, value.id, index);
+        // Ajust index
+        index = index + 12;
+        return index;
+      } else if(value instanceof Date || isDate(value)) {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_DATE;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+
+        // Write the date
+        var dateInMilis = Long.fromNumber(value.getTime());
+        var lowBits = dateInMilis.getLowBits();
+        var highBits = dateInMilis.getHighBits();
+        // Encode low bits
+        buffer[index++] = lowBits & 0xff;
+        buffer[index++] = (lowBits >> 8) & 0xff;
+        buffer[index++] = (lowBits >> 16) & 0xff;
+        buffer[index++] = (lowBits >> 24) & 0xff;
+        // Encode high bits
+        buffer[index++] = highBits & 0xff;
+        buffer[index++] = (highBits >> 8) & 0xff;
+        buffer[index++] = (highBits >> 16) & 0xff;
+        buffer[index++] = (highBits >> 24) & 0xff;
+        return index;
+      } else if(typeof Buffer !== 'undefined' && Buffer.isBuffer(value)) {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_BINARY;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Get size of the buffer (current write point)
+        var size = value.length;
+        // Write the size of the string to buffer
+        buffer[index++] = size & 0xff;
+        buffer[index++] = (size >> 8) & 0xff;
+        buffer[index++] = (size >> 16) & 0xff;
+        buffer[index++] = (size >> 24) & 0xff;
+        // Write the default subtype
+        buffer[index++] = BSON.BSON_BINARY_SUBTYPE_DEFAULT;
+        // Copy the content form the binary field to the buffer
+        value.copy(buffer, index, 0, size);
+        // Adjust the index
+        index = index + size;
+        return index;
+      } else if(value instanceof Long || value instanceof Timestamp || value['_bsontype'] == 'Long' || value['_bsontype'] == 'Timestamp') {
+        // Write the type
+        buffer[index++] = value instanceof Long ? BSON.BSON_DATA_LONG : BSON.BSON_DATA_TIMESTAMP;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Write the date
+        var lowBits = value.getLowBits();
+        var highBits = value.getHighBits();
+        // Encode low bits
+        buffer[index++] = lowBits & 0xff;
+        buffer[index++] = (lowBits >> 8) & 0xff;
+        buffer[index++] = (lowBits >> 16) & 0xff;
+        buffer[index++] = (lowBits >> 24) & 0xff;
+        // Encode high bits
+        buffer[index++] = highBits & 0xff;
+        buffer[index++] = (highBits >> 8) & 0xff;
+        buffer[index++] = (highBits >> 16) & 0xff;
+        buffer[index++] = (highBits >> 24) & 0xff;
+        return index;
+      } else if(value instanceof Double || value['_bsontype'] == 'Double') {
+        // Encode as double
+        buffer[index++] = BSON.BSON_DATA_NUMBER;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Write float
+        writeIEEE754(buffer, value, index, 'little', 52, 8);
+        // Ajust index
+        index = index + 8;
+        return index;
+      } else if(value instanceof Code || value['_bsontype'] == 'Code') {
+        if(value.scope != null && Object.keys(value.scope).length > 0) {
+          // Write the type
+          buffer[index++] = BSON.BSON_DATA_CODE_W_SCOPE;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Calculate the scope size
+          var scopeSize = BSON.calculateObjectSize(value.scope, serializeFunctions);
+          // Function string
+          var functionString = value.code.toString();
+          // Function Size
+          var codeSize = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
+
+          // Calculate full size of the object
+          var totalSize = 4 + codeSize + scopeSize + 4;
+
+          // Write the total size of the object
+          buffer[index++] = totalSize & 0xff;
+          buffer[index++] = (totalSize >> 8) & 0xff;
+          buffer[index++] = (totalSize >> 16) & 0xff;
+          buffer[index++] = (totalSize >> 24) & 0xff;
+
+          // Write the size of the string to buffer
+          buffer[index++] = codeSize & 0xff;
+          buffer[index++] = (codeSize >> 8) & 0xff;
+          buffer[index++] = (codeSize >> 16) & 0xff;
+          buffer[index++] = (codeSize >> 24) & 0xff;
+
+          // Write the string
+          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
+          // Update index
+          index = index + codeSize - 1;
+          // Write zero
+          buffer[index++] = 0;
+          // Serialize the scope object
+          var scopeObjectBuffer = supportsBuffer ? new Buffer(scopeSize) : new Uint8Array(new ArrayBuffer(scopeSize));
+          // Execute the serialization into a seperate buffer
+          serializeObject(value.scope, checkKeys, scopeObjectBuffer, 0, serializeFunctions);
+
+          // Adjusted scope Size (removing the header)
+          var scopeDocSize = scopeSize;
+          // Write scope object size
+          buffer[index++] = scopeDocSize & 0xff;
+          buffer[index++] = (scopeDocSize >> 8) & 0xff;
+          buffer[index++] = (scopeDocSize >> 16) & 0xff;
+          buffer[index++] = (scopeDocSize >> 24) & 0xff;
+
+          // Write the scopeObject into the buffer
+          supportsBuffer ? scopeObjectBuffer.copy(buffer, index, 0, scopeSize) : buffer.set(scopeObjectBuffer, index);
+          // Adjust index, removing the empty size of the doc (5 bytes 0000000005)
+          index = index + scopeDocSize - 5;
+          // Write trailing zero
+          buffer[index++] = 0;
+          return index
+        } else {
+          buffer[index++] = BSON.BSON_DATA_CODE;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Function string
+          var functionString = value.code.toString();
+          // Function Size
+          var size = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
+          // Write the size of the string to buffer
+          buffer[index++] = size & 0xff;
+          buffer[index++] = (size >> 8) & 0xff;
+          buffer[index++] = (size >> 16) & 0xff;
+          buffer[index++] = (size >> 24) & 0xff;
+          // Write the string
+          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
+          // Update index
+          index = index + size - 1;
+          // Write zero
+          buffer[index++] = 0;
+          return index;
+        }
+      } else if(value instanceof Binary || value['_bsontype'] == 'Binary') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_BINARY;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Extract the buffer
+        var data = value.value(true);
+        // Calculate size
+        var size = value.position;
+        // Write the size of the string to buffer
+        buffer[index++] = size & 0xff;
+        buffer[index++] = (size >> 8) & 0xff;
+        buffer[index++] = (size >> 16) & 0xff;
+        buffer[index++] = (size >> 24) & 0xff;
+        // Write the subtype to the buffer
+        buffer[index++] = value.sub_type;
+
+        // If we have binary type 2 the 4 first bytes are the size
+        if(value.sub_type == Binary.SUBTYPE_BYTE_ARRAY) {
+          buffer[index++] = size & 0xff;
+          buffer[index++] = (size >> 8) & 0xff;
+          buffer[index++] = (size >> 16) & 0xff;
+          buffer[index++] = (size >> 24) & 0xff;
+        }
+
+        // Write the data to the object
+        supportsBuffer ? data.copy(buffer, index, 0, value.position) : buffer.set(data, index);
+        // Ajust index
+        index = index + value.position;
+        return index;
+      } else if(value instanceof Symbol || value['_bsontype'] == 'Symbol') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_SYMBOL;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Calculate size
+        var size = supportsBuffer ? Buffer.byteLength(value.value) + 1 : numberOfBytes(value.value) + 1;
+        // Write the size of the string to buffer
+        buffer[index++] = size & 0xff;
+        buffer[index++] = (size >> 8) & 0xff;
+        buffer[index++] = (size >> 16) & 0xff;
+        buffer[index++] = (size >> 24) & 0xff;
+        // Write the string
+        buffer.write(value.value, index, 'utf8');
+        // Update index
+        index = index + size - 1;
+        // Write zero
+        buffer[index++] = 0x00;
+        return index;
+      } else if(value instanceof DBRef || value['_bsontype'] == 'DBRef') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_OBJECT;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Set up correct object for serialization
+        var ordered_values = {
+            '$ref': value.namespace
+          , '$id' : value.oid
+        };
+
+        // Add db reference if it exists
+        if(null != value.db) {
+          ordered_values['$db'] = value.db;
+        }
+
+        // Message size
+        var size = BSON.calculateObjectSize(ordered_values, serializeFunctions);
+        // Serialize the object
+        var endIndex = BSON.serializeWithBufferAndIndex(ordered_values, checkKeys, buffer, index, serializeFunctions);
+        // Write the size of the string to buffer
+        buffer[index++] = size & 0xff;
+        buffer[index++] = (size >> 8) & 0xff;
+        buffer[index++] = (size >> 16) & 0xff;
+        buffer[index++] = (size >> 24) & 0xff;
+        // Write zero for object
+        buffer[endIndex++] = 0x00;
+        // Return the end index
+        return endIndex;
+      } else if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_REGEXP;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+
+        // Write the regular expression string
+        supportsBuffer ? buffer.write(value.source, index, 'utf8') : writeToTypedArray(buffer, value.source, index);
+        // Adjust the index
+        index = index + (supportsBuffer ? Buffer.byteLength(value.source) : numberOfBytes(value.source));
+        // Write zero
+        buffer[index++] = 0x00;
+        // Write the parameters
+        if(value.global) buffer[index++] = 0x73; // s
+        if(value.ignoreCase) buffer[index++] = 0x69; // i
+        if(value.multiline) buffer[index++] = 0x6d; // m
+        // Add ending zero
+        buffer[index++] = 0x00;
+        return index;
+      } else {
+        // Write the type
+        buffer[index++] = Array.isArray(value) ? BSON.BSON_DATA_ARRAY : BSON.BSON_DATA_OBJECT;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Adjust the index
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+	      var endIndex = serializeObject(value, checkKeys, buffer, index + 4, serializeFunctions);
+        // Write size
+        var size = endIndex - index;
+        // Write the size of the string to buffer
+        buffer[index++] = size & 0xff;
+        buffer[index++] = (size >> 8) & 0xff;
+        buffer[index++] = (size >> 16) & 0xff;
+        buffer[index++] = (size >> 24) & 0xff;
+        return endIndex;
+      }
+    case 'function':
+      // WTF for 0.4.X where typeof /someregexp/ === 'function'
+      if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]' || String.call(value) == '[object RegExp]') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_REGEXP;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+
+        // Write the regular expression string
+        buffer.write(value.source, index, 'utf8');
+        // Adjust the index
+        index = index + (supportsBuffer ? Buffer.byteLength(value.source) : numberOfBytes(value.source));
+        // Write zero
+        buffer[index++] = 0x00;
+        // Write the parameters
+        if(value.global) buffer[index++] = 0x73; // s
+        if(value.ignoreCase) buffer[index++] = 0x69; // i
+        if(value.multiline) buffer[index++] = 0x6d; // m
+        // Add ending zero
+        buffer[index++] = 0x00;
+        return index;
+      } else {
+        if(serializeFunctions && value.scope != null && Object.keys(value.scope).length > 0) {
+          // Write the type
+          buffer[index++] = BSON.BSON_DATA_CODE_W_SCOPE;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Calculate the scope size
+          var scopeSize = BSON.calculateObjectSize(value.scope, serializeFunctions);
+          // Function string
+          var functionString = value.toString();
+          // Function Size
+          var codeSize = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
+
+          // Calculate full size of the object
+          var totalSize = 4 + codeSize + scopeSize;
+
+          // Write the total size of the object
+          buffer[index++] = totalSize & 0xff;
+          buffer[index++] = (totalSize >> 8) & 0xff;
+          buffer[index++] = (totalSize >> 16) & 0xff;
+          buffer[index++] = (totalSize >> 24) & 0xff;
+
+          // Write the size of the string to buffer
+          buffer[index++] = codeSize & 0xff;
+          buffer[index++] = (codeSize >> 8) & 0xff;
+          buffer[index++] = (codeSize >> 16) & 0xff;
+          buffer[index++] = (codeSize >> 24) & 0xff;
+
+          // Write the string
+          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
+          // Update index
+          index = index + codeSize - 1;
+          // Write zero
+          buffer[index++] = 0;
+          // Serialize the scope object
+          var scopeObjectBuffer = new Buffer(scopeSize);
+          // Execute the serialization into a seperate buffer
+          serializeObject(value.scope, checkKeys, scopeObjectBuffer, 0, serializeFunctions);
+
+          // Adjusted scope Size (removing the header)
+          var scopeDocSize = scopeSize - 4;
+          // Write scope object size
+          buffer[index++] = scopeDocSize & 0xff;
+          buffer[index++] = (scopeDocSize >> 8) & 0xff;
+          buffer[index++] = (scopeDocSize >> 16) & 0xff;
+          buffer[index++] = (scopeDocSize >> 24) & 0xff;
+
+          // Write the scopeObject into the buffer
+          scopeObjectBuffer.copy(buffer, index, 0, scopeSize);
+
+          // Adjust index, removing the empty size of the doc (5 bytes 0000000005)
+          index = index + scopeDocSize - 5;
+          // Write trailing zero
+          buffer[index++] = 0;
+          return index
+        } else if(serializeFunctions) {
+          buffer[index++] = BSON.BSON_DATA_CODE;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Function string
+          var functionString = value.toString();
+          // Function Size
+          var size = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
+          // Write the size of the string to buffer
+          buffer[index++] = size & 0xff;
+          buffer[index++] = (size >> 8) & 0xff;
+          buffer[index++] = (size >> 16) & 0xff;
+          buffer[index++] = (size >> 24) & 0xff;
+          // Write the string
+          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
+          // Update index
+          index = index + size - 1;
+          // Write zero
+          buffer[index++] = 0;
+          return index;
+        }
+      }
+  }
+
+  // If no value to serialize
+  return index;
+}
+
+/**
+ * Serialize a Javascript object.
+ *
+ * @param {Object} object the Javascript object to serialize.
+ * @param {Boolean} checkKeys the serializer will check if keys are valid.
+ * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.
+ * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
+ * @return {Buffer} returns the Buffer object containing the serialized object.
+ * @api public
+ */
+BSON.serialize = function(object, checkKeys, asBuffer, serializeFunctions) {
+  var buffer = null;
+  // Calculate the size of the object
+  var size = BSON.calculateObjectSize(object, serializeFunctions);
+  // Fetch the best available type for storing the binary data
+  if(buffer = typeof Buffer != 'undefined') {
+    buffer = new Buffer(size);
+    asBuffer = true;
+  } else if(typeof Uint8Array != 'undefined') {
+    buffer = new Uint8Array(new ArrayBuffer(size));
+  } else {
+    buffer = new Array(size);
+  }
+
+  // If asBuffer is false use typed arrays
+  BSON.serializeWithBufferAndIndex(object, checkKeys, buffer, 0, serializeFunctions);
+  return buffer;
+}
+
+/**
+ * Contains the function cache if we have that enable to allow for avoiding the eval step on each deserialization, comparison is by md5
+ *
+ * @ignore
+ * @api private
+ */
+var functionCache = BSON.functionCache = {};
+
+/**
+ * Crc state variables shared by function
+ *
+ * @ignore
+ * @api private
+ */
+var table = [0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D];
+
+/**
+ * CRC32 hash method, Fast and enough versitility for our usage
+ *
+ * @ignore
+ * @api private
+ */
+var crc32 =  function(string, start, end) {
+  var crc = 0
+  var x = 0;
+  var y = 0;
+  crc = crc ^ (-1);
+
+  for(var i = start, iTop = end; i < iTop;i++) {
+  	y = (crc ^ string[i]) & 0xFF;
+    x = table[y];
+  	crc = (crc >>> 8) ^ x;
+  }
+
+  return crc ^ (-1);
+}
+
+/**
+ * Deserialize stream data as BSON documents.
+ *
+ * Options
+ *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
+ *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
+ *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
+ *
+ * @param {Buffer} data the buffer containing the serialized set of BSON documents.
+ * @param {Number} startIndex the start index in the data Buffer where the deserialization is to start.
+ * @param {Number} numberOfDocuments number of documents to deserialize.
+ * @param {Array} documents an array where to store the deserialized documents.
+ * @param {Number} docStartIndex the index in the documents array from where to start inserting documents.
+ * @param {Object} [options] additional options used for the deserialization.
+ * @return {Number} returns the next index in the buffer after deserialization **x** numbers of documents.
+ * @api public
+ */
+BSON.deserializeStream = function(data, startIndex, numberOfDocuments, documents, docStartIndex, options) {
+  // if(numberOfDocuments !== documents.length) throw new Error("Number of expected results back is less than the number of documents");
+  options = options != null ? options : {};
+  var index = startIndex;
+  // Loop over all documents
+  for(var i = 0; i < numberOfDocuments; i++) {
+    // Find size of the document
+    var size = data[index] | data[index + 1] << 8 | data[index + 2] << 16 | data[index + 3] << 24;
+    // Update options with index
+    options['index'] = index;
+    // Parse the document at this point
+    documents[docStartIndex + i] = BSON.deserialize(data, options);
+    // Adjust index by the document size
+    index = index + size;
+  }
+
+  // Return object containing end index of parsing and list of documents
+  return index;
+}
+
+/**
+ * Ensure eval is isolated.
+ *
+ * @ignore
+ * @api private
+ */
+var isolateEvalWithHash = function(functionCache, hash, functionString, object) {
+  // Contains the value we are going to set
+  var value = null;
+
+  // Check for cache hit, eval if missing and return cached function
+  if(functionCache[hash] == null) {
+    eval("value = " + functionString);
+    functionCache[hash] = value;
+  }
+  // Set the object
+  return functionCache[hash].bind(object);
+}
+
+/**
+ * Ensure eval is isolated.
+ *
+ * @ignore
+ * @api private
+ */
+var isolateEval = function(functionString) {
+  // Contains the value we are going to set
+  var value = null;
+  // Eval the function
+  eval("value = " + functionString);
+  return value;
+}
+
+/**
+ * Convert Uint8Array to String
+ *
+ * @ignore
+ * @api private
+ */
+var convertUint8ArrayToUtf8String = function(byteArray, startIndex, endIndex) {
+  return BinaryParser.decode_utf8(convertArraytoUtf8BinaryString(byteArray, startIndex, endIndex));
+}
+
+var convertArraytoUtf8BinaryString = function(byteArray, startIndex, endIndex) {
+  var result = "";
+  for(var i = startIndex; i < endIndex; i++) {
+    result = result + String.fromCharCode(byteArray[i]);
+  }
+
+  return result;
+};
+
+/**
+ * Deserialize data as BSON.
+ *
+ * Options
+ *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
+ *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
+ *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
+ *
+ * @param {Buffer} buffer the buffer containing the serialized set of BSON documents.
+ * @param {Object} [options] additional options used for the deserialization.
+ * @param {Boolean} [isArray] ignore used for recursive parsing.
+ * @return {Object} returns the deserialized Javascript Object.
+ * @api public
+ */
+BSON.deserialize = function(buffer, options, isArray) {
+  // Options
+  options = options == null ? {} : options;
+  var evalFunctions = options['evalFunctions'] == null ? false : options['evalFunctions'];
+  var cacheFunctions = options['cacheFunctions'] == null ? false : options['cacheFunctions'];
+  var cacheFunctionsCrc32 = options['cacheFunctionsCrc32'] == null ? false : options['cacheFunctionsCrc32'];
+
+  // Validate that we have at least 4 bytes of buffer
+  if(buffer.length < 5) throw new Error("corrupt bson message < 5 bytes long");
+
+  // Set up index
+  var index = typeof options['index'] == 'number' ? options['index'] : 0;
+  // Reads in a C style string
+  var readCStyleString = function() {
+    // Get the start search index
+    var i = index;
+    // Locate the end of the c string
+    while(buffer[i] !== 0x00) { i++ }
+    // Grab utf8 encoded string
+    var string = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, i) : convertUint8ArrayToUtf8String(buffer, index, i);
+    // Update index position
+    index = i + 1;
+    // Return string
+    return string;
+  }
+
+  // Create holding object
+  var object = isArray ? [] : {};
+
+  // Read the document size
+  var size = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+
+  // Ensure buffer is valid size
+  if(size < 5 || size > buffer.length) throw new Error("corrupt bson message");
+
+  // While we have more left data left keep parsing
+  while(true) {
+    // Read the type
+    var elementType = buffer[index++];
+    // If we get a zero it's the last byte, exit
+    if(elementType == 0) break;
+    // Read the name of the field
+    var name = readCStyleString();
+    // Switch on the type
+    switch(elementType) {
+      case BSON.BSON_DATA_OID:
+        var string = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('binary', index, index + 12) : convertArraytoUtf8BinaryString(buffer, index, index + 12);
+        // Decode the oid
+        object[name] = new ObjectID(string);
+        // Update index
+        index = index + 12;
+        break;
+      case BSON.BSON_DATA_STRING:
+        // Read the content of the field
+        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Add string to object
+        object[name] = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
+        // Update parse index position
+        index = index + stringSize;
+        break;
+      case BSON.BSON_DATA_INT:
+        // Decode the 32bit value
+        object[name] = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        break;
+      case BSON.BSON_DATA_NUMBER:
+        // Decode the double value
+        object[name] = readIEEE754(buffer, index, 'little', 52, 8);
+        // Update the index
+        index = index + 8;
+        break;
+      case BSON.BSON_DATA_DATE:
+        // Unpack the low and high bits
+        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Set date object
+        object[name] = new Date(new Long(lowBits, highBits).toNumber());
+        break;
+      case BSON.BSON_DATA_BOOLEAN:
+        // Parse the boolean value
+        object[name] = buffer[index++] == 1;
+        break;
+      case BSON.BSON_DATA_NULL:
+        // Parse the boolean value
+        object[name] = null;
+        break;
+      case BSON.BSON_DATA_BINARY:
+        // Decode the size of the binary blob
+        var binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Decode the subtype
+        var subType = buffer[index++];
+        // Decode as raw Buffer object if options specifies it
+        if(buffer['slice'] != null) {
+          // If we have subtype 2 skip the 4 bytes for the size
+          if(subType == Binary.SUBTYPE_BYTE_ARRAY) {
+            binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+          }
+          // Slice the data
+          object[name] = new Binary(buffer.slice(index, index + binarySize), subType);
+        } else {
+          var _buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(binarySize)) : new Array(binarySize);
+          // If we have subtype 2 skip the 4 bytes for the size
+          if(subType == Binary.SUBTYPE_BYTE_ARRAY) {
+            binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+          }
+          // Copy the data
+          for(var i = 0; i < binarySize; i++) {
+            _buffer[i] = buffer[index + i];
+          }
+          // Create the binary object
+          object[name] = new Binary(_buffer, subType);
+        }
+        // Update the index
+        index = index + binarySize;
+        break;
+      case BSON.BSON_DATA_ARRAY:
+        options['index'] = index;
+        // Decode the size of the array document
+        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
+        // Set the array to the object
+        object[name] = BSON.deserialize(buffer, options, true);
+        // Adjust the index
+        index = index + objectSize;
+        break;
+      case BSON.BSON_DATA_OBJECT:
+        options['index'] = index;
+        // Decode the size of the object document
+        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
+        // Set the array to the object
+        object[name] = BSON.deserialize(buffer, options, false);
+        // Adjust the index
+        index = index + objectSize;
+        break;
+      case BSON.BSON_DATA_REGEXP:
+        // Create the regexp
+        var source = readCStyleString();
+        var regExpOptions = readCStyleString();
+        // For each option add the corresponding one for javascript
+        var optionsArray = new Array(regExpOptions.length);
+
+        // Parse options
+        for(var i = 0; i < regExpOptions.length; i++) {
+          switch(regExpOptions[i]) {
+            case 'm':
+              optionsArray[i] = 'm';
+              break;
+            case 's':
+              optionsArray[i] = 'g';
+              break;
+            case 'i':
+              optionsArray[i] = 'i';
+              break;
+          }
+        }
+
+        object[name] = new RegExp(source, optionsArray.join(''));
+        break;
+      case BSON.BSON_DATA_LONG:
+        // Unpack the low and high bits
+        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Create long object
+        var long = new Long(lowBits, highBits);
+        // Set the object
+        object[name] = long.lessThanOrEqual(JS_INT_MAX_LONG) && long.greaterThanOrEqual(JS_INT_MIN_LONG) ? long.toNumber() : long;
+        break;
+      case BSON.BSON_DATA_SYMBOL:
+        // Read the content of the field
+        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Add string to object
+        object[name] = new Symbol(buffer.toString('utf8', index, index + stringSize - 1));
+        // Update parse index position
+        index = index + stringSize;
+        break;
+      case BSON.BSON_DATA_TIMESTAMP:
+        // Unpack the low and high bits
+        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Set the object
+        object[name] = new Timestamp(lowBits, highBits);
+        break;
+      case BSON.BSON_DATA_MIN_KEY:
+        // Parse the object
+        object[name] = new MinKey();
+        break;
+      case BSON.BSON_DATA_MAX_KEY:
+        // Parse the object
+        object[name] = new MaxKey();
+        break;
+      case BSON.BSON_DATA_CODE:
+        // Read the content of the field
+        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Function string
+        var functionString = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
+
+        // If we are evaluating the functions
+        if(evalFunctions) {
+          // Contains the value we are going to set
+          var value = null;
+          // If we have cache enabled let's look for the md5 of the function in the cache
+          if(cacheFunctions) {
+            var hash = cacheFunctionsCrc32 ? crc32(functionString) : functionString;
+            // Got to do this to avoid V8 deoptimizing the call due to finding eval
+            object[name] = isolateEvalWithHash(functionCache, hash, functionString, object);
+          } else {
+            // Set directly
+            object[name] = isolateEval(functionString);
+          }
+        } else {
+          object[name]  = new Code(functionString, {});
+        }
+
+        // Update parse index position
+        index = index + stringSize;
+        break;
+      case BSON.BSON_DATA_CODE_W_SCOPE:
+        // Read the content of the field
+        var totalSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Javascript function
+        var functionString = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
+        // Update parse index position
+        index = index + stringSize;
+        // Parse the element
+        options['index'] = index;
+        // Decode the size of the object document
+        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
+        // Decode the scope object
+        var scopeObject = BSON.deserialize(buffer, options, false);
+        // Adjust the index
+        index = index + objectSize;
+
+        // If we are evaluating the functions
+        if(evalFunctions) {
+          // Contains the value we are going to set
+          var value = null;
+          // If we have cache enabled let's look for the md5 of the function in the cache
+          if(cacheFunctions) {
+            var hash = cacheFunctionsCrc32 ? crc32(functionString) : functionString;
+            // Got to do this to avoid V8 deoptimizing the call due to finding eval
+            object[name] = isolateEvalWithHash(functionCache, hash, functionString, object);
+          } else {
+            // Set directly
+            object[name] = isolateEval(functionString);
+          }
+
+          // Set the scope on the object
+          object[name].scope = scopeObject;
+        } else {
+          object[name]  = new Code(functionString, scopeObject);
+        }
+
+        // Add string to object
+        break;
+    }
+  }
+
+  // Check if we have a db ref object
+  if(object['$id'] != null) object = new DBRef(object['$ref'], object['$id'], object['$db']);
+
+  // Return the final objects
+  return object;
+}
+
+/**
+ * Check if key name is valid.
+ *
+ * @ignore
+ * @api private
+ */
+BSON.checkKey = function checkKey (key) {
+  if (!key.length) return;
+  // Check if we have a legal key for the object
+  if('$' == key[0]) {
+    throw Error("key " + key + " must not start with '$'");
+  } else if (!!~key.indexOf('.')) {
+    throw Error("key " + key + " must not contain '.'");
+  }
+};
+
+/**
+ * Deserialize data as BSON.
+ *
+ * Options
+ *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
+ *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
+ *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
+ *
+ * @param {Buffer} buffer the buffer containing the serialized set of BSON documents.
+ * @param {Object} [options] additional options used for the deserialization.
+ * @param {Boolean} [isArray] ignore used for recursive parsing.
+ * @return {Object} returns the deserialized Javascript Object.
+ * @api public
+ */
+BSON.prototype.deserialize = function(data, options) {
+  return BSON.deserialize(data, options);
+}
+
+/**
+ * Deserialize stream data as BSON documents.
+ *
+ * Options
+ *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
+ *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
+ *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
+ *
+ * @param {Buffer} data the buffer containing the serialized set of BSON documents.
+ * @param {Number} startIndex the start index in the data Buffer where the deserialization is to start.
+ * @param {Number} numberOfDocuments number of documents to deserialize.
+ * @param {Array} documents an array where to store the deserialized documents.
+ * @param {Number} docStartIndex the index in the documents array from where to start inserting documents.
+ * @param {Object} [options] additional options used for the deserialization.
+ * @return {Number} returns the next index in the buffer after deserialization **x** numbers of documents.
+ * @api public
+ */
+BSON.prototype.deserializeStream = function(data, startIndex, numberOfDocuments, documents, docStartIndex, options) {
+  return BSON.deserializeStream(data, startIndex, numberOfDocuments, documents, docStartIndex, options);
+}
+
+/**
+ * Serialize a Javascript object.
+ *
+ * @param {Object} object the Javascript object to serialize.
+ * @param {Boolean} checkKeys the serializer will check if keys are valid.
+ * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.
+ * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
+ * @return {Buffer} returns the Buffer object containing the serialized object.
+ * @api public
+ */
+BSON.prototype.serialize = function(object, checkKeys, asBuffer, serializeFunctions) {
+  return BSON.serialize(object, checkKeys, asBuffer, serializeFunctions);
+}
+
+/**
+ * Calculate the bson size for a passed in Javascript object.
+ *
+ * @param {Object} object the Javascript object to calculate the BSON byte size for.
+ * @param {Boolean} [serializeFunctions] serialize all functions in the object **(default:false)**.
+ * @return {Number} returns the number of bytes the BSON object will take up.
+ * @api public
+ */
+BSON.prototype.calculateObjectSize = function(object, serializeFunctions) {
+  return BSON.calculateObjectSize(object, serializeFunctions);
+}
+
+/**
+ * Serialize a Javascript object using a predefined Buffer and index into the buffer, useful when pre-allocating the space for serialization.
+ *
+ * @param {Object} object the Javascript object to serialize.
+ * @param {Boolean} checkKeys the serializer will check if keys are valid.
+ * @param {Buffer} buffer the Buffer you pre-allocated to store the serialized BSON object.
+ * @param {Number} index the index in the buffer where we wish to start serializing into.
+ * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
+ * @return {Number} returns the new write index in the Buffer.
+ * @api public
+ */
+BSON.prototype.serializeWithBufferAndIndex = function(object, checkKeys, buffer, startIndex, serializeFunctions) {
+  return BSON.serializeWithBufferAndIndex(object, checkKeys, buffer, startIndex, serializeFunctions);
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+exports.Code = Code;
+exports.Symbol = Symbol;
+exports.BSON = BSON;
+exports.DBRef = DBRef;
+exports.Binary = Binary;
+exports.ObjectID = ObjectID;
+exports.Long = Long;
+exports.Timestamp = Timestamp;
+exports.Double = Double;
+exports.MinKey = MinKey;
+exports.MaxKey = MaxKey;
+
+}, 
+
+
+
+'code': function(module, exports, global, require, undefined){
+  /**
+ * A class representation of the BSON Code type.
+ *
+ * @class Represents the BSON Code type.
+ * @param {String|Function} code a string or function.
+ * @param {Object} [scope] an optional scope for the function.
+ * @return {Code}
+ */
+function Code(code, scope) {
+  if(!(this instanceof Code)) return new Code(code, scope);
+  
+  this._bsontype = 'Code';
+  this.code = code;
+  this.scope = scope == null ? {} : scope;
+};
+
+/**
+ * @ignore
+ * @api private
+ */
+Code.prototype.toJSON = function() {
+  return {scope:this.scope, code:this.code};
+}
+
+exports.Code = Code;
+}, 
+
+
+
+'db_ref': function(module, exports, global, require, undefined){
+  /**
+ * A class representation of the BSON DBRef type.
+ *
+ * @class Represents the BSON DBRef type.
+ * @param {String} namespace the collection name.
+ * @param {ObjectID} oid the reference ObjectID.
+ * @param {String} [db] optional db name, if omitted the reference is local to the current db.
+ * @return {DBRef}
+ */
+function DBRef(namespace, oid, db) {
+  if(!(this instanceof DBRef)) return new DBRef(namespace, oid, db);
+  
+  this._bsontype = 'DBRef';
+  this.namespace = namespace;
+  this.oid = oid;
+  this.db = db;
+};
+
+/**
+ * @ignore
+ * @api private
+ */
+DBRef.prototype.toJSON = function() {
+  return {
+    '$ref':this.namespace,
+    '$id':this.oid,
+    '$db':this.db == null ? '' : this.db
+  };
+}
+
+exports.DBRef = DBRef;
+}, 
+
+
+
+'double': function(module, exports, global, require, undefined){
+  /**
+ * A class representation of the BSON Double type.
+ *
+ * @class Represents the BSON Double type.
+ * @param {Number} value the number we want to represent as a double.
+ * @return {Double}
+ */
+function Double(value) {
+  if(!(this instanceof Double)) return new Double(value);
+  
+  this._bsontype = 'Double';
+  this.value = value;
+}
+
+/**
+ * Access the number value.
+ *
+ * @return {Number} returns the wrapped double number.
+ * @api public
+ */
+Double.prototype.valueOf = function() {
+  return this.value;
+};
+
+/**
+ * @ignore
+ * @api private
+ */
+Double.prototype.toJSON = function() {
+  return this.value;
+}
+
+exports.Double = Double;
+}, 
+
+
+
+'float_parser': function(module, exports, global, require, undefined){
+  // Copyright (c) 2008, Fair Oaks Labs, Inc.
+// All rights reserved.
+// 
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are met:
+// 
+//  * Redistributions of source code must retain the above copyright notice,
+//    this list of conditions and the following disclaimer.
+// 
+//  * Redistributions in binary form must reproduce the above copyright notice,
+//    this list of conditions and the following disclaimer in the documentation
+//    and/or other materials provided with the distribution.
+// 
+//  * Neither the name of Fair Oaks Labs, Inc. nor the names of its contributors
+//    may be used to endorse or promote products derived from this software
+//    without specific prior written permission.
+// 
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+// ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+// POSSIBILITY OF SUCH DAMAGE.
+//
+//
+// Modifications to writeIEEE754 to support negative zeroes made by Brian White
+
+var readIEEE754 = function(buffer, offset, endian, mLen, nBytes) {
+  var e, m,
+      bBE = (endian === 'big'),
+      eLen = nBytes * 8 - mLen - 1,
+      eMax = (1 << eLen) - 1,
+      eBias = eMax >> 1,
+      nBits = -7,
+      i = bBE ? 0 : (nBytes - 1),
+      d = bBE ? 1 : -1,
+      s = buffer[offset + i];
+
+  i += d;
+
+  e = s & ((1 << (-nBits)) - 1);
+  s >>= (-nBits);
+  nBits += eLen;
+  for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8);
+
+  m = e & ((1 << (-nBits)) - 1);
+  e >>= (-nBits);
+  nBits += mLen;
+  for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8);
+
+  if (e === 0) {
+    e = 1 - eBias;
+  } else if (e === eMax) {
+    return m ? NaN : ((s ? -1 : 1) * Infinity);
+  } else {
+    m = m + Math.pow(2, mLen);
+    e = e - eBias;
+  }
+  return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
+};
+
+var writeIEEE754 = function(buffer, value, offset, endian, mLen, nBytes) {
+  var e, m, c,
+      bBE = (endian === 'big'),
+      eLen = nBytes * 8 - mLen - 1,
+      eMax = (1 << eLen) - 1,
+      eBias = eMax >> 1,
+      rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0),
+      i = bBE ? (nBytes-1) : 0,
+      d = bBE ? -1 : 1,
+      s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;
+
+  value = Math.abs(value);
+
+  if (isNaN(value) || value === Infinity) {
+    m = isNaN(value) ? 1 : 0;
+    e = eMax;
+  } else {
+    e = Math.floor(Math.log(value) / Math.LN2);
+    if (value * (c = Math.pow(2, -e)) < 1) {
+      e--;
+      c *= 2;
+    }
+    if (e+eBias >= 1) {
+      value += rt / c;
+    } else {
+      value += rt * Math.pow(2, 1 - eBias);
+    }
+    if (value * c >= 2) {
+      e++;
+      c /= 2;
+    }
+
+    if (e + eBias >= eMax) {
+      m = 0;
+      e = eMax;
+    } else if (e + eBias >= 1) {
+      m = (value * c - 1) * Math.pow(2, mLen);
+      e = e + eBias;
+    } else {
+      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
+      e = 0;
+    }
+  }
+
+  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8);
+
+  e = (e << mLen) | m;
+  eLen += mLen;
+  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8);
+
+  buffer[offset + i - d] |= s * 128;
+};
+
+exports.readIEEE754 = readIEEE754;
+exports.writeIEEE754 = writeIEEE754;
+}, 
+
+
+
+'index': function(module, exports, global, require, undefined){
+  try {
+  exports.BSONPure = require('./bson');
+  exports.BSONNative = require('../../ext');
+} catch(err) {
+  // do nothing
+}
+
+[ './binary_parser'
+  , './binary'
+  , './code'
+  , './db_ref'
+  , './double'
+  , './max_key'
+  , './min_key'
+  , './objectid'
+  , './symbol'
+  , './timestamp'
+  , './long'].forEach(function (path) {
+  	var module = require('./' + path);
+  	for (var i in module) {
+  		exports[i] = module[i];
+    }
+});
+
+// Exports all the classes for the NATIVE JS BSON Parser
+exports.native = function() {
+  var classes = {};
+  // Map all the classes
+  [ './binary_parser'
+    , './binary'
+    , './code'
+    , './db_ref'
+    , './double'
+    , './max_key'
+    , './min_key'
+    , './objectid'
+    , './symbol'
+    , './timestamp'
+    , './long'
+    , '../../ext'
+].forEach(function (path) {
+    	var module = require('./' + path);
+    	for (var i in module) {
+    		classes[i] = module[i];
+      }
+  });
+  // Return classes list
+  return classes;
+}
+
+// Exports all the classes for the PURE JS BSON Parser
+exports.pure = function() {
+  var classes = {};
+  // Map all the classes
+  [ './binary_parser'
+    , './binary'
+    , './code'
+    , './db_ref'
+    , './double'
+    , './max_key'
+    , './min_key'
+    , './objectid'
+    , './symbol'
+    , './timestamp'
+    , './long'
+    , '././bson'].forEach(function (path) {
+    	var module = require('./' + path);
+    	for (var i in module) {
+    		classes[i] = module[i];
+      }
+  });
+  // Return classes list
+  return classes;
+}
+
+}, 
+
+
+
+'long': function(module, exports, global, require, undefined){
+  // Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//
+// Copyright 2009 Google Inc. All Rights Reserved
+
+/**
+ * Defines a Long class for representing a 64-bit two's-complement
+ * integer value, which faithfully simulates the behavior of a Java "Long". This
+ * implementation is derived from LongLib in GWT.
+ *
+ * Constructs a 64-bit two's-complement integer, given its low and high 32-bit
+ * values as *signed* integers.  See the from* functions below for more
+ * convenient ways of constructing Longs.
+ *
+ * The internal representation of a Long is the two given signed, 32-bit values.
+ * We use 32-bit pieces because these are the size of integers on which
+ * Javascript performs bit-operations.  For operations like addition and
+ * multiplication, we split each number into 16-bit pieces, which can easily be
+ * multiplied within Javascript's floating-point representation without overflow
+ * or change in sign.
+ *
+ * In the algorithms below, we frequently reduce the negative case to the
+ * positive case by negating the input(s) and then post-processing the result.
+ * Note that we must ALWAYS check specially whether those values are MIN_VALUE
+ * (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
+ * a positive number, it overflows back into a negative).  Not handling this
+ * case would often result in infinite recursion.
+ *
+ * @class Represents the BSON Long type.
+ * @param {Number} low  the low (signed) 32 bits of the Long.
+ * @param {Number} high the high (signed) 32 bits of the Long.
+ */
+function Long(low, high) {
+  if(!(this instanceof Long)) return new Long(low, high);
+  
+  this._bsontype = 'Long';
+  /**
+   * @type {number}
+   * @api private
+   */
+  this.low_ = low | 0;  // force into 32 signed bits.
+
+  /**
+   * @type {number}
+   * @api private
+   */
+  this.high_ = high | 0;  // force into 32 signed bits.
+};
+
+/**
+ * Return the int value.
+ *
+ * @return {Number} the value, assuming it is a 32-bit integer.
+ * @api public
+ */
+Long.prototype.toInt = function() {
+  return this.low_;
+};
+
+/**
+ * Return the Number value.
+ *
+ * @return {Number} the closest floating-point representation to this value.
+ * @api public
+ */
+Long.prototype.toNumber = function() {
+  return this.high_ * Long.TWO_PWR_32_DBL_ +
+         this.getLowBitsUnsigned();
+};
+
+/**
+ * Return the JSON value.
+ *
+ * @return {String} the JSON representation.
+ * @api public
+ */
+Long.prototype.toJSON = function() {
+  return this.toString();
+}
+
+/**
+ * Return the String value.
+ *
+ * @param {Number} [opt_radix] the radix in which the text should be written.
+ * @return {String} the textual representation of this value.
+ * @api public
+ */
+Long.prototype.toString = function(opt_radix) {
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (this.isZero()) {
+    return '0';
+  }
+
+  if (this.isNegative()) {
+    if (this.equals(Long.MIN_VALUE)) {
+      // We need to change the Long value before it can be negated, so we remove
+      // the bottom-most digit in this base and then recurse to do the rest.
+      var radixLong = Long.fromNumber(radix);
+      var div = this.div(radixLong);
+      var rem = div.multiply(radixLong).subtract(this);
+      return div.toString(radix) + rem.toInt().toString(radix);
+    } else {
+      return '-' + this.negate().toString(radix);
+    }
+  }
+
+  // Do several (6) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = Long.fromNumber(Math.pow(radix, 6));
+
+  var rem = this;
+  var result = '';
+  while (true) {
+    var remDiv = rem.div(radixToPower);
+    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt();
+    var digits = intval.toString(radix);
+
+    rem = remDiv;
+    if (rem.isZero()) {
+      return digits + result;
+    } else {
+      while (digits.length < 6) {
+        digits = '0' + digits;
+      }
+      result = '' + digits + result;
+    }
+  }
+};
+
+/**
+ * Return the high 32-bits value.
+ *
+ * @return {Number} the high 32-bits as a signed value.
+ * @api public
+ */
+Long.prototype.getHighBits = function() {
+  return this.high_;
+};
+
+/**
+ * Return the low 32-bits value.
+ *
+ * @return {Number} the low 32-bits as a signed value.
+ * @api public
+ */
+Long.prototype.getLowBits = function() {
+  return this.low_;
+};
+
+/**
+ * Return the low unsigned 32-bits value.
+ *
+ * @return {Number} the low 32-bits as an unsigned value.
+ * @api public
+ */
+Long.prototype.getLowBitsUnsigned = function() {
+  return (this.low_ >= 0) ?
+      this.low_ : Long.TWO_PWR_32_DBL_ + this.low_;
+};
+
+/**
+ * Returns the number of bits needed to represent the absolute value of this Long.
+ *
+ * @return {Number} Returns the number of bits needed to represent the absolute value of this Long.
+ * @api public
+ */
+Long.prototype.getNumBitsAbs = function() {
+  if (this.isNegative()) {
+    if (this.equals(Long.MIN_VALUE)) {
+      return 64;
+    } else {
+      return this.negate().getNumBitsAbs();
+    }
+  } else {
+    var val = this.high_ != 0 ? this.high_ : this.low_;
+    for (var bit = 31; bit > 0; bit--) {
+      if ((val & (1 << bit)) != 0) {
+        break;
+      }
+    }
+    return this.high_ != 0 ? bit + 33 : bit + 1;
+  }
+};
+
+/**
+ * Return whether this value is zero.
+ *
+ * @return {Boolean} whether this value is zero.
+ * @api public
+ */
+Long.prototype.isZero = function() {
+  return this.high_ == 0 && this.low_ == 0;
+};
+
+/**
+ * Return whether this value is negative.
+ *
+ * @return {Boolean} whether this value is negative.
+ * @api public
+ */
+Long.prototype.isNegative = function() {
+  return this.high_ < 0;
+};
+
+/**
+ * Return whether this value is odd.
+ *
+ * @return {Boolean} whether this value is odd.
+ * @api public
+ */
+Long.prototype.isOdd = function() {
+  return (this.low_ & 1) == 1;
+};
+
+/**
+ * Return whether this Long equals the other
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long equals the other
+ * @api public
+ */
+Long.prototype.equals = function(other) {
+  return (this.high_ == other.high_) && (this.low_ == other.low_);
+};
+
+/**
+ * Return whether this Long does not equal the other.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long does not equal the other.
+ * @api public
+ */
+Long.prototype.notEquals = function(other) {
+  return (this.high_ != other.high_) || (this.low_ != other.low_);
+};
+
+/**
+ * Return whether this Long is less than the other.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long is less than the other.
+ * @api public
+ */
+Long.prototype.lessThan = function(other) {
+  return this.compare(other) < 0;
+};
+
+/**
+ * Return whether this Long is less than or equal to the other.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long is less than or equal to the other.
+ * @api public
+ */
+Long.prototype.lessThanOrEqual = function(other) {
+  return this.compare(other) <= 0;
+};
+
+/**
+ * Return whether this Long is greater than the other.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long is greater than the other.
+ * @api public
+ */
+Long.prototype.greaterThan = function(other) {
+  return this.compare(other) > 0;
+};
+
+/**
+ * Return whether this Long is greater than or equal to the other.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long is greater than or equal to the other.
+ * @api public
+ */
+Long.prototype.greaterThanOrEqual = function(other) {
+  return this.compare(other) >= 0;
+};
+
+/**
+ * Compares this Long with the given one.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} 0 if they are the same, 1 if the this is greater, and -1 if the given one is greater.
+ * @api public
+ */
+Long.prototype.compare = function(other) {
+  if (this.equals(other)) {
+    return 0;
+  }
+
+  var thisNeg = this.isNegative();
+  var otherNeg = other.isNegative();
+  if (thisNeg && !otherNeg) {
+    return -1;
+  }
+  if (!thisNeg && otherNeg) {
+    return 1;
+  }
+
+  // at this point, the signs are the same, so subtraction will not overflow
+  if (this.subtract(other).isNegative()) {
+    return -1;
+  } else {
+    return 1;
+  }
+};
+
+/**
+ * The negation of this value.
+ *
+ * @return {Long} the negation of this value.
+ * @api public
+ */
+Long.prototype.negate = function() {
+  if (this.equals(Long.MIN_VALUE)) {
+    return Long.MIN_VALUE;
+  } else {
+    return this.not().add(Long.ONE);
+  }
+};
+
+/**
+ * Returns the sum of this and the given Long.
+ *
+ * @param {Long} other Long to add to this one.
+ * @return {Long} the sum of this and the given Long.
+ * @api public
+ */
+Long.prototype.add = function(other) {
+  // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
+
+  var a48 = this.high_ >>> 16;
+  var a32 = this.high_ & 0xFFFF;
+  var a16 = this.low_ >>> 16;
+  var a00 = this.low_ & 0xFFFF;
+
+  var b48 = other.high_ >>> 16;
+  var b32 = other.high_ & 0xFFFF;
+  var b16 = other.low_ >>> 16;
+  var b00 = other.low_ & 0xFFFF;
+
+  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+  c00 += a00 + b00;
+  c16 += c00 >>> 16;
+  c00 &= 0xFFFF;
+  c16 += a16 + b16;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c32 += a32 + b32;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c48 += a48 + b48;
+  c48 &= 0xFFFF;
+  return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+};
+
+/**
+ * Returns the difference of this and the given Long.
+ *
+ * @param {Long} other Long to subtract from this.
+ * @return {Long} the difference of this and the given Long.
+ * @api public
+ */
+Long.prototype.subtract = function(other) {
+  return this.add(other.negate());
+};
+
+/**
+ * Returns the product of this and the given Long.
+ *
+ * @param {Long} other Long to multiply with this.
+ * @return {Long} the product of this and the other.
+ * @api public
+ */
+Long.prototype.multiply = function(other) {
+  if (this.isZero()) {
+    return Long.ZERO;
+  } else if (other.isZero()) {
+    return Long.ZERO;
+  }
+
+  if (this.equals(Long.MIN_VALUE)) {
+    return other.isOdd() ? Long.MIN_VALUE : Long.ZERO;
+  } else if (other.equals(Long.MIN_VALUE)) {
+    return this.isOdd() ? Long.MIN_VALUE : Long.ZERO;
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().multiply(other.negate());
+    } else {
+      return this.negate().multiply(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.multiply(other.negate()).negate();
+  }
+
+  // If both Longs are small, use float multiplication
+  if (this.lessThan(Long.TWO_PWR_24_) &&
+      other.lessThan(Long.TWO_PWR_24_)) {
+    return Long.fromNumber(this.toNumber() * other.toNumber());
+  }
+
+  // Divide each Long into 4 chunks of 16 bits, and then add up 4x4 products.
+  // We can skip products that would overflow.
+
+  var a48 = this.high_ >>> 16;
+  var a32 = this.high_ & 0xFFFF;
+  var a16 = this.low_ >>> 16;
+  var a00 = this.low_ & 0xFFFF;
+
+  var b48 = other.high_ >>> 16;
+  var b32 = other.high_ & 0xFFFF;
+  var b16 = other.low_ >>> 16;
+  var b00 = other.low_ & 0xFFFF;
+
+  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+  c00 += a00 * b00;
+  c16 += c00 >>> 16;
+  c00 &= 0xFFFF;
+  c16 += a16 * b00;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c16 += a00 * b16;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c32 += a32 * b00;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c32 += a16 * b16;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c32 += a00 * b32;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
+  c48 &= 0xFFFF;
+  return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+};
+
+/**
+ * Returns this Long divided by the given one.
+ *
+ * @param {Long} other Long by which to divide.
+ * @return {Long} this Long divided by the given one.
+ * @api public
+ */
+Long.prototype.div = function(other) {
+  if (other.isZero()) {
+    throw Error('division by zero');
+  } else if (this.isZero()) {
+    return Long.ZERO;
+  }
+
+  if (this.equals(Long.MIN_VALUE)) {
+    if (other.equals(Long.ONE) ||
+        other.equals(Long.NEG_ONE)) {
+      return Long.MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE
+    } else if (other.equals(Long.MIN_VALUE)) {
+      return Long.ONE;
+    } else {
+      // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
+      var halfThis = this.shiftRight(1);
+      var approx = halfThis.div(other).shiftLeft(1);
+      if (approx.equals(Long.ZERO)) {
+        return other.isNegative() ? Long.ONE : Long.NEG_ONE;
+      } else {
+        var rem = this.subtract(other.multiply(approx));
+        var result = approx.add(rem.div(other));
+        return result;
+      }
+    }
+  } else if (other.equals(Long.MIN_VALUE)) {
+    return Long.ZERO;
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().div(other.negate());
+    } else {
+      return this.negate().div(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.div(other.negate()).negate();
+  }
+
+  // Repeat the following until the remainder is less than other:  find a
+  // floating-point that approximates remainder / other *from below*, add this
+  // into the result, and subtract it from the remainder.  It is critical that
+  // the approximate value is less than or equal to the real value so that the
+  // remainder never becomes negative.
+  var res = Long.ZERO;
+  var rem = this;
+  while (rem.greaterThanOrEqual(other)) {
+    // Approximate the result of division. This may be a little greater or
+    // smaller than the actual value.
+    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
+
+    // We will tweak the approximate result by changing it in the 48-th digit or
+    // the smallest non-fractional digit, whichever is larger.
+    var log2 = Math.ceil(Math.log(approx) / Math.LN2);
+    var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);
+
+    // Decrease the approximation until it is smaller than the remainder.  Note
+    // that if it is too large, the product overflows and is negative.
+    var approxRes = Long.fromNumber(approx);
+    var approxRem = approxRes.multiply(other);
+    while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
+      approx -= delta;
+      approxRes = Long.fromNumber(approx);
+      approxRem = approxRes.multiply(other);
+    }
+
+    // We know the answer can't be zero... and actually, zero would cause
+    // infinite recursion since we would make no progress.
+    if (approxRes.isZero()) {
+      approxRes = Long.ONE;
+    }
+
+    res = res.add(approxRes);
+    rem = rem.subtract(approxRem);
+  }
+  return res;
+};
+
+/**
+ * Returns this Long modulo the given one.
+ *
+ * @param {Long} other Long by which to mod.
+ * @return {Long} this Long modulo the given one.
+ * @api public
+ */
+Long.prototype.modulo = function(other) {
+  return this.subtract(this.div(other).multiply(other));
+};
+
+/**
+ * The bitwise-NOT of this value.
+ *
+ * @return {Long} the bitwise-NOT of this value.
+ * @api public
+ */
+Long.prototype.not = function() {
+  return Long.fromBits(~this.low_, ~this.high_);
+};
+
+/**
+ * Returns the bitwise-AND of this Long and the given one.
+ *
+ * @param {Long} other the Long with which to AND.
+ * @return {Long} the bitwise-AND of this and the other.
+ * @api public
+ */
+Long.prototype.and = function(other) {
+  return Long.fromBits(this.low_ & other.low_, this.high_ & other.high_);
+};
+
+/**
+ * Returns the bitwise-OR of this Long and the given one.
+ *
+ * @param {Long} other the Long with which to OR.
+ * @return {Long} the bitwise-OR of this and the other.
+ * @api public
+ */
+Long.prototype.or = function(other) {
+  return Long.fromBits(this.low_ | other.low_, this.high_ | other.high_);
+};
+
+/**
+ * Returns the bitwise-XOR of this Long and the given one.
+ *
+ * @param {Long} other the Long with which to XOR.
+ * @return {Long} the bitwise-XOR of this and the other.
+ * @api public
+ */
+Long.prototype.xor = function(other) {
+  return Long.fromBits(this.low_ ^ other.low_, this.high_ ^ other.high_);
+};
+
+/**
+ * Returns this Long with bits shifted to the left by the given amount.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Long} this shifted to the left by the given amount.
+ * @api public
+ */
+Long.prototype.shiftLeft = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var low = this.low_;
+    if (numBits < 32) {
+      var high = this.high_;
+      return Long.fromBits(
+                 low << numBits,
+                 (high << numBits) | (low >>> (32 - numBits)));
+    } else {
+      return Long.fromBits(0, low << (numBits - 32));
+    }
+  }
+};
+
+/**
+ * Returns this Long with bits shifted to the right by the given amount.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Long} this shifted to the right by the given amount.
+ * @api public
+ */
+Long.prototype.shiftRight = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var high = this.high_;
+    if (numBits < 32) {
+      var low = this.low_;
+      return Long.fromBits(
+                 (low >>> numBits) | (high << (32 - numBits)),
+                 high >> numBits);
+    } else {
+      return Long.fromBits(
+                 high >> (numBits - 32),
+                 high >= 0 ? 0 : -1);
+    }
+  }
+};
+
+/**
+ * Returns this Long with bits shifted to the right by the given amount, with the new top bits matching the current sign bit.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Long} this shifted to the right by the given amount, with zeros placed into the new leading bits.
+ * @api public
+ */
+Long.prototype.shiftRightUnsigned = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var high = this.high_;
+    if (numBits < 32) {
+      var low = this.low_;
+      return Long.fromBits(
+                 (low >>> numBits) | (high << (32 - numBits)),
+                 high >>> numBits);
+    } else if (numBits == 32) {
+      return Long.fromBits(high, 0);
+    } else {
+      return Long.fromBits(high >>> (numBits - 32), 0);
+    }
+  }
+};
+
+/**
+ * Returns a Long representing the given (32-bit) integer value.
+ *
+ * @param {Number} value the 32-bit integer in question.
+ * @return {Long} the corresponding Long value.
+ * @api public
+ */
+Long.fromInt = function(value) {
+  if (-128 <= value && value < 128) {
+    var cachedObj = Long.INT_CACHE_[value];
+    if (cachedObj) {
+      return cachedObj;
+    }
+  }
+
+  var obj = new Long(value | 0, value < 0 ? -1 : 0);
+  if (-128 <= value && value < 128) {
+    Long.INT_CACHE_[value] = obj;
+  }
+  return obj;
+};
+
+/**
+ * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
+ *
+ * @param {Number} value the number in question.
+ * @return {Long} the corresponding Long value.
+ * @api public
+ */
+Long.fromNumber = function(value) {
+  if (isNaN(value) || !isFinite(value)) {
+    return Long.ZERO;
+  } else if (value <= -Long.TWO_PWR_63_DBL_) {
+    return Long.MIN_VALUE;
+  } else if (value + 1 >= Long.TWO_PWR_63_DBL_) {
+    return Long.MAX_VALUE;
+  } else if (value < 0) {
+    return Long.fromNumber(-value).negate();
+  } else {
+    return new Long(
+               (value % Long.TWO_PWR_32_DBL_) | 0,
+               (value / Long.TWO_PWR_32_DBL_) | 0);
+  }
+};
+
+/**
+ * Returns a Long representing the 64-bit integer that comes by concatenating the given high and low bits. Each is assumed to use 32 bits.
+ *
+ * @param {Number} lowBits the low 32-bits.
+ * @param {Number} highBits the high 32-bits.
+ * @return {Long} the corresponding Long value.
+ * @api public
+ */
+Long.fromBits = function(lowBits, highBits) {
+  return new Long(lowBits, highBits);
+};
+
+/**
+ * Returns a Long representation of the given string, written using the given radix.
+ *
+ * @param {String} str the textual representation of the Long.
+ * @param {Number} opt_radix the radix in which the text is written.
+ * @return {Long} the corresponding Long value.
+ * @api public
+ */
+Long.fromString = function(str, opt_radix) {
+  if (str.length == 0) {
+    throw Error('number format error: empty string');
+  }
+
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (str.charAt(0) == '-') {
+    return Long.fromString(str.substring(1), radix).negate();
+  } else if (str.indexOf('-') >= 0) {
+    throw Error('number format error: interior "-" character: ' + str);
+  }
+
+  // Do several (8) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = Long.fromNumber(Math.pow(radix, 8));
+
+  var result = Long.ZERO;
+  for (var i = 0; i < str.length; i += 8) {
+    var size = Math.min(8, str.length - i);
+    var value = parseInt(str.substring(i, i + size), radix);
+    if (size < 8) {
+      var power = Long.fromNumber(Math.pow(radix, size));
+      result = result.multiply(power).add(Long.fromNumber(value));
+    } else {
+      result = result.multiply(radixToPower);
+      result = result.add(Long.fromNumber(value));
+    }
+  }
+  return result;
+};
+
+// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
+// from* methods on which they depend.
+
+
+/**
+ * A cache of the Long representations of small integer values.
+ * @type {Object}
+ * @api private
+ */
+Long.INT_CACHE_ = {};
+
+// NOTE: the compiler should inline these constant values below and then remove
+// these variables, so there should be no runtime penalty for these.
+
+/**
+ * Number used repeated below in calculations.  This must appear before the
+ * first call to any from* function below.
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_16_DBL_ = 1 << 16;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_24_DBL_ = 1 << 24;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_32_DBL_ = Long.TWO_PWR_16_DBL_ * Long.TWO_PWR_16_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_31_DBL_ = Long.TWO_PWR_32_DBL_ / 2;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_48_DBL_ = Long.TWO_PWR_32_DBL_ * Long.TWO_PWR_16_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_64_DBL_ = Long.TWO_PWR_32_DBL_ * Long.TWO_PWR_32_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_63_DBL_ = Long.TWO_PWR_64_DBL_ / 2;
+
+/** @type {Long} */
+Long.ZERO = Long.fromInt(0);
+
+/** @type {Long} */
+Long.ONE = Long.fromInt(1);
+
+/** @type {Long} */
+Long.NEG_ONE = Long.fromInt(-1);
+
+/** @type {Long} */
+Long.MAX_VALUE =
+    Long.fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0);
+
+/** @type {Long} */
+Long.MIN_VALUE = Long.fromBits(0, 0x80000000 | 0);
+
+/**
+ * @type {Long}
+ * @api private
+ */
+Long.TWO_PWR_24_ = Long.fromInt(1 << 24);
+
+/**
+ * Expose.
+ */
+exports.Long = Long;
+}, 
+
+
+
+'max_key': function(module, exports, global, require, undefined){
+  /**
+ * A class representation of the BSON MaxKey type.
+ *
+ * @class Represents the BSON MaxKey type.
+ * @return {MaxKey}
+ */
+function MaxKey() {
+  if(!(this instanceof MaxKey)) return new MaxKey();
+  
+  this._bsontype = 'MaxKey';  
+}
+
+exports.MaxKey = MaxKey;
+}, 
+
+
+
+'min_key': function(module, exports, global, require, undefined){
+  /**
+ * A class representation of the BSON MinKey type.
+ *
+ * @class Represents the BSON MinKey type.
+ * @return {MinKey}
+ */
+function MinKey() {
+  if(!(this instanceof MinKey)) return new MinKey();
+  
+  this._bsontype = 'MinKey';
+}
+
+exports.MinKey = MinKey;
+}, 
+
+
+
+'objectid': function(module, exports, global, require, undefined){
+  /**
+ * Module dependencies.
+ */
+var BinaryParser = require('./binary_parser').BinaryParser;
+
+/**
+ * Machine id.
+ *
+ * Create a random 3-byte value (i.e. unique for this
+ * process). Other drivers use a md5 of the machine id here, but
+ * that would mean an asyc call to gethostname, so we don't bother.
+ */
+var MACHINE_ID = parseInt(Math.random() * 0xFFFFFF, 10);
+
+// Regular expression that checks for hex value
+var checkForHexRegExp = new RegExp("^[0-9a-fA-F]{24}$");
+
+/**
+* Create a new ObjectID instance
+*
+* @class Represents the BSON ObjectID type
+* @param {String|Number} id Can be a 24 byte hex string, 12 byte binary string or a Number.
+* @return {Object} instance of ObjectID.
+*/
+var ObjectID = function ObjectID(id, _hex) {
+  if(!(this instanceof ObjectID)) return new ObjectID(id, _hex);
+
+  this._bsontype = 'ObjectID';
+  var __id = null;
+
+  // Throw an error if it's not a valid setup
+  if(id != null && 'number' != typeof id && (id.length != 12 && id.length != 24))
+    throw new Error("Argument passed in must be a single String of 12 bytes or a string of 24 hex characters");
+
+  // Generate id based on the input
+  if(id == null || typeof id == 'number') {
+    // convert to 12 byte binary string
+    this.id = this.generate(id);
+  } else if(id != null && id.length === 12) {
+    // assume 12 byte string
+    this.id = id;
+  } else if(checkForHexRegExp.test(id)) {
+    return ObjectID.createFromHexString(id);
+  } else if(!checkForHexRegExp.test(id)) {
+    throw new Error("Value passed in is not a valid 24 character hex string");
+  }
+
+  if(ObjectID.cacheHexString) this.__id = this.toHexString();
+};
+
+// Allow usage of ObjectId aswell as ObjectID
+var ObjectId = ObjectID;
+
+/**
+* Return the ObjectID id as a 24 byte hex string representation
+*
+* @return {String} return the 24 byte hex string representation.
+* @api public
+*/
+ObjectID.prototype.toHexString = function() {
+  if(ObjectID.cacheHexString && this.__id) return this.__id;
+
+  var hexString = ''
+    , number
+    , value;
+
+  for (var index = 0, len = this.id.length; index < len; index++) {
+    value = BinaryParser.toByte(this.id[index]);
+    number = value <= 15
+      ? '0' + value.toString(16)
+      : value.toString(16);
+    hexString = hexString + number;
+  }
+
+  if(ObjectID.cacheHexString) this.__id = hexString;
+  return hexString;
+};
+
+/**
+* Update the ObjectID index used in generating new ObjectID's on the driver
+*
+* @return {Number} returns next index value.
+* @api private
+*/
+ObjectID.prototype.get_inc = function() {
+  return ObjectID.index = (ObjectID.index + 1) % 0xFFFFFF;
+};
+
+/**
+* Update the ObjectID index used in generating new ObjectID's on the driver
+*
+* @return {Number} returns next index value.
+* @api private
+*/
+ObjectID.prototype.getInc = function() {
+  return this.get_inc();
+};
+
+/**
+* Generate a 12 byte id string used in ObjectID's
+*
+* @param {Number} [time] optional parameter allowing to pass in a second based timestamp.
+* @return {String} return the 12 byte id binary string.
+* @api private
+*/
+ObjectID.prototype.generate = function(time) {
+  if ('number' == typeof time) {
+    var time4Bytes = BinaryParser.encodeInt(time, 32, true, true);
+    /* for time-based ObjectID the bytes following the time will be zeroed */
+    var machine3Bytes = BinaryParser.encodeInt(MACHINE_ID, 24, false);
+    var pid2Bytes = BinaryParser.fromShort(typeof process === 'undefined' ? Math.floor(Math.random() * 100000) : process.pid);
+    var index3Bytes = BinaryParser.encodeInt(this.get_inc(), 24, false, true);
+  } else {
+  	var unixTime = parseInt(Date.now()/1000,10);
+    var time4Bytes = BinaryParser.encodeInt(unixTime, 32, true, true);
+    var machine3Bytes = BinaryParser.encodeInt(MACHINE_ID, 24, false);
+    var pid2Bytes = BinaryParser.fromShort(typeof process === 'undefined' ? Math.floor(Math.random() * 100000) : process.pid);
+    var index3Bytes = BinaryParser.encodeInt(this.get_inc(), 24, false, true);
+  }
+
+  return time4Bytes + machine3Bytes + pid2Bytes + index3Bytes;
+};
+
+/**
+* Converts the id into a 24 byte hex string for printing
+*
+* @return {String} return the 24 byte hex string representation.
+* @api private
+*/
+ObjectID.prototype.toString = function() {
+  return this.toHexString();
+};
+
+/**
+* Converts to a string representation of this Id.
+*
+* @return {String} return the 24 byte hex string representation.
+* @api private
+*/
+ObjectID.prototype.inspect = ObjectID.prototype.toString;
+
+/**
+* Converts to its JSON representation.
+*
+* @return {String} return the 24 byte hex string representation.
+* @api private
+*/
+ObjectID.prototype.toJSON = function() {
+  return this.toHexString();
+};
+
+/**
+* Compares the equality of this ObjectID with `otherID`.
+*
+* @param {Object} otherID ObjectID instance to compare against.
+* @return {Bool} the result of comparing two ObjectID's
+* @api public
+*/
+ObjectID.prototype.equals = function equals (otherID) {
+  var id = (otherID instanceof ObjectID || otherID.toHexString)
+    ? otherID.id
+    : ObjectID.createFromHexString(otherID).id;
+
+  return this.id === id;
+}
+
+/**
+* Returns the generation time in seconds that this ID was generated.
+*
+* @return {Number} return number of seconds in the timestamp part of the 12 byte id.
+* @api public
+*/
+ObjectID.prototype.getTimestamp = function() {
+  var timestamp = new Date();
+  timestamp.setTime(Math.floor(BinaryParser.decodeInt(this.id.substring(0,4), 32, true, true)) * 1000);
+  return timestamp;
+}
+
+/**
+* @ignore
+* @api private
+*/
+ObjectID.index = 0;
+
+ObjectID.createPk = function createPk () {
+  return new ObjectID();
+};
+
+/**
+* Creates an ObjectID from a second based number, with the rest of the ObjectID zeroed out. Used for comparisons or sorting the ObjectID.
+*
+* @param {Number} time an integer number representing a number of seconds.
+* @return {ObjectID} return the created ObjectID
+* @api public
+*/
+ObjectID.createFromTime = function createFromTime (time) {
+  var id = BinaryParser.encodeInt(time, 32, true, true) +
+           BinaryParser.encodeInt(0, 64, true, true);
+  return new ObjectID(id);
+};
+
+/**
+* Creates an ObjectID from a hex string representation of an ObjectID.
+*
+* @param {String} hexString create a ObjectID from a passed in 24 byte hexstring.
+* @return {ObjectID} return the created ObjectID
+* @api public
+*/
+ObjectID.createFromHexString = function createFromHexString (hexString) {
+  // Throw an error if it's not a valid setup
+  if(typeof hexString === 'undefined' || hexString != null && hexString.length != 24)
+    throw new Error("Argument passed in must be a single String of 12 bytes or a string of 24 hex characters");
+
+  var len = hexString.length;
+
+  if(len > 12*2) {
+    throw new Error('Id cannot be longer than 12 bytes');
+  }
+
+  var result = ''
+    , string
+    , number;
+
+  for (var index = 0; index < len; index += 2) {
+    string = hexString.substr(index, 2);
+    number = parseInt(string, 16);
+    result += BinaryParser.fromByte(number);
+  }
+
+  return new ObjectID(result, hexString);
+};
+
+/**
+* @ignore
+*/
+Object.defineProperty(ObjectID.prototype, "generationTime", {
+   enumerable: true
+ , get: function () {
+     return Math.floor(BinaryParser.decodeInt(this.id.substring(0,4), 32, true, true));
+   }
+ , set: function (value) {
+     var value = BinaryParser.encodeInt(value, 32, true, true);
+     this.id = value + this.id.substr(4);
+     // delete this.__id;
+     this.toHexString();
+   }
+});
+
+/**
+ * Expose.
+ */
+exports.ObjectID = ObjectID;
+exports.ObjectId = ObjectID;
+}, 
+
+
+
+'symbol': function(module, exports, global, require, undefined){
+  /**
+ * A class representation of the BSON Symbol type.
+ *
+ * @class Represents the BSON Symbol type.
+ * @param {String} value the string representing the symbol.
+ * @return {Symbol}
+ */
+function Symbol(value) {
+  if(!(this instanceof Symbol)) return new Symbol(value);
+  this._bsontype = 'Symbol';
+  this.value = value;
+}
+
+/**
+ * Access the wrapped string value.
+ *
+ * @return {String} returns the wrapped string.
+ * @api public
+ */
+Symbol.prototype.valueOf = function() {
+  return this.value;
+};
+
+/**
+ * @ignore
+ * @api private
+ */
+Symbol.prototype.toString = function() {
+  return this.value;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+Symbol.prototype.inspect = function() {
+  return this.value;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+Symbol.prototype.toJSON = function() {
+  return this.value;
+}
+
+exports.Symbol = Symbol;
+}, 
+
+
+
+'timestamp': function(module, exports, global, require, undefined){
+  // Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//
+// Copyright 2009 Google Inc. All Rights Reserved
+
+/**
+ * Defines a Timestamp class for representing a 64-bit two's-complement
+ * integer value, which faithfully simulates the behavior of a Java "Timestamp". This
+ * implementation is derived from TimestampLib in GWT.
+ *
+ * Constructs a 64-bit two's-complement integer, given its low and high 32-bit
+ * values as *signed* integers.  See the from* functions below for more
+ * convenient ways of constructing Timestamps.
+ *
+ * The internal representation of a Timestamp is the two given signed, 32-bit values.
+ * We use 32-bit pieces because these are the size of integers on which
+ * Javascript performs bit-operations.  For operations like addition and
+ * multiplication, we split each number into 16-bit pieces, which can easily be
+ * multiplied within Javascript's floating-point representation without overflow
+ * or change in sign.
+ *
+ * In the algorithms below, we frequently reduce the negative case to the
+ * positive case by negating the input(s) and then post-processing the result.
+ * Note that we must ALWAYS check specially whether those values are MIN_VALUE
+ * (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
+ * a positive number, it overflows back into a negative).  Not handling this
+ * case would often result in infinite recursion.
+ *
+ * @class Represents the BSON Timestamp type.
+ * @param {Number} low  the low (signed) 32 bits of the Timestamp.
+ * @param {Number} high the high (signed) 32 bits of the Timestamp.
+ */
+function Timestamp(low, high) {
+  if(!(this instanceof Timestamp)) return new Timestamp(low, high);
+  this._bsontype = 'Timestamp';
+  /**
+   * @type {number}
+   * @api private
+   */
+  this.low_ = low | 0;  // force into 32 signed bits.
+
+  /**
+   * @type {number}
+   * @api private
+   */
+  this.high_ = high | 0;  // force into 32 signed bits.
+};
+
+/**
+ * Return the int value.
+ *
+ * @return {Number} the value, assuming it is a 32-bit integer.
+ * @api public
+ */
+Timestamp.prototype.toInt = function() {
+  return this.low_;
+};
+
+/**
+ * Return the Number value.
+ *
+ * @return {Number} the closest floating-point representation to this value.
+ * @api public
+ */
+Timestamp.prototype.toNumber = function() {
+  return this.high_ * Timestamp.TWO_PWR_32_DBL_ +
+         this.getLowBitsUnsigned();
+};
+
+/**
+ * Return the JSON value.
+ *
+ * @return {String} the JSON representation.
+ * @api public
+ */
+Timestamp.prototype.toJSON = function() {
+  return this.toString();
+}
+
+/**
+ * Return the String value.
+ *
+ * @param {Number} [opt_radix] the radix in which the text should be written.
+ * @return {String} the textual representation of this value.
+ * @api public
+ */
+Timestamp.prototype.toString = function(opt_radix) {
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (this.isZero()) {
+    return '0';
+  }
+
+  if (this.isNegative()) {
+    if (this.equals(Timestamp.MIN_VALUE)) {
+      // We need to change the Timestamp value before it can be negated, so we remove
+      // the bottom-most digit in this base and then recurse to do the rest.
+      var radixTimestamp = Timestamp.fromNumber(radix);
+      var div = this.div(radixTimestamp);
+      var rem = div.multiply(radixTimestamp).subtract(this);
+      return div.toString(radix) + rem.toInt().toString(radix);
+    } else {
+      return '-' + this.negate().toString(radix);
+    }
+  }
+
+  // Do several (6) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = Timestamp.fromNumber(Math.pow(radix, 6));
+
+  var rem = this;
+  var result = '';
+  while (true) {
+    var remDiv = rem.div(radixToPower);
+    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt();
+    var digits = intval.toString(radix);
+
+    rem = remDiv;
+    if (rem.isZero()) {
+      return digits + result;
+    } else {
+      while (digits.length < 6) {
+        digits = '0' + digits;
+      }
+      result = '' + digits + result;
+    }
+  }
+};
+
+/**
+ * Return the high 32-bits value.
+ *
+ * @return {Number} the high 32-bits as a signed value.
+ * @api public
+ */
+Timestamp.prototype.getHighBits = function() {
+  return this.high_;
+};
+
+/**
+ * Return the low 32-bits value.
+ *
+ * @return {Number} the low 32-bits as a signed value.
+ * @api public
+ */
+Timestamp.prototype.getLowBits = function() {
+  return this.low_;
+};
+
+/**
+ * Return the low unsigned 32-bits value.
+ *
+ * @return {Number} the low 32-bits as an unsigned value.
+ * @api public
+ */
+Timestamp.prototype.getLowBitsUnsigned = function() {
+  return (this.low_ >= 0) ?
+      this.low_ : Timestamp.TWO_PWR_32_DBL_ + this.low_;
+};
+
+/**
+ * Returns the number of bits needed to represent the absolute value of this Timestamp.
+ *
+ * @return {Number} Returns the number of bits needed to represent the absolute value of this Timestamp.
+ * @api public
+ */
+Timestamp.prototype.getNumBitsAbs = function() {
+  if (this.isNegative()) {
+    if (this.equals(Timestamp.MIN_VALUE)) {
+      return 64;
+    } else {
+      return this.negate().getNumBitsAbs();
+    }
+  } else {
+    var val = this.high_ != 0 ? this.high_ : this.low_;
+    for (var bit = 31; bit > 0; bit--) {
+      if ((val & (1 << bit)) != 0) {
+        break;
+      }
+    }
+    return this.high_ != 0 ? bit + 33 : bit + 1;
+  }
+};
+
+/**
+ * Return whether this value is zero.
+ *
+ * @return {Boolean} whether this value is zero.
+ * @api public
+ */
+Timestamp.prototype.isZero = function() {
+  return this.high_ == 0 && this.low_ == 0;
+};
+
+/**
+ * Return whether this value is negative.
+ *
+ * @return {Boolean} whether this value is negative.
+ * @api public
+ */
+Timestamp.prototype.isNegative = function() {
+  return this.high_ < 0;
+};
+
+/**
+ * Return whether this value is odd.
+ *
+ * @return {Boolean} whether this value is odd.
+ * @api public
+ */
+Timestamp.prototype.isOdd = function() {
+  return (this.low_ & 1) == 1;
+};
+
+/**
+ * Return whether this Timestamp equals the other
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp equals the other
+ * @api public
+ */
+Timestamp.prototype.equals = function(other) {
+  return (this.high_ == other.high_) && (this.low_ == other.low_);
+};
+
+/**
+ * Return whether this Timestamp does not equal the other.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp does not equal the other.
+ * @api public
+ */
+Timestamp.prototype.notEquals = function(other) {
+  return (this.high_ != other.high_) || (this.low_ != other.low_);
+};
+
+/**
+ * Return whether this Timestamp is less than the other.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp is less than the other.
+ * @api public
+ */
+Timestamp.prototype.lessThan = function(other) {
+  return this.compare(other) < 0;
+};
+
+/**
+ * Return whether this Timestamp is less than or equal to the other.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp is less than or equal to the other.
+ * @api public
+ */
+Timestamp.prototype.lessThanOrEqual = function(other) {
+  return this.compare(other) <= 0;
+};
+
+/**
+ * Return whether this Timestamp is greater than the other.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp is greater than the other.
+ * @api public
+ */
+Timestamp.prototype.greaterThan = function(other) {
+  return this.compare(other) > 0;
+};
+
+/**
+ * Return whether this Timestamp is greater than or equal to the other.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp is greater than or equal to the other.
+ * @api public
+ */
+Timestamp.prototype.greaterThanOrEqual = function(other) {
+  return this.compare(other) >= 0;
+};
+
+/**
+ * Compares this Timestamp with the given one.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} 0 if they are the same, 1 if the this is greater, and -1 if the given one is greater.
+ * @api public
+ */
+Timestamp.prototype.compare = function(other) {
+  if (this.equals(other)) {
+    return 0;
+  }
+
+  var thisNeg = this.isNegative();
+  var otherNeg = other.isNegative();
+  if (thisNeg && !otherNeg) {
+    return -1;
+  }
+  if (!thisNeg && otherNeg) {
+    return 1;
+  }
+
+  // at this point, the signs are the same, so subtraction will not overflow
+  if (this.subtract(other).isNegative()) {
+    return -1;
+  } else {
+    return 1;
+  }
+};
+
+/**
+ * The negation of this value.
+ *
+ * @return {Timestamp} the negation of this value.
+ * @api public
+ */
+Timestamp.prototype.negate = function() {
+  if (this.equals(Timestamp.MIN_VALUE)) {
+    return Timestamp.MIN_VALUE;
+  } else {
+    return this.not().add(Timestamp.ONE);
+  }
+};
+
+/**
+ * Returns the sum of this and the given Timestamp.
+ *
+ * @param {Timestamp} other Timestamp to add to this one.
+ * @return {Timestamp} the sum of this and the given Timestamp.
+ * @api public
+ */
+Timestamp.prototype.add = function(other) {
+  // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
+
+  var a48 = this.high_ >>> 16;
+  var a32 = this.high_ & 0xFFFF;
+  var a16 = this.low_ >>> 16;
+  var a00 = this.low_ & 0xFFFF;
+
+  var b48 = other.high_ >>> 16;
+  var b32 = other.high_ & 0xFFFF;
+  var b16 = other.low_ >>> 16;
+  var b00 = other.low_ & 0xFFFF;
+
+  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+  c00 += a00 + b00;
+  c16 += c00 >>> 16;
+  c00 &= 0xFFFF;
+  c16 += a16 + b16;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c32 += a32 + b32;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c48 += a48 + b48;
+  c48 &= 0xFFFF;
+  return Timestamp.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+};
+
+/**
+ * Returns the difference of this and the given Timestamp.
+ *
+ * @param {Timestamp} other Timestamp to subtract from this.
+ * @return {Timestamp} the difference of this and the given Timestamp.
+ * @api public
+ */
+Timestamp.prototype.subtract = function(other) {
+  return this.add(other.negate());
+};
+
+/**
+ * Returns the product of this and the given Timestamp.
+ *
+ * @param {Timestamp} other Timestamp to multiply with this.
+ * @return {Timestamp} the product of this and the other.
+ * @api public
+ */
+Timestamp.prototype.multiply = function(other) {
+  if (this.isZero()) {
+    return Timestamp.ZERO;
+  } else if (other.isZero()) {
+    return Timestamp.ZERO;
+  }
+
+  if (this.equals(Timestamp.MIN_VALUE)) {
+    return other.isOdd() ? Timestamp.MIN_VALUE : Timestamp.ZERO;
+  } else if (other.equals(Timestamp.MIN_VALUE)) {
+    return this.isOdd() ? Timestamp.MIN_VALUE : Timestamp.ZERO;
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().multiply(other.negate());
+    } else {
+      return this.negate().multiply(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.multiply(other.negate()).negate();
+  }
+
+  // If both Timestamps are small, use float multiplication
+  if (this.lessThan(Timestamp.TWO_PWR_24_) &&
+      other.lessThan(Timestamp.TWO_PWR_24_)) {
+    return Timestamp.fromNumber(this.toNumber() * other.toNumber());
+  }
+
+  // Divide each Timestamp into 4 chunks of 16 bits, and then add up 4x4 products.
+  // We can skip products that would overflow.
+
+  var a48 = this.high_ >>> 16;
+  var a32 = this.high_ & 0xFFFF;
+  var a16 = this.low_ >>> 16;
+  var a00 = this.low_ & 0xFFFF;
+
+  var b48 = other.high_ >>> 16;
+  var b32 = other.high_ & 0xFFFF;
+  var b16 = other.low_ >>> 16;
+  var b00 = other.low_ & 0xFFFF;
+
+  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+  c00 += a00 * b00;
+  c16 += c00 >>> 16;
+  c00 &= 0xFFFF;
+  c16 += a16 * b00;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c16 += a00 * b16;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c32 += a32 * b00;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c32 += a16 * b16;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c32 += a00 * b32;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
+  c48 &= 0xFFFF;
+  return Timestamp.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+};
+
+/**
+ * Returns this Timestamp divided by the given one.
+ *
+ * @param {Timestamp} other Timestamp by which to divide.
+ * @return {Timestamp} this Timestamp divided by the given one.
+ * @api public
+ */
+Timestamp.prototype.div = function(other) {
+  if (other.isZero()) {
+    throw Error('division by zero');
+  } else if (this.isZero()) {
+    return Timestamp.ZERO;
+  }
+
+  if (this.equals(Timestamp.MIN_VALUE)) {
+    if (other.equals(Timestamp.ONE) ||
+        other.equals(Timestamp.NEG_ONE)) {
+      return Timestamp.MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE
+    } else if (other.equals(Timestamp.MIN_VALUE)) {
+      return Timestamp.ONE;
+    } else {
+      // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
+      var halfThis = this.shiftRight(1);
+      var approx = halfThis.div(other).shiftLeft(1);
+      if (approx.equals(Timestamp.ZERO)) {
+        return other.isNegative() ? Timestamp.ONE : Timestamp.NEG_ONE;
+      } else {
+        var rem = this.subtract(other.multiply(approx));
+        var result = approx.add(rem.div(other));
+        return result;
+      }
+    }
+  } else if (other.equals(Timestamp.MIN_VALUE)) {
+    return Timestamp.ZERO;
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().div(other.negate());
+    } else {
+      return this.negate().div(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.div(other.negate()).negate();
+  }
+
+  // Repeat the following until the remainder is less than other:  find a
+  // floating-point that approximates remainder / other *from below*, add this
+  // into the result, and subtract it from the remainder.  It is critical that
+  // the approximate value is less than or equal to the real value so that the
+  // remainder never becomes negative.
+  var res = Timestamp.ZERO;
+  var rem = this;
+  while (rem.greaterThanOrEqual(other)) {
+    // Approximate the result of division. This may be a little greater or
+    // smaller than the actual value.
+    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
+
+    // We will tweak the approximate result by changing it in the 48-th digit or
+    // the smallest non-fractional digit, whichever is larger.
+    var log2 = Math.ceil(Math.log(approx) / Math.LN2);
+    var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);
+
+    // Decrease the approximation until it is smaller than the remainder.  Note
+    // that if it is too large, the product overflows and is negative.
+    var approxRes = Timestamp.fromNumber(approx);
+    var approxRem = approxRes.multiply(other);
+    while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
+      approx -= delta;
+      approxRes = Timestamp.fromNumber(approx);
+      approxRem = approxRes.multiply(other);
+    }
+
+    // We know the answer can't be zero... and actually, zero would cause
+    // infinite recursion since we would make no progress.
+    if (approxRes.isZero()) {
+      approxRes = Timestamp.ONE;
+    }
+
+    res = res.add(approxRes);
+    rem = rem.subtract(approxRem);
+  }
+  return res;
+};
+
+/**
+ * Returns this Timestamp modulo the given one.
+ *
+ * @param {Timestamp} other Timestamp by which to mod.
+ * @return {Timestamp} this Timestamp modulo the given one.
+ * @api public
+ */
+Timestamp.prototype.modulo = function(other) {
+  return this.subtract(this.div(other).multiply(other));
+};
+
+/**
+ * The bitwise-NOT of this value.
+ *
+ * @return {Timestamp} the bitwise-NOT of this value.
+ * @api public
+ */
+Timestamp.prototype.not = function() {
+  return Timestamp.fromBits(~this.low_, ~this.high_);
+};
+
+/**
+ * Returns the bitwise-AND of this Timestamp and the given one.
+ *
+ * @param {Timestamp} other the Timestamp with which to AND.
+ * @return {Timestamp} the bitwise-AND of this and the other.
+ * @api public
+ */
+Timestamp.prototype.and = function(other) {
+  return Timestamp.fromBits(this.low_ & other.low_, this.high_ & other.high_);
+};
+
+/**
+ * Returns the bitwise-OR of this Timestamp and the given one.
+ *
+ * @param {Timestamp} other the Timestamp with which to OR.
+ * @return {Timestamp} the bitwise-OR of this and the other.
+ * @api public
+ */
+Timestamp.prototype.or = function(other) {
+  return Timestamp.fromBits(this.low_ | other.low_, this.high_ | other.high_);
+};
+
+/**
+ * Returns the bitwise-XOR of this Timestamp and the given one.
+ *
+ * @param {Timestamp} other the Timestamp with which to XOR.
+ * @return {Timestamp} the bitwise-XOR of this and the other.
+ * @api public
+ */
+Timestamp.prototype.xor = function(other) {
+  return Timestamp.fromBits(this.low_ ^ other.low_, this.high_ ^ other.high_);
+};
+
+/**
+ * Returns this Timestamp with bits shifted to the left by the given amount.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Timestamp} this shifted to the left by the given amount.
+ * @api public
+ */
+Timestamp.prototype.shiftLeft = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var low = this.low_;
+    if (numBits < 32) {
+      var high = this.high_;
+      return Timestamp.fromBits(
+                 low << numBits,
+                 (high << numBits) | (low >>> (32 - numBits)));
+    } else {
+      return Timestamp.fromBits(0, low << (numBits - 32));
+    }
+  }
+};
+
+/**
+ * Returns this Timestamp with bits shifted to the right by the given amount.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Timestamp} this shifted to the right by the given amount.
+ * @api public
+ */
+Timestamp.prototype.shiftRight = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var high = this.high_;
+    if (numBits < 32) {
+      var low = this.low_;
+      return Timestamp.fromBits(
+                 (low >>> numBits) | (high << (32 - numBits)),
+                 high >> numBits);
+    } else {
+      return Timestamp.fromBits(
+                 high >> (numBits - 32),
+                 high >= 0 ? 0 : -1);
+    }
+  }
+};
+
+/**
+ * Returns this Timestamp with bits shifted to the right by the given amount, with the new top bits matching the current sign bit.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Timestamp} this shifted to the right by the given amount, with zeros placed into the new leading bits.
+ * @api public
+ */
+Timestamp.prototype.shiftRightUnsigned = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var high = this.high_;
+    if (numBits < 32) {
+      var low = this.low_;
+      return Timestamp.fromBits(
+                 (low >>> numBits) | (high << (32 - numBits)),
+                 high >>> numBits);
+    } else if (numBits == 32) {
+      return Timestamp.fromBits(high, 0);
+    } else {
+      return Timestamp.fromBits(high >>> (numBits - 32), 0);
+    }
+  }
+};
+
+/**
+ * Returns a Timestamp representing the given (32-bit) integer value.
+ *
+ * @param {Number} value the 32-bit integer in question.
+ * @return {Timestamp} the corresponding Timestamp value.
+ * @api public
+ */
+Timestamp.fromInt = function(value) {
+  if (-128 <= value && value < 128) {
+    var cachedObj = Timestamp.INT_CACHE_[value];
+    if (cachedObj) {
+      return cachedObj;
+    }
+  }
+
+  var obj = new Timestamp(value | 0, value < 0 ? -1 : 0);
+  if (-128 <= value && value < 128) {
+    Timestamp.INT_CACHE_[value] = obj;
+  }
+  return obj;
+};
+
+/**
+ * Returns a Timestamp representing the given value, provided that it is a finite number. Otherwise, zero is returned.
+ *
+ * @param {Number} value the number in question.
+ * @return {Timestamp} the corresponding Timestamp value.
+ * @api public
+ */
+Timestamp.fromNumber = function(value) {
+  if (isNaN(value) || !isFinite(value)) {
+    return Timestamp.ZERO;
+  } else if (value <= -Timestamp.TWO_PWR_63_DBL_) {
+    return Timestamp.MIN_VALUE;
+  } else if (value + 1 >= Timestamp.TWO_PWR_63_DBL_) {
+    return Timestamp.MAX_VALUE;
+  } else if (value < 0) {
+    return Timestamp.fromNumber(-value).negate();
+  } else {
+    return new Timestamp(
+               (value % Timestamp.TWO_PWR_32_DBL_) | 0,
+               (value / Timestamp.TWO_PWR_32_DBL_) | 0);
+  }
+};
+
+/**
+ * Returns a Timestamp representing the 64-bit integer that comes by concatenating the given high and low bits. Each is assumed to use 32 bits.
+ *
+ * @param {Number} lowBits the low 32-bits.
+ * @param {Number} highBits the high 32-bits.
+ * @return {Timestamp} the corresponding Timestamp value.
+ * @api public
+ */
+Timestamp.fromBits = function(lowBits, highBits) {
+  return new Timestamp(lowBits, highBits);
+};
+
+/**
+ * Returns a Timestamp representation of the given string, written using the given radix.
+ *
+ * @param {String} str the textual representation of the Timestamp.
+ * @param {Number} opt_radix the radix in which the text is written.
+ * @return {Timestamp} the corresponding Timestamp value.
+ * @api public
+ */
+Timestamp.fromString = function(str, opt_radix) {
+  if (str.length == 0) {
+    throw Error('number format error: empty string');
+  }
+
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (str.charAt(0) == '-') {
+    return Timestamp.fromString(str.substring(1), radix).negate();
+  } else if (str.indexOf('-') >= 0) {
+    throw Error('number format error: interior "-" character: ' + str);
+  }
+
+  // Do several (8) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = Timestamp.fromNumber(Math.pow(radix, 8));
+
+  var result = Timestamp.ZERO;
+  for (var i = 0; i < str.length; i += 8) {
+    var size = Math.min(8, str.length - i);
+    var value = parseInt(str.substring(i, i + size), radix);
+    if (size < 8) {
+      var power = Timestamp.fromNumber(Math.pow(radix, size));
+      result = result.multiply(power).add(Timestamp.fromNumber(value));
+    } else {
+      result = result.multiply(radixToPower);
+      result = result.add(Timestamp.fromNumber(value));
+    }
+  }
+  return result;
+};
+
+// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
+// from* methods on which they depend.
+
+
+/**
+ * A cache of the Timestamp representations of small integer values.
+ * @type {Object}
+ * @api private
+ */
+Timestamp.INT_CACHE_ = {};
+
+// NOTE: the compiler should inline these constant values below and then remove
+// these variables, so there should be no runtime penalty for these.
+
+/**
+ * Number used repeated below in calculations.  This must appear before the
+ * first call to any from* function below.
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_16_DBL_ = 1 << 16;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_24_DBL_ = 1 << 24;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_32_DBL_ = Timestamp.TWO_PWR_16_DBL_ * Timestamp.TWO_PWR_16_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_31_DBL_ = Timestamp.TWO_PWR_32_DBL_ / 2;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_48_DBL_ = Timestamp.TWO_PWR_32_DBL_ * Timestamp.TWO_PWR_16_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_64_DBL_ = Timestamp.TWO_PWR_32_DBL_ * Timestamp.TWO_PWR_32_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_63_DBL_ = Timestamp.TWO_PWR_64_DBL_ / 2;
+
+/** @type {Timestamp} */
+Timestamp.ZERO = Timestamp.fromInt(0);
+
+/** @type {Timestamp} */
+Timestamp.ONE = Timestamp.fromInt(1);
+
+/** @type {Timestamp} */
+Timestamp.NEG_ONE = Timestamp.fromInt(-1);
+
+/** @type {Timestamp} */
+Timestamp.MAX_VALUE =
+    Timestamp.fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0);
+
+/** @type {Timestamp} */
+Timestamp.MIN_VALUE = Timestamp.fromBits(0, 0x80000000 | 0);
+
+/**
+ * @type {Timestamp}
+ * @api private
+ */
+Timestamp.TWO_PWR_24_ = Timestamp.fromInt(1 << 24);
+
+/**
+ * Expose.
+ */
+exports.Timestamp = Timestamp;
+}, 
+
+ });
+
+
+if(typeof module != 'undefined' && module.exports ){
+  module.exports = bson;
+
+  if( !module.parent ){
+    bson();
+  }
+}
diff --git a/node_modules/mongodb/node_modules/bson/browser_build/package.json b/node_modules/mongodb/node_modules/bson/browser_build/package.json
new file mode 100644
index 0000000..3ebb587
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/browser_build/package.json
@@ -0,0 +1,8 @@
+{ "name" :            "bson"
+, "description" :     "A bson parser for node.js and the browser"
+, "main":             "../lib/bson/bson"
+, "directories" :   { "lib" : "../lib/bson" }
+, "engines" :       { "node" : ">=0.6.0" }
+, "licenses" :    [ { "type" :  "Apache License, Version 2.0"
+                    , "url" :   "http://www.apache.org/licenses/LICENSE-2.0" } ]
+}
diff --git a/node_modules/mongodb/node_modules/bson/build/Makefile b/node_modules/mongodb/node_modules/bson/build/Makefile
new file mode 100644
index 0000000..7d9b448
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/build/Makefile
@@ -0,0 +1,355 @@
+# We borrow heavily from the kernel build setup, though we are simpler since
+# we don't have Kconfig tweaking settings on us.
+
+# The implicit make rules have it looking for RCS files, among other things.
+# We instead explicitly write all the rules we care about.
+# It's even quicker (saves ~200ms) to pass -r on the command line.
+MAKEFLAGS=-r
+
+# The source directory tree.
+srcdir := ..
+abs_srcdir := $(abspath $(srcdir))
+
+# The name of the builddir.
+builddir_name ?= .
+
+# The V=1 flag on command line makes us verbosely print command lines.
+ifdef V
+  quiet=
+else
+  quiet=quiet_
+endif
+
+# Specify BUILDTYPE=Release on the command line for a release build.
+BUILDTYPE ?= Release
+
+# Directory all our build output goes into.
+# Note that this must be two directories beneath src/ for unit tests to pass,
+# as they reach into the src/ directory for data with relative paths.
+builddir ?= $(builddir_name)/$(BUILDTYPE)
+abs_builddir := $(abspath $(builddir))
+depsdir := $(builddir)/.deps
+
+# Object output directory.
+obj := $(builddir)/obj
+abs_obj := $(abspath $(obj))
+
+# We build up a list of every single one of the targets so we can slurp in the
+# generated dependency rule Makefiles in one pass.
+all_deps :=
+
+
+
+# C++ apps need to be linked with g++.
+#
+# Note: flock is used to seralize linking. Linking is a memory-intensive
+# process so running parallel links can often lead to thrashing.  To disable
+# the serialization, override LINK via an envrionment variable as follows:
+#
+#   export LINK=g++
+#
+# This will allow make to invoke N linker processes as specified in -jN.
+LINK ?= ./gyp-mac-tool flock $(builddir)/linker.lock $(CXX)
+
+CC.target ?= $(CC)
+CFLAGS.target ?= $(CFLAGS)
+CXX.target ?= $(CXX)
+CXXFLAGS.target ?= $(CXXFLAGS)
+LINK.target ?= $(LINK)
+LDFLAGS.target ?= $(LDFLAGS)
+AR.target ?= $(AR)
+
+# TODO(evan): move all cross-compilation logic to gyp-time so we don't need
+# to replicate this environment fallback in make as well.
+CC.host ?= gcc
+CFLAGS.host ?=
+CXX.host ?= g++
+CXXFLAGS.host ?=
+LINK.host ?= g++
+LDFLAGS.host ?=
+AR.host ?= ar
+
+# Define a dir function that can handle spaces.
+# http://www.gnu.org/software/make/manual/make.html#Syntax-of-Functions
+# "leading spaces cannot appear in the text of the first argument as written.
+# These characters can be put into the argument value by variable substitution."
+empty :=
+space := $(empty) $(empty)
+
+# http://stackoverflow.com/questions/1189781/using-make-dir-or-notdir-on-a-path-with-spaces
+replace_spaces = $(subst $(space),?,$1)
+unreplace_spaces = $(subst ?,$(space),$1)
+dirx = $(call unreplace_spaces,$(dir $(call replace_spaces,$1)))
+
+# Flags to make gcc output dependency info.  Note that you need to be
+# careful here to use the flags that ccache and distcc can understand.
+# We write to a dep file on the side first and then rename at the end
+# so we can't end up with a broken dep file.
+depfile = $(depsdir)/$(call replace_spaces,$@).d
+DEPFLAGS = -MMD -MF $(depfile).raw
+
+# We have to fixup the deps output in a few ways.
+# (1) the file output should mention the proper .o file.
+# ccache or distcc lose the path to the target, so we convert a rule of
+# the form:
+#   foobar.o: DEP1 DEP2
+# into
+#   path/to/foobar.o: DEP1 DEP2
+# (2) we want missing files not to cause us to fail to build.
+# We want to rewrite
+#   foobar.o: DEP1 DEP2 \
+#               DEP3
+# to
+#   DEP1:
+#   DEP2:
+#   DEP3:
+# so if the files are missing, they're just considered phony rules.
+# We have to do some pretty insane escaping to get those backslashes
+# and dollar signs past make, the shell, and sed at the same time.
+# Doesn't work with spaces, but that's fine: .d files have spaces in
+# their names replaced with other characters.
+define fixup_dep
+# The depfile may not exist if the input file didn't have any #includes.
+touch $(depfile).raw
+# Fixup path as in (1).
+sed -e "s|^$(notdir $@)|$@|" $(depfile).raw >> $(depfile)
+# Add extra rules as in (2).
+# We remove slashes and replace spaces with new lines;
+# remove blank lines;
+# delete the first line and append a colon to the remaining lines.
+sed -e 's|\\||' -e 'y| |\n|' $(depfile).raw |\
+  grep -v '^$$'                             |\
+  sed -e 1d -e 's|$$|:|'                     \
+    >> $(depfile)
+rm $(depfile).raw
+endef
+
+# Command definitions:
+# - cmd_foo is the actual command to run;
+# - quiet_cmd_foo is the brief-output summary of the command.
+
+quiet_cmd_cc = CC($(TOOLSET)) $@
+cmd_cc = $(CC.$(TOOLSET)) $(GYP_CFLAGS) $(DEPFLAGS) $(CFLAGS.$(TOOLSET)) -c -o $@ $<
+
+quiet_cmd_cxx = CXX($(TOOLSET)) $@
+cmd_cxx = $(CXX.$(TOOLSET)) $(GYP_CXXFLAGS) $(DEPFLAGS) $(CXXFLAGS.$(TOOLSET)) -c -o $@ $<
+
+quiet_cmd_objc = CXX($(TOOLSET)) $@
+cmd_objc = $(CC.$(TOOLSET)) $(GYP_OBJCFLAGS) $(DEPFLAGS) -c -o $@ $<
+
+quiet_cmd_objcxx = CXX($(TOOLSET)) $@
+cmd_objcxx = $(CXX.$(TOOLSET)) $(GYP_OBJCXXFLAGS) $(DEPFLAGS) -c -o $@ $<
+
+# Commands for precompiled header files.
+quiet_cmd_pch_c = CXX($(TOOLSET)) $@
+cmd_pch_c = $(CC.$(TOOLSET)) $(GYP_PCH_CFLAGS) $(DEPFLAGS) $(CXXFLAGS.$(TOOLSET)) -c -o $@ $<
+quiet_cmd_pch_cc = CXX($(TOOLSET)) $@
+cmd_pch_cc = $(CC.$(TOOLSET)) $(GYP_PCH_CXXFLAGS) $(DEPFLAGS) $(CXXFLAGS.$(TOOLSET)) -c -o $@ $<
+quiet_cmd_pch_m = CXX($(TOOLSET)) $@
+cmd_pch_m = $(CC.$(TOOLSET)) $(GYP_PCH_OBJCFLAGS) $(DEPFLAGS) -c -o $@ $<
+quiet_cmd_pch_mm = CXX($(TOOLSET)) $@
+cmd_pch_mm = $(CC.$(TOOLSET)) $(GYP_PCH_OBJCXXFLAGS) $(DEPFLAGS) -c -o $@ $<
+
+# gyp-mac-tool is written next to the root Makefile by gyp.
+# Use $(4) for the command, since $(2) and $(3) are used as flag by do_cmd
+# already.
+quiet_cmd_mac_tool = MACTOOL $(4) $<
+cmd_mac_tool = ./gyp-mac-tool $(4) $< "$@"
+
+quiet_cmd_mac_package_framework = PACKAGE FRAMEWORK $@
+cmd_mac_package_framework = ./gyp-mac-tool package-framework "$@" $(4)
+
+quiet_cmd_infoplist = INFOPLIST $@
+cmd_infoplist = $(CC.$(TOOLSET)) -E -P -Wno-trigraphs -x c $(INFOPLIST_DEFINES) "$<" -o "$@"
+
+quiet_cmd_touch = TOUCH $@
+cmd_touch = touch $@
+
+quiet_cmd_copy = COPY $@
+# send stderr to /dev/null to ignore messages when linking directories.
+cmd_copy = rm -rf "$@" && cp -af "$<" "$@"
+
+quiet_cmd_alink = LIBTOOL-STATIC $@
+cmd_alink = rm -f $@ && ./gyp-mac-tool filter-libtool libtool $(GYP_LIBTOOLFLAGS) -static -o $@ $(filter %.o,$^)
+
+quiet_cmd_link = LINK($(TOOLSET)) $@
+cmd_link = $(LINK.$(TOOLSET)) $(GYP_LDFLAGS) $(LDFLAGS.$(TOOLSET)) -o "$@" $(LD_INPUTS) $(LIBS)
+
+# TODO(thakis): Find out and document the difference between shared_library and
+# loadable_module on mac.
+quiet_cmd_solink = SOLINK($(TOOLSET)) $@
+cmd_solink = $(LINK.$(TOOLSET)) -shared $(GYP_LDFLAGS) $(LDFLAGS.$(TOOLSET)) -o "$@" $(LD_INPUTS) $(LIBS)
+
+# TODO(thakis): The solink_module rule is likely wrong. Xcode seems to pass
+# -bundle -single_module here (for osmesa.so).
+quiet_cmd_solink_module = SOLINK_MODULE($(TOOLSET)) $@
+cmd_solink_module = $(LINK.$(TOOLSET)) -shared $(GYP_LDFLAGS) $(LDFLAGS.$(TOOLSET)) -o $@ $(filter-out FORCE_DO_CMD, $^) $(LIBS)
+
+
+# Define an escape_quotes function to escape single quotes.
+# This allows us to handle quotes properly as long as we always use
+# use single quotes and escape_quotes.
+escape_quotes = $(subst ','\'',$(1))
+# This comment is here just to include a ' to unconfuse syntax highlighting.
+# Define an escape_vars function to escape '$' variable syntax.
+# This allows us to read/write command lines with shell variables (e.g.
+# $LD_LIBRARY_PATH), without triggering make substitution.
+escape_vars = $(subst $$,$$$$,$(1))
+# Helper that expands to a shell command to echo a string exactly as it is in
+# make. This uses printf instead of echo because printf's behaviour with respect
+# to escape sequences is more portable than echo's across different shells
+# (e.g., dash, bash).
+exact_echo = printf '%s\n' '$(call escape_quotes,$(1))'
+
+# Helper to compare the command we're about to run against the command
+# we logged the last time we ran the command.  Produces an empty
+# string (false) when the commands match.
+# Tricky point: Make has no string-equality test function.
+# The kernel uses the following, but it seems like it would have false
+# positives, where one string reordered its arguments.
+#   arg_check = $(strip $(filter-out $(cmd_$(1)), $(cmd_$@)) \
+#                       $(filter-out $(cmd_$@), $(cmd_$(1))))
+# We instead substitute each for the empty string into the other, and
+# say they're equal if both substitutions produce the empty string.
+# .d files contain ? instead of spaces, take that into account.
+command_changed = $(or $(subst $(cmd_$(1)),,$(cmd_$(call replace_spaces,$@))),\
+                       $(subst $(cmd_$(call replace_spaces,$@)),,$(cmd_$(1))))
+
+# Helper that is non-empty when a prerequisite changes.
+# Normally make does this implicitly, but we force rules to always run
+# so we can check their command lines.
+#   $? -- new prerequisites
+#   $| -- order-only dependencies
+prereq_changed = $(filter-out FORCE_DO_CMD,$(filter-out $|,$?))
+
+# Helper that executes all postbuilds, and deletes the output file when done
+# if any of the postbuilds failed.
+define do_postbuilds
+  @E=0;\
+  for p in $(POSTBUILDS); do\
+    eval $$p;\
+    F=$$?;\
+    if [ $$F -ne 0 ]; then\
+      E=$$F;\
+    fi;\
+  done;\
+  if [ $$E -ne 0 ]; then\
+    rm -rf "$@";\
+    exit $$E;\
+  fi
+endef
+
+# do_cmd: run a command via the above cmd_foo names, if necessary.
+# Should always run for a given target to handle command-line changes.
+# Second argument, if non-zero, makes it do asm/C/C++ dependency munging.
+# Third argument, if non-zero, makes it do POSTBUILDS processing.
+# Note: We intentionally do NOT call dirx for depfile, since it contains ? for
+# spaces already and dirx strips the ? characters.
+define do_cmd
+$(if $(or $(command_changed),$(prereq_changed)),
+  @$(call exact_echo,  $($(quiet)cmd_$(1)))
+  @mkdir -p "$(call dirx,$@)" "$(dir $(depfile))"
+  $(if $(findstring flock,$(word 2,$(cmd_$1))),
+    @$(cmd_$(1))
+    @echo "  $(quiet_cmd_$(1)): Finished",
+    @$(cmd_$(1))
+  )
+  @$(call exact_echo,$(call escape_vars,cmd_$(call replace_spaces,$@) := $(cmd_$(1)))) > $(depfile)
+  @$(if $(2),$(fixup_dep))
+  $(if $(and $(3), $(POSTBUILDS)),
+    $(call do_postbuilds)
+  )
+)
+endef
+
+# Declare the "all" target first so it is the default,
+# even though we don't have the deps yet.
+.PHONY: all
+all:
+
+# make looks for ways to re-generate included makefiles, but in our case, we
+# don't have a direct way. Explicitly telling make that it has nothing to do
+# for them makes it go faster.
+%.d: ;
+
+# Use FORCE_DO_CMD to force a target to run.  Should be coupled with
+# do_cmd.
+.PHONY: FORCE_DO_CMD
+FORCE_DO_CMD:
+
+TOOLSET := target
+# Suffix rules, putting all outputs into $(obj).
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.c FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.cpp FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.cxx FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.m FORCE_DO_CMD
+	@$(call do_cmd,objc,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.mm FORCE_DO_CMD
+	@$(call do_cmd,objcxx,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.S FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.s FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+
+# Try building from generated source, too.
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.c FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.cpp FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.cxx FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.m FORCE_DO_CMD
+	@$(call do_cmd,objc,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.mm FORCE_DO_CMD
+	@$(call do_cmd,objcxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.S FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.s FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+
+$(obj).$(TOOLSET)/%.o: $(obj)/%.c FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.cpp FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.cxx FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.m FORCE_DO_CMD
+	@$(call do_cmd,objc,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.mm FORCE_DO_CMD
+	@$(call do_cmd,objcxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.S FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.s FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+
+
+ifeq ($(strip $(foreach prefix,$(NO_LOAD),\
+    $(findstring $(join ^,$(prefix)),\
+                 $(join ^,bson.target.mk)))),)
+  include bson.target.mk
+endif
+
+quiet_cmd_regen_makefile = ACTION Regenerating $@
+cmd_regen_makefile = /usr/local/Cellar/node/0.10.8/lib/node_modules/npm/node_modules/node-gyp/gyp/gyp -fmake --ignore-environment "--toplevel-dir=." -I/Users/gootyfer/Documents/github/moocrank/node_modules/mongodb/node_modules/bson/build/config.gypi -I/usr/local/Cellar/node/0.10.8/lib/node_modules/npm/node_modules/node-gyp/addon.gypi -I/Users/gootyfer/.node-gyp/0.10.8/common.gypi "--depth=." "-Goutput_dir=." "--generator-output=build" "-Dlibrary=shared_library" "-Dvisibility=default" "-Dnode_root_dir=/Users/gootyfer/.node-gyp/0.10.8" "-Dmodule_root_dir=/Users/gootyfer/Documents/github/moocrank/node_modules/mongodb/node_modules/bson" binding.gyp
+Makefile: $(srcdir)/../../../../../../../.node-gyp/0.10.8/common.gypi $(srcdir)/build/config.gypi $(srcdir)/binding.gyp $(srcdir)/../../../../../../../../../usr/local/Cellar/node/0.10.8/lib/node_modules/npm/node_modules/node-gyp/addon.gypi
+	$(call do_cmd,regen_makefile)
+
+# "all" is a concatenation of the "all" targets from all the included
+# sub-makefiles. This is just here to clarify.
+all:
+
+# Add in dependency-tracking rules.  $(all_deps) is the list of every single
+# target in our tree. Only consider the ones with .d (dependency) info:
+d_files := $(wildcard $(foreach f,$(all_deps),$(depsdir)/$(f).d))
+ifneq ($(d_files),)
+  include $(d_files)
+endif
diff --git a/node_modules/mongodb/node_modules/bson/build/Release/.deps/Release/bson.node.d b/node_modules/mongodb/node_modules/bson/build/Release/.deps/Release/bson.node.d
new file mode 100644
index 0000000..396b6bf
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/build/Release/.deps/Release/bson.node.d
@@ -0,0 +1 @@
+cmd_Release/bson.node := ./gyp-mac-tool flock ./Release/linker.lock c++ -shared -Wl,-search_paths_first -mmacosx-version-min=10.5 -arch x86_64 -L./Release -install_name @rpath/bson.node  -o Release/bson.node Release/obj.target/bson/ext/bson.o -undefined dynamic_lookup
diff --git a/node_modules/mongodb/node_modules/bson/build/Release/.deps/Release/obj.target/bson/ext/bson.o.d b/node_modules/mongodb/node_modules/bson/build/Release/.deps/Release/obj.target/bson/ext/bson.o.d
new file mode 100644
index 0000000..7456b67
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/build/Release/.deps/Release/obj.target/bson/ext/bson.o.d
@@ -0,0 +1,24 @@
+cmd_Release/obj.target/bson/ext/bson.o := c++ '-D_DARWIN_USE_64_BIT_INODE=1' '-D_LARGEFILE_SOURCE' '-D_FILE_OFFSET_BITS=64' '-DBUILDING_NODE_EXTENSION' -I/Users/gootyfer/.node-gyp/0.10.8/src -I/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include -I/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include  -Os -gdwarf-2 -mmacosx-version-min=10.5 -arch x86_64 -Wall -Wendif-labels -W -Wno-unused-parameter -fno-rtti -fno-threadsafe-statics -fno-strict-aliasing -MMD -MF ./Release/.deps/Release/obj.target/bson/ext/bson.o.d.raw  -c -o Release/obj.target/bson/ext/bson.o ../ext/bson.cc
+Release/obj.target/bson/ext/bson.o: ../ext/bson.cc \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8stdint.h \
+  /Users/gootyfer/.node-gyp/0.10.8/src/node.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-unix.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/ngx-queue.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-darwin.h \
+  /Users/gootyfer/.node-gyp/0.10.8/src/node_object_wrap.h \
+  /Users/gootyfer/.node-gyp/0.10.8/src/node_version.h \
+  /Users/gootyfer/.node-gyp/0.10.8/src/node_buffer.h ../ext/bson.h
+../ext/bson.cc:
+/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8stdint.h:
+/Users/gootyfer/.node-gyp/0.10.8/src/node.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-unix.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/ngx-queue.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-darwin.h:
+/Users/gootyfer/.node-gyp/0.10.8/src/node_object_wrap.h:
+/Users/gootyfer/.node-gyp/0.10.8/src/node_version.h:
+/Users/gootyfer/.node-gyp/0.10.8/src/node_buffer.h:
+../ext/bson.h:
diff --git a/node_modules/mongodb/node_modules/bson/build/Release/bson.node b/node_modules/mongodb/node_modules/bson/build/Release/bson.node
new file mode 100755
index 0000000..9a1d56e
Binary files /dev/null and b/node_modules/mongodb/node_modules/bson/build/Release/bson.node differ
diff --git a/node_modules/mongodb/node_modules/bson/build/Release/linker.lock b/node_modules/mongodb/node_modules/bson/build/Release/linker.lock
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mongodb/node_modules/bson/build/Release/obj.target/bson/ext/bson.o b/node_modules/mongodb/node_modules/bson/build/Release/obj.target/bson/ext/bson.o
new file mode 100644
index 0000000..5d3e344
Binary files /dev/null and b/node_modules/mongodb/node_modules/bson/build/Release/obj.target/bson/ext/bson.o differ
diff --git a/node_modules/mongodb/node_modules/bson/build/binding.Makefile b/node_modules/mongodb/node_modules/bson/build/binding.Makefile
new file mode 100644
index 0000000..90bf824
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/build/binding.Makefile
@@ -0,0 +1,6 @@
+# This file is generated by gyp; do not edit.
+
+export builddir_name ?= build/./.
+.PHONY: all
+all:
+	$(MAKE) bson
diff --git a/node_modules/mongodb/node_modules/bson/build/bson.target.mk b/node_modules/mongodb/node_modules/bson/build/bson.target.mk
new file mode 100644
index 0000000..6ff8328
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/build/bson.target.mk
@@ -0,0 +1,154 @@
+# This file is generated by gyp; do not edit.
+
+TOOLSET := target
+TARGET := bson
+DEFS_Debug := \
+	'-D_DARWIN_USE_64_BIT_INODE=1' \
+	'-D_LARGEFILE_SOURCE' \
+	'-D_FILE_OFFSET_BITS=64' \
+	'-DBUILDING_NODE_EXTENSION' \
+	'-DDEBUG' \
+	'-D_DEBUG'
+
+# Flags passed to all source files.
+CFLAGS_Debug := \
+	-O0 \
+	-gdwarf-2 \
+	-mmacosx-version-min=10.5 \
+	-arch x86_64 \
+	-Wall \
+	-Wendif-labels \
+	-W \
+	-Wno-unused-parameter
+
+# Flags passed to only C files.
+CFLAGS_C_Debug := \
+	-fno-strict-aliasing
+
+# Flags passed to only C++ files.
+CFLAGS_CC_Debug := \
+	-fno-rtti \
+	-fno-threadsafe-statics \
+	-fno-strict-aliasing
+
+# Flags passed to only ObjC files.
+CFLAGS_OBJC_Debug :=
+
+# Flags passed to only ObjC++ files.
+CFLAGS_OBJCC_Debug :=
+
+INCS_Debug := \
+	-I/Users/gootyfer/.node-gyp/0.10.8/src \
+	-I/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include \
+	-I/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include
+
+DEFS_Release := \
+	'-D_DARWIN_USE_64_BIT_INODE=1' \
+	'-D_LARGEFILE_SOURCE' \
+	'-D_FILE_OFFSET_BITS=64' \
+	'-DBUILDING_NODE_EXTENSION'
+
+# Flags passed to all source files.
+CFLAGS_Release := \
+	-Os \
+	-gdwarf-2 \
+	-mmacosx-version-min=10.5 \
+	-arch x86_64 \
+	-Wall \
+	-Wendif-labels \
+	-W \
+	-Wno-unused-parameter
+
+# Flags passed to only C files.
+CFLAGS_C_Release := \
+	-fno-strict-aliasing
+
+# Flags passed to only C++ files.
+CFLAGS_CC_Release := \
+	-fno-rtti \
+	-fno-threadsafe-statics \
+	-fno-strict-aliasing
+
+# Flags passed to only ObjC files.
+CFLAGS_OBJC_Release :=
+
+# Flags passed to only ObjC++ files.
+CFLAGS_OBJCC_Release :=
+
+INCS_Release := \
+	-I/Users/gootyfer/.node-gyp/0.10.8/src \
+	-I/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include \
+	-I/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include
+
+OBJS := \
+	$(obj).target/$(TARGET)/ext/bson.o
+
+# Add to the list of files we specially track dependencies for.
+all_deps += $(OBJS)
+
+# CFLAGS et al overrides must be target-local.
+# See "Target-specific Variable Values" in the GNU Make manual.
+$(OBJS): TOOLSET := $(TOOLSET)
+$(OBJS): GYP_CFLAGS := $(DEFS_$(BUILDTYPE)) $(INCS_$(BUILDTYPE))  $(CFLAGS_$(BUILDTYPE)) $(CFLAGS_C_$(BUILDTYPE))
+$(OBJS): GYP_CXXFLAGS := $(DEFS_$(BUILDTYPE)) $(INCS_$(BUILDTYPE))  $(CFLAGS_$(BUILDTYPE)) $(CFLAGS_CC_$(BUILDTYPE))
+$(OBJS): GYP_OBJCFLAGS := $(DEFS_$(BUILDTYPE)) $(INCS_$(BUILDTYPE))  $(CFLAGS_$(BUILDTYPE)) $(CFLAGS_C_$(BUILDTYPE)) $(CFLAGS_OBJC_$(BUILDTYPE))
+$(OBJS): GYP_OBJCXXFLAGS := $(DEFS_$(BUILDTYPE)) $(INCS_$(BUILDTYPE))  $(CFLAGS_$(BUILDTYPE)) $(CFLAGS_CC_$(BUILDTYPE)) $(CFLAGS_OBJCC_$(BUILDTYPE))
+
+# Suffix rules, putting all outputs into $(obj).
+
+$(obj).$(TOOLSET)/$(TARGET)/%.o: $(srcdir)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+
+# Try building from generated source, too.
+
+$(obj).$(TOOLSET)/$(TARGET)/%.o: $(obj).$(TOOLSET)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+
+$(obj).$(TOOLSET)/$(TARGET)/%.o: $(obj)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+
+# End of this set of suffix rules
+### Rules for final target.
+LDFLAGS_Debug := \
+	-Wl,-search_paths_first \
+	-mmacosx-version-min=10.5 \
+	-arch x86_64 \
+	-L$(builddir) \
+	-install_name @rpath/bson.node
+
+LIBTOOLFLAGS_Debug := \
+	-Wl,-search_paths_first
+
+LDFLAGS_Release := \
+	-Wl,-search_paths_first \
+	-mmacosx-version-min=10.5 \
+	-arch x86_64 \
+	-L$(builddir) \
+	-install_name @rpath/bson.node
+
+LIBTOOLFLAGS_Release := \
+	-Wl,-search_paths_first
+
+LIBS := \
+	-undefined dynamic_lookup
+
+$(builddir)/bson.node: GYP_LDFLAGS := $(LDFLAGS_$(BUILDTYPE))
+$(builddir)/bson.node: LIBS := $(LIBS)
+$(builddir)/bson.node: GYP_LIBTOOLFLAGS := $(LIBTOOLFLAGS_$(BUILDTYPE))
+$(builddir)/bson.node: TOOLSET := $(TOOLSET)
+$(builddir)/bson.node: $(OBJS) FORCE_DO_CMD
+	$(call do_cmd,solink_module)
+
+all_deps += $(builddir)/bson.node
+# Add target alias
+.PHONY: bson
+bson: $(builddir)/bson.node
+
+# Short alias for building this executable.
+.PHONY: bson.node
+bson.node: $(builddir)/bson.node
+
+# Add executable to "all" target.
+.PHONY: all
+all: $(builddir)/bson.node
+
diff --git a/node_modules/mongodb/node_modules/bson/build/config.gypi b/node_modules/mongodb/node_modules/bson/build/config.gypi
new file mode 100644
index 0000000..f950c42
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/build/config.gypi
@@ -0,0 +1,111 @@
+# Do not edit. File was generated by node-gyp's "configure" step
+{
+  "target_defaults": {
+    "cflags": [],
+    "default_configuration": "Release",
+    "defines": [],
+    "include_dirs": [],
+    "libraries": []
+  },
+  "variables": {
+    "clang": 1,
+    "host_arch": "x64",
+    "node_install_npm": "true",
+    "node_prefix": "/usr/local/Cellar/node/0.10.8",
+    "node_shared_cares": "false",
+    "node_shared_http_parser": "false",
+    "node_shared_libuv": "false",
+    "node_shared_openssl": "false",
+    "node_shared_v8": "false",
+    "node_shared_zlib": "false",
+    "node_tag": "",
+    "node_unsafe_optimizations": 0,
+    "node_use_dtrace": "true",
+    "node_use_etw": "false",
+    "node_use_openssl": "true",
+    "node_use_perfctr": "false",
+    "python": "/usr/bin/python",
+    "target_arch": "x64",
+    "v8_enable_gdbjit": 0,
+    "v8_no_strict_aliasing": 1,
+    "v8_use_snapshot": "true",
+    "nodedir": "/Users/gootyfer/.node-gyp/0.10.8",
+    "copy_dev_lib": "true",
+    "standalone_static_library": 1,
+    "save_dev": "",
+    "browser": "",
+    "viewer": "man",
+    "rollback": "true",
+    "usage": "",
+    "globalignorefile": "/usr/local/share/npm/etc/npmignore",
+    "init_author_url": "",
+    "shell": "/bin/bash",
+    "parseable": "",
+    "userignorefile": "/Users/gootyfer/.npmignore",
+    "cache_max": "null",
+    "init_author_email": "",
+    "sign_git_tag": "",
+    "ignore": "",
+    "long": "",
+    "registry": "https://registry.npmjs.org/",
+    "fetch_retries": "2",
+    "npat": "",
+    "message": "%s",
+    "versions": "",
+    "globalconfig": "/usr/local/share/npm/etc/npmrc",
+    "always_auth": "",
+    "cache_lock_retries": "10",
+    "fetch_retry_mintimeout": "10000",
+    "proprietary_attribs": "true",
+    "coverage": "",
+    "json": "",
+    "pre": "",
+    "description": "true",
+    "engine_strict": "",
+    "https_proxy": "",
+    "init_module": "/Users/gootyfer/.npm-init.js",
+    "userconfig": "/Users/gootyfer/.npmrc",
+    "npaturl": "http://npat.npmjs.org/",
+    "node_version": "v0.10.8",
+    "user": "501",
+    "editor": "vi",
+    "save": "",
+    "tag": "latest",
+    "global": "",
+    "optional": "true",
+    "username": "",
+    "bin_links": "true",
+    "force": "",
+    "searchopts": "",
+    "depth": "null",
+    "rebuild_bundle": "true",
+    "searchsort": "name",
+    "unicode": "true",
+    "yes": "",
+    "fetch_retry_maxtimeout": "60000",
+    "strict_ssl": "true",
+    "dev": "",
+    "fetch_retry_factor": "10",
+    "group": "20",
+    "cache_lock_stale": "60000",
+    "version": "",
+    "cache_min": "10",
+    "cache": "/Users/gootyfer/.npm",
+    "searchexclude": "",
+    "color": "true",
+    "save_optional": "",
+    "user_agent": "node/v0.10.8 darwin x64",
+    "cache_lock_wait": "10000",
+    "production": "",
+    "save_bundle": "",
+    "init_version": "0.0.0",
+    "umask": "18",
+    "git": "git",
+    "init_author_name": "",
+    "onload_script": "",
+    "tmp": "/var/folders/v1/5nckjtlj63ddnl8s01cwl8pr0000gn/T/",
+    "unsafe_perm": "true",
+    "prefix": "/usr/local/share/npm",
+    "link": ""
+  }
+}
diff --git a/node_modules/mongodb/node_modules/bson/build/gyp-mac-tool b/node_modules/mongodb/node_modules/bson/build/gyp-mac-tool
new file mode 100755
index 0000000..bf059c3
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/build/gyp-mac-tool
@@ -0,0 +1,211 @@
+#!/usr/bin/env python
+# Generated by gyp. Do not edit.
+# Copyright (c) 2012 Google Inc. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+"""Utility functions to perform Xcode-style build steps.
+
+These functions are executed via gyp-mac-tool when using the Makefile generator.
+"""
+
+import fcntl
+import os
+import plistlib
+import re
+import shutil
+import string
+import subprocess
+import sys
+
+
+def main(args):
+  executor = MacTool()
+  exit_code = executor.Dispatch(args)
+  if exit_code is not None:
+    sys.exit(exit_code)
+
+
+class MacTool(object):
+  """This class performs all the Mac tooling steps. The methods can either be
+  executed directly, or dispatched from an argument list."""
+
+  def Dispatch(self, args):
+    """Dispatches a string command to a method."""
+    if len(args) < 1:
+      raise Exception("Not enough arguments")
+
+    method = "Exec%s" % self._CommandifyName(args[0])
+    return getattr(self, method)(*args[1:])
+
+  def _CommandifyName(self, name_string):
+    """Transforms a tool name like copy-info-plist to CopyInfoPlist"""
+    return name_string.title().replace('-', '')
+
+  def ExecCopyBundleResource(self, source, dest):
+    """Copies a resource file to the bundle/Resources directory, performing any
+    necessary compilation on each resource."""
+    extension = os.path.splitext(source)[1].lower()
+    if os.path.isdir(source):
+      # Copy tree.
+      if os.path.exists(dest):
+        shutil.rmtree(dest)
+      shutil.copytree(source, dest)
+    elif extension == '.xib':
+      return self._CopyXIBFile(source, dest)
+    elif extension == '.strings':
+      self._CopyStringsFile(source, dest)
+    else:
+      shutil.copyfile(source, dest)
+
+  def _CopyXIBFile(self, source, dest):
+    """Compiles a XIB file with ibtool into a binary plist in the bundle."""
+    tools_dir = os.environ.get('DEVELOPER_BIN_DIR', '/usr/bin')
+    args = [os.path.join(tools_dir, 'ibtool'), '--errors', '--warnings',
+        '--notices', '--output-format', 'human-readable-text', '--compile',
+        dest, source]
+    ibtool_section_re = re.compile(r'/\*.*\*/')
+    ibtool_re = re.compile(r'.*note:.*is clipping its content')
+    ibtoolout = subprocess.Popen(args, stdout=subprocess.PIPE)
+    current_section_header = None
+    for line in ibtoolout.stdout:
+      if ibtool_section_re.match(line):
+        current_section_header = line
+      elif not ibtool_re.match(line):
+        if current_section_header:
+          sys.stdout.write(current_section_header)
+          current_section_header = None
+        sys.stdout.write(line)
+    return ibtoolout.returncode
+
+  def _CopyStringsFile(self, source, dest):
+    """Copies a .strings file using iconv to reconvert the input into UTF-16."""
+    input_code = self._DetectInputEncoding(source) or "UTF-8"
+    fp = open(dest, 'w')
+    args = ['/usr/bin/iconv', '--from-code', input_code, '--to-code',
+        'UTF-16', source]
+    subprocess.call(args, stdout=fp)
+    fp.close()
+
+  def _DetectInputEncoding(self, file_name):
+    """Reads the first few bytes from file_name and tries to guess the text
+    encoding. Returns None as a guess if it can't detect it."""
+    fp = open(file_name, 'rb')
+    try:
+      header = fp.read(3)
+    except e:
+      fp.close()
+      return None
+    fp.close()
+    if header.startswith("\xFE\xFF"):
+      return "UTF-16BE"
+    elif header.startswith("\xFF\xFE"):
+      return "UTF-16LE"
+    elif header.startswith("\xEF\xBB\xBF"):
+      return "UTF-8"
+    else:
+      return None
+
+  def ExecCopyInfoPlist(self, source, dest):
+    """Copies the |source| Info.plist to the destination directory |dest|."""
+    # Read the source Info.plist into memory.
+    fd = open(source, 'r')
+    lines = fd.read()
+    fd.close()
+
+    # Go through all the environment variables and replace them as variables in
+    # the file.
+    for key in os.environ:
+      if key.startswith('_'):
+        continue
+      evar = '${%s}' % key
+      lines = string.replace(lines, evar, os.environ[key])
+
+    # Write out the file with variables replaced.
+    fd = open(dest, 'w')
+    fd.write(lines)
+    fd.close()
+
+    # Now write out PkgInfo file now that the Info.plist file has been
+    # "compiled".
+    self._WritePkgInfo(dest)
+
+  def _WritePkgInfo(self, info_plist):
+    """This writes the PkgInfo file from the data stored in Info.plist."""
+    plist = plistlib.readPlist(info_plist)
+    if not plist:
+      return
+
+    # Only create PkgInfo for executable types.
+    package_type = plist['CFBundlePackageType']
+    if package_type != 'APPL':
+      return
+
+    # The format of PkgInfo is eight characters, representing the bundle type
+    # and bundle signature, each four characters. If that is missing, four
+    # '?' characters are used instead.
+    signature_code = plist.get('CFBundleSignature', '????')
+    if len(signature_code) != 4:  # Wrong length resets everything, too.
+      signature_code = '?' * 4
+
+    dest = os.path.join(os.path.dirname(info_plist), 'PkgInfo')
+    fp = open(dest, 'w')
+    fp.write('%s%s' % (package_type, signature_code))
+    fp.close()
+
+  def ExecFlock(self, lockfile, *cmd_list):
+    """Emulates the most basic behavior of Linux's flock(1)."""
+    # Rely on exception handling to report errors.
+    fd = os.open(lockfile, os.O_RDONLY|os.O_NOCTTY|os.O_CREAT, 0o666)
+    fcntl.flock(fd, fcntl.LOCK_EX)
+    return subprocess.call(cmd_list)
+
+  def ExecFilterLibtool(self, *cmd_list):
+    """Calls libtool and filters out 'libtool: file: foo.o has no symbols'."""
+    libtool_re = re.compile(r'^libtool: file: .* has no symbols$')
+    libtoolout = subprocess.Popen(cmd_list, stderr=subprocess.PIPE)
+    _, err = libtoolout.communicate()
+    for line in err.splitlines():
+      if not libtool_re.match(line):
+        print >>sys.stderr, line
+    return libtoolout.returncode
+
+  def ExecPackageFramework(self, framework, version):
+    """Takes a path to Something.framework and the Current version of that and
+    sets up all the symlinks."""
+    # Find the name of the binary based on the part before the ".framework".
+    binary = os.path.basename(framework).split('.')[0]
+
+    CURRENT = 'Current'
+    RESOURCES = 'Resources'
+    VERSIONS = 'Versions'
+
+    if not os.path.exists(os.path.join(framework, VERSIONS, version, binary)):
+      # Binary-less frameworks don't seem to contain symlinks (see e.g.
+      # chromium's out/Debug/org.chromium.Chromium.manifest/ bundle).
+      return
+
+    # Move into the framework directory to set the symlinks correctly.
+    pwd = os.getcwd()
+    os.chdir(framework)
+
+    # Set up the Current version.
+    self._Relink(version, os.path.join(VERSIONS, CURRENT))
+
+    # Set up the root symlinks.
+    self._Relink(os.path.join(VERSIONS, CURRENT, binary), binary)
+    self._Relink(os.path.join(VERSIONS, CURRENT, RESOURCES), RESOURCES)
+
+    # Back to where we were before!
+    os.chdir(pwd)
+
+  def _Relink(self, dest, link):
+    """Creates a symlink to |dest| named |link|. If |link| already exists,
+    it is overwritten."""
+    if os.path.lexists(link):
+      os.remove(link)
+    os.symlink(dest, link)
+
+
+if __name__ == '__main__':
+  sys.exit(main(sys.argv[1:]))
diff --git a/node_modules/mongodb/node_modules/bson/build_browser.js b/node_modules/mongodb/node_modules/bson/build_browser.js
new file mode 100644
index 0000000..bb80238
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/build_browser.js
@@ -0,0 +1,7 @@
+require('one');
+
+one('./package.json')
+  .tie('bson', BSON)
+  // .exclude('buffer')
+  .tie('buffer', {})
+  .save('./browser_build/bson.js')
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/builderror.log b/node_modules/mongodb/node_modules/bson/builderror.log
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mongodb/node_modules/bson/ext/Makefile b/node_modules/mongodb/node_modules/bson/ext/Makefile
new file mode 100644
index 0000000..435999e
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/ext/Makefile
@@ -0,0 +1,28 @@
+NODE = node
+name = all
+JOBS = 1
+
+all:
+	rm -rf build .lock-wscript bson.node
+	node-waf configure build
+	cp -R ./build/Release/bson.node . || true
+
+all_debug:
+	rm -rf build .lock-wscript bson.node
+	node-waf --debug configure build
+	cp -R ./build/Release/bson.node . || true
+
+clang:
+	rm -rf build .lock-wscript bson.node
+	CXX=clang node-waf configure build
+	cp -R ./build/Release/bson.node . || true
+
+clang_debug:
+	rm -rf build .lock-wscript bson.node
+	CXX=clang node-waf --debug configure build
+	cp -R ./build/Release/bson.node . || true
+
+clean:
+	rm -rf build .lock-wscript bson.node
+
+.PHONY: all
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/ext/bson.cc b/node_modules/mongodb/node_modules/bson/ext/bson.cc
new file mode 100644
index 0000000..b910d79
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/ext/bson.cc
@@ -0,0 +1,1006 @@
+//===========================================================================
+
+#include <stdarg.h>
+#include <cstdlib>
+#include <cstring>
+#include <string.h>
+#include <stdlib.h>
+
+#ifdef __clang__
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wunused-parameter"
+#endif
+
+#include <v8.h>
+
+// this and the above block must be around the v8.h header otherwise
+// v8 is not happy
+#ifdef __clang__
+#pragma clang diagnostic pop
+#endif
+
+#include <node.h>
+#include <node_version.h>
+#include <node_buffer.h>
+
+#include <cmath>
+#include <iostream>
+#include <limits>
+#include <vector>
+
+#ifdef __sun
+	#include <alloca.h>
+#endif
+
+#include "bson.h"
+
+using namespace v8;
+using namespace node;
+
+//===========================================================================
+
+void DataStream::WriteObjectId(const Handle<Object>& object, const Handle<String>& key)
+{
+	uint16_t buffer[12];
+	object->Get(key)->ToString()->Write(buffer, 0, 12);
+	for(uint32_t i = 0; i < 12; ++i)
+	{
+		*p++ = (char) buffer[i];
+	}
+}
+
+void ThrowAllocatedStringException(size_t allocationSize, const char* format, ...)
+{
+	va_list args;
+	va_start(args, format);
+	char* string = (char*) malloc(allocationSize);
+	vsprintf(string, format, args);
+	va_end(args);
+
+	throw string;
+}
+
+void DataStream::CheckKey(const Local<String>& keyName)
+{
+	size_t keyLength = keyName->Utf8Length();
+	if(keyLength == 0) return;
+
+	char* keyStringBuffer = (char*) alloca(keyLength+1);
+	keyName->WriteUtf8(keyStringBuffer);
+
+	if(keyStringBuffer[0] == '$')
+	{
+		ThrowAllocatedStringException(64+keyLength, "key %s must not start with '$'", keyStringBuffer);
+	}
+
+	if(strchr(keyStringBuffer, '.') != NULL)
+	{
+		ThrowAllocatedStringException(64+keyLength, "key %s must not contain '.'", keyStringBuffer);
+	}
+}
+
+template<typename T> void BSONSerializer<T>::SerializeDocument(const Handle<Value>& value)
+{
+	void* documentSize = this->BeginWriteSize();
+	Local<Object> object = bson->GetSerializeObject(value);
+
+	// Get the object property names
+	#if NODE_MAJOR_VERSION == 0 && NODE_MINOR_VERSION < 6
+    Local<Array> propertyNames = object->GetPropertyNames();
+  #else
+    Local<Array> propertyNames = object->GetOwnPropertyNames();
+  #endif
+
+	// Length of the property
+	int propertyLength = propertyNames->Length();
+	for(int i = 0;  i < propertyLength; ++i)
+	{
+		const Local<String>& propertyName = propertyNames->Get(i)->ToString();
+		if(checkKeys) this->CheckKey(propertyName);
+
+		const Local<Value>& propertyValue = object->Get(propertyName);
+
+		if(serializeFunctions || !propertyValue->IsFunction())
+		{
+			void* typeLocation = this->BeginWriteType();
+			this->WriteString(propertyName);
+			SerializeValue(typeLocation, propertyValue);
+		}
+	}
+
+	this->WriteByte(0);
+	this->CommitSize(documentSize);
+}
+
+template<typename T> void BSONSerializer<T>::SerializeArray(const Handle<Value>& value)
+{
+	void* documentSize = this->BeginWriteSize();
+
+	Local<Array> array = Local<Array>::Cast(value->ToObject());
+	uint32_t arrayLength = array->Length();
+
+	for(uint32_t i = 0;  i < arrayLength; ++i)
+	{
+		void* typeLocation = this->BeginWriteType();
+		this->WriteUInt32String(i);
+		SerializeValue(typeLocation, array->Get(i));
+	}
+
+	this->WriteByte(0);
+	this->CommitSize(documentSize);
+}
+
+// This is templated so that we can use this function to both count the number of bytes, and to serialize those bytes.
+// The template approach eliminates almost all of the inspection of values unless they're required (eg. string lengths)
+// and ensures that there is always consistency between bytes counted and bytes written by design.
+template<typename T> void BSONSerializer<T>::SerializeValue(void* typeLocation, const Handle<Value>& value)
+{
+	if(value->IsNumber())
+	{
+		double doubleValue = value->NumberValue();
+		int intValue = (int) doubleValue;
+		if(intValue == doubleValue)
+		{
+			this->CommitType(typeLocation, BSON_TYPE_INT);
+			this->WriteInt32(intValue);
+		}
+		else
+		{
+			this->CommitType(typeLocation, BSON_TYPE_NUMBER);
+			this->WriteDouble(doubleValue);
+		}
+	}
+	else if(value->IsString())
+	{
+		this->CommitType(typeLocation, BSON_TYPE_STRING);
+		this->WriteLengthPrefixedString(value->ToString());
+	}
+	else if(value->IsBoolean())
+	{
+		this->CommitType(typeLocation, BSON_TYPE_BOOLEAN);
+		this->WriteBool(value);
+	}
+	else if(value->IsArray())
+	{
+		this->CommitType(typeLocation, BSON_TYPE_ARRAY);
+		SerializeArray(value);
+	}
+	else if(value->IsDate())
+	{
+		this->CommitType(typeLocation, BSON_TYPE_DATE);
+		this->WriteInt64(value);
+	}
+	else if(value->IsRegExp())
+	{
+		this->CommitType(typeLocation, BSON_TYPE_REGEXP);
+		const Handle<RegExp>& regExp = Handle<RegExp>::Cast(value);
+
+		this->WriteString(regExp->GetSource());
+
+		int flags = regExp->GetFlags();
+		if(flags & RegExp::kGlobal) this->WriteByte('s');
+		if(flags & RegExp::kIgnoreCase) this->WriteByte('i');
+		if(flags & RegExp::kMultiline) this->WriteByte('m');
+		this->WriteByte(0);
+	}
+	else if(value->IsFunction())
+	{
+		this->CommitType(typeLocation, BSON_TYPE_CODE);
+		this->WriteLengthPrefixedString(value->ToString());
+	}
+	else if(value->IsObject())
+	{
+		const Local<Object>& object = value->ToObject();
+		if(object->Has(bson->_bsontypeString))
+		{
+			const Local<String>& constructorString = object->GetConstructorName();
+			if(bson->longString->StrictEquals(constructorString))
+			{
+				this->CommitType(typeLocation, BSON_TYPE_LONG);
+				this->WriteInt32(object, bson->_longLowString);
+				this->WriteInt32(object, bson->_longHighString);
+			}
+			else if(bson->timestampString->StrictEquals(constructorString))
+			{
+				this->CommitType(typeLocation, BSON_TYPE_TIMESTAMP);
+				this->WriteInt32(object, bson->_longLowString);
+				this->WriteInt32(object, bson->_longHighString);
+			}
+			else if(bson->objectIDString->StrictEquals(constructorString))
+			{
+				this->CommitType(typeLocation, BSON_TYPE_OID);
+				this->WriteObjectId(object, bson->_objectIDidString);
+			}
+			else if(bson->binaryString->StrictEquals(constructorString))
+			{
+				this->CommitType(typeLocation, BSON_TYPE_BINARY);
+
+				uint32_t length = object->Get(bson->_binaryPositionString)->Uint32Value();
+				Local<Object> bufferObj = object->Get(bson->_binaryBufferString)->ToObject();
+
+				this->WriteInt32(length);
+				this->WriteByte(object, bson->_binarySubTypeString);	// write subtype
+				// If type 0x02 write the array length aswell
+				if(object->Get(bson->_binarySubTypeString)->Int32Value() == 0x02) {
+					this->WriteInt32(length);
+				}
+				// Write the actual data
+				this->WriteData(Buffer::Data(bufferObj), length);
+			}
+			else if(bson->doubleString->StrictEquals(constructorString))
+			{
+				this->CommitType(typeLocation, BSON_TYPE_NUMBER);
+				this->WriteDouble(object, bson->_doubleValueString);
+			}
+			else if(bson->symbolString->StrictEquals(constructorString))
+			{
+				this->CommitType(typeLocation, BSON_TYPE_SYMBOL);
+				this->WriteLengthPrefixedString(object->Get(bson->_symbolValueString)->ToString());
+			}
+			else if(bson->codeString->StrictEquals(constructorString))
+			{
+				const Local<String>& function = object->Get(bson->_codeCodeString)->ToString();
+				const Local<Object>& scope = object->Get(bson->_codeScopeString)->ToObject();
+
+				// For Node < 0.6.X use the GetPropertyNames
+	      #if NODE_MAJOR_VERSION == 0 && NODE_MINOR_VERSION < 6
+	        uint32_t propertyNameLength = scope->GetPropertyNames()->Length();
+	      #else
+	        uint32_t propertyNameLength = scope->GetOwnPropertyNames()->Length();
+	      #endif
+
+				if(propertyNameLength > 0)
+				{
+					this->CommitType(typeLocation, BSON_TYPE_CODE_W_SCOPE);
+					void* codeWidthScopeSize = this->BeginWriteSize();
+					this->WriteLengthPrefixedString(function->ToString());
+					SerializeDocument(scope);
+					this->CommitSize(codeWidthScopeSize);
+				}
+				else
+				{
+					this->CommitType(typeLocation, BSON_TYPE_CODE);
+					this->WriteLengthPrefixedString(function->ToString());
+				}
+			}
+			else if(bson->dbrefString->StrictEquals(constructorString))
+			{
+				this->CommitType(typeLocation, BSON_TYPE_OBJECT);
+
+				void* dbRefSize = this->BeginWriteSize();
+
+				void* refType = this->BeginWriteType();
+				this->WriteData("$ref", 5);
+				SerializeValue(refType, object->Get(bson->_dbRefNamespaceString));
+
+				void* idType = this->BeginWriteType();
+				this->WriteData("$id", 4);
+				SerializeValue(idType, object->Get(bson->_dbRefOidString));
+
+				const Local<Value>& refDbValue = object->Get(bson->_dbRefDbString);
+				if(!refDbValue->IsUndefined())
+				{
+					void* dbType = this->BeginWriteType();
+					this->WriteData("$db", 4);
+					SerializeValue(dbType, refDbValue);
+				}
+
+				this->WriteByte(0);
+				this->CommitSize(dbRefSize);
+			}
+			else if(bson->minKeyString->StrictEquals(constructorString))
+			{
+				this->CommitType(typeLocation, BSON_TYPE_MIN_KEY);
+			}
+			else if(bson->maxKeyString->StrictEquals(constructorString))
+			{
+				this->CommitType(typeLocation, BSON_TYPE_MAX_KEY);
+			}
+		}
+		else if(Buffer::HasInstance(value))
+		{
+			this->CommitType(typeLocation, BSON_TYPE_BINARY);
+
+	    #if NODE_MAJOR_VERSION == 0 && NODE_MINOR_VERSION < 3
+       Buffer *buffer = ObjectWrap::Unwrap<Buffer>(value->ToObject());
+			 uint32_t length = object->length();
+	    #else
+			 uint32_t length = Buffer::Length(value->ToObject());
+	    #endif
+
+			this->WriteInt32(length);
+			this->WriteByte(0);
+			this->WriteData(Buffer::Data(value->ToObject()), length);
+		}
+		else
+		{
+			this->CommitType(typeLocation, BSON_TYPE_OBJECT);
+			SerializeDocument(value);
+		}
+	}
+	else if(value->IsNull() || value->IsUndefined())
+	{
+		this->CommitType(typeLocation, BSON_TYPE_NULL);
+	}
+}
+
+// Data points to start of element list, length is length of entire document including '\0' but excluding initial size
+BSONDeserializer::BSONDeserializer(BSON* aBson, char* data, size_t length)
+: bson(aBson),
+  pStart(data),
+  p(data),
+  pEnd(data + length - 1)
+{
+	if(*pEnd != '\0') ThrowAllocatedStringException(64, "Missing end of document marker '\\0'");
+}
+
+BSONDeserializer::BSONDeserializer(BSONDeserializer& parentSerializer, size_t length)
+: bson(parentSerializer.bson),
+  pStart(parentSerializer.p),
+  p(parentSerializer.p),
+  pEnd(parentSerializer.p + length - 1)
+{
+	parentSerializer.p += length;
+	if(pEnd > parentSerializer.pEnd) ThrowAllocatedStringException(64, "Child document exceeds parent's bounds");
+	if(*pEnd != '\0') ThrowAllocatedStringException(64, "Missing end of document marker '\\0'");
+}
+
+Local<String> BSONDeserializer::ReadCString()
+{
+	char* start = p;
+	while(*p++) { }
+	return String::New(start, (int32_t) (p-start-1) );
+}
+
+int32_t BSONDeserializer::ReadRegexOptions()
+{
+	int32_t options = 0;
+	for(;;)
+	{
+		switch(*p++)
+		{
+		case '\0': return options;
+		case 's': options |= RegExp::kGlobal; break;
+		case 'i': options |= RegExp::kIgnoreCase; break;
+		case 'm': options |= RegExp::kMultiline; break;
+		}
+	}
+}
+
+uint32_t BSONDeserializer::ReadIntegerString()
+{
+	uint32_t value = 0;
+	while(*p)
+	{
+		if(*p < '0' || *p > '9') ThrowAllocatedStringException(64, "Invalid key for array");
+		value = value * 10 + *p++ - '0';
+	}
+	++p;
+	return value;
+}
+
+Local<String> BSONDeserializer::ReadString()
+{
+	uint32_t length = ReadUInt32();
+	char* start = p;
+	p += length;
+	return String::New(start, length-1);
+}
+
+Local<String> BSONDeserializer::ReadObjectId()
+{
+	uint16_t objectId[12];
+	for(size_t i = 0; i < 12; ++i)
+	{
+		objectId[i] = *reinterpret_cast<unsigned char*>(p++);
+	}
+	return String::New(objectId, 12);
+}
+
+Handle<Value> BSONDeserializer::DeserializeDocument()
+{
+	uint32_t length = ReadUInt32();
+	if(length < 5) ThrowAllocatedStringException(64, "Bad BSON: Document is less than 5 bytes");
+
+	BSONDeserializer documentDeserializer(*this, length-4);
+	return documentDeserializer.DeserializeDocumentInternal();
+}
+
+Handle<Value> BSONDeserializer::DeserializeDocumentInternal()
+{
+	Local<Object> returnObject = Object::New();
+
+	while(HasMoreData())
+	{
+		BsonType type = (BsonType) ReadByte();
+		const Local<String>& name = ReadCString();
+		const Handle<Value>& value = DeserializeValue(type);
+		returnObject->ForceSet(name, value);
+	}
+	if(p != pEnd) ThrowAllocatedStringException(64, "Bad BSON Document: Serialize consumed unexpected number of bytes");
+
+	// From JavaScript:
+	// if(object['$id'] != null) object = new DBRef(object['$ref'], object['$id'], object['$db']);
+	if(returnObject->Has(bson->_dbRefIdRefString))
+	{
+		Local<Value> argv[] = { returnObject->Get(bson->_dbRefRefString), returnObject->Get(bson->_dbRefIdRefString), returnObject->Get(bson->_dbRefDbRefString) };
+		return bson->dbrefConstructor->NewInstance(3, argv);
+	}
+	else
+	{
+		return returnObject;
+	}
+}
+
+Handle<Value> BSONDeserializer::DeserializeArray()
+{
+	uint32_t length = ReadUInt32();
+	if(length < 5) ThrowAllocatedStringException(64, "Bad BSON: Array Document is less than 5 bytes");
+
+	BSONDeserializer documentDeserializer(*this, length-4);
+	return documentDeserializer.DeserializeArrayInternal();
+}
+
+Handle<Value> BSONDeserializer::DeserializeArrayInternal()
+{
+	Local<Array> returnArray = Array::New();
+
+	while(HasMoreData())
+	{
+		BsonType type = (BsonType) ReadByte();
+		uint32_t index = ReadIntegerString();
+		const Handle<Value>& value = DeserializeValue(type);
+		returnArray->Set(index, value);
+	}
+	if(p != pEnd) ThrowAllocatedStringException(64, "Bad BSON Array: Serialize consumed unexpected number of bytes");
+
+	return returnArray;
+}
+
+Handle<Value> BSONDeserializer::DeserializeValue(BsonType type)
+{
+	switch(type)
+	{
+	case BSON_TYPE_STRING:
+		return ReadString();
+
+	case BSON_TYPE_INT:
+		return Integer::New(ReadInt32());
+
+	case BSON_TYPE_NUMBER:
+		return Number::New(ReadDouble());
+
+	case BSON_TYPE_NULL:
+		return Null();
+
+	case BSON_TYPE_UNDEFINED:
+		return Undefined();
+
+	case BSON_TYPE_TIMESTAMP:
+		{
+			int32_t lowBits = ReadInt32();
+			int32_t highBits = ReadInt32();
+			Local<Value> argv[] = { Int32::New(lowBits), Int32::New(highBits) };
+			return bson->timestampConstructor->NewInstance(2, argv);
+		}
+
+	case BSON_TYPE_BOOLEAN:
+		return (ReadByte() != 0) ? True() : False();
+
+	case BSON_TYPE_REGEXP:
+		{
+			const Local<String>& regex = ReadCString();
+			int32_t options = ReadRegexOptions();
+			return RegExp::New(regex, (RegExp::Flags) options);
+		}
+
+	case BSON_TYPE_CODE:
+		{
+			const Local<Value>& code = ReadString();
+			const Local<Value>& scope = Object::New();
+			Local<Value> argv[] = { code, scope };
+			return bson->codeConstructor->NewInstance(2, argv);
+		}
+
+	case BSON_TYPE_CODE_W_SCOPE:
+		{
+			ReadUInt32();
+			const Local<Value>& code = ReadString();
+			const Handle<Value>& scope = DeserializeDocument();
+			Local<Value> argv[] = { code, scope->ToObject() };
+			return bson->codeConstructor->NewInstance(2, argv);
+		}
+
+	case BSON_TYPE_OID:
+		{
+			Local<Value> argv[] = { ReadObjectId() };
+			return bson->objectIDConstructor->NewInstance(1, argv);
+		}
+
+	case BSON_TYPE_BINARY:
+		{
+			uint32_t length = ReadUInt32();
+			uint32_t subType = ReadByte();
+			if(subType == 0x02) {
+				length = ReadInt32();
+			}
+
+			Buffer* buffer = Buffer::New(p, length);
+			p += length;
+
+			Handle<Value> argv[] = { buffer->handle_, Uint32::New(subType) };
+			return bson->binaryConstructor->NewInstance(2, argv);
+		}
+
+	case BSON_TYPE_LONG:
+		{
+			// Read 32 bit integers
+			int32_t lowBits = (int32_t) ReadInt32();
+			int32_t highBits = (int32_t) ReadInt32();
+
+		    // If value is < 2^53 and >-2^53
+		    if((highBits < 0x200000 || (highBits == 0x200000 && lowBits == 0)) && highBits >= -0x200000) {
+			  // Adjust the pointer and read as 64 bit value
+			  p -= 8;
+			  // Read the 64 bit value
+		      int64_t finalValue = (int64_t) ReadInt64();
+		      return Number::New(finalValue);
+		    }
+
+			Local<Value> argv[] = { Int32::New(lowBits), Int32::New(highBits) };
+			return bson->longConstructor->NewInstance(2, argv);
+		}
+
+	case BSON_TYPE_DATE:
+		return Date::New((double) ReadInt64());
+
+	case BSON_TYPE_ARRAY:
+		return DeserializeArray();
+
+	case BSON_TYPE_OBJECT:
+		return DeserializeDocument();
+
+	case BSON_TYPE_SYMBOL:
+		{
+			const Local<String>& string = ReadString();
+			Local<Value> argv[] = { string };
+			return bson->symbolConstructor->NewInstance(1, argv);
+		}
+
+	case BSON_TYPE_MIN_KEY:
+		return bson->minKeyConstructor->NewInstance();
+
+	case BSON_TYPE_MAX_KEY:
+		return bson->maxKeyConstructor->NewInstance();
+
+	default:
+		ThrowAllocatedStringException(64, "Unhandled BSON Type: %d", type);
+	}
+
+	return v8::Null();
+}
+
+
+static Handle<Value> VException(const char *msg)
+{
+	HandleScope scope;
+	return ThrowException(Exception::Error(String::New(msg)));
+}
+
+Persistent<FunctionTemplate> BSON::constructor_template;
+
+BSON::BSON() : ObjectWrap()
+{
+	// Setup pre-allocated comparision objects
+	_bsontypeString = Persistent<String>::New(String::New("_bsontype"));
+	_longLowString = Persistent<String>::New(String::New("low_"));
+	_longHighString = Persistent<String>::New(String::New("high_"));
+	_objectIDidString = Persistent<String>::New(String::New("id"));
+	_binaryPositionString = Persistent<String>::New(String::New("position"));
+	_binarySubTypeString = Persistent<String>::New(String::New("sub_type"));
+	_binaryBufferString = Persistent<String>::New(String::New("buffer"));
+	_doubleValueString = Persistent<String>::New(String::New("value"));
+	_symbolValueString = Persistent<String>::New(String::New("value"));
+	_dbRefRefString = Persistent<String>::New(String::New("$ref"));
+	_dbRefIdRefString = Persistent<String>::New(String::New("$id"));
+	_dbRefDbRefString = Persistent<String>::New(String::New("$db"));
+	_dbRefNamespaceString = Persistent<String>::New(String::New("namespace"));
+	_dbRefDbString = Persistent<String>::New(String::New("db"));
+	_dbRefOidString = Persistent<String>::New(String::New("oid"));
+	_codeCodeString = Persistent<String>::New(String::New("code"));
+	_codeScopeString = Persistent<String>::New(String::New("scope"));
+	_toBSONString = Persistent<String>::New(String::New("toBSON"));
+
+	longString = Persistent<String>::New(String::New("Long"));
+	objectIDString = Persistent<String>::New(String::New("ObjectID"));
+	binaryString = Persistent<String>::New(String::New("Binary"));
+	codeString = Persistent<String>::New(String::New("Code"));
+	dbrefString = Persistent<String>::New(String::New("DBRef"));
+	symbolString = Persistent<String>::New(String::New("Symbol"));
+	doubleString = Persistent<String>::New(String::New("Double"));
+	timestampString = Persistent<String>::New(String::New("Timestamp"));
+	minKeyString = Persistent<String>::New(String::New("MinKey"));
+	maxKeyString = Persistent<String>::New(String::New("MaxKey"));
+}
+
+void BSON::Initialize(v8::Handle<v8::Object> target)
+{
+	// Grab the scope of the call from Node
+	HandleScope scope;
+	// Define a new function template
+	Local<FunctionTemplate> t = FunctionTemplate::New(New);
+	constructor_template = Persistent<FunctionTemplate>::New(t);
+	constructor_template->InstanceTemplate()->SetInternalFieldCount(1);
+	constructor_template->SetClassName(String::NewSymbol("BSON"));
+
+	// Instance methods
+	NODE_SET_PROTOTYPE_METHOD(constructor_template, "calculateObjectSize", CalculateObjectSize);
+	NODE_SET_PROTOTYPE_METHOD(constructor_template, "serialize", BSONSerialize);
+	NODE_SET_PROTOTYPE_METHOD(constructor_template, "serializeWithBufferAndIndex", SerializeWithBufferAndIndex);
+	NODE_SET_PROTOTYPE_METHOD(constructor_template, "deserialize", BSONDeserialize);
+	NODE_SET_PROTOTYPE_METHOD(constructor_template, "deserializeStream", BSONDeserializeStream);
+
+	target->ForceSet(String::NewSymbol("BSON"), constructor_template->GetFunction());
+}
+
+// Create a new instance of BSON and passing it the existing context
+Handle<Value> BSON::New(const Arguments &args)
+{
+	HandleScope scope;
+
+	// Check that we have an array
+	if(args.Length() == 1 && args[0]->IsArray())
+	{
+		// Cast the array to a local reference
+		Local<Array> array = Local<Array>::Cast(args[0]);
+
+		if(array->Length() > 0)
+		{
+			// Create a bson object instance and return it
+			BSON *bson = new BSON();
+
+			uint32_t foundClassesMask = 0;
+
+			// Iterate over all entries to save the instantiate funtions
+			for(uint32_t i = 0; i < array->Length(); i++) {
+				// Let's get a reference to the function
+				Local<Function> func = Local<Function>::Cast(array->Get(i));
+				Local<String> functionName = func->GetName()->ToString();
+
+				// Save the functions making them persistant handles (they don't get collected)
+				if(functionName->StrictEquals(bson->longString)) {
+					bson->longConstructor = Persistent<Function>::New(func);
+					foundClassesMask |= 1;
+				} else if(functionName->StrictEquals(bson->objectIDString)) {
+					bson->objectIDConstructor = Persistent<Function>::New(func);
+					foundClassesMask |= 2;
+				} else if(functionName->StrictEquals(bson->binaryString)) {
+					bson->binaryConstructor = Persistent<Function>::New(func);
+					foundClassesMask |= 4;
+				} else if(functionName->StrictEquals(bson->codeString)) {
+					bson->codeConstructor = Persistent<Function>::New(func);
+					foundClassesMask |= 8;
+				} else if(functionName->StrictEquals(bson->dbrefString)) {
+					bson->dbrefConstructor = Persistent<Function>::New(func);
+					foundClassesMask |= 0x10;
+				} else if(functionName->StrictEquals(bson->symbolString)) {
+					bson->symbolConstructor = Persistent<Function>::New(func);
+					foundClassesMask |= 0x20;
+				} else if(functionName->StrictEquals(bson->doubleString)) {
+					bson->doubleConstructor = Persistent<Function>::New(func);
+					foundClassesMask |= 0x40;
+				} else if(functionName->StrictEquals(bson->timestampString)) {
+					bson->timestampConstructor = Persistent<Function>::New(func);
+					foundClassesMask |= 0x80;
+				} else if(functionName->StrictEquals(bson->minKeyString)) {
+					bson->minKeyConstructor = Persistent<Function>::New(func);
+					foundClassesMask |= 0x100;
+				} else if(functionName->StrictEquals(bson->maxKeyString)) {
+					bson->maxKeyConstructor = Persistent<Function>::New(func);
+					foundClassesMask |= 0x200;
+				}
+			}
+
+			// Check if we have the right number of constructors otherwise throw an error
+			if(foundClassesMask != 0x3ff) {
+				delete bson;
+				return VException("Missing function constructor for either [Long/ObjectID/Binary/Code/DbRef/Symbol/Double/Timestamp/MinKey/MaxKey]");
+			} else {
+				bson->Wrap(args.This());
+				return args.This();
+			}
+		}
+		else
+		{
+			return VException("No types passed in");
+		}
+	}
+	else
+	{
+		return VException("Argument passed in must be an array of types");
+	}
+}
+
+//------------------------------------------------------------------------------------------------
+//------------------------------------------------------------------------------------------------
+//------------------------------------------------------------------------------------------------
+//------------------------------------------------------------------------------------------------
+
+Handle<Value> BSON::BSONDeserialize(const Arguments &args)
+{
+	HandleScope scope;
+
+	// Ensure that we have an parameter
+	if(Buffer::HasInstance(args[0]) && args.Length() > 1) return VException("One argument required - buffer1.");
+	if(args[0]->IsString() && args.Length() > 1) return VException("One argument required - string1.");
+	// Throw an exception if the argument is not of type Buffer
+	if(!Buffer::HasInstance(args[0]) && !args[0]->IsString()) return VException("Argument must be a Buffer or String.");
+
+	// Define pointer to data
+	Local<Object> obj = args[0]->ToObject();
+
+	// Unpack the BSON parser instance
+	BSON *bson = ObjectWrap::Unwrap<BSON>(args.This());
+
+	// If we passed in a buffer, let's unpack it, otherwise let's unpack the string
+	if(Buffer::HasInstance(obj))
+	{
+#if NODE_MAJOR_VERSION == 0 && NODE_MINOR_VERSION < 3
+		Buffer *buffer = ObjectWrap::Unwrap<Buffer>(obj);
+		char* data = buffer->data();
+		size_t length = buffer->length();
+#else
+		char* data = Buffer::Data(obj);
+		size_t length = Buffer::Length(obj);
+#endif
+
+		// Validate that we have at least 5 bytes
+		if(length < 5) return VException("corrupt bson message < 5 bytes long");
+
+		try
+		{
+			BSONDeserializer deserializer(bson, data, length);
+			return deserializer.DeserializeDocument();
+		}
+		catch(char* exception)
+		{
+			Handle<Value> error = VException(exception);
+			free(exception);
+			return error;
+		}
+
+	}
+	else
+	{
+		// The length of the data for this encoding
+		ssize_t len = DecodeBytes(args[0], BINARY);
+
+		// Validate that we have at least 5 bytes
+		if(len < 5) return VException("corrupt bson message < 5 bytes long");
+
+		// Let's define the buffer size
+		char* data = (char *)malloc(len);
+		DecodeWrite(data, len, args[0], BINARY);
+
+		try
+		{
+			BSONDeserializer deserializer(bson, data, len);
+			Handle<Value> result = deserializer.DeserializeDocument();
+			free(data);
+			return result;
+
+		}
+		catch(char* exception)
+		{
+			Handle<Value> error = VException(exception);
+			free(exception);
+			free(data);
+			return error;
+		}
+	}
+}
+
+Local<Object> BSON::GetSerializeObject(const Handle<Value>& argValue)
+{
+	Local<Object> object = argValue->ToObject();
+	if(object->Has(_toBSONString))
+	{
+		const Local<Value>& toBSON = object->Get(_toBSONString);
+		if(!toBSON->IsFunction()) ThrowAllocatedStringException(64, "toBSON is not a function");
+
+		Local<Value> result = Local<Function>::Cast(toBSON)->Call(object, 0, NULL);
+		if(!result->IsObject()) ThrowAllocatedStringException(64, "toBSON function did not return an object");
+		return result->ToObject();
+	}
+	else
+	{
+		return object;
+	}
+}
+
+Handle<Value> BSON::BSONSerialize(const Arguments &args)
+{
+	HandleScope scope;
+
+	if(args.Length() == 1 && !args[0]->IsObject()) return VException("One, two or tree arguments required - [object] or [object, boolean] or [object, boolean, boolean]");
+	if(args.Length() == 2 && !args[0]->IsObject() && !args[1]->IsBoolean()) return VException("One, two or tree arguments required - [object] or [object, boolean] or [object, boolean, boolean]");
+	if(args.Length() == 3 && !args[0]->IsObject() && !args[1]->IsBoolean() && !args[2]->IsBoolean()) return VException("One, two or tree arguments required - [object] or [object, boolean] or [object, boolean, boolean]");
+	if(args.Length() == 4 && !args[0]->IsObject() && !args[1]->IsBoolean() && !args[2]->IsBoolean() && !args[3]->IsBoolean()) return VException("One, two or tree arguments required - [object] or [object, boolean] or [object, boolean, boolean] or [object, boolean, boolean, boolean]");
+	if(args.Length() > 4) return VException("One, two, tree or four arguments required - [object] or [object, boolean] or [object, boolean, boolean] or [object, boolean, boolean, boolean]");
+
+	// Unpack the BSON parser instance
+	BSON *bson = ObjectWrap::Unwrap<BSON>(args.This());
+
+	// Calculate the total size of the document in binary form to ensure we only allocate memory once
+	// With serialize function
+	bool serializeFunctions = (args.Length() >= 4) && args[3]->BooleanValue();
+
+	char *serialized_object = NULL;
+	size_t object_size;
+	try
+	{
+		Local<Object> object = bson->GetSerializeObject(args[0]);
+
+		BSONSerializer<CountStream> counter(bson, false, serializeFunctions);
+		counter.SerializeDocument(object);
+		object_size = counter.GetSerializeSize();
+
+		// Allocate the memory needed for the serialization
+		serialized_object = (char *)malloc(object_size);
+
+		// Check if we have a boolean value
+		bool checkKeys = args.Length() >= 3 && args[1]->IsBoolean() && args[1]->BooleanValue();
+		BSONSerializer<DataStream> data(bson, checkKeys, serializeFunctions, serialized_object);
+		data.SerializeDocument(object);
+	}
+	catch(char *err_msg)
+	{
+		free(serialized_object);
+		Handle<Value> error = VException(err_msg);
+		free(err_msg);
+		return error;
+	}
+
+	// If we have 3 arguments
+	if(args.Length() == 3 || args.Length() == 4)
+	{
+		Buffer *buffer = Buffer::New(serialized_object, object_size);
+		free(serialized_object);
+		return scope.Close(buffer->handle_);
+	}
+	else
+	{
+		Local<Value> bin_value = Encode(serialized_object, object_size, BINARY)->ToString();
+		free(serialized_object);
+		return bin_value;
+	}
+}
+
+Handle<Value> BSON::CalculateObjectSize(const Arguments &args)
+{
+	HandleScope scope;
+	// Ensure we have a valid object
+	if(args.Length() == 1 && !args[0]->IsObject()) return VException("One argument required - [object]");
+	if(args.Length() == 2 && !args[0]->IsObject() && !args[1]->IsBoolean())  return VException("Two arguments required - [object, boolean]");
+	if(args.Length() > 3) return VException("One or two arguments required - [object] or [object, boolean]");
+
+	// Unpack the BSON parser instance
+	BSON *bson = ObjectWrap::Unwrap<BSON>(args.This());
+	bool serializeFunctions = (args.Length() >= 2) && args[1]->BooleanValue();
+	BSONSerializer<CountStream> countSerializer(bson, false, serializeFunctions);
+	countSerializer.SerializeDocument(args[0]);
+
+	// Return the object size
+	return scope.Close(Uint32::New((uint32_t) countSerializer.GetSerializeSize()));
+}
+
+Handle<Value> BSON::SerializeWithBufferAndIndex(const Arguments &args)
+{
+	HandleScope scope;
+
+	//BSON.serializeWithBufferAndIndex = function serializeWithBufferAndIndex(object, ->, buffer, index) {
+	// Ensure we have the correct values
+	if(args.Length() > 5) return VException("Four or five parameters required [object, boolean, Buffer, int] or [object, boolean, Buffer, int, boolean]");
+	if(args.Length() == 4 && !args[0]->IsObject() && !args[1]->IsBoolean() && !Buffer::HasInstance(args[2]) && !args[3]->IsUint32()) return VException("Four parameters required [object, boolean, Buffer, int]");
+	if(args.Length() == 5 && !args[0]->IsObject() && !args[1]->IsBoolean() && !Buffer::HasInstance(args[2]) && !args[3]->IsUint32() && !args[4]->IsBoolean()) return VException("Four parameters required [object, boolean, Buffer, int, boolean]");
+
+	uint32_t index;
+	size_t object_size;
+
+	try
+	{
+		BSON *bson = ObjectWrap::Unwrap<BSON>(args.This());
+
+		Local<Object> obj = args[2]->ToObject();
+		char* data = Buffer::Data(obj);
+		size_t length = Buffer::Length(obj);
+
+		index = args[3]->Uint32Value();
+		bool checkKeys = args.Length() >= 4 && args[1]->IsBoolean() && args[1]->BooleanValue();
+		bool serializeFunctions = (args.Length() == 5) && args[4]->BooleanValue();
+
+		BSONSerializer<DataStream> dataSerializer(bson, checkKeys, serializeFunctions, data+index);
+		dataSerializer.SerializeDocument(bson->GetSerializeObject(args[0]));
+		object_size = dataSerializer.GetSerializeSize();
+
+		if(object_size + index > length) return VException("Serious error - overflowed buffer!!");
+	}
+	catch(char *exception)
+	{
+		Handle<Value> error = VException(exception);
+		free(exception);
+		return error;
+	}
+
+	return scope.Close(Uint32::New((uint32_t) (index + object_size - 1)));
+}
+
+Handle<Value> BSON::BSONDeserializeStream(const Arguments &args)
+{
+	HandleScope scope;
+
+	// At least 3 arguments required
+	if(args.Length() < 5) return VException("Arguments required (Buffer(data), Number(index in data), Number(number of documents to deserialize), Array(results), Number(index in the array), Object(optional))");
+
+	// If the number of argumets equals 3
+	if(args.Length() >= 5)
+	{
+		if(!Buffer::HasInstance(args[0])) return VException("First argument must be Buffer instance");
+		if(!args[1]->IsUint32()) return VException("Second argument must be a positive index number");
+		if(!args[2]->IsUint32()) return VException("Third argument must be a positive number of documents to deserialize");
+		if(!args[3]->IsArray()) return VException("Fourth argument must be an array the size of documents to deserialize");
+		if(!args[4]->IsUint32()) return VException("Sixth argument must be a positive index number");
+	}
+
+	// If we have 4 arguments
+	if(args.Length() == 6 && !args[5]->IsObject()) return VException("Fifth argument must be an object with options");
+
+	// Define pointer to data
+	Local<Object> obj = args[0]->ToObject();
+	uint32_t numberOfDocuments = args[2]->Uint32Value();
+	uint32_t index = args[1]->Uint32Value();
+	uint32_t resultIndex = args[4]->Uint32Value();
+
+	// Unpack the BSON parser instance
+	BSON *bson = ObjectWrap::Unwrap<BSON>(args.This());
+
+	// Unpack the buffer variable
+#if NODE_MAJOR_VERSION == 0 && NODE_MINOR_VERSION < 3
+	Buffer *buffer = ObjectWrap::Unwrap<Buffer>(obj);
+	char* data = buffer->data();
+	size_t length = buffer->length();
+#else
+	char* data = Buffer::Data(obj);
+	size_t length = Buffer::Length(obj);
+#endif
+
+	// Fetch the documents
+	Local<Object> documents = args[3]->ToObject();
+
+	BSONDeserializer deserializer(bson, data+index, length-index);
+	for(uint32_t i = 0; i < numberOfDocuments; i++)
+	{
+		try
+		{
+			documents->Set(i + resultIndex, deserializer.DeserializeDocument());
+		}
+		catch (char* exception)
+		{
+			Handle<Value> error = VException(exception);
+			free(exception);
+			return error;
+		}
+	}
+
+	// Return new index of parsing
+	return scope.Close(Uint32::New((uint32_t) (index + deserializer.GetSerializeSize())));
+}
+
+// Exporting function
+extern "C" void init(Handle<Object> target)
+{
+	HandleScope scope;
+	BSON::Initialize(target);
+}
+
+NODE_MODULE(bson, BSON::Initialize);
diff --git a/node_modules/mongodb/node_modules/bson/ext/bson.h b/node_modules/mongodb/node_modules/bson/ext/bson.h
new file mode 100644
index 0000000..b0fac94
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/ext/bson.h
@@ -0,0 +1,277 @@
+//===========================================================================
+
+#ifndef BSON_H_
+#define BSON_H_
+
+//===========================================================================
+
+#ifdef __arm__
+#define USE_MISALIGNED_MEMORY_ACCESS 0
+#else
+#define USE_MISALIGNED_MEMORY_ACCESS 1
+#endif
+
+#include <node.h>
+#include <node_object_wrap.h>
+#include <v8.h>
+
+using namespace v8;
+using namespace node;
+
+//===========================================================================
+
+enum BsonType
+{
+	BSON_TYPE_NUMBER		= 1,
+	BSON_TYPE_STRING		= 2,
+	BSON_TYPE_OBJECT		= 3,
+	BSON_TYPE_ARRAY			= 4,
+	BSON_TYPE_BINARY		= 5,
+	BSON_TYPE_UNDEFINED		= 6,
+	BSON_TYPE_OID			= 7,
+	BSON_TYPE_BOOLEAN		= 8,
+	BSON_TYPE_DATE			= 9,
+	BSON_TYPE_NULL			= 10,
+	BSON_TYPE_REGEXP		= 11,
+	BSON_TYPE_CODE			= 13,
+	BSON_TYPE_SYMBOL		= 14,
+	BSON_TYPE_CODE_W_SCOPE	= 15,
+	BSON_TYPE_INT			= 16,
+	BSON_TYPE_TIMESTAMP		= 17,
+	BSON_TYPE_LONG			= 18,
+	BSON_TYPE_MAX_KEY		= 0x7f,
+	BSON_TYPE_MIN_KEY		= 0xff
+};
+
+//===========================================================================
+
+template<typename T> class BSONSerializer;
+
+class BSON : public ObjectWrap {
+public:    
+	BSON();
+	~BSON() {}
+
+	static void Initialize(Handle<Object> target);
+	static Handle<Value> BSONDeserializeStream(const Arguments &args);
+
+	// JS based objects
+	static Handle<Value> BSONSerialize(const Arguments &args);
+	static Handle<Value> BSONDeserialize(const Arguments &args);
+
+	// Calculate size of function
+	static Handle<Value> CalculateObjectSize(const Arguments &args);
+	static Handle<Value> SerializeWithBufferAndIndex(const Arguments &args);
+
+	// Constructor used for creating new BSON objects from C++
+	static Persistent<FunctionTemplate> constructor_template;
+
+private:
+	static Handle<Value> New(const Arguments &args);
+	static Handle<Value> deserialize(BSON *bson, char *data, uint32_t dataLength, uint32_t startIndex, bool is_array_item);
+
+	// BSON type instantiate functions
+	Persistent<Function> longConstructor;
+	Persistent<Function> objectIDConstructor;
+	Persistent<Function> binaryConstructor;
+	Persistent<Function> codeConstructor;
+	Persistent<Function> dbrefConstructor;
+	Persistent<Function> symbolConstructor;
+	Persistent<Function> doubleConstructor;
+	Persistent<Function> timestampConstructor;
+	Persistent<Function> minKeyConstructor;
+	Persistent<Function> maxKeyConstructor;
+
+	// Equality Objects
+	Persistent<String> longString;
+	Persistent<String> objectIDString;
+	Persistent<String> binaryString;
+	Persistent<String> codeString;
+	Persistent<String> dbrefString;
+	Persistent<String> symbolString;
+	Persistent<String> doubleString;
+	Persistent<String> timestampString;
+	Persistent<String> minKeyString;
+	Persistent<String> maxKeyString;
+
+	// Equality speed up comparison objects
+	Persistent<String> _bsontypeString;
+	Persistent<String> _longLowString;
+	Persistent<String> _longHighString;
+	Persistent<String> _objectIDidString;
+	Persistent<String> _binaryPositionString;
+	Persistent<String> _binarySubTypeString;
+	Persistent<String> _binaryBufferString;
+	Persistent<String> _doubleValueString;
+	Persistent<String> _symbolValueString;
+
+	Persistent<String> _dbRefRefString;
+	Persistent<String> _dbRefIdRefString;
+	Persistent<String> _dbRefDbRefString;
+	Persistent<String> _dbRefNamespaceString;
+	Persistent<String> _dbRefDbString;
+	Persistent<String> _dbRefOidString;
+
+	Persistent<String> _codeCodeString;
+	Persistent<String> _codeScopeString;
+	Persistent<String> _toBSONString;
+
+	Local<Object> GetSerializeObject(const Handle<Value>& object);
+
+	template<typename T> friend class BSONSerializer;
+	friend class BSONDeserializer;
+};
+
+//===========================================================================
+
+class CountStream
+{
+public:
+	CountStream() : count(0) { }
+
+	void	WriteByte(int value)									{ ++count; }
+	void	WriteByte(const Handle<Object>&, const Handle<String>&)	{ ++count; }
+	void	WriteBool(const Handle<Value>& value)					{ ++count; }
+	void	WriteInt32(int32_t value)								{ count += 4; }
+	void	WriteInt32(const Handle<Value>& value)					{ count += 4; }
+	void	WriteInt32(const Handle<Object>& object, const Handle<String>& key) { count += 4; }
+	void	WriteInt64(int64_t value)								{ count += 8; }
+	void	WriteInt64(const Handle<Value>& value)					{ count += 8; }
+	void	WriteDouble(double value)								{ count += 8; }
+	void	WriteDouble(const Handle<Value>& value)					{ count += 8; }
+	void	WriteDouble(const Handle<Object>&, const Handle<String>&) { count += 8; }
+	void	WriteUInt32String(uint32_t name)						{ char buffer[32]; count += sprintf(buffer, "%u", name) + 1; }
+	void	WriteLengthPrefixedString(const Local<String>& value)	{ count += value->Utf8Length()+5; }
+	void	WriteObjectId(const Handle<Object>& object, const Handle<String>& key)				{ count += 12; }
+	void	WriteString(const Local<String>& value)					{ count += value->Utf8Length() + 1; }	// This returns the number of bytes exclusive of the NULL terminator
+	void	WriteData(const char* data, size_t length)				{ count += length; }
+
+	void*	BeginWriteType()										{ ++count; return NULL; }
+	void	CommitType(void*, BsonType)								{ }
+	void*	BeginWriteSize()										{ count += 4; return NULL; }
+	void	CommitSize(void*)										{ }
+
+	size_t GetSerializeSize() const									{ return count; }
+
+	// Do nothing. CheckKey is implemented for DataStream
+	void	CheckKey(const Local<String>&)							{ }
+
+private:
+	size_t	count;
+};
+
+class DataStream
+{
+public:
+	DataStream(char* aDestinationBuffer) : destinationBuffer(aDestinationBuffer), p(aDestinationBuffer) { }
+
+	void	WriteByte(int value)									{ *p++ = value; }
+	void	WriteByte(const Handle<Object>& object, const Handle<String>& key)	{ *p++ = object->Get(key)->Int32Value(); }
+#if USE_MISALIGNED_MEMORY_ACCESS
+	void	WriteInt32(int32_t value)								{ *reinterpret_cast<int32_t*>(p) = value; p += 4; }
+	void	WriteInt64(int64_t value)								{ *reinterpret_cast<int64_t*>(p) = value; p += 8; }
+	void	WriteDouble(double value)								{ *reinterpret_cast<double*>(p) = value; p += 8; }
+#else
+	void	WriteInt32(int32_t value)								{ memcpy(p, &value, 4); p += 4; }
+	void	WriteInt64(int64_t value)								{ memcpy(p, &value, 8); p += 8; }
+	void	WriteDouble(double value)								{ memcpy(p, &value, 8); p += 8; }
+#endif
+	void	WriteBool(const Handle<Value>& value)					{ WriteByte(value->BooleanValue() ? 1 : 0); }
+	void	WriteInt32(const Handle<Value>& value)					{ WriteInt32(value->Int32Value());			}
+	void	WriteInt32(const Handle<Object>& object, const Handle<String>& key) { WriteInt32(object->Get(key)); }
+	void	WriteInt64(const Handle<Value>& value)					{ WriteInt64(value->IntegerValue());		}
+	void	WriteDouble(const Handle<Value>& value)					{ WriteDouble(value->NumberValue());		}
+	void	WriteDouble(const Handle<Object>& object, const Handle<String>& key) { WriteDouble(object->Get(key)); }
+	void	WriteUInt32String(uint32_t name)						{ p += sprintf(p, "%u", name) + 1;			}
+	void	WriteLengthPrefixedString(const Local<String>& value)	{ WriteInt32(value->Utf8Length()+1); WriteString(value); }
+	void	WriteObjectId(const Handle<Object>& object, const Handle<String>& key);
+	void	WriteString(const Local<String>& value)					{ p += value->WriteUtf8(p); }		// This returns the number of bytes inclusive of the NULL terminator.
+	void	WriteData(const char* data, size_t length)				{ memcpy(p, data, length); p += length; }
+
+	void*	BeginWriteType()										{ void* returnValue = p; p++; return returnValue; }
+	void	CommitType(void* beginPoint, BsonType value)			{ *reinterpret_cast<unsigned char*>(beginPoint) = value; }
+	void*	BeginWriteSize()										{ void* returnValue = p; p += 4; return returnValue; }
+
+#if USE_MISALIGNED_MEMORY_ACCESS
+	void	CommitSize(void* beginPoint)							{ *reinterpret_cast<int32_t*>(beginPoint) = (int32_t) (p - (char*) beginPoint); }
+#else
+	void	CommitSize(void* beginPoint)							{ int32_t value = (int32_t) (p - (char*) beginPoint); memcpy(beginPoint, &value, 4); }
+#endif
+
+	size_t GetSerializeSize() const									{ return p - destinationBuffer; }
+
+	void	CheckKey(const Local<String>& keyName);
+
+protected:
+	char *const	destinationBuffer;		// base, never changes
+	char*		p;						// cursor into buffer
+};
+
+template<typename T> class BSONSerializer : public T
+{
+private:
+	typedef T Inherited;
+
+public:
+	BSONSerializer(BSON* aBson, bool aCheckKeys, bool aSerializeFunctions) : Inherited(), checkKeys(aCheckKeys), serializeFunctions(aSerializeFunctions), bson(aBson) { }
+	BSONSerializer(BSON* aBson, bool aCheckKeys, bool aSerializeFunctions, char* parentParam) : Inherited(parentParam), checkKeys(aCheckKeys), serializeFunctions(aSerializeFunctions), bson(aBson) { }
+
+	void SerializeDocument(const Handle<Value>& value);
+	void SerializeArray(const Handle<Value>& value);
+	void SerializeValue(void* typeLocation, const Handle<Value>& value);
+
+private:
+	bool		checkKeys;
+	bool		serializeFunctions;
+	BSON*		bson;
+};
+
+//===========================================================================
+
+class BSONDeserializer
+{
+public:
+	BSONDeserializer(BSON* aBson, char* data, size_t length);
+	BSONDeserializer(BSONDeserializer& parentSerializer, size_t length);
+
+	Handle<Value> DeserializeDocument();
+
+	bool			HasMoreData() const { return p < pEnd; }
+	Local<String>	ReadCString();
+	uint32_t		ReadIntegerString();
+	int32_t			ReadRegexOptions();
+	Local<String>	ReadString();
+	Local<String>	ReadObjectId();
+
+	unsigned char	ReadByte()			{ return *reinterpret_cast<unsigned char*>(p++); }
+#if USE_MISALIGNED_MEMORY_ACCESS
+	int32_t			ReadInt32()			{ int32_t returnValue = *reinterpret_cast<int32_t*>(p); p += 4; return returnValue; }
+	uint32_t		ReadUInt32()		{ uint32_t returnValue = *reinterpret_cast<uint32_t*>(p); p += 4; return returnValue; }
+	int64_t			ReadInt64()			{ int64_t returnValue = *reinterpret_cast<int64_t*>(p); p += 8; return returnValue; }
+	double			ReadDouble()		{ double returnValue = *reinterpret_cast<double*>(p); p += 8; return returnValue; }
+#else
+	int32_t			ReadInt32()			{ int32_t returnValue; memcpy(&returnValue, p, 4); p += 4; return returnValue; }
+	uint32_t		ReadUInt32()		{ uint32_t returnValue; memcpy(&returnValue, p, 4); p += 4; return returnValue; }
+	int64_t			ReadInt64()			{ int64_t returnValue; memcpy(&returnValue, p, 8); p += 8; return returnValue; }
+	double			ReadDouble()		{ double returnValue; memcpy(&returnValue, p, 8); p += 8; return returnValue; }
+#endif
+
+	size_t			GetSerializeSize() const { return p - pStart; }
+
+private:
+	Handle<Value> DeserializeArray();
+	Handle<Value> DeserializeValue(BsonType type);
+	Handle<Value> DeserializeDocumentInternal();
+	Handle<Value> DeserializeArrayInternal();
+
+	BSON*		bson;
+	char* const pStart;
+	char*		p;
+	char* const	pEnd;
+};
+
+//===========================================================================
+
+#endif  // BSON_H_
+
+//===========================================================================
diff --git a/node_modules/mongodb/node_modules/bson/ext/index.js b/node_modules/mongodb/node_modules/bson/ext/index.js
new file mode 100644
index 0000000..85e243c
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/ext/index.js
@@ -0,0 +1,30 @@
+var bson = null;
+
+// Load the precompiled win32 binary
+if(process.platform == "win32" && process.arch == "x64") {
+  bson = require('./win32/x64/bson');  
+} else if(process.platform == "win32" && process.arch == "ia32") {
+  bson = require('./win32/ia32/bson');  
+} else {
+  bson = require('../build/Release/bson');  
+}
+
+exports.BSON = bson.BSON;
+exports.Long = require('../lib/bson/long').Long;
+exports.ObjectID = require('../lib/bson/objectid').ObjectID;
+exports.DBRef = require('../lib/bson/db_ref').DBRef;
+exports.Code = require('../lib/bson/code').Code;
+exports.Timestamp = require('../lib/bson/timestamp').Timestamp;
+exports.Binary = require('../lib/bson/binary').Binary;
+exports.Double = require('../lib/bson/double').Double;
+exports.MaxKey = require('../lib/bson/max_key').MaxKey;
+exports.MinKey = require('../lib/bson/min_key').MinKey;
+exports.Symbol = require('../lib/bson/symbol').Symbol;
+
+// Just add constants tot he Native BSON parser
+exports.BSON.BSON_BINARY_SUBTYPE_DEFAULT = 0;
+exports.BSON.BSON_BINARY_SUBTYPE_FUNCTION = 1;
+exports.BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY = 2;
+exports.BSON.BSON_BINARY_SUBTYPE_UUID = 3;
+exports.BSON.BSON_BINARY_SUBTYPE_MD5 = 4;
+exports.BSON.BSON_BINARY_SUBTYPE_USER_DEFINED = 128;
diff --git a/node_modules/mongodb/node_modules/bson/ext/win32/ia32/bson.node b/node_modules/mongodb/node_modules/bson/ext/win32/ia32/bson.node
new file mode 100644
index 0000000..b27819b
Binary files /dev/null and b/node_modules/mongodb/node_modules/bson/ext/win32/ia32/bson.node differ
diff --git a/node_modules/mongodb/node_modules/bson/ext/win32/x64/bson.node b/node_modules/mongodb/node_modules/bson/ext/win32/x64/bson.node
new file mode 100644
index 0000000..a544c8e
Binary files /dev/null and b/node_modules/mongodb/node_modules/bson/ext/win32/x64/bson.node differ
diff --git a/node_modules/mongodb/node_modules/bson/ext/wscript b/node_modules/mongodb/node_modules/bson/ext/wscript
new file mode 100644
index 0000000..40f5317
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/ext/wscript
@@ -0,0 +1,39 @@
+import Options
+from os import unlink, symlink, popen
+from os.path import exists 
+
+srcdir = "."
+blddir = "build"
+VERSION = "0.1.0"
+
+def set_options(opt):
+  opt.tool_options("compiler_cxx")
+  opt.add_option( '--debug'
+                , action='store_true'
+                , default=False
+                , help='Build debug variant [Default: False]'
+                , dest='debug'
+                )  
+
+def configure(conf):
+  conf.check_tool("compiler_cxx")
+  conf.check_tool("node_addon")
+  conf.env.append_value('CXXFLAGS', ['-O3', '-funroll-loops'])
+
+  # conf.env.append_value('CXXFLAGS', ['-DDEBUG', '-g', '-O0', '-Wall', '-Wextra'])
+  # conf.check(lib='node', libpath=['/usr/lib', '/usr/local/lib'], uselib_store='NODE')
+
+def build(bld):
+  obj = bld.new_task_gen("cxx", "shlib", "node_addon")
+  obj.target = "bson"
+  obj.source = ["bson.cc"]
+  # obj.uselib = "NODE"
+
+def shutdown():
+  # HACK to get compress.node out of build directory.
+  # better way to do this?
+  if Options.commands['clean']:
+    if exists('bson.node'): unlink('bson.node')
+  else:
+    if exists('build/default/bson.node') and not exists('bson.node'):
+      symlink('build/default/bson.node', 'bson.node')
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/binary.js b/node_modules/mongodb/node_modules/bson/lib/bson/binary.js
new file mode 100644
index 0000000..82d4d04
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/binary.js
@@ -0,0 +1,339 @@
+/**
+ * Module dependencies.
+ */
+if(typeof window === 'undefined') { 
+  var Buffer = require('buffer').Buffer; // TODO just use global Buffer
+}
+
+// Binary default subtype
+var BSON_BINARY_SUBTYPE_DEFAULT = 0;
+
+/**
+ * @ignore
+ * @api private
+ */
+var writeStringToArray = function(data) {
+  // Create a buffer
+  var buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(data.length)) : new Array(data.length);
+  // Write the content to the buffer
+  for(var i = 0; i < data.length; i++) {
+    buffer[i] = data.charCodeAt(i);
+  }  
+  // Write the string to the buffer
+  return buffer;
+}
+
+/**
+ * Convert Array ot Uint8Array to Binary String
+ *
+ * @ignore
+ * @api private
+ */
+var convertArraytoUtf8BinaryString = function(byteArray, startIndex, endIndex) {
+  var result = "";
+  for(var i = startIndex; i < endIndex; i++) {
+   result = result + String.fromCharCode(byteArray[i]);
+  }
+  return result;  
+};
+
+/**
+ * A class representation of the BSON Binary type.
+ * 
+ * Sub types
+ *  - **BSON.BSON_BINARY_SUBTYPE_DEFAULT**, default BSON type.
+ *  - **BSON.BSON_BINARY_SUBTYPE_FUNCTION**, BSON function type.
+ *  - **BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY**, BSON byte array type.
+ *  - **BSON.BSON_BINARY_SUBTYPE_UUID**, BSON uuid type.
+ *  - **BSON.BSON_BINARY_SUBTYPE_MD5**, BSON md5 type.
+ *  - **BSON.BSON_BINARY_SUBTYPE_USER_DEFINED**, BSON user defined type.
+ *
+ * @class Represents the Binary BSON type.
+ * @param {Buffer} buffer a buffer object containing the binary data.
+ * @param {Number} [subType] the option binary type.
+ * @return {Grid}
+ */
+function Binary(buffer, subType) {
+  if(!(this instanceof Binary)) return new Binary(buffer, subType);
+  
+  this._bsontype = 'Binary';
+
+  if(buffer instanceof Number) {
+    this.sub_type = buffer;
+    this.position = 0;
+  } else {    
+    this.sub_type = subType == null ? BSON_BINARY_SUBTYPE_DEFAULT : subType;
+    this.position = 0;
+  }
+
+  if(buffer != null && !(buffer instanceof Number)) {
+    // Only accept Buffer, Uint8Array or Arrays
+    if(typeof buffer == 'string') {
+      // Different ways of writing the length of the string for the different types
+      if(typeof Buffer != 'undefined') {
+        this.buffer = new Buffer(buffer);
+      } else if(typeof Uint8Array != 'undefined' || (Object.prototype.toString.call(buffer) == '[object Array]')) {
+        this.buffer = writeStringToArray(buffer);
+      } else {
+        throw new Error("only String, Buffer, Uint8Array or Array accepted");
+      }
+    } else {
+      this.buffer = buffer;      
+    }
+    this.position = buffer.length;
+  } else {
+    if(typeof Buffer != 'undefined') {
+      this.buffer =  new Buffer(Binary.BUFFER_SIZE);      
+    } else if(typeof Uint8Array != 'undefined'){
+      this.buffer = new Uint8Array(new ArrayBuffer(Binary.BUFFER_SIZE));
+    } else {
+      this.buffer = new Array(Binary.BUFFER_SIZE);
+    }
+    // Set position to start of buffer
+    this.position = 0;
+  }
+};
+
+/**
+ * Updates this binary with byte_value.
+ *
+ * @param {Character} byte_value a single byte we wish to write.
+ * @api public
+ */
+Binary.prototype.put = function put(byte_value) {
+  // If it's a string and a has more than one character throw an error
+  if(byte_value['length'] != null && typeof byte_value != 'number' && byte_value.length != 1) throw new Error("only accepts single character String, Uint8Array or Array");
+  if(typeof byte_value != 'number' && byte_value < 0 || byte_value > 255) throw new Error("only accepts number in a valid unsigned byte range 0-255");
+  
+  // Decode the byte value once
+  var decoded_byte = null;
+  if(typeof byte_value == 'string') {
+    decoded_byte = byte_value.charCodeAt(0);      
+  } else if(byte_value['length'] != null) {
+    decoded_byte = byte_value[0];
+  } else {
+    decoded_byte = byte_value;
+  }
+  
+  if(this.buffer.length > this.position) {
+    this.buffer[this.position++] = decoded_byte;
+  } else {
+    if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {    
+      // Create additional overflow buffer
+      var buffer = new Buffer(Binary.BUFFER_SIZE + this.buffer.length);
+      // Combine the two buffers together
+      this.buffer.copy(buffer, 0, 0, this.buffer.length);
+      this.buffer = buffer;
+      this.buffer[this.position++] = decoded_byte;
+    } else {
+      var buffer = null;
+      // Create a new buffer (typed or normal array)
+      if(Object.prototype.toString.call(this.buffer) == '[object Uint8Array]') {
+        buffer = new Uint8Array(new ArrayBuffer(Binary.BUFFER_SIZE + this.buffer.length));
+      } else {
+        buffer = new Array(Binary.BUFFER_SIZE + this.buffer.length);
+      }      
+      
+      // We need to copy all the content to the new array
+      for(var i = 0; i < this.buffer.length; i++) {
+        buffer[i] = this.buffer[i];
+      }
+      
+      // Reassign the buffer
+      this.buffer = buffer;
+      // Write the byte
+      this.buffer[this.position++] = decoded_byte;
+    }
+  }
+};
+
+/**
+ * Writes a buffer or string to the binary.
+ *
+ * @param {Buffer|String} string a string or buffer to be written to the Binary BSON object.
+ * @param {Number} offset specify the binary of where to write the content.
+ * @api public
+ */
+Binary.prototype.write = function write(string, offset) {
+  offset = typeof offset == 'number' ? offset : this.position;
+
+  // If the buffer is to small let's extend the buffer
+  if(this.buffer.length < offset + string.length) {
+    var buffer = null;
+    // If we are in node.js
+    if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {      
+      buffer = new Buffer(this.buffer.length + string.length);
+      this.buffer.copy(buffer, 0, 0, this.buffer.length);      
+    } else if(Object.prototype.toString.call(this.buffer) == '[object Uint8Array]') {
+      // Create a new buffer
+      buffer = new Uint8Array(new ArrayBuffer(this.buffer.length + string.length))
+      // Copy the content
+      for(var i = 0; i < this.position; i++) {
+        buffer[i] = this.buffer[i];
+      }
+    }
+    
+    // Assign the new buffer
+    this.buffer = buffer;
+  }
+
+  if(typeof Buffer != 'undefined' && Buffer.isBuffer(string) && Buffer.isBuffer(this.buffer)) {
+    string.copy(this.buffer, offset, 0, string.length);
+    this.position = (offset + string.length) > this.position ? (offset + string.length) : this.position;
+    // offset = string.length
+  } else if(typeof Buffer != 'undefined' && typeof string == 'string' && Buffer.isBuffer(this.buffer)) {
+    this.buffer.write(string, 'binary', offset);
+    this.position = (offset + string.length) > this.position ? (offset + string.length) : this.position;
+    // offset = string.length;
+  } else if(Object.prototype.toString.call(string) == '[object Uint8Array]' 
+    || Object.prototype.toString.call(string) == '[object Array]' && typeof string != 'string') {      
+    for(var i = 0; i < string.length; i++) {
+      this.buffer[offset++] = string[i];
+    }    
+
+    this.position = offset > this.position ? offset : this.position;
+  } else if(typeof string == 'string') {
+    for(var i = 0; i < string.length; i++) {
+      this.buffer[offset++] = string.charCodeAt(i);
+    }
+
+    this.position = offset > this.position ? offset : this.position;
+  }
+};
+
+/**
+ * Reads **length** bytes starting at **position**.
+ *
+ * @param {Number} position read from the given position in the Binary.
+ * @param {Number} length the number of bytes to read.
+ * @return {Buffer}
+ * @api public
+ */
+Binary.prototype.read = function read(position, length) {
+  length = length && length > 0
+    ? length
+    : this.position;
+  
+  // Let's return the data based on the type we have
+  if(this.buffer['slice']) {
+    return this.buffer.slice(position, position + length);
+  } else {
+    // Create a buffer to keep the result
+    var buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(length)) : new Array(length);
+    for(var i = 0; i < length; i++) {
+      buffer[i] = this.buffer[position++];
+    }
+  }
+  // Return the buffer
+  return buffer;
+};
+
+/**
+ * Returns the value of this binary as a string.
+ *
+ * @return {String}
+ * @api public
+ */
+Binary.prototype.value = function value(asRaw) {
+  asRaw = asRaw == null ? false : asRaw;  
+  
+  // If it's a node.js buffer object
+  if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {
+    return asRaw ? this.buffer.slice(0, this.position) : this.buffer.toString('binary', 0, this.position);
+  } else {
+    if(asRaw) {
+      // we support the slice command use it
+      if(this.buffer['slice'] != null) {
+        return this.buffer.slice(0, this.position);
+      } else {
+        // Create a new buffer to copy content to
+        var newBuffer = Object.prototype.toString.call(this.buffer) == '[object Uint8Array]' ? new Uint8Array(new ArrayBuffer(this.position)) : new Array(this.position);
+        // Copy content
+        for(var i = 0; i < this.position; i++) {
+          newBuffer[i] = this.buffer[i];
+        }
+        // Return the buffer
+        return newBuffer;
+      }
+    } else {
+      return convertArraytoUtf8BinaryString(this.buffer, 0, this.position);
+    }
+  }
+};
+
+/**
+ * Length.
+ *
+ * @return {Number} the length of the binary.
+ * @api public
+ */
+Binary.prototype.length = function length() {
+  return this.position;
+};
+
+/**
+ * @ignore
+ * @api private
+ */
+Binary.prototype.toJSON = function() {
+  return this.buffer != null ? this.buffer.toString('base64') : '';
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+Binary.prototype.toString = function(format) {
+  return this.buffer != null ? this.buffer.slice(0, this.position).toString(format) : '';
+}
+
+Binary.BUFFER_SIZE = 256;
+
+/**
+ * Default BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_DEFAULT = 0;
+/**
+ * Function BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_FUNCTION = 1;
+/**
+ * Byte Array BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_BYTE_ARRAY = 2;
+/**
+ * OLD UUID BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_UUID_OLD = 3;
+/**
+ * UUID BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_UUID = 4;
+/**
+ * MD5 BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_MD5 = 5;
+/**
+ * User BSON type
+ *  
+ * @classconstant SUBTYPE_DEFAULT
+ **/
+Binary.SUBTYPE_USER_DEFINED = 128;
+
+/**
+ * Expose.
+ */
+exports.Binary = Binary;
+
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/binary_parser.js b/node_modules/mongodb/node_modules/bson/lib/bson/binary_parser.js
new file mode 100644
index 0000000..d2fc811
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/binary_parser.js
@@ -0,0 +1,385 @@
+/**
+ * Binary Parser.
+ * Jonas Raoni Soares Silva
+ * http://jsfromhell.com/classes/binary-parser [v1.0]
+ */
+var chr = String.fromCharCode;
+
+var maxBits = [];
+for (var i = 0; i < 64; i++) {
+	maxBits[i] = Math.pow(2, i);
+}
+
+function BinaryParser (bigEndian, allowExceptions) {
+  if(!(this instanceof BinaryParser)) return new BinaryParser(bigEndian, allowExceptions);
+  
+	this.bigEndian = bigEndian;
+	this.allowExceptions = allowExceptions;
+};
+
+BinaryParser.warn = function warn (msg) {
+	if (this.allowExceptions) {
+		throw new Error(msg);
+  }
+
+	return 1;
+};
+
+BinaryParser.decodeFloat = function decodeFloat (data, precisionBits, exponentBits) {
+	var b = new this.Buffer(this.bigEndian, data);
+
+	b.checkBuffer(precisionBits + exponentBits + 1);
+
+	var bias = maxBits[exponentBits - 1] - 1
+    , signal = b.readBits(precisionBits + exponentBits, 1)
+    , exponent = b.readBits(precisionBits, exponentBits)
+    , significand = 0
+    , divisor = 2
+    , curByte = b.buffer.length + (-precisionBits >> 3) - 1;
+
+	do {
+		for (var byteValue = b.buffer[ ++curByte ], startBit = precisionBits % 8 || 8, mask = 1 << startBit; mask >>= 1; ( byteValue & mask ) && ( significand += 1 / divisor ), divisor *= 2 );
+	} while (precisionBits -= startBit);
+
+	return exponent == ( bias << 1 ) + 1 ? significand ? NaN : signal ? -Infinity : +Infinity : ( 1 + signal * -2 ) * ( exponent || significand ? !exponent ? Math.pow( 2, -bias + 1 ) * significand : Math.pow( 2, exponent - bias ) * ( 1 + significand ) : 0 );
+};
+
+BinaryParser.decodeInt = function decodeInt (data, bits, signed, forceBigEndian) {
+  var b = new this.Buffer(this.bigEndian || forceBigEndian, data)
+      , x = b.readBits(0, bits)
+      , max = maxBits[bits]; //max = Math.pow( 2, bits );
+  
+  return signed && x >= max / 2
+      ? x - max
+      : x;
+};
+
+BinaryParser.encodeFloat = function encodeFloat (data, precisionBits, exponentBits) {
+	var bias = maxBits[exponentBits - 1] - 1
+    , minExp = -bias + 1
+    , maxExp = bias
+    , minUnnormExp = minExp - precisionBits
+    , n = parseFloat(data)
+    , status = isNaN(n) || n == -Infinity || n == +Infinity ? n : 0
+    ,	exp = 0
+    , len = 2 * bias + 1 + precisionBits + 3
+    , bin = new Array(len)
+    , signal = (n = status !== 0 ? 0 : n) < 0
+    , intPart = Math.floor(n = Math.abs(n))
+    , floatPart = n - intPart
+    , lastBit
+    , rounded
+    , result
+    , i
+    , j;
+
+	for (i = len; i; bin[--i] = 0);
+
+	for (i = bias + 2; intPart && i; bin[--i] = intPart % 2, intPart = Math.floor(intPart / 2));
+
+	for (i = bias + 1; floatPart > 0 && i; (bin[++i] = ((floatPart *= 2) >= 1) - 0 ) && --floatPart);
+
+	for (i = -1; ++i < len && !bin[i];);
+
+	if (bin[(lastBit = precisionBits - 1 + (i = (exp = bias + 1 - i) >= minExp && exp <= maxExp ? i + 1 : bias + 1 - (exp = minExp - 1))) + 1]) {
+		if (!(rounded = bin[lastBit])) {
+			for (j = lastBit + 2; !rounded && j < len; rounded = bin[j++]);
+		}
+
+		for (j = lastBit + 1; rounded && --j >= 0; (bin[j] = !bin[j] - 0) && (rounded = 0));
+	}
+
+	for (i = i - 2 < 0 ? -1 : i - 3; ++i < len && !bin[i];);
+
+	if ((exp = bias + 1 - i) >= minExp && exp <= maxExp) {
+		++i;
+  } else if (exp < minExp) {
+		exp != bias + 1 - len && exp < minUnnormExp && this.warn("encodeFloat::float underflow");
+		i = bias + 1 - (exp = minExp - 1);
+	}
+
+	if (intPart || status !== 0) {
+		this.warn(intPart ? "encodeFloat::float overflow" : "encodeFloat::" + status);
+		exp = maxExp + 1;
+		i = bias + 2;
+
+		if (status == -Infinity) {
+			signal = 1;
+    } else if (isNaN(status)) {
+			bin[i] = 1;
+    }
+	}
+
+	for (n = Math.abs(exp + bias), j = exponentBits + 1, result = ""; --j; result = (n % 2) + result, n = n >>= 1);
+
+	for (n = 0, j = 0, i = (result = (signal ? "1" : "0") + result + bin.slice(i, i + precisionBits).join("")).length, r = []; i; j = (j + 1) % 8) {
+		n += (1 << j) * result.charAt(--i);
+		if (j == 7) {
+			r[r.length] = String.fromCharCode(n);
+			n = 0;
+		}
+	}
+
+	r[r.length] = n
+    ? String.fromCharCode(n)
+    : "";
+
+	return (this.bigEndian ? r.reverse() : r).join("");
+};
+
+BinaryParser.encodeInt = function encodeInt (data, bits, signed, forceBigEndian) {
+	var max = maxBits[bits];
+
+  if (data >= max || data < -(max / 2)) {
+    this.warn("encodeInt::overflow");
+    data = 0;
+  }
+
+	if (data < 0) {
+    data += max;
+  }
+
+	for (var r = []; data; r[r.length] = String.fromCharCode(data % 256), data = Math.floor(data / 256));
+
+	for (bits = -(-bits >> 3) - r.length; bits--; r[r.length] = "\0");
+
+  return ((this.bigEndian || forceBigEndian) ? r.reverse() : r).join("");
+};
+
+BinaryParser.toSmall    = function( data ){ return this.decodeInt( data,  8, true  ); };
+BinaryParser.fromSmall  = function( data ){ return this.encodeInt( data,  8, true  ); };
+BinaryParser.toByte     = function( data ){ return this.decodeInt( data,  8, false ); };
+BinaryParser.fromByte   = function( data ){ return this.encodeInt( data,  8, false ); };
+BinaryParser.toShort    = function( data ){ return this.decodeInt( data, 16, true  ); };
+BinaryParser.fromShort  = function( data ){ return this.encodeInt( data, 16, true  ); };
+BinaryParser.toWord     = function( data ){ return this.decodeInt( data, 16, false ); };
+BinaryParser.fromWord   = function( data ){ return this.encodeInt( data, 16, false ); };
+BinaryParser.toInt      = function( data ){ return this.decodeInt( data, 32, true  ); };
+BinaryParser.fromInt    = function( data ){ return this.encodeInt( data, 32, true  ); };
+BinaryParser.toLong     = function( data ){ return this.decodeInt( data, 64, true  ); };
+BinaryParser.fromLong   = function( data ){ return this.encodeInt( data, 64, true  ); };
+BinaryParser.toDWord    = function( data ){ return this.decodeInt( data, 32, false ); };
+BinaryParser.fromDWord  = function( data ){ return this.encodeInt( data, 32, false ); };
+BinaryParser.toQWord    = function( data ){ return this.decodeInt( data, 64, true ); };
+BinaryParser.fromQWord  = function( data ){ return this.encodeInt( data, 64, true ); };
+BinaryParser.toFloat    = function( data ){ return this.decodeFloat( data, 23, 8   ); };
+BinaryParser.fromFloat  = function( data ){ return this.encodeFloat( data, 23, 8   ); };
+BinaryParser.toDouble   = function( data ){ return this.decodeFloat( data, 52, 11  ); };
+BinaryParser.fromDouble = function( data ){ return this.encodeFloat( data, 52, 11  ); };
+
+// Factor out the encode so it can be shared by add_header and push_int32
+BinaryParser.encode_int32 = function encode_int32 (number, asArray) {
+  var a, b, c, d, unsigned;
+  unsigned = (number < 0) ? (number + 0x100000000) : number;
+  a = Math.floor(unsigned / 0xffffff);
+  unsigned &= 0xffffff;
+  b = Math.floor(unsigned / 0xffff);
+  unsigned &= 0xffff;
+  c = Math.floor(unsigned / 0xff);
+  unsigned &= 0xff;
+  d = Math.floor(unsigned);
+  return asArray ? [chr(a), chr(b), chr(c), chr(d)] : chr(a) + chr(b) + chr(c) + chr(d);
+};
+
+BinaryParser.encode_int64 = function encode_int64 (number) {
+  var a, b, c, d, e, f, g, h, unsigned;
+  unsigned = (number < 0) ? (number + 0x10000000000000000) : number;
+  a = Math.floor(unsigned / 0xffffffffffffff);
+  unsigned &= 0xffffffffffffff;
+  b = Math.floor(unsigned / 0xffffffffffff);
+  unsigned &= 0xffffffffffff;
+  c = Math.floor(unsigned / 0xffffffffff);
+  unsigned &= 0xffffffffff;
+  d = Math.floor(unsigned / 0xffffffff);
+  unsigned &= 0xffffffff;
+  e = Math.floor(unsigned / 0xffffff);
+  unsigned &= 0xffffff;
+  f = Math.floor(unsigned / 0xffff);
+  unsigned &= 0xffff;
+  g = Math.floor(unsigned / 0xff);
+  unsigned &= 0xff;
+  h = Math.floor(unsigned);
+  return chr(a) + chr(b) + chr(c) + chr(d) + chr(e) + chr(f) + chr(g) + chr(h);
+};
+
+/**
+ * UTF8 methods
+ */
+
+// Take a raw binary string and return a utf8 string
+BinaryParser.decode_utf8 = function decode_utf8 (binaryStr) {
+  var len = binaryStr.length
+    , decoded = ''
+    , i = 0
+    , c = 0
+    , c1 = 0
+    , c2 = 0
+    , c3;
+
+  while (i < len) {
+    c = binaryStr.charCodeAt(i);
+    if (c < 128) {
+      decoded += String.fromCharCode(c);
+      i++;
+    } else if ((c > 191) && (c < 224)) {
+	    c2 = binaryStr.charCodeAt(i+1);
+      decoded += String.fromCharCode(((c & 31) << 6) | (c2 & 63));
+      i += 2;
+    } else {
+	    c2 = binaryStr.charCodeAt(i+1);
+	    c3 = binaryStr.charCodeAt(i+2);
+      decoded += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
+      i += 3;
+    }
+  }
+
+  return decoded;
+};
+
+// Encode a cstring
+BinaryParser.encode_cstring = function encode_cstring (s) {
+  return unescape(encodeURIComponent(s)) + BinaryParser.fromByte(0);
+};
+
+// Take a utf8 string and return a binary string
+BinaryParser.encode_utf8 = function encode_utf8 (s) {
+  var a = ""
+    , c;
+
+  for (var n = 0, len = s.length; n < len; n++) {
+    c = s.charCodeAt(n);
+
+    if (c < 128) {
+	    a += String.fromCharCode(c);
+    } else if ((c > 127) && (c < 2048)) {
+	    a += String.fromCharCode((c>>6) | 192) ;
+	    a += String.fromCharCode((c&63) | 128);
+    } else {
+      a += String.fromCharCode((c>>12) | 224);
+      a += String.fromCharCode(((c>>6) & 63) | 128);
+      a += String.fromCharCode((c&63) | 128);
+    }
+  }
+
+  return a;
+};
+
+BinaryParser.hprint = function hprint (s) {
+  var number;
+
+  for (var i = 0, len = s.length; i < len; i++) {
+    if (s.charCodeAt(i) < 32) {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(16)
+        : s.charCodeAt(i).toString(16);        
+      process.stdout.write(number + " ")
+    } else {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(16)
+        : s.charCodeAt(i).toString(16);
+        process.stdout.write(number + " ")
+    }
+  }
+  
+  process.stdout.write("\n\n");
+};
+
+BinaryParser.ilprint = function hprint (s) {
+  var number;
+
+  for (var i = 0, len = s.length; i < len; i++) {
+    if (s.charCodeAt(i) < 32) {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(10)
+        : s.charCodeAt(i).toString(10);
+
+      require('util').debug(number+' : ');
+    } else {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(10)
+        : s.charCodeAt(i).toString(10);
+      require('util').debug(number+' : '+ s.charAt(i));
+    }
+  }
+};
+
+BinaryParser.hlprint = function hprint (s) {
+  var number;
+
+  for (var i = 0, len = s.length; i < len; i++) {
+    if (s.charCodeAt(i) < 32) {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(16)
+        : s.charCodeAt(i).toString(16);
+      require('util').debug(number+' : ');
+    } else {
+      number = s.charCodeAt(i) <= 15
+        ? "0" + s.charCodeAt(i).toString(16)
+        : s.charCodeAt(i).toString(16);
+      require('util').debug(number+' : '+ s.charAt(i));
+    }
+  }
+};
+
+/**
+ * BinaryParser buffer constructor.
+ */
+function BinaryParserBuffer (bigEndian, buffer) {
+  this.bigEndian = bigEndian || 0;
+  this.buffer = [];
+  this.setBuffer(buffer);
+};
+
+BinaryParserBuffer.prototype.setBuffer = function setBuffer (data) {
+  var l, i, b;
+
+	if (data) {
+    i = l = data.length;
+    b = this.buffer = new Array(l);
+		for (; i; b[l - i] = data.charCodeAt(--i));
+		this.bigEndian && b.reverse();
+	}
+};
+
+BinaryParserBuffer.prototype.hasNeededBits = function hasNeededBits (neededBits) {
+	return this.buffer.length >= -(-neededBits >> 3);
+};
+
+BinaryParserBuffer.prototype.checkBuffer = function checkBuffer (neededBits) {
+	if (!this.hasNeededBits(neededBits)) {
+		throw new Error("checkBuffer::missing bytes");
+  }
+};
+
+BinaryParserBuffer.prototype.readBits = function readBits (start, length) {
+	//shl fix: Henri Torgemane ~1996 (compressed by Jonas Raoni)
+
+	function shl (a, b) {
+		for (; b--; a = ((a %= 0x7fffffff + 1) & 0x40000000) == 0x40000000 ? a * 2 : (a - 0x40000000) * 2 + 0x7fffffff + 1);
+		return a;
+	}
+
+	if (start < 0 || length <= 0) {
+		return 0;
+  }
+
+	this.checkBuffer(start + length);
+
+  var offsetLeft
+    , offsetRight = start % 8
+    , curByte = this.buffer.length - ( start >> 3 ) - 1
+    , lastByte = this.buffer.length + ( -( start + length ) >> 3 )
+    , diff = curByte - lastByte
+    , sum = ((this.buffer[ curByte ] >> offsetRight) & ((1 << (diff ? 8 - offsetRight : length)) - 1)) + (diff && (offsetLeft = (start + length) % 8) ? (this.buffer[lastByte++] & ((1 << offsetLeft) - 1)) << (diff-- << 3) - offsetRight : 0);
+
+	for(; diff; sum += shl(this.buffer[lastByte++], (diff-- << 3) - offsetRight));
+
+	return sum;
+};
+
+/**
+ * Expose.
+ */
+BinaryParser.Buffer = BinaryParserBuffer;
+
+exports.BinaryParser = BinaryParser;
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/bson.js b/node_modules/mongodb/node_modules/bson/lib/bson/bson.js
new file mode 100644
index 0000000..7da8249
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/bson.js
@@ -0,0 +1,1519 @@
+var Long = require('./long').Long
+  , Double = require('./double').Double
+  , Timestamp = require('./timestamp').Timestamp
+  , ObjectID = require('./objectid').ObjectID
+  , Symbol = require('./symbol').Symbol
+  , Code = require('./code').Code
+  , MinKey = require('./min_key').MinKey
+  , MaxKey = require('./max_key').MaxKey
+  , DBRef = require('./db_ref').DBRef
+  , Binary = require('./binary').Binary
+  , BinaryParser = require('./binary_parser').BinaryParser
+  , writeIEEE754 = require('./float_parser').writeIEEE754
+  , readIEEE754 = require('./float_parser').readIEEE754
+
+// To ensure that 0.4 of node works correctly
+var isDate = function isDate(d) {
+  return typeof d === 'object' && Object.prototype.toString.call(d) === '[object Date]';
+}
+
+/**
+ * Create a new BSON instance
+ *
+ * @class Represents the BSON Parser
+ * @return {BSON} instance of BSON Parser.
+ */
+function BSON () {};
+
+/**
+ * @ignore
+ * @api private
+ */
+// BSON MAX VALUES
+BSON.BSON_INT32_MAX = 0x7FFFFFFF;
+BSON.BSON_INT32_MIN = -0x80000000;
+
+BSON.BSON_INT64_MAX = Math.pow(2, 63) - 1;
+BSON.BSON_INT64_MIN = -Math.pow(2, 63);
+
+// JS MAX PRECISE VALUES
+BSON.JS_INT_MAX = 0x20000000000000;  // Any integer up to 2^53 can be precisely represented by a double.
+BSON.JS_INT_MIN = -0x20000000000000;  // Any integer down to -2^53 can be precisely represented by a double.
+
+// Internal long versions
+var JS_INT_MAX_LONG = Long.fromNumber(0x20000000000000);  // Any integer up to 2^53 can be precisely represented by a double.
+var JS_INT_MIN_LONG = Long.fromNumber(-0x20000000000000);  // Any integer down to -2^53 can be precisely represented by a double.
+
+/**
+ * Number BSON Type
+ *
+ * @classconstant BSON_DATA_NUMBER
+ **/
+BSON.BSON_DATA_NUMBER = 1;
+/**
+ * String BSON Type
+ *
+ * @classconstant BSON_DATA_STRING
+ **/
+BSON.BSON_DATA_STRING = 2;
+/**
+ * Object BSON Type
+ *
+ * @classconstant BSON_DATA_OBJECT
+ **/
+BSON.BSON_DATA_OBJECT = 3;
+/**
+ * Array BSON Type
+ *
+ * @classconstant BSON_DATA_ARRAY
+ **/
+BSON.BSON_DATA_ARRAY = 4;
+/**
+ * Binary BSON Type
+ *
+ * @classconstant BSON_DATA_BINARY
+ **/
+BSON.BSON_DATA_BINARY = 5;
+/**
+ * ObjectID BSON Type
+ *
+ * @classconstant BSON_DATA_OID
+ **/
+BSON.BSON_DATA_OID = 7;
+/**
+ * Boolean BSON Type
+ *
+ * @classconstant BSON_DATA_BOOLEAN
+ **/
+BSON.BSON_DATA_BOOLEAN = 8;
+/**
+ * Date BSON Type
+ *
+ * @classconstant BSON_DATA_DATE
+ **/
+BSON.BSON_DATA_DATE = 9;
+/**
+ * null BSON Type
+ *
+ * @classconstant BSON_DATA_NULL
+ **/
+BSON.BSON_DATA_NULL = 10;
+/**
+ * RegExp BSON Type
+ *
+ * @classconstant BSON_DATA_REGEXP
+ **/
+BSON.BSON_DATA_REGEXP = 11;
+/**
+ * Code BSON Type
+ *
+ * @classconstant BSON_DATA_CODE
+ **/
+BSON.BSON_DATA_CODE = 13;
+/**
+ * Symbol BSON Type
+ *
+ * @classconstant BSON_DATA_SYMBOL
+ **/
+BSON.BSON_DATA_SYMBOL = 14;
+/**
+ * Code with Scope BSON Type
+ *
+ * @classconstant BSON_DATA_CODE_W_SCOPE
+ **/
+BSON.BSON_DATA_CODE_W_SCOPE = 15;
+/**
+ * 32 bit Integer BSON Type
+ *
+ * @classconstant BSON_DATA_INT
+ **/
+BSON.BSON_DATA_INT = 16;
+/**
+ * Timestamp BSON Type
+ *
+ * @classconstant BSON_DATA_TIMESTAMP
+ **/
+BSON.BSON_DATA_TIMESTAMP = 17;
+/**
+ * Long BSON Type
+ *
+ * @classconstant BSON_DATA_LONG
+ **/
+BSON.BSON_DATA_LONG = 18;
+/**
+ * MinKey BSON Type
+ *
+ * @classconstant BSON_DATA_MIN_KEY
+ **/
+BSON.BSON_DATA_MIN_KEY = 0xff;
+/**
+ * MaxKey BSON Type
+ *
+ * @classconstant BSON_DATA_MAX_KEY
+ **/
+BSON.BSON_DATA_MAX_KEY = 0x7f;
+
+/**
+ * Binary Default Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_DEFAULT
+ **/
+BSON.BSON_BINARY_SUBTYPE_DEFAULT = 0;
+/**
+ * Binary Function Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_FUNCTION
+ **/
+BSON.BSON_BINARY_SUBTYPE_FUNCTION = 1;
+/**
+ * Binary Byte Array Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_BYTE_ARRAY
+ **/
+BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY = 2;
+/**
+ * Binary UUID Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_UUID
+ **/
+BSON.BSON_BINARY_SUBTYPE_UUID = 3;
+/**
+ * Binary MD5 Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_MD5
+ **/
+BSON.BSON_BINARY_SUBTYPE_MD5 = 4;
+/**
+ * Binary User Defined Type
+ *
+ * @classconstant BSON_BINARY_SUBTYPE_USER_DEFINED
+ **/
+BSON.BSON_BINARY_SUBTYPE_USER_DEFINED = 128;
+
+/**
+ * Calculate the bson size for a passed in Javascript object.
+ *
+ * @param {Object} object the Javascript object to calculate the BSON byte size for.
+ * @param {Boolean} [serializeFunctions] serialize all functions in the object **(default:false)**.
+ * @return {Number} returns the number of bytes the BSON object will take up.
+ * @api public
+ */
+BSON.calculateObjectSize = function calculateObjectSize(object, serializeFunctions) {
+  var totalLength = (4 + 1);
+
+  if(Array.isArray(object)) {
+    for(var i = 0; i < object.length; i++) {
+      totalLength += calculateElement(i.toString(), object[i], serializeFunctions)
+    }
+  } else {
+		// If we have toBSON defined, override the current object
+		if(object.toBSON) {
+			object = object.toBSON();
+		}
+
+		// Calculate size
+    for(var key in object) {
+      totalLength += calculateElement(key, object[key], serializeFunctions)
+    }
+  }
+
+  return totalLength;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+function calculateElement(name, value, serializeFunctions) {
+  var isBuffer = typeof Buffer !== 'undefined';
+
+  switch(typeof value) {
+    case 'string':
+      return 1 + (!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1 + 4 + (!isBuffer ? numberOfBytes(value) : Buffer.byteLength(value, 'utf8')) + 1;
+    case 'number':
+      if(Math.floor(value) === value && value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
+        if(value >= BSON.BSON_INT32_MIN && value <= BSON.BSON_INT32_MAX) { // 32 bit
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (4 + 1);
+        } else {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
+        }
+      } else {  // 64 bit
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
+      }
+    case 'undefined':
+      return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1);
+    case 'boolean':
+      return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1 + 1);
+    case 'object':
+      if(value == null || value instanceof MinKey || value instanceof MaxKey || value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1);
+      } else if(value instanceof ObjectID || value['_bsontype'] == 'ObjectID') {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (12 + 1);
+      } else if(value instanceof Date || isDate(value)) {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
+      } else if(typeof Buffer !== 'undefined' && Buffer.isBuffer(value)) {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1 + 4 + 1) + value.length;
+      } else if(value instanceof Long || value instanceof Double || value instanceof Timestamp
+          || value['_bsontype'] == 'Long' || value['_bsontype'] == 'Double' || value['_bsontype'] == 'Timestamp') {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
+      } else if(value instanceof Code || value['_bsontype'] == 'Code') {
+        // Calculate size depending on the availability of a scope
+        if(value.scope != null && Object.keys(value.scope).length > 0) {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + 4 + (!isBuffer ? numberOfBytes(value.code.toString()) : Buffer.byteLength(value.code.toString(), 'utf8')) + 1 + BSON.calculateObjectSize(value.scope, serializeFunctions);
+        } else {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + (!isBuffer ? numberOfBytes(value.code.toString()) : Buffer.byteLength(value.code.toString(), 'utf8')) + 1;
+        }
+      } else if(value instanceof Binary || value['_bsontype'] == 'Binary') {
+        // Check what kind of subtype we have
+        if(value.sub_type == Binary.SUBTYPE_BYTE_ARRAY) {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (value.position + 1 + 4 + 1 + 4);
+        } else {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (value.position + 1 + 4 + 1);
+        }
+      } else if(value instanceof Symbol || value['_bsontype'] == 'Symbol') {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + ((!isBuffer ? numberOfBytes(value.value) : Buffer.byteLength(value.value, 'utf8')) + 4 + 1 + 1);
+      } else if(value instanceof DBRef || value['_bsontype'] == 'DBRef') {
+        // Set up correct object for serialization
+        var ordered_values = {
+            '$ref': value.namespace
+          , '$id' : value.oid
+        };
+
+        // Add db reference if it exists
+        if(null != value.db) {
+          ordered_values['$db'] = value.db;
+        }
+
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + BSON.calculateObjectSize(ordered_values, serializeFunctions);
+      } else if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]') {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + (!isBuffer ? numberOfBytes(value.source) : Buffer.byteLength(value.source, 'utf8')) + 1
+            + (value.global ? 1 : 0) + (value.ignoreCase ? 1 : 0) + (value.multiline ? 1 : 0) + 1
+      } else {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + BSON.calculateObjectSize(value, serializeFunctions) + 1;
+      }
+    case 'function':
+      // WTF for 0.4.X where typeof /someregexp/ === 'function'
+      if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]' || String.call(value) == '[object RegExp]') {
+        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + (!isBuffer ? numberOfBytes(value.source) : Buffer.byteLength(value.source, 'utf8')) + 1
+          + (value.global ? 1 : 0) + (value.ignoreCase ? 1 : 0) + (value.multiline ? 1 : 0) + 1
+      } else {
+        if(serializeFunctions && value.scope != null && Object.keys(value.scope).length > 0) {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + 4 + (!isBuffer ? numberOfBytes(value.toString()) : Buffer.byteLength(value.toString(), 'utf8')) + 1 + BSON.calculateObjectSize(value.scope, serializeFunctions);
+        } else if(serializeFunctions) {
+          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + (!isBuffer ? numberOfBytes(value.toString()) : Buffer.byteLength(value.toString(), 'utf8')) + 1;
+        }
+      }
+  }
+
+  return 0;
+}
+
+/**
+ * Serialize a Javascript object using a predefined Buffer and index into the buffer, useful when pre-allocating the space for serialization.
+ *
+ * @param {Object} object the Javascript object to serialize.
+ * @param {Boolean} checkKeys the serializer will check if keys are valid.
+ * @param {Buffer} buffer the Buffer you pre-allocated to store the serialized BSON object.
+ * @param {Number} index the index in the buffer where we wish to start serializing into.
+ * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
+ * @return {Number} returns the new write index in the Buffer.
+ * @api public
+ */
+BSON.serializeWithBufferAndIndex = function serializeWithBufferAndIndex(object, checkKeys, buffer, index, serializeFunctions) {
+  // Default setting false
+  serializeFunctions = serializeFunctions == null ? false : serializeFunctions;
+  // Write end information (length of the object)
+  var size = buffer.length;
+  // Write the size of the object
+  buffer[index++] = size & 0xff;
+  buffer[index++] = (size >> 8) & 0xff;
+  buffer[index++] = (size >> 16) & 0xff;
+  buffer[index++] = (size >> 24) & 0xff;
+  return serializeObject(object, checkKeys, buffer, index, serializeFunctions) - 1;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+var serializeObject = function(object, checkKeys, buffer, index, serializeFunctions) {
+  // Process the object
+  if(Array.isArray(object)) {
+    for(var i = 0; i < object.length; i++) {
+      index = packElement(i.toString(), object[i], checkKeys, buffer, index, serializeFunctions);
+    }
+  } else {
+		// If we have toBSON defined, override the current object
+		if(object.toBSON) {
+			object = object.toBSON();
+		}
+
+		// Serialize the object
+    for(var key in object) {
+      // Check the key and throw error if it's illegal
+      if(checkKeys ==  true && (key != '$db' && key != '$ref' && key != '$id')) {
+        BSON.checkKey(key);
+      }
+
+      // Pack the element
+      index = packElement(key, object[key], checkKeys, buffer, index, serializeFunctions);
+    }
+  }
+
+  // Write zero
+  buffer[index++] = 0;
+  return index;
+}
+
+var stringToBytes = function(str) {
+  var ch, st, re = [];
+  for (var i = 0; i < str.length; i++ ) {
+    ch = str.charCodeAt(i);  // get char
+    st = [];                 // set up "stack"
+    do {
+      st.push( ch & 0xFF );  // push byte to stack
+      ch = ch >> 8;          // shift value down by 1 byte
+    }
+    while ( ch );
+    // add stack contents to result
+    // done because chars have "wrong" endianness
+    re = re.concat( st.reverse() );
+  }
+  // return an array of bytes
+  return re;
+}
+
+var numberOfBytes = function(str) {
+  var ch, st, re = 0;
+  for (var i = 0; i < str.length; i++ ) {
+    ch = str.charCodeAt(i);  // get char
+    st = [];                 // set up "stack"
+    do {
+      st.push( ch & 0xFF );  // push byte to stack
+      ch = ch >> 8;          // shift value down by 1 byte
+    }
+    while ( ch );
+    // add stack contents to result
+    // done because chars have "wrong" endianness
+    re = re + st.length;
+  }
+  // return an array of bytes
+  return re;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+var writeToTypedArray = function(buffer, string, index) {
+  var bytes = stringToBytes(string);
+  for(var i = 0; i < bytes.length; i++) {
+    buffer[index + i] = bytes[i];
+  }
+  return bytes.length;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+var supportsBuffer = typeof Buffer != 'undefined';
+
+/**
+ * @ignore
+ * @api private
+ */
+var packElement = function(name, value, checkKeys, buffer, index, serializeFunctions) {
+  var startIndex = index;
+
+  switch(typeof value) {
+    case 'string':
+      // Encode String type
+      buffer[index++] = BSON.BSON_DATA_STRING;
+      // Number of written bytes
+      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+      // Encode the name
+      index = index + numberOfWrittenBytes + 1;
+      buffer[index - 1] = 0;
+
+      // Calculate size
+      var size = supportsBuffer ? Buffer.byteLength(value) + 1 : numberOfBytes(value) + 1;
+      // Write the size of the string to buffer
+      buffer[index + 3] = (size >> 24) & 0xff;
+      buffer[index + 2] = (size >> 16) & 0xff;
+      buffer[index + 1] = (size >> 8) & 0xff;
+      buffer[index] = size & 0xff;
+      // Ajust the index
+      index = index + 4;
+      // Write the string
+      supportsBuffer ? buffer.write(value, index, 'utf8') : writeToTypedArray(buffer, value, index);
+      // Update index
+      index = index + size - 1;
+      // Write zero
+      buffer[index++] = 0;
+      // Return index
+      return index;
+    case 'number':
+      // We have an integer value
+      if(Math.floor(value) === value && value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
+        // If the value fits in 32 bits encode as int, if it fits in a double
+        // encode it as a double, otherwise long
+        if(value >= BSON.BSON_INT32_MIN && value <= BSON.BSON_INT32_MAX) {
+          // Set int type 32 bits or less
+          buffer[index++] = BSON.BSON_DATA_INT;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Write the int value
+          buffer[index++] = value & 0xff;
+          buffer[index++] = (value >> 8) & 0xff;
+          buffer[index++] = (value >> 16) & 0xff;
+          buffer[index++] = (value >> 24) & 0xff;
+        } else if(value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
+          // Encode as double
+          buffer[index++] = BSON.BSON_DATA_NUMBER;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Write float
+          writeIEEE754(buffer, value, index, 'little', 52, 8);
+          // Ajust index
+          index = index + 8;
+        } else {
+          // Set long type
+          buffer[index++] = BSON.BSON_DATA_LONG;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          var longVal = Long.fromNumber(value);
+          var lowBits = longVal.getLowBits();
+          var highBits = longVal.getHighBits();
+          // Encode low bits
+          buffer[index++] = lowBits & 0xff;
+          buffer[index++] = (lowBits >> 8) & 0xff;
+          buffer[index++] = (lowBits >> 16) & 0xff;
+          buffer[index++] = (lowBits >> 24) & 0xff;
+          // Encode high bits
+          buffer[index++] = highBits & 0xff;
+          buffer[index++] = (highBits >> 8) & 0xff;
+          buffer[index++] = (highBits >> 16) & 0xff;
+          buffer[index++] = (highBits >> 24) & 0xff;
+        }
+      } else {
+        // Encode as double
+        buffer[index++] = BSON.BSON_DATA_NUMBER;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Write float
+        writeIEEE754(buffer, value, index, 'little', 52, 8);
+        // Ajust index
+        index = index + 8;
+      }
+
+      return index;
+    case 'undefined':
+      // Set long type
+      buffer[index++] = BSON.BSON_DATA_NULL;
+      // Number of written bytes
+      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+      // Encode the name
+      index = index + numberOfWrittenBytes + 1;
+      buffer[index - 1] = 0;
+      return index;
+    case 'boolean':
+      // Write the type
+      buffer[index++] = BSON.BSON_DATA_BOOLEAN;
+      // Number of written bytes
+      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+      // Encode the name
+      index = index + numberOfWrittenBytes + 1;
+      buffer[index - 1] = 0;
+      // Encode the boolean value
+      buffer[index++] = value ? 1 : 0;
+      return index;
+    case 'object':
+      if(value === null || value instanceof MinKey || value instanceof MaxKey
+          || value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
+        // Write the type of either min or max key
+        if(value === null) {
+          buffer[index++] = BSON.BSON_DATA_NULL;
+        } else if(value instanceof MinKey) {
+          buffer[index++] = BSON.BSON_DATA_MIN_KEY;
+        } else {
+          buffer[index++] = BSON.BSON_DATA_MAX_KEY;
+        }
+
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        return index;
+      } else if(value instanceof ObjectID || value['_bsontype'] == 'ObjectID') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_OID;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+
+        // Write objectid
+        supportsBuffer ? buffer.write(value.id, index, 'binary') : writeToTypedArray(buffer, value.id, index);
+        // Ajust index
+        index = index + 12;
+        return index;
+      } else if(value instanceof Date || isDate(value)) {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_DATE;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+
+        // Write the date
+        var dateInMilis = Long.fromNumber(value.getTime());
+        var lowBits = dateInMilis.getLowBits();
+        var highBits = dateInMilis.getHighBits();
+        // Encode low bits
+        buffer[index++] = lowBits & 0xff;
+        buffer[index++] = (lowBits >> 8) & 0xff;
+        buffer[index++] = (lowBits >> 16) & 0xff;
+        buffer[index++] = (lowBits >> 24) & 0xff;
+        // Encode high bits
+        buffer[index++] = highBits & 0xff;
+        buffer[index++] = (highBits >> 8) & 0xff;
+        buffer[index++] = (highBits >> 16) & 0xff;
+        buffer[index++] = (highBits >> 24) & 0xff;
+        return index;
+      } else if(typeof Buffer !== 'undefined' && Buffer.isBuffer(value)) {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_BINARY;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Get size of the buffer (current write point)
+        var size = value.length;
+        // Write the size of the string to buffer
+        buffer[index++] = size & 0xff;
+        buffer[index++] = (size >> 8) & 0xff;
+        buffer[index++] = (size >> 16) & 0xff;
+        buffer[index++] = (size >> 24) & 0xff;
+        // Write the default subtype
+        buffer[index++] = BSON.BSON_BINARY_SUBTYPE_DEFAULT;
+        // Copy the content form the binary field to the buffer
+        value.copy(buffer, index, 0, size);
+        // Adjust the index
+        index = index + size;
+        return index;
+      } else if(value instanceof Long || value instanceof Timestamp || value['_bsontype'] == 'Long' || value['_bsontype'] == 'Timestamp') {
+        // Write the type
+        buffer[index++] = value instanceof Long ? BSON.BSON_DATA_LONG : BSON.BSON_DATA_TIMESTAMP;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Write the date
+        var lowBits = value.getLowBits();
+        var highBits = value.getHighBits();
+        // Encode low bits
+        buffer[index++] = lowBits & 0xff;
+        buffer[index++] = (lowBits >> 8) & 0xff;
+        buffer[index++] = (lowBits >> 16) & 0xff;
+        buffer[index++] = (lowBits >> 24) & 0xff;
+        // Encode high bits
+        buffer[index++] = highBits & 0xff;
+        buffer[index++] = (highBits >> 8) & 0xff;
+        buffer[index++] = (highBits >> 16) & 0xff;
+        buffer[index++] = (highBits >> 24) & 0xff;
+        return index;
+      } else if(value instanceof Double || value['_bsontype'] == 'Double') {
+        // Encode as double
+        buffer[index++] = BSON.BSON_DATA_NUMBER;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Write float
+        writeIEEE754(buffer, value, index, 'little', 52, 8);
+        // Ajust index
+        index = index + 8;
+        return index;
+      } else if(value instanceof Code || value['_bsontype'] == 'Code') {
+        if(value.scope != null && Object.keys(value.scope).length > 0) {
+          // Write the type
+          buffer[index++] = BSON.BSON_DATA_CODE_W_SCOPE;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Calculate the scope size
+          var scopeSize = BSON.calculateObjectSize(value.scope, serializeFunctions);
+          // Function string
+          var functionString = value.code.toString();
+          // Function Size
+          var codeSize = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
+
+          // Calculate full size of the object
+          var totalSize = 4 + codeSize + scopeSize + 4;
+
+          // Write the total size of the object
+          buffer[index++] = totalSize & 0xff;
+          buffer[index++] = (totalSize >> 8) & 0xff;
+          buffer[index++] = (totalSize >> 16) & 0xff;
+          buffer[index++] = (totalSize >> 24) & 0xff;
+
+          // Write the size of the string to buffer
+          buffer[index++] = codeSize & 0xff;
+          buffer[index++] = (codeSize >> 8) & 0xff;
+          buffer[index++] = (codeSize >> 16) & 0xff;
+          buffer[index++] = (codeSize >> 24) & 0xff;
+
+          // Write the string
+          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
+          // Update index
+          index = index + codeSize - 1;
+          // Write zero
+          buffer[index++] = 0;
+          // Serialize the scope object
+          var scopeObjectBuffer = supportsBuffer ? new Buffer(scopeSize) : new Uint8Array(new ArrayBuffer(scopeSize));
+          // Execute the serialization into a seperate buffer
+          serializeObject(value.scope, checkKeys, scopeObjectBuffer, 0, serializeFunctions);
+
+          // Adjusted scope Size (removing the header)
+          var scopeDocSize = scopeSize;
+          // Write scope object size
+          buffer[index++] = scopeDocSize & 0xff;
+          buffer[index++] = (scopeDocSize >> 8) & 0xff;
+          buffer[index++] = (scopeDocSize >> 16) & 0xff;
+          buffer[index++] = (scopeDocSize >> 24) & 0xff;
+
+          // Write the scopeObject into the buffer
+          supportsBuffer ? scopeObjectBuffer.copy(buffer, index, 0, scopeSize) : buffer.set(scopeObjectBuffer, index);
+          // Adjust index, removing the empty size of the doc (5 bytes 0000000005)
+          index = index + scopeDocSize - 5;
+          // Write trailing zero
+          buffer[index++] = 0;
+          return index
+        } else {
+          buffer[index++] = BSON.BSON_DATA_CODE;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Function string
+          var functionString = value.code.toString();
+          // Function Size
+          var size = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
+          // Write the size of the string to buffer
+          buffer[index++] = size & 0xff;
+          buffer[index++] = (size >> 8) & 0xff;
+          buffer[index++] = (size >> 16) & 0xff;
+          buffer[index++] = (size >> 24) & 0xff;
+          // Write the string
+          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
+          // Update index
+          index = index + size - 1;
+          // Write zero
+          buffer[index++] = 0;
+          return index;
+        }
+      } else if(value instanceof Binary || value['_bsontype'] == 'Binary') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_BINARY;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Extract the buffer
+        var data = value.value(true);
+        // Calculate size
+        var size = value.position;
+        // Write the size of the string to buffer
+        buffer[index++] = size & 0xff;
+        buffer[index++] = (size >> 8) & 0xff;
+        buffer[index++] = (size >> 16) & 0xff;
+        buffer[index++] = (size >> 24) & 0xff;
+        // Write the subtype to the buffer
+        buffer[index++] = value.sub_type;
+
+        // If we have binary type 2 the 4 first bytes are the size
+        if(value.sub_type == Binary.SUBTYPE_BYTE_ARRAY) {
+          buffer[index++] = size & 0xff;
+          buffer[index++] = (size >> 8) & 0xff;
+          buffer[index++] = (size >> 16) & 0xff;
+          buffer[index++] = (size >> 24) & 0xff;
+        }
+
+        // Write the data to the object
+        supportsBuffer ? data.copy(buffer, index, 0, value.position) : buffer.set(data, index);
+        // Ajust index
+        index = index + value.position;
+        return index;
+      } else if(value instanceof Symbol || value['_bsontype'] == 'Symbol') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_SYMBOL;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Calculate size
+        var size = supportsBuffer ? Buffer.byteLength(value.value) + 1 : numberOfBytes(value.value) + 1;
+        // Write the size of the string to buffer
+        buffer[index++] = size & 0xff;
+        buffer[index++] = (size >> 8) & 0xff;
+        buffer[index++] = (size >> 16) & 0xff;
+        buffer[index++] = (size >> 24) & 0xff;
+        // Write the string
+        buffer.write(value.value, index, 'utf8');
+        // Update index
+        index = index + size - 1;
+        // Write zero
+        buffer[index++] = 0x00;
+        return index;
+      } else if(value instanceof DBRef || value['_bsontype'] == 'DBRef') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_OBJECT;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+        // Set up correct object for serialization
+        var ordered_values = {
+            '$ref': value.namespace
+          , '$id' : value.oid
+        };
+
+        // Add db reference if it exists
+        if(null != value.db) {
+          ordered_values['$db'] = value.db;
+        }
+
+        // Message size
+        var size = BSON.calculateObjectSize(ordered_values, serializeFunctions);
+        // Serialize the object
+        var endIndex = BSON.serializeWithBufferAndIndex(ordered_values, checkKeys, buffer, index, serializeFunctions);
+        // Write the size of the string to buffer
+        buffer[index++] = size & 0xff;
+        buffer[index++] = (size >> 8) & 0xff;
+        buffer[index++] = (size >> 16) & 0xff;
+        buffer[index++] = (size >> 24) & 0xff;
+        // Write zero for object
+        buffer[endIndex++] = 0x00;
+        // Return the end index
+        return endIndex;
+      } else if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_REGEXP;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+
+        // Write the regular expression string
+        supportsBuffer ? buffer.write(value.source, index, 'utf8') : writeToTypedArray(buffer, value.source, index);
+        // Adjust the index
+        index = index + (supportsBuffer ? Buffer.byteLength(value.source) : numberOfBytes(value.source));
+        // Write zero
+        buffer[index++] = 0x00;
+        // Write the parameters
+        if(value.global) buffer[index++] = 0x73; // s
+        if(value.ignoreCase) buffer[index++] = 0x69; // i
+        if(value.multiline) buffer[index++] = 0x6d; // m
+        // Add ending zero
+        buffer[index++] = 0x00;
+        return index;
+      } else {
+        // Write the type
+        buffer[index++] = Array.isArray(value) ? BSON.BSON_DATA_ARRAY : BSON.BSON_DATA_OBJECT;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Adjust the index
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+	      var endIndex = serializeObject(value, checkKeys, buffer, index + 4, serializeFunctions);
+        // Write size
+        var size = endIndex - index;
+        // Write the size of the string to buffer
+        buffer[index++] = size & 0xff;
+        buffer[index++] = (size >> 8) & 0xff;
+        buffer[index++] = (size >> 16) & 0xff;
+        buffer[index++] = (size >> 24) & 0xff;
+        return endIndex;
+      }
+    case 'function':
+      // WTF for 0.4.X where typeof /someregexp/ === 'function'
+      if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]' || String.call(value) == '[object RegExp]') {
+        // Write the type
+        buffer[index++] = BSON.BSON_DATA_REGEXP;
+        // Number of written bytes
+        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+        // Encode the name
+        index = index + numberOfWrittenBytes + 1;
+        buffer[index - 1] = 0;
+
+        // Write the regular expression string
+        buffer.write(value.source, index, 'utf8');
+        // Adjust the index
+        index = index + (supportsBuffer ? Buffer.byteLength(value.source) : numberOfBytes(value.source));
+        // Write zero
+        buffer[index++] = 0x00;
+        // Write the parameters
+        if(value.global) buffer[index++] = 0x73; // s
+        if(value.ignoreCase) buffer[index++] = 0x69; // i
+        if(value.multiline) buffer[index++] = 0x6d; // m
+        // Add ending zero
+        buffer[index++] = 0x00;
+        return index;
+      } else {
+        if(serializeFunctions && value.scope != null && Object.keys(value.scope).length > 0) {
+          // Write the type
+          buffer[index++] = BSON.BSON_DATA_CODE_W_SCOPE;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Calculate the scope size
+          var scopeSize = BSON.calculateObjectSize(value.scope, serializeFunctions);
+          // Function string
+          var functionString = value.toString();
+          // Function Size
+          var codeSize = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
+
+          // Calculate full size of the object
+          var totalSize = 4 + codeSize + scopeSize;
+
+          // Write the total size of the object
+          buffer[index++] = totalSize & 0xff;
+          buffer[index++] = (totalSize >> 8) & 0xff;
+          buffer[index++] = (totalSize >> 16) & 0xff;
+          buffer[index++] = (totalSize >> 24) & 0xff;
+
+          // Write the size of the string to buffer
+          buffer[index++] = codeSize & 0xff;
+          buffer[index++] = (codeSize >> 8) & 0xff;
+          buffer[index++] = (codeSize >> 16) & 0xff;
+          buffer[index++] = (codeSize >> 24) & 0xff;
+
+          // Write the string
+          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
+          // Update index
+          index = index + codeSize - 1;
+          // Write zero
+          buffer[index++] = 0;
+          // Serialize the scope object
+          var scopeObjectBuffer = new Buffer(scopeSize);
+          // Execute the serialization into a seperate buffer
+          serializeObject(value.scope, checkKeys, scopeObjectBuffer, 0, serializeFunctions);
+
+          // Adjusted scope Size (removing the header)
+          var scopeDocSize = scopeSize - 4;
+          // Write scope object size
+          buffer[index++] = scopeDocSize & 0xff;
+          buffer[index++] = (scopeDocSize >> 8) & 0xff;
+          buffer[index++] = (scopeDocSize >> 16) & 0xff;
+          buffer[index++] = (scopeDocSize >> 24) & 0xff;
+
+          // Write the scopeObject into the buffer
+          scopeObjectBuffer.copy(buffer, index, 0, scopeSize);
+
+          // Adjust index, removing the empty size of the doc (5 bytes 0000000005)
+          index = index + scopeDocSize - 5;
+          // Write trailing zero
+          buffer[index++] = 0;
+          return index
+        } else if(serializeFunctions) {
+          buffer[index++] = BSON.BSON_DATA_CODE;
+          // Number of written bytes
+          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
+          // Encode the name
+          index = index + numberOfWrittenBytes + 1;
+          buffer[index - 1] = 0;
+          // Function string
+          var functionString = value.toString();
+          // Function Size
+          var size = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
+          // Write the size of the string to buffer
+          buffer[index++] = size & 0xff;
+          buffer[index++] = (size >> 8) & 0xff;
+          buffer[index++] = (size >> 16) & 0xff;
+          buffer[index++] = (size >> 24) & 0xff;
+          // Write the string
+          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
+          // Update index
+          index = index + size - 1;
+          // Write zero
+          buffer[index++] = 0;
+          return index;
+        }
+      }
+  }
+
+  // If no value to serialize
+  return index;
+}
+
+/**
+ * Serialize a Javascript object.
+ *
+ * @param {Object} object the Javascript object to serialize.
+ * @param {Boolean} checkKeys the serializer will check if keys are valid.
+ * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.
+ * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
+ * @return {Buffer} returns the Buffer object containing the serialized object.
+ * @api public
+ */
+BSON.serialize = function(object, checkKeys, asBuffer, serializeFunctions) {
+  var buffer = null;
+  // Calculate the size of the object
+  var size = BSON.calculateObjectSize(object, serializeFunctions);
+  // Fetch the best available type for storing the binary data
+  if(buffer = typeof Buffer != 'undefined') {
+    buffer = new Buffer(size);
+    asBuffer = true;
+  } else if(typeof Uint8Array != 'undefined') {
+    buffer = new Uint8Array(new ArrayBuffer(size));
+  } else {
+    buffer = new Array(size);
+  }
+
+  // If asBuffer is false use typed arrays
+  BSON.serializeWithBufferAndIndex(object, checkKeys, buffer, 0, serializeFunctions);
+  return buffer;
+}
+
+/**
+ * Contains the function cache if we have that enable to allow for avoiding the eval step on each deserialization, comparison is by md5
+ *
+ * @ignore
+ * @api private
+ */
+var functionCache = BSON.functionCache = {};
+
+/**
+ * Crc state variables shared by function
+ *
+ * @ignore
+ * @api private
+ */
+var table = [0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D];
+
+/**
+ * CRC32 hash method, Fast and enough versitility for our usage
+ *
+ * @ignore
+ * @api private
+ */
+var crc32 =  function(string, start, end) {
+  var crc = 0
+  var x = 0;
+  var y = 0;
+  crc = crc ^ (-1);
+
+  for(var i = start, iTop = end; i < iTop;i++) {
+  	y = (crc ^ string[i]) & 0xFF;
+    x = table[y];
+  	crc = (crc >>> 8) ^ x;
+  }
+
+  return crc ^ (-1);
+}
+
+/**
+ * Deserialize stream data as BSON documents.
+ *
+ * Options
+ *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
+ *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
+ *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
+ *
+ * @param {Buffer} data the buffer containing the serialized set of BSON documents.
+ * @param {Number} startIndex the start index in the data Buffer where the deserialization is to start.
+ * @param {Number} numberOfDocuments number of documents to deserialize.
+ * @param {Array} documents an array where to store the deserialized documents.
+ * @param {Number} docStartIndex the index in the documents array from where to start inserting documents.
+ * @param {Object} [options] additional options used for the deserialization.
+ * @return {Number} returns the next index in the buffer after deserialization **x** numbers of documents.
+ * @api public
+ */
+BSON.deserializeStream = function(data, startIndex, numberOfDocuments, documents, docStartIndex, options) {
+  // if(numberOfDocuments !== documents.length) throw new Error("Number of expected results back is less than the number of documents");
+  options = options != null ? options : {};
+  var index = startIndex;
+  // Loop over all documents
+  for(var i = 0; i < numberOfDocuments; i++) {
+    // Find size of the document
+    var size = data[index] | data[index + 1] << 8 | data[index + 2] << 16 | data[index + 3] << 24;
+    // Update options with index
+    options['index'] = index;
+    // Parse the document at this point
+    documents[docStartIndex + i] = BSON.deserialize(data, options);
+    // Adjust index by the document size
+    index = index + size;
+  }
+
+  // Return object containing end index of parsing and list of documents
+  return index;
+}
+
+/**
+ * Ensure eval is isolated.
+ *
+ * @ignore
+ * @api private
+ */
+var isolateEvalWithHash = function(functionCache, hash, functionString, object) {
+  // Contains the value we are going to set
+  var value = null;
+
+  // Check for cache hit, eval if missing and return cached function
+  if(functionCache[hash] == null) {
+    eval("value = " + functionString);
+    functionCache[hash] = value;
+  }
+  // Set the object
+  return functionCache[hash].bind(object);
+}
+
+/**
+ * Ensure eval is isolated.
+ *
+ * @ignore
+ * @api private
+ */
+var isolateEval = function(functionString) {
+  // Contains the value we are going to set
+  var value = null;
+  // Eval the function
+  eval("value = " + functionString);
+  return value;
+}
+
+/**
+ * Convert Uint8Array to String
+ *
+ * @ignore
+ * @api private
+ */
+var convertUint8ArrayToUtf8String = function(byteArray, startIndex, endIndex) {
+  return BinaryParser.decode_utf8(convertArraytoUtf8BinaryString(byteArray, startIndex, endIndex));
+}
+
+var convertArraytoUtf8BinaryString = function(byteArray, startIndex, endIndex) {
+  var result = "";
+  for(var i = startIndex; i < endIndex; i++) {
+    result = result + String.fromCharCode(byteArray[i]);
+  }
+
+  return result;
+};
+
+/**
+ * Deserialize data as BSON.
+ *
+ * Options
+ *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
+ *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
+ *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
+ *
+ * @param {Buffer} buffer the buffer containing the serialized set of BSON documents.
+ * @param {Object} [options] additional options used for the deserialization.
+ * @param {Boolean} [isArray] ignore used for recursive parsing.
+ * @return {Object} returns the deserialized Javascript Object.
+ * @api public
+ */
+BSON.deserialize = function(buffer, options, isArray) {
+  // Options
+  options = options == null ? {} : options;
+  var evalFunctions = options['evalFunctions'] == null ? false : options['evalFunctions'];
+  var cacheFunctions = options['cacheFunctions'] == null ? false : options['cacheFunctions'];
+  var cacheFunctionsCrc32 = options['cacheFunctionsCrc32'] == null ? false : options['cacheFunctionsCrc32'];
+
+  // Validate that we have at least 4 bytes of buffer
+  if(buffer.length < 5) throw new Error("corrupt bson message < 5 bytes long");
+
+  // Set up index
+  var index = typeof options['index'] == 'number' ? options['index'] : 0;
+  // Reads in a C style string
+  var readCStyleString = function() {
+    // Get the start search index
+    var i = index;
+    // Locate the end of the c string
+    while(buffer[i] !== 0x00) { i++ }
+    // Grab utf8 encoded string
+    var string = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, i) : convertUint8ArrayToUtf8String(buffer, index, i);
+    // Update index position
+    index = i + 1;
+    // Return string
+    return string;
+  }
+
+  // Create holding object
+  var object = isArray ? [] : {};
+
+  // Read the document size
+  var size = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+
+  // Ensure buffer is valid size
+  if(size < 5 || size > buffer.length) throw new Error("corrupt bson message");
+
+  // While we have more left data left keep parsing
+  while(true) {
+    // Read the type
+    var elementType = buffer[index++];
+    // If we get a zero it's the last byte, exit
+    if(elementType == 0) break;
+    // Read the name of the field
+    var name = readCStyleString();
+    // Switch on the type
+    switch(elementType) {
+      case BSON.BSON_DATA_OID:
+        var string = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('binary', index, index + 12) : convertArraytoUtf8BinaryString(buffer, index, index + 12);
+        // Decode the oid
+        object[name] = new ObjectID(string);
+        // Update index
+        index = index + 12;
+        break;
+      case BSON.BSON_DATA_STRING:
+        // Read the content of the field
+        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Add string to object
+        object[name] = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
+        // Update parse index position
+        index = index + stringSize;
+        break;
+      case BSON.BSON_DATA_INT:
+        // Decode the 32bit value
+        object[name] = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        break;
+      case BSON.BSON_DATA_NUMBER:
+        // Decode the double value
+        object[name] = readIEEE754(buffer, index, 'little', 52, 8);
+        // Update the index
+        index = index + 8;
+        break;
+      case BSON.BSON_DATA_DATE:
+        // Unpack the low and high bits
+        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Set date object
+        object[name] = new Date(new Long(lowBits, highBits).toNumber());
+        break;
+      case BSON.BSON_DATA_BOOLEAN:
+        // Parse the boolean value
+        object[name] = buffer[index++] == 1;
+        break;
+      case BSON.BSON_DATA_NULL:
+        // Parse the boolean value
+        object[name] = null;
+        break;
+      case BSON.BSON_DATA_BINARY:
+        // Decode the size of the binary blob
+        var binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Decode the subtype
+        var subType = buffer[index++];
+        // Decode as raw Buffer object if options specifies it
+        if(buffer['slice'] != null) {
+          // If we have subtype 2 skip the 4 bytes for the size
+          if(subType == Binary.SUBTYPE_BYTE_ARRAY) {
+            binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+          }
+          // Slice the data
+          object[name] = new Binary(buffer.slice(index, index + binarySize), subType);
+        } else {
+          var _buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(binarySize)) : new Array(binarySize);
+          // If we have subtype 2 skip the 4 bytes for the size
+          if(subType == Binary.SUBTYPE_BYTE_ARRAY) {
+            binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+          }
+          // Copy the data
+          for(var i = 0; i < binarySize; i++) {
+            _buffer[i] = buffer[index + i];
+          }
+          // Create the binary object
+          object[name] = new Binary(_buffer, subType);
+        }
+        // Update the index
+        index = index + binarySize;
+        break;
+      case BSON.BSON_DATA_ARRAY:
+        options['index'] = index;
+        // Decode the size of the array document
+        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
+        // Set the array to the object
+        object[name] = BSON.deserialize(buffer, options, true);
+        // Adjust the index
+        index = index + objectSize;
+        break;
+      case BSON.BSON_DATA_OBJECT:
+        options['index'] = index;
+        // Decode the size of the object document
+        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
+        // Set the array to the object
+        object[name] = BSON.deserialize(buffer, options, false);
+        // Adjust the index
+        index = index + objectSize;
+        break;
+      case BSON.BSON_DATA_REGEXP:
+        // Create the regexp
+        var source = readCStyleString();
+        var regExpOptions = readCStyleString();
+        // For each option add the corresponding one for javascript
+        var optionsArray = new Array(regExpOptions.length);
+
+        // Parse options
+        for(var i = 0; i < regExpOptions.length; i++) {
+          switch(regExpOptions[i]) {
+            case 'm':
+              optionsArray[i] = 'm';
+              break;
+            case 's':
+              optionsArray[i] = 'g';
+              break;
+            case 'i':
+              optionsArray[i] = 'i';
+              break;
+          }
+        }
+
+        object[name] = new RegExp(source, optionsArray.join(''));
+        break;
+      case BSON.BSON_DATA_LONG:
+        // Unpack the low and high bits
+        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Create long object
+        var long = new Long(lowBits, highBits);
+        // Set the object
+        object[name] = long.lessThanOrEqual(JS_INT_MAX_LONG) && long.greaterThanOrEqual(JS_INT_MIN_LONG) ? long.toNumber() : long;
+        break;
+      case BSON.BSON_DATA_SYMBOL:
+        // Read the content of the field
+        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Add string to object
+        object[name] = new Symbol(buffer.toString('utf8', index, index + stringSize - 1));
+        // Update parse index position
+        index = index + stringSize;
+        break;
+      case BSON.BSON_DATA_TIMESTAMP:
+        // Unpack the low and high bits
+        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Set the object
+        object[name] = new Timestamp(lowBits, highBits);
+        break;
+      case BSON.BSON_DATA_MIN_KEY:
+        // Parse the object
+        object[name] = new MinKey();
+        break;
+      case BSON.BSON_DATA_MAX_KEY:
+        // Parse the object
+        object[name] = new MaxKey();
+        break;
+      case BSON.BSON_DATA_CODE:
+        // Read the content of the field
+        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Function string
+        var functionString = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
+
+        // If we are evaluating the functions
+        if(evalFunctions) {
+          // Contains the value we are going to set
+          var value = null;
+          // If we have cache enabled let's look for the md5 of the function in the cache
+          if(cacheFunctions) {
+            var hash = cacheFunctionsCrc32 ? crc32(functionString) : functionString;
+            // Got to do this to avoid V8 deoptimizing the call due to finding eval
+            object[name] = isolateEvalWithHash(functionCache, hash, functionString, object);
+          } else {
+            // Set directly
+            object[name] = isolateEval(functionString);
+          }
+        } else {
+          object[name]  = new Code(functionString, {});
+        }
+
+        // Update parse index position
+        index = index + stringSize;
+        break;
+      case BSON.BSON_DATA_CODE_W_SCOPE:
+        // Read the content of the field
+        var totalSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
+        // Javascript function
+        var functionString = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
+        // Update parse index position
+        index = index + stringSize;
+        // Parse the element
+        options['index'] = index;
+        // Decode the size of the object document
+        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
+        // Decode the scope object
+        var scopeObject = BSON.deserialize(buffer, options, false);
+        // Adjust the index
+        index = index + objectSize;
+
+        // If we are evaluating the functions
+        if(evalFunctions) {
+          // Contains the value we are going to set
+          var value = null;
+          // If we have cache enabled let's look for the md5 of the function in the cache
+          if(cacheFunctions) {
+            var hash = cacheFunctionsCrc32 ? crc32(functionString) : functionString;
+            // Got to do this to avoid V8 deoptimizing the call due to finding eval
+            object[name] = isolateEvalWithHash(functionCache, hash, functionString, object);
+          } else {
+            // Set directly
+            object[name] = isolateEval(functionString);
+          }
+
+          // Set the scope on the object
+          object[name].scope = scopeObject;
+        } else {
+          object[name]  = new Code(functionString, scopeObject);
+        }
+
+        // Add string to object
+        break;
+    }
+  }
+
+  // Check if we have a db ref object
+  if(object['$id'] != null) object = new DBRef(object['$ref'], object['$id'], object['$db']);
+
+  // Return the final objects
+  return object;
+}
+
+/**
+ * Check if key name is valid.
+ *
+ * @ignore
+ * @api private
+ */
+BSON.checkKey = function checkKey (key) {
+  if (!key.length) return;
+  // Check if we have a legal key for the object
+  if('$' == key[0]) {
+    throw Error("key " + key + " must not start with '$'");
+  } else if (!!~key.indexOf('.')) {
+    throw Error("key " + key + " must not contain '.'");
+  }
+};
+
+/**
+ * Deserialize data as BSON.
+ *
+ * Options
+ *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
+ *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
+ *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
+ *
+ * @param {Buffer} buffer the buffer containing the serialized set of BSON documents.
+ * @param {Object} [options] additional options used for the deserialization.
+ * @param {Boolean} [isArray] ignore used for recursive parsing.
+ * @return {Object} returns the deserialized Javascript Object.
+ * @api public
+ */
+BSON.prototype.deserialize = function(data, options) {
+  return BSON.deserialize(data, options);
+}
+
+/**
+ * Deserialize stream data as BSON documents.
+ *
+ * Options
+ *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
+ *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
+ *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
+ *
+ * @param {Buffer} data the buffer containing the serialized set of BSON documents.
+ * @param {Number} startIndex the start index in the data Buffer where the deserialization is to start.
+ * @param {Number} numberOfDocuments number of documents to deserialize.
+ * @param {Array} documents an array where to store the deserialized documents.
+ * @param {Number} docStartIndex the index in the documents array from where to start inserting documents.
+ * @param {Object} [options] additional options used for the deserialization.
+ * @return {Number} returns the next index in the buffer after deserialization **x** numbers of documents.
+ * @api public
+ */
+BSON.prototype.deserializeStream = function(data, startIndex, numberOfDocuments, documents, docStartIndex, options) {
+  return BSON.deserializeStream(data, startIndex, numberOfDocuments, documents, docStartIndex, options);
+}
+
+/**
+ * Serialize a Javascript object.
+ *
+ * @param {Object} object the Javascript object to serialize.
+ * @param {Boolean} checkKeys the serializer will check if keys are valid.
+ * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.
+ * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
+ * @return {Buffer} returns the Buffer object containing the serialized object.
+ * @api public
+ */
+BSON.prototype.serialize = function(object, checkKeys, asBuffer, serializeFunctions) {
+  return BSON.serialize(object, checkKeys, asBuffer, serializeFunctions);
+}
+
+/**
+ * Calculate the bson size for a passed in Javascript object.
+ *
+ * @param {Object} object the Javascript object to calculate the BSON byte size for.
+ * @param {Boolean} [serializeFunctions] serialize all functions in the object **(default:false)**.
+ * @return {Number} returns the number of bytes the BSON object will take up.
+ * @api public
+ */
+BSON.prototype.calculateObjectSize = function(object, serializeFunctions) {
+  return BSON.calculateObjectSize(object, serializeFunctions);
+}
+
+/**
+ * Serialize a Javascript object using a predefined Buffer and index into the buffer, useful when pre-allocating the space for serialization.
+ *
+ * @param {Object} object the Javascript object to serialize.
+ * @param {Boolean} checkKeys the serializer will check if keys are valid.
+ * @param {Buffer} buffer the Buffer you pre-allocated to store the serialized BSON object.
+ * @param {Number} index the index in the buffer where we wish to start serializing into.
+ * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
+ * @return {Number} returns the new write index in the Buffer.
+ * @api public
+ */
+BSON.prototype.serializeWithBufferAndIndex = function(object, checkKeys, buffer, startIndex, serializeFunctions) {
+  return BSON.serializeWithBufferAndIndex(object, checkKeys, buffer, startIndex, serializeFunctions);
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+exports.Code = Code;
+exports.Symbol = Symbol;
+exports.BSON = BSON;
+exports.DBRef = DBRef;
+exports.Binary = Binary;
+exports.ObjectID = ObjectID;
+exports.Long = Long;
+exports.Timestamp = Timestamp;
+exports.Double = Double;
+exports.MinKey = MinKey;
+exports.MaxKey = MaxKey;
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/code.js b/node_modules/mongodb/node_modules/bson/lib/bson/code.js
new file mode 100644
index 0000000..69b56a3
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/code.js
@@ -0,0 +1,25 @@
+/**
+ * A class representation of the BSON Code type.
+ *
+ * @class Represents the BSON Code type.
+ * @param {String|Function} code a string or function.
+ * @param {Object} [scope] an optional scope for the function.
+ * @return {Code}
+ */
+function Code(code, scope) {
+  if(!(this instanceof Code)) return new Code(code, scope);
+  
+  this._bsontype = 'Code';
+  this.code = code;
+  this.scope = scope == null ? {} : scope;
+};
+
+/**
+ * @ignore
+ * @api private
+ */
+Code.prototype.toJSON = function() {
+  return {scope:this.scope, code:this.code};
+}
+
+exports.Code = Code;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/db_ref.js b/node_modules/mongodb/node_modules/bson/lib/bson/db_ref.js
new file mode 100644
index 0000000..56b6510
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/db_ref.js
@@ -0,0 +1,31 @@
+/**
+ * A class representation of the BSON DBRef type.
+ *
+ * @class Represents the BSON DBRef type.
+ * @param {String} namespace the collection name.
+ * @param {ObjectID} oid the reference ObjectID.
+ * @param {String} [db] optional db name, if omitted the reference is local to the current db.
+ * @return {DBRef}
+ */
+function DBRef(namespace, oid, db) {
+  if(!(this instanceof DBRef)) return new DBRef(namespace, oid, db);
+  
+  this._bsontype = 'DBRef';
+  this.namespace = namespace;
+  this.oid = oid;
+  this.db = db;
+};
+
+/**
+ * @ignore
+ * @api private
+ */
+DBRef.prototype.toJSON = function() {
+  return {
+    '$ref':this.namespace,
+    '$id':this.oid,
+    '$db':this.db == null ? '' : this.db
+  };
+}
+
+exports.DBRef = DBRef;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/double.js b/node_modules/mongodb/node_modules/bson/lib/bson/double.js
new file mode 100644
index 0000000..ae51463
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/double.js
@@ -0,0 +1,33 @@
+/**
+ * A class representation of the BSON Double type.
+ *
+ * @class Represents the BSON Double type.
+ * @param {Number} value the number we want to represent as a double.
+ * @return {Double}
+ */
+function Double(value) {
+  if(!(this instanceof Double)) return new Double(value);
+  
+  this._bsontype = 'Double';
+  this.value = value;
+}
+
+/**
+ * Access the number value.
+ *
+ * @return {Number} returns the wrapped double number.
+ * @api public
+ */
+Double.prototype.valueOf = function() {
+  return this.value;
+};
+
+/**
+ * @ignore
+ * @api private
+ */
+Double.prototype.toJSON = function() {
+  return this.value;
+}
+
+exports.Double = Double;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/float_parser.js b/node_modules/mongodb/node_modules/bson/lib/bson/float_parser.js
new file mode 100644
index 0000000..6fca392
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/float_parser.js
@@ -0,0 +1,121 @@
+// Copyright (c) 2008, Fair Oaks Labs, Inc.
+// All rights reserved.
+// 
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are met:
+// 
+//  * Redistributions of source code must retain the above copyright notice,
+//    this list of conditions and the following disclaimer.
+// 
+//  * Redistributions in binary form must reproduce the above copyright notice,
+//    this list of conditions and the following disclaimer in the documentation
+//    and/or other materials provided with the distribution.
+// 
+//  * Neither the name of Fair Oaks Labs, Inc. nor the names of its contributors
+//    may be used to endorse or promote products derived from this software
+//    without specific prior written permission.
+// 
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+// ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+// POSSIBILITY OF SUCH DAMAGE.
+//
+//
+// Modifications to writeIEEE754 to support negative zeroes made by Brian White
+
+var readIEEE754 = function(buffer, offset, endian, mLen, nBytes) {
+  var e, m,
+      bBE = (endian === 'big'),
+      eLen = nBytes * 8 - mLen - 1,
+      eMax = (1 << eLen) - 1,
+      eBias = eMax >> 1,
+      nBits = -7,
+      i = bBE ? 0 : (nBytes - 1),
+      d = bBE ? 1 : -1,
+      s = buffer[offset + i];
+
+  i += d;
+
+  e = s & ((1 << (-nBits)) - 1);
+  s >>= (-nBits);
+  nBits += eLen;
+  for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8);
+
+  m = e & ((1 << (-nBits)) - 1);
+  e >>= (-nBits);
+  nBits += mLen;
+  for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8);
+
+  if (e === 0) {
+    e = 1 - eBias;
+  } else if (e === eMax) {
+    return m ? NaN : ((s ? -1 : 1) * Infinity);
+  } else {
+    m = m + Math.pow(2, mLen);
+    e = e - eBias;
+  }
+  return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
+};
+
+var writeIEEE754 = function(buffer, value, offset, endian, mLen, nBytes) {
+  var e, m, c,
+      bBE = (endian === 'big'),
+      eLen = nBytes * 8 - mLen - 1,
+      eMax = (1 << eLen) - 1,
+      eBias = eMax >> 1,
+      rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0),
+      i = bBE ? (nBytes-1) : 0,
+      d = bBE ? -1 : 1,
+      s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;
+
+  value = Math.abs(value);
+
+  if (isNaN(value) || value === Infinity) {
+    m = isNaN(value) ? 1 : 0;
+    e = eMax;
+  } else {
+    e = Math.floor(Math.log(value) / Math.LN2);
+    if (value * (c = Math.pow(2, -e)) < 1) {
+      e--;
+      c *= 2;
+    }
+    if (e+eBias >= 1) {
+      value += rt / c;
+    } else {
+      value += rt * Math.pow(2, 1 - eBias);
+    }
+    if (value * c >= 2) {
+      e++;
+      c /= 2;
+    }
+
+    if (e + eBias >= eMax) {
+      m = 0;
+      e = eMax;
+    } else if (e + eBias >= 1) {
+      m = (value * c - 1) * Math.pow(2, mLen);
+      e = e + eBias;
+    } else {
+      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
+      e = 0;
+    }
+  }
+
+  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8);
+
+  e = (e << mLen) | m;
+  eLen += mLen;
+  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8);
+
+  buffer[offset + i - d] |= s * 128;
+};
+
+exports.readIEEE754 = readIEEE754;
+exports.writeIEEE754 = writeIEEE754;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/index.js b/node_modules/mongodb/node_modules/bson/lib/bson/index.js
new file mode 100644
index 0000000..950fcad
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/index.js
@@ -0,0 +1,74 @@
+try {
+  exports.BSONPure = require('./bson');
+  exports.BSONNative = require('../../ext');
+} catch(err) {
+  // do nothing
+}
+
+[ './binary_parser'
+  , './binary'
+  , './code'
+  , './db_ref'
+  , './double'
+  , './max_key'
+  , './min_key'
+  , './objectid'
+  , './symbol'
+  , './timestamp'
+  , './long'].forEach(function (path) {
+  	var module = require('./' + path);
+  	for (var i in module) {
+  		exports[i] = module[i];
+    }
+});
+
+// Exports all the classes for the NATIVE JS BSON Parser
+exports.native = function() {
+  var classes = {};
+  // Map all the classes
+  [ './binary_parser'
+    , './binary'
+    , './code'
+    , './db_ref'
+    , './double'
+    , './max_key'
+    , './min_key'
+    , './objectid'
+    , './symbol'
+    , './timestamp'
+    , './long'
+    , '../../ext'
+].forEach(function (path) {
+    	var module = require('./' + path);
+    	for (var i in module) {
+    		classes[i] = module[i];
+      }
+  });
+  // Return classes list
+  return classes;
+}
+
+// Exports all the classes for the PURE JS BSON Parser
+exports.pure = function() {
+  var classes = {};
+  // Map all the classes
+  [ './binary_parser'
+    , './binary'
+    , './code'
+    , './db_ref'
+    , './double'
+    , './max_key'
+    , './min_key'
+    , './objectid'
+    , './symbol'
+    , './timestamp'
+    , './long'
+    , '././bson'].forEach(function (path) {
+    	var module = require('./' + path);
+    	for (var i in module) {
+    		classes[i] = module[i];
+      }
+  });
+  // Return classes list
+  return classes;
+}
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/long.js b/node_modules/mongodb/node_modules/bson/lib/bson/long.js
new file mode 100644
index 0000000..f8f37a6
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/long.js
@@ -0,0 +1,854 @@
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//
+// Copyright 2009 Google Inc. All Rights Reserved
+
+/**
+ * Defines a Long class for representing a 64-bit two's-complement
+ * integer value, which faithfully simulates the behavior of a Java "Long". This
+ * implementation is derived from LongLib in GWT.
+ *
+ * Constructs a 64-bit two's-complement integer, given its low and high 32-bit
+ * values as *signed* integers.  See the from* functions below for more
+ * convenient ways of constructing Longs.
+ *
+ * The internal representation of a Long is the two given signed, 32-bit values.
+ * We use 32-bit pieces because these are the size of integers on which
+ * Javascript performs bit-operations.  For operations like addition and
+ * multiplication, we split each number into 16-bit pieces, which can easily be
+ * multiplied within Javascript's floating-point representation without overflow
+ * or change in sign.
+ *
+ * In the algorithms below, we frequently reduce the negative case to the
+ * positive case by negating the input(s) and then post-processing the result.
+ * Note that we must ALWAYS check specially whether those values are MIN_VALUE
+ * (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
+ * a positive number, it overflows back into a negative).  Not handling this
+ * case would often result in infinite recursion.
+ *
+ * @class Represents the BSON Long type.
+ * @param {Number} low  the low (signed) 32 bits of the Long.
+ * @param {Number} high the high (signed) 32 bits of the Long.
+ */
+function Long(low, high) {
+  if(!(this instanceof Long)) return new Long(low, high);
+  
+  this._bsontype = 'Long';
+  /**
+   * @type {number}
+   * @api private
+   */
+  this.low_ = low | 0;  // force into 32 signed bits.
+
+  /**
+   * @type {number}
+   * @api private
+   */
+  this.high_ = high | 0;  // force into 32 signed bits.
+};
+
+/**
+ * Return the int value.
+ *
+ * @return {Number} the value, assuming it is a 32-bit integer.
+ * @api public
+ */
+Long.prototype.toInt = function() {
+  return this.low_;
+};
+
+/**
+ * Return the Number value.
+ *
+ * @return {Number} the closest floating-point representation to this value.
+ * @api public
+ */
+Long.prototype.toNumber = function() {
+  return this.high_ * Long.TWO_PWR_32_DBL_ +
+         this.getLowBitsUnsigned();
+};
+
+/**
+ * Return the JSON value.
+ *
+ * @return {String} the JSON representation.
+ * @api public
+ */
+Long.prototype.toJSON = function() {
+  return this.toString();
+}
+
+/**
+ * Return the String value.
+ *
+ * @param {Number} [opt_radix] the radix in which the text should be written.
+ * @return {String} the textual representation of this value.
+ * @api public
+ */
+Long.prototype.toString = function(opt_radix) {
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (this.isZero()) {
+    return '0';
+  }
+
+  if (this.isNegative()) {
+    if (this.equals(Long.MIN_VALUE)) {
+      // We need to change the Long value before it can be negated, so we remove
+      // the bottom-most digit in this base and then recurse to do the rest.
+      var radixLong = Long.fromNumber(radix);
+      var div = this.div(radixLong);
+      var rem = div.multiply(radixLong).subtract(this);
+      return div.toString(radix) + rem.toInt().toString(radix);
+    } else {
+      return '-' + this.negate().toString(radix);
+    }
+  }
+
+  // Do several (6) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = Long.fromNumber(Math.pow(radix, 6));
+
+  var rem = this;
+  var result = '';
+  while (true) {
+    var remDiv = rem.div(radixToPower);
+    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt();
+    var digits = intval.toString(radix);
+
+    rem = remDiv;
+    if (rem.isZero()) {
+      return digits + result;
+    } else {
+      while (digits.length < 6) {
+        digits = '0' + digits;
+      }
+      result = '' + digits + result;
+    }
+  }
+};
+
+/**
+ * Return the high 32-bits value.
+ *
+ * @return {Number} the high 32-bits as a signed value.
+ * @api public
+ */
+Long.prototype.getHighBits = function() {
+  return this.high_;
+};
+
+/**
+ * Return the low 32-bits value.
+ *
+ * @return {Number} the low 32-bits as a signed value.
+ * @api public
+ */
+Long.prototype.getLowBits = function() {
+  return this.low_;
+};
+
+/**
+ * Return the low unsigned 32-bits value.
+ *
+ * @return {Number} the low 32-bits as an unsigned value.
+ * @api public
+ */
+Long.prototype.getLowBitsUnsigned = function() {
+  return (this.low_ >= 0) ?
+      this.low_ : Long.TWO_PWR_32_DBL_ + this.low_;
+};
+
+/**
+ * Returns the number of bits needed to represent the absolute value of this Long.
+ *
+ * @return {Number} Returns the number of bits needed to represent the absolute value of this Long.
+ * @api public
+ */
+Long.prototype.getNumBitsAbs = function() {
+  if (this.isNegative()) {
+    if (this.equals(Long.MIN_VALUE)) {
+      return 64;
+    } else {
+      return this.negate().getNumBitsAbs();
+    }
+  } else {
+    var val = this.high_ != 0 ? this.high_ : this.low_;
+    for (var bit = 31; bit > 0; bit--) {
+      if ((val & (1 << bit)) != 0) {
+        break;
+      }
+    }
+    return this.high_ != 0 ? bit + 33 : bit + 1;
+  }
+};
+
+/**
+ * Return whether this value is zero.
+ *
+ * @return {Boolean} whether this value is zero.
+ * @api public
+ */
+Long.prototype.isZero = function() {
+  return this.high_ == 0 && this.low_ == 0;
+};
+
+/**
+ * Return whether this value is negative.
+ *
+ * @return {Boolean} whether this value is negative.
+ * @api public
+ */
+Long.prototype.isNegative = function() {
+  return this.high_ < 0;
+};
+
+/**
+ * Return whether this value is odd.
+ *
+ * @return {Boolean} whether this value is odd.
+ * @api public
+ */
+Long.prototype.isOdd = function() {
+  return (this.low_ & 1) == 1;
+};
+
+/**
+ * Return whether this Long equals the other
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long equals the other
+ * @api public
+ */
+Long.prototype.equals = function(other) {
+  return (this.high_ == other.high_) && (this.low_ == other.low_);
+};
+
+/**
+ * Return whether this Long does not equal the other.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long does not equal the other.
+ * @api public
+ */
+Long.prototype.notEquals = function(other) {
+  return (this.high_ != other.high_) || (this.low_ != other.low_);
+};
+
+/**
+ * Return whether this Long is less than the other.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long is less than the other.
+ * @api public
+ */
+Long.prototype.lessThan = function(other) {
+  return this.compare(other) < 0;
+};
+
+/**
+ * Return whether this Long is less than or equal to the other.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long is less than or equal to the other.
+ * @api public
+ */
+Long.prototype.lessThanOrEqual = function(other) {
+  return this.compare(other) <= 0;
+};
+
+/**
+ * Return whether this Long is greater than the other.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long is greater than the other.
+ * @api public
+ */
+Long.prototype.greaterThan = function(other) {
+  return this.compare(other) > 0;
+};
+
+/**
+ * Return whether this Long is greater than or equal to the other.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} whether this Long is greater than or equal to the other.
+ * @api public
+ */
+Long.prototype.greaterThanOrEqual = function(other) {
+  return this.compare(other) >= 0;
+};
+
+/**
+ * Compares this Long with the given one.
+ *
+ * @param {Long} other Long to compare against.
+ * @return {Boolean} 0 if they are the same, 1 if the this is greater, and -1 if the given one is greater.
+ * @api public
+ */
+Long.prototype.compare = function(other) {
+  if (this.equals(other)) {
+    return 0;
+  }
+
+  var thisNeg = this.isNegative();
+  var otherNeg = other.isNegative();
+  if (thisNeg && !otherNeg) {
+    return -1;
+  }
+  if (!thisNeg && otherNeg) {
+    return 1;
+  }
+
+  // at this point, the signs are the same, so subtraction will not overflow
+  if (this.subtract(other).isNegative()) {
+    return -1;
+  } else {
+    return 1;
+  }
+};
+
+/**
+ * The negation of this value.
+ *
+ * @return {Long} the negation of this value.
+ * @api public
+ */
+Long.prototype.negate = function() {
+  if (this.equals(Long.MIN_VALUE)) {
+    return Long.MIN_VALUE;
+  } else {
+    return this.not().add(Long.ONE);
+  }
+};
+
+/**
+ * Returns the sum of this and the given Long.
+ *
+ * @param {Long} other Long to add to this one.
+ * @return {Long} the sum of this and the given Long.
+ * @api public
+ */
+Long.prototype.add = function(other) {
+  // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
+
+  var a48 = this.high_ >>> 16;
+  var a32 = this.high_ & 0xFFFF;
+  var a16 = this.low_ >>> 16;
+  var a00 = this.low_ & 0xFFFF;
+
+  var b48 = other.high_ >>> 16;
+  var b32 = other.high_ & 0xFFFF;
+  var b16 = other.low_ >>> 16;
+  var b00 = other.low_ & 0xFFFF;
+
+  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+  c00 += a00 + b00;
+  c16 += c00 >>> 16;
+  c00 &= 0xFFFF;
+  c16 += a16 + b16;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c32 += a32 + b32;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c48 += a48 + b48;
+  c48 &= 0xFFFF;
+  return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+};
+
+/**
+ * Returns the difference of this and the given Long.
+ *
+ * @param {Long} other Long to subtract from this.
+ * @return {Long} the difference of this and the given Long.
+ * @api public
+ */
+Long.prototype.subtract = function(other) {
+  return this.add(other.negate());
+};
+
+/**
+ * Returns the product of this and the given Long.
+ *
+ * @param {Long} other Long to multiply with this.
+ * @return {Long} the product of this and the other.
+ * @api public
+ */
+Long.prototype.multiply = function(other) {
+  if (this.isZero()) {
+    return Long.ZERO;
+  } else if (other.isZero()) {
+    return Long.ZERO;
+  }
+
+  if (this.equals(Long.MIN_VALUE)) {
+    return other.isOdd() ? Long.MIN_VALUE : Long.ZERO;
+  } else if (other.equals(Long.MIN_VALUE)) {
+    return this.isOdd() ? Long.MIN_VALUE : Long.ZERO;
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().multiply(other.negate());
+    } else {
+      return this.negate().multiply(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.multiply(other.negate()).negate();
+  }
+
+  // If both Longs are small, use float multiplication
+  if (this.lessThan(Long.TWO_PWR_24_) &&
+      other.lessThan(Long.TWO_PWR_24_)) {
+    return Long.fromNumber(this.toNumber() * other.toNumber());
+  }
+
+  // Divide each Long into 4 chunks of 16 bits, and then add up 4x4 products.
+  // We can skip products that would overflow.
+
+  var a48 = this.high_ >>> 16;
+  var a32 = this.high_ & 0xFFFF;
+  var a16 = this.low_ >>> 16;
+  var a00 = this.low_ & 0xFFFF;
+
+  var b48 = other.high_ >>> 16;
+  var b32 = other.high_ & 0xFFFF;
+  var b16 = other.low_ >>> 16;
+  var b00 = other.low_ & 0xFFFF;
+
+  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+  c00 += a00 * b00;
+  c16 += c00 >>> 16;
+  c00 &= 0xFFFF;
+  c16 += a16 * b00;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c16 += a00 * b16;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c32 += a32 * b00;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c32 += a16 * b16;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c32 += a00 * b32;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
+  c48 &= 0xFFFF;
+  return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+};
+
+/**
+ * Returns this Long divided by the given one.
+ *
+ * @param {Long} other Long by which to divide.
+ * @return {Long} this Long divided by the given one.
+ * @api public
+ */
+Long.prototype.div = function(other) {
+  if (other.isZero()) {
+    throw Error('division by zero');
+  } else if (this.isZero()) {
+    return Long.ZERO;
+  }
+
+  if (this.equals(Long.MIN_VALUE)) {
+    if (other.equals(Long.ONE) ||
+        other.equals(Long.NEG_ONE)) {
+      return Long.MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE
+    } else if (other.equals(Long.MIN_VALUE)) {
+      return Long.ONE;
+    } else {
+      // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
+      var halfThis = this.shiftRight(1);
+      var approx = halfThis.div(other).shiftLeft(1);
+      if (approx.equals(Long.ZERO)) {
+        return other.isNegative() ? Long.ONE : Long.NEG_ONE;
+      } else {
+        var rem = this.subtract(other.multiply(approx));
+        var result = approx.add(rem.div(other));
+        return result;
+      }
+    }
+  } else if (other.equals(Long.MIN_VALUE)) {
+    return Long.ZERO;
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().div(other.negate());
+    } else {
+      return this.negate().div(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.div(other.negate()).negate();
+  }
+
+  // Repeat the following until the remainder is less than other:  find a
+  // floating-point that approximates remainder / other *from below*, add this
+  // into the result, and subtract it from the remainder.  It is critical that
+  // the approximate value is less than or equal to the real value so that the
+  // remainder never becomes negative.
+  var res = Long.ZERO;
+  var rem = this;
+  while (rem.greaterThanOrEqual(other)) {
+    // Approximate the result of division. This may be a little greater or
+    // smaller than the actual value.
+    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
+
+    // We will tweak the approximate result by changing it in the 48-th digit or
+    // the smallest non-fractional digit, whichever is larger.
+    var log2 = Math.ceil(Math.log(approx) / Math.LN2);
+    var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);
+
+    // Decrease the approximation until it is smaller than the remainder.  Note
+    // that if it is too large, the product overflows and is negative.
+    var approxRes = Long.fromNumber(approx);
+    var approxRem = approxRes.multiply(other);
+    while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
+      approx -= delta;
+      approxRes = Long.fromNumber(approx);
+      approxRem = approxRes.multiply(other);
+    }
+
+    // We know the answer can't be zero... and actually, zero would cause
+    // infinite recursion since we would make no progress.
+    if (approxRes.isZero()) {
+      approxRes = Long.ONE;
+    }
+
+    res = res.add(approxRes);
+    rem = rem.subtract(approxRem);
+  }
+  return res;
+};
+
+/**
+ * Returns this Long modulo the given one.
+ *
+ * @param {Long} other Long by which to mod.
+ * @return {Long} this Long modulo the given one.
+ * @api public
+ */
+Long.prototype.modulo = function(other) {
+  return this.subtract(this.div(other).multiply(other));
+};
+
+/**
+ * The bitwise-NOT of this value.
+ *
+ * @return {Long} the bitwise-NOT of this value.
+ * @api public
+ */
+Long.prototype.not = function() {
+  return Long.fromBits(~this.low_, ~this.high_);
+};
+
+/**
+ * Returns the bitwise-AND of this Long and the given one.
+ *
+ * @param {Long} other the Long with which to AND.
+ * @return {Long} the bitwise-AND of this and the other.
+ * @api public
+ */
+Long.prototype.and = function(other) {
+  return Long.fromBits(this.low_ & other.low_, this.high_ & other.high_);
+};
+
+/**
+ * Returns the bitwise-OR of this Long and the given one.
+ *
+ * @param {Long} other the Long with which to OR.
+ * @return {Long} the bitwise-OR of this and the other.
+ * @api public
+ */
+Long.prototype.or = function(other) {
+  return Long.fromBits(this.low_ | other.low_, this.high_ | other.high_);
+};
+
+/**
+ * Returns the bitwise-XOR of this Long and the given one.
+ *
+ * @param {Long} other the Long with which to XOR.
+ * @return {Long} the bitwise-XOR of this and the other.
+ * @api public
+ */
+Long.prototype.xor = function(other) {
+  return Long.fromBits(this.low_ ^ other.low_, this.high_ ^ other.high_);
+};
+
+/**
+ * Returns this Long with bits shifted to the left by the given amount.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Long} this shifted to the left by the given amount.
+ * @api public
+ */
+Long.prototype.shiftLeft = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var low = this.low_;
+    if (numBits < 32) {
+      var high = this.high_;
+      return Long.fromBits(
+                 low << numBits,
+                 (high << numBits) | (low >>> (32 - numBits)));
+    } else {
+      return Long.fromBits(0, low << (numBits - 32));
+    }
+  }
+};
+
+/**
+ * Returns this Long with bits shifted to the right by the given amount.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Long} this shifted to the right by the given amount.
+ * @api public
+ */
+Long.prototype.shiftRight = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var high = this.high_;
+    if (numBits < 32) {
+      var low = this.low_;
+      return Long.fromBits(
+                 (low >>> numBits) | (high << (32 - numBits)),
+                 high >> numBits);
+    } else {
+      return Long.fromBits(
+                 high >> (numBits - 32),
+                 high >= 0 ? 0 : -1);
+    }
+  }
+};
+
+/**
+ * Returns this Long with bits shifted to the right by the given amount, with the new top bits matching the current sign bit.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Long} this shifted to the right by the given amount, with zeros placed into the new leading bits.
+ * @api public
+ */
+Long.prototype.shiftRightUnsigned = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var high = this.high_;
+    if (numBits < 32) {
+      var low = this.low_;
+      return Long.fromBits(
+                 (low >>> numBits) | (high << (32 - numBits)),
+                 high >>> numBits);
+    } else if (numBits == 32) {
+      return Long.fromBits(high, 0);
+    } else {
+      return Long.fromBits(high >>> (numBits - 32), 0);
+    }
+  }
+};
+
+/**
+ * Returns a Long representing the given (32-bit) integer value.
+ *
+ * @param {Number} value the 32-bit integer in question.
+ * @return {Long} the corresponding Long value.
+ * @api public
+ */
+Long.fromInt = function(value) {
+  if (-128 <= value && value < 128) {
+    var cachedObj = Long.INT_CACHE_[value];
+    if (cachedObj) {
+      return cachedObj;
+    }
+  }
+
+  var obj = new Long(value | 0, value < 0 ? -1 : 0);
+  if (-128 <= value && value < 128) {
+    Long.INT_CACHE_[value] = obj;
+  }
+  return obj;
+};
+
+/**
+ * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
+ *
+ * @param {Number} value the number in question.
+ * @return {Long} the corresponding Long value.
+ * @api public
+ */
+Long.fromNumber = function(value) {
+  if (isNaN(value) || !isFinite(value)) {
+    return Long.ZERO;
+  } else if (value <= -Long.TWO_PWR_63_DBL_) {
+    return Long.MIN_VALUE;
+  } else if (value + 1 >= Long.TWO_PWR_63_DBL_) {
+    return Long.MAX_VALUE;
+  } else if (value < 0) {
+    return Long.fromNumber(-value).negate();
+  } else {
+    return new Long(
+               (value % Long.TWO_PWR_32_DBL_) | 0,
+               (value / Long.TWO_PWR_32_DBL_) | 0);
+  }
+};
+
+/**
+ * Returns a Long representing the 64-bit integer that comes by concatenating the given high and low bits. Each is assumed to use 32 bits.
+ *
+ * @param {Number} lowBits the low 32-bits.
+ * @param {Number} highBits the high 32-bits.
+ * @return {Long} the corresponding Long value.
+ * @api public
+ */
+Long.fromBits = function(lowBits, highBits) {
+  return new Long(lowBits, highBits);
+};
+
+/**
+ * Returns a Long representation of the given string, written using the given radix.
+ *
+ * @param {String} str the textual representation of the Long.
+ * @param {Number} opt_radix the radix in which the text is written.
+ * @return {Long} the corresponding Long value.
+ * @api public
+ */
+Long.fromString = function(str, opt_radix) {
+  if (str.length == 0) {
+    throw Error('number format error: empty string');
+  }
+
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (str.charAt(0) == '-') {
+    return Long.fromString(str.substring(1), radix).negate();
+  } else if (str.indexOf('-') >= 0) {
+    throw Error('number format error: interior "-" character: ' + str);
+  }
+
+  // Do several (8) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = Long.fromNumber(Math.pow(radix, 8));
+
+  var result = Long.ZERO;
+  for (var i = 0; i < str.length; i += 8) {
+    var size = Math.min(8, str.length - i);
+    var value = parseInt(str.substring(i, i + size), radix);
+    if (size < 8) {
+      var power = Long.fromNumber(Math.pow(radix, size));
+      result = result.multiply(power).add(Long.fromNumber(value));
+    } else {
+      result = result.multiply(radixToPower);
+      result = result.add(Long.fromNumber(value));
+    }
+  }
+  return result;
+};
+
+// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
+// from* methods on which they depend.
+
+
+/**
+ * A cache of the Long representations of small integer values.
+ * @type {Object}
+ * @api private
+ */
+Long.INT_CACHE_ = {};
+
+// NOTE: the compiler should inline these constant values below and then remove
+// these variables, so there should be no runtime penalty for these.
+
+/**
+ * Number used repeated below in calculations.  This must appear before the
+ * first call to any from* function below.
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_16_DBL_ = 1 << 16;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_24_DBL_ = 1 << 24;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_32_DBL_ = Long.TWO_PWR_16_DBL_ * Long.TWO_PWR_16_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_31_DBL_ = Long.TWO_PWR_32_DBL_ / 2;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_48_DBL_ = Long.TWO_PWR_32_DBL_ * Long.TWO_PWR_16_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_64_DBL_ = Long.TWO_PWR_32_DBL_ * Long.TWO_PWR_32_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Long.TWO_PWR_63_DBL_ = Long.TWO_PWR_64_DBL_ / 2;
+
+/** @type {Long} */
+Long.ZERO = Long.fromInt(0);
+
+/** @type {Long} */
+Long.ONE = Long.fromInt(1);
+
+/** @type {Long} */
+Long.NEG_ONE = Long.fromInt(-1);
+
+/** @type {Long} */
+Long.MAX_VALUE =
+    Long.fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0);
+
+/** @type {Long} */
+Long.MIN_VALUE = Long.fromBits(0, 0x80000000 | 0);
+
+/**
+ * @type {Long}
+ * @api private
+ */
+Long.TWO_PWR_24_ = Long.fromInt(1 << 24);
+
+/**
+ * Expose.
+ */
+exports.Long = Long;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/max_key.js b/node_modules/mongodb/node_modules/bson/lib/bson/max_key.js
new file mode 100644
index 0000000..0825408
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/max_key.js
@@ -0,0 +1,13 @@
+/**
+ * A class representation of the BSON MaxKey type.
+ *
+ * @class Represents the BSON MaxKey type.
+ * @return {MaxKey}
+ */
+function MaxKey() {
+  if(!(this instanceof MaxKey)) return new MaxKey();
+  
+  this._bsontype = 'MaxKey';  
+}
+
+exports.MaxKey = MaxKey;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/min_key.js b/node_modules/mongodb/node_modules/bson/lib/bson/min_key.js
new file mode 100644
index 0000000..230c2e6
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/min_key.js
@@ -0,0 +1,13 @@
+/**
+ * A class representation of the BSON MinKey type.
+ *
+ * @class Represents the BSON MinKey type.
+ * @return {MinKey}
+ */
+function MinKey() {
+  if(!(this instanceof MinKey)) return new MinKey();
+  
+  this._bsontype = 'MinKey';
+}
+
+exports.MinKey = MinKey;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/objectid.js b/node_modules/mongodb/node_modules/bson/lib/bson/objectid.js
new file mode 100644
index 0000000..183bbc3
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/objectid.js
@@ -0,0 +1,253 @@
+/**
+ * Module dependencies.
+ */
+var BinaryParser = require('./binary_parser').BinaryParser;
+
+/**
+ * Machine id.
+ *
+ * Create a random 3-byte value (i.e. unique for this
+ * process). Other drivers use a md5 of the machine id here, but
+ * that would mean an asyc call to gethostname, so we don't bother.
+ */
+var MACHINE_ID = parseInt(Math.random() * 0xFFFFFF, 10);
+
+// Regular expression that checks for hex value
+var checkForHexRegExp = new RegExp("^[0-9a-fA-F]{24}$");
+
+/**
+* Create a new ObjectID instance
+*
+* @class Represents the BSON ObjectID type
+* @param {String|Number} id Can be a 24 byte hex string, 12 byte binary string or a Number.
+* @return {Object} instance of ObjectID.
+*/
+var ObjectID = function ObjectID(id, _hex) {
+  if(!(this instanceof ObjectID)) return new ObjectID(id, _hex);
+
+  this._bsontype = 'ObjectID';
+  var __id = null;
+
+  // Throw an error if it's not a valid setup
+  if(id != null && 'number' != typeof id && (id.length != 12 && id.length != 24))
+    throw new Error("Argument passed in must be a single String of 12 bytes or a string of 24 hex characters");
+
+  // Generate id based on the input
+  if(id == null || typeof id == 'number') {
+    // convert to 12 byte binary string
+    this.id = this.generate(id);
+  } else if(id != null && id.length === 12) {
+    // assume 12 byte string
+    this.id = id;
+  } else if(checkForHexRegExp.test(id)) {
+    return ObjectID.createFromHexString(id);
+  } else {
+    throw new Error("Value passed in is not a valid 24 character hex string");
+  }
+
+  if(ObjectID.cacheHexString) this.__id = this.toHexString();
+};
+
+// Allow usage of ObjectId aswell as ObjectID
+var ObjectId = ObjectID;
+
+/**
+* Return the ObjectID id as a 24 byte hex string representation
+*
+* @return {String} return the 24 byte hex string representation.
+* @api public
+*/
+ObjectID.prototype.toHexString = function() {
+  if(ObjectID.cacheHexString && this.__id) return this.__id;
+
+  var hexString = ''
+    , number
+    , value;
+
+  for (var index = 0, len = this.id.length; index < len; index++) {
+    value = BinaryParser.toByte(this.id[index]);
+    number = value <= 15
+      ? '0' + value.toString(16)
+      : value.toString(16);
+    hexString = hexString + number;
+  }
+
+  if(ObjectID.cacheHexString) this.__id = hexString;
+  return hexString;
+};
+
+/**
+* Update the ObjectID index used in generating new ObjectID's on the driver
+*
+* @return {Number} returns next index value.
+* @api private
+*/
+ObjectID.prototype.get_inc = function() {
+  return ObjectID.index = (ObjectID.index + 1) % 0xFFFFFF;
+};
+
+/**
+* Update the ObjectID index used in generating new ObjectID's on the driver
+*
+* @return {Number} returns next index value.
+* @api private
+*/
+ObjectID.prototype.getInc = function() {
+  return this.get_inc();
+};
+
+/**
+* Generate a 12 byte id string used in ObjectID's
+*
+* @param {Number} [time] optional parameter allowing to pass in a second based timestamp.
+* @return {String} return the 12 byte id binary string.
+* @api private
+*/
+ObjectID.prototype.generate = function(time) {
+  if ('number' == typeof time) {
+    var time4Bytes = BinaryParser.encodeInt(time, 32, true, true);
+    /* for time-based ObjectID the bytes following the time will be zeroed */
+    var machine3Bytes = BinaryParser.encodeInt(MACHINE_ID, 24, false);
+    var pid2Bytes = BinaryParser.fromShort(typeof process === 'undefined' ? Math.floor(Math.random() * 100000) : process.pid);
+    var index3Bytes = BinaryParser.encodeInt(this.get_inc(), 24, false, true);
+  } else {
+  	var unixTime = parseInt(Date.now()/1000,10);
+    var time4Bytes = BinaryParser.encodeInt(unixTime, 32, true, true);
+    var machine3Bytes = BinaryParser.encodeInt(MACHINE_ID, 24, false);
+    var pid2Bytes = BinaryParser.fromShort(typeof process === 'undefined' ? Math.floor(Math.random() * 100000) : process.pid);
+    var index3Bytes = BinaryParser.encodeInt(this.get_inc(), 24, false, true);
+  }
+
+  return time4Bytes + machine3Bytes + pid2Bytes + index3Bytes;
+};
+
+/**
+* Converts the id into a 24 byte hex string for printing
+*
+* @return {String} return the 24 byte hex string representation.
+* @api private
+*/
+ObjectID.prototype.toString = function() {
+  return this.toHexString();
+};
+
+/**
+* Converts to a string representation of this Id.
+*
+* @return {String} return the 24 byte hex string representation.
+* @api private
+*/
+ObjectID.prototype.inspect = ObjectID.prototype.toString;
+
+/**
+* Converts to its JSON representation.
+*
+* @return {String} return the 24 byte hex string representation.
+* @api private
+*/
+ObjectID.prototype.toJSON = function() {
+  return this.toHexString();
+};
+
+/**
+* Compares the equality of this ObjectID with `otherID`.
+*
+* @param {Object} otherID ObjectID instance to compare against.
+* @return {Bool} the result of comparing two ObjectID's
+* @api public
+*/
+ObjectID.prototype.equals = function equals (otherID) {
+  var id = (otherID instanceof ObjectID || otherID.toHexString)
+    ? otherID.id
+    : ObjectID.createFromHexString(otherID).id;
+
+  return this.id === id;
+}
+
+/**
+* Returns the generation date (accurate up to the second) that this ID was generated.
+*
+* @return {Date} the generation date
+* @api public
+*/
+ObjectID.prototype.getTimestamp = function() {
+  var timestamp = new Date();
+  timestamp.setTime(Math.floor(BinaryParser.decodeInt(this.id.substring(0,4), 32, true, true)) * 1000);
+  return timestamp;
+}
+
+/**
+* @ignore
+* @api private
+*/
+ObjectID.index = 0;
+
+ObjectID.createPk = function createPk () {
+  return new ObjectID();
+};
+
+/**
+* Creates an ObjectID from a second based number, with the rest of the ObjectID zeroed out. Used for comparisons or sorting the ObjectID.
+*
+* @param {Number} time an integer number representing a number of seconds.
+* @return {ObjectID} return the created ObjectID
+* @api public
+*/
+ObjectID.createFromTime = function createFromTime (time) {
+  var id = BinaryParser.encodeInt(time, 32, true, true) +
+           BinaryParser.encodeInt(0, 64, true, true);
+  return new ObjectID(id);
+};
+
+/**
+* Creates an ObjectID from a hex string representation of an ObjectID.
+*
+* @param {String} hexString create a ObjectID from a passed in 24 byte hexstring.
+* @return {ObjectID} return the created ObjectID
+* @api public
+*/
+ObjectID.createFromHexString = function createFromHexString (hexString) {
+  // Throw an error if it's not a valid setup
+  if(typeof hexString === 'undefined' || hexString != null && hexString.length != 24)
+    throw new Error("Argument passed in must be a single String of 12 bytes or a string of 24 hex characters");
+
+  var len = hexString.length;
+
+  if(len > 12*2) {
+    throw new Error('Id cannot be longer than 12 bytes');
+  }
+
+  var result = ''
+    , string
+    , number;
+
+  for (var index = 0; index < len; index += 2) {
+    string = hexString.substr(index, 2);
+    number = parseInt(string, 16);
+    result += BinaryParser.fromByte(number);
+  }
+
+  return new ObjectID(result, hexString);
+};
+
+/**
+* @ignore
+*/
+Object.defineProperty(ObjectID.prototype, "generationTime", {
+   enumerable: true
+ , get: function () {
+     return Math.floor(BinaryParser.decodeInt(this.id.substring(0,4), 32, true, true));
+   }
+ , set: function (value) {
+     var value = BinaryParser.encodeInt(value, 32, true, true);
+     this.id = value + this.id.substr(4);
+     // delete this.__id;
+     this.toHexString();
+   }
+});
+
+/**
+ * Expose.
+ */
+exports.ObjectID = ObjectID;
+exports.ObjectId = ObjectID;
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/symbol.js b/node_modules/mongodb/node_modules/bson/lib/bson/symbol.js
new file mode 100644
index 0000000..8e2838d
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/symbol.js
@@ -0,0 +1,48 @@
+/**
+ * A class representation of the BSON Symbol type.
+ *
+ * @class Represents the BSON Symbol type.
+ * @param {String} value the string representing the symbol.
+ * @return {Symbol}
+ */
+function Symbol(value) {
+  if(!(this instanceof Symbol)) return new Symbol(value);
+  this._bsontype = 'Symbol';
+  this.value = value;
+}
+
+/**
+ * Access the wrapped string value.
+ *
+ * @return {String} returns the wrapped string.
+ * @api public
+ */
+Symbol.prototype.valueOf = function() {
+  return this.value;
+};
+
+/**
+ * @ignore
+ * @api private
+ */
+Symbol.prototype.toString = function() {
+  return this.value;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+Symbol.prototype.inspect = function() {
+  return this.value;
+}
+
+/**
+ * @ignore
+ * @api private
+ */
+Symbol.prototype.toJSON = function() {
+  return this.value;
+}
+
+exports.Symbol = Symbol;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/lib/bson/timestamp.js b/node_modules/mongodb/node_modules/bson/lib/bson/timestamp.js
new file mode 100644
index 0000000..c650d15
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/lib/bson/timestamp.js
@@ -0,0 +1,853 @@
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//
+// Copyright 2009 Google Inc. All Rights Reserved
+
+/**
+ * Defines a Timestamp class for representing a 64-bit two's-complement
+ * integer value, which faithfully simulates the behavior of a Java "Timestamp". This
+ * implementation is derived from TimestampLib in GWT.
+ *
+ * Constructs a 64-bit two's-complement integer, given its low and high 32-bit
+ * values as *signed* integers.  See the from* functions below for more
+ * convenient ways of constructing Timestamps.
+ *
+ * The internal representation of a Timestamp is the two given signed, 32-bit values.
+ * We use 32-bit pieces because these are the size of integers on which
+ * Javascript performs bit-operations.  For operations like addition and
+ * multiplication, we split each number into 16-bit pieces, which can easily be
+ * multiplied within Javascript's floating-point representation without overflow
+ * or change in sign.
+ *
+ * In the algorithms below, we frequently reduce the negative case to the
+ * positive case by negating the input(s) and then post-processing the result.
+ * Note that we must ALWAYS check specially whether those values are MIN_VALUE
+ * (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
+ * a positive number, it overflows back into a negative).  Not handling this
+ * case would often result in infinite recursion.
+ *
+ * @class Represents the BSON Timestamp type.
+ * @param {Number} low  the low (signed) 32 bits of the Timestamp.
+ * @param {Number} high the high (signed) 32 bits of the Timestamp.
+ */
+function Timestamp(low, high) {
+  if(!(this instanceof Timestamp)) return new Timestamp(low, high);
+  this._bsontype = 'Timestamp';
+  /**
+   * @type {number}
+   * @api private
+   */
+  this.low_ = low | 0;  // force into 32 signed bits.
+
+  /**
+   * @type {number}
+   * @api private
+   */
+  this.high_ = high | 0;  // force into 32 signed bits.
+};
+
+/**
+ * Return the int value.
+ *
+ * @return {Number} the value, assuming it is a 32-bit integer.
+ * @api public
+ */
+Timestamp.prototype.toInt = function() {
+  return this.low_;
+};
+
+/**
+ * Return the Number value.
+ *
+ * @return {Number} the closest floating-point representation to this value.
+ * @api public
+ */
+Timestamp.prototype.toNumber = function() {
+  return this.high_ * Timestamp.TWO_PWR_32_DBL_ +
+         this.getLowBitsUnsigned();
+};
+
+/**
+ * Return the JSON value.
+ *
+ * @return {String} the JSON representation.
+ * @api public
+ */
+Timestamp.prototype.toJSON = function() {
+  return this.toString();
+}
+
+/**
+ * Return the String value.
+ *
+ * @param {Number} [opt_radix] the radix in which the text should be written.
+ * @return {String} the textual representation of this value.
+ * @api public
+ */
+Timestamp.prototype.toString = function(opt_radix) {
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (this.isZero()) {
+    return '0';
+  }
+
+  if (this.isNegative()) {
+    if (this.equals(Timestamp.MIN_VALUE)) {
+      // We need to change the Timestamp value before it can be negated, so we remove
+      // the bottom-most digit in this base and then recurse to do the rest.
+      var radixTimestamp = Timestamp.fromNumber(radix);
+      var div = this.div(radixTimestamp);
+      var rem = div.multiply(radixTimestamp).subtract(this);
+      return div.toString(radix) + rem.toInt().toString(radix);
+    } else {
+      return '-' + this.negate().toString(radix);
+    }
+  }
+
+  // Do several (6) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = Timestamp.fromNumber(Math.pow(radix, 6));
+
+  var rem = this;
+  var result = '';
+  while (true) {
+    var remDiv = rem.div(radixToPower);
+    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt();
+    var digits = intval.toString(radix);
+
+    rem = remDiv;
+    if (rem.isZero()) {
+      return digits + result;
+    } else {
+      while (digits.length < 6) {
+        digits = '0' + digits;
+      }
+      result = '' + digits + result;
+    }
+  }
+};
+
+/**
+ * Return the high 32-bits value.
+ *
+ * @return {Number} the high 32-bits as a signed value.
+ * @api public
+ */
+Timestamp.prototype.getHighBits = function() {
+  return this.high_;
+};
+
+/**
+ * Return the low 32-bits value.
+ *
+ * @return {Number} the low 32-bits as a signed value.
+ * @api public
+ */
+Timestamp.prototype.getLowBits = function() {
+  return this.low_;
+};
+
+/**
+ * Return the low unsigned 32-bits value.
+ *
+ * @return {Number} the low 32-bits as an unsigned value.
+ * @api public
+ */
+Timestamp.prototype.getLowBitsUnsigned = function() {
+  return (this.low_ >= 0) ?
+      this.low_ : Timestamp.TWO_PWR_32_DBL_ + this.low_;
+};
+
+/**
+ * Returns the number of bits needed to represent the absolute value of this Timestamp.
+ *
+ * @return {Number} Returns the number of bits needed to represent the absolute value of this Timestamp.
+ * @api public
+ */
+Timestamp.prototype.getNumBitsAbs = function() {
+  if (this.isNegative()) {
+    if (this.equals(Timestamp.MIN_VALUE)) {
+      return 64;
+    } else {
+      return this.negate().getNumBitsAbs();
+    }
+  } else {
+    var val = this.high_ != 0 ? this.high_ : this.low_;
+    for (var bit = 31; bit > 0; bit--) {
+      if ((val & (1 << bit)) != 0) {
+        break;
+      }
+    }
+    return this.high_ != 0 ? bit + 33 : bit + 1;
+  }
+};
+
+/**
+ * Return whether this value is zero.
+ *
+ * @return {Boolean} whether this value is zero.
+ * @api public
+ */
+Timestamp.prototype.isZero = function() {
+  return this.high_ == 0 && this.low_ == 0;
+};
+
+/**
+ * Return whether this value is negative.
+ *
+ * @return {Boolean} whether this value is negative.
+ * @api public
+ */
+Timestamp.prototype.isNegative = function() {
+  return this.high_ < 0;
+};
+
+/**
+ * Return whether this value is odd.
+ *
+ * @return {Boolean} whether this value is odd.
+ * @api public
+ */
+Timestamp.prototype.isOdd = function() {
+  return (this.low_ & 1) == 1;
+};
+
+/**
+ * Return whether this Timestamp equals the other
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp equals the other
+ * @api public
+ */
+Timestamp.prototype.equals = function(other) {
+  return (this.high_ == other.high_) && (this.low_ == other.low_);
+};
+
+/**
+ * Return whether this Timestamp does not equal the other.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp does not equal the other.
+ * @api public
+ */
+Timestamp.prototype.notEquals = function(other) {
+  return (this.high_ != other.high_) || (this.low_ != other.low_);
+};
+
+/**
+ * Return whether this Timestamp is less than the other.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp is less than the other.
+ * @api public
+ */
+Timestamp.prototype.lessThan = function(other) {
+  return this.compare(other) < 0;
+};
+
+/**
+ * Return whether this Timestamp is less than or equal to the other.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp is less than or equal to the other.
+ * @api public
+ */
+Timestamp.prototype.lessThanOrEqual = function(other) {
+  return this.compare(other) <= 0;
+};
+
+/**
+ * Return whether this Timestamp is greater than the other.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp is greater than the other.
+ * @api public
+ */
+Timestamp.prototype.greaterThan = function(other) {
+  return this.compare(other) > 0;
+};
+
+/**
+ * Return whether this Timestamp is greater than or equal to the other.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} whether this Timestamp is greater than or equal to the other.
+ * @api public
+ */
+Timestamp.prototype.greaterThanOrEqual = function(other) {
+  return this.compare(other) >= 0;
+};
+
+/**
+ * Compares this Timestamp with the given one.
+ *
+ * @param {Timestamp} other Timestamp to compare against.
+ * @return {Boolean} 0 if they are the same, 1 if the this is greater, and -1 if the given one is greater.
+ * @api public
+ */
+Timestamp.prototype.compare = function(other) {
+  if (this.equals(other)) {
+    return 0;
+  }
+
+  var thisNeg = this.isNegative();
+  var otherNeg = other.isNegative();
+  if (thisNeg && !otherNeg) {
+    return -1;
+  }
+  if (!thisNeg && otherNeg) {
+    return 1;
+  }
+
+  // at this point, the signs are the same, so subtraction will not overflow
+  if (this.subtract(other).isNegative()) {
+    return -1;
+  } else {
+    return 1;
+  }
+};
+
+/**
+ * The negation of this value.
+ *
+ * @return {Timestamp} the negation of this value.
+ * @api public
+ */
+Timestamp.prototype.negate = function() {
+  if (this.equals(Timestamp.MIN_VALUE)) {
+    return Timestamp.MIN_VALUE;
+  } else {
+    return this.not().add(Timestamp.ONE);
+  }
+};
+
+/**
+ * Returns the sum of this and the given Timestamp.
+ *
+ * @param {Timestamp} other Timestamp to add to this one.
+ * @return {Timestamp} the sum of this and the given Timestamp.
+ * @api public
+ */
+Timestamp.prototype.add = function(other) {
+  // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
+
+  var a48 = this.high_ >>> 16;
+  var a32 = this.high_ & 0xFFFF;
+  var a16 = this.low_ >>> 16;
+  var a00 = this.low_ & 0xFFFF;
+
+  var b48 = other.high_ >>> 16;
+  var b32 = other.high_ & 0xFFFF;
+  var b16 = other.low_ >>> 16;
+  var b00 = other.low_ & 0xFFFF;
+
+  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+  c00 += a00 + b00;
+  c16 += c00 >>> 16;
+  c00 &= 0xFFFF;
+  c16 += a16 + b16;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c32 += a32 + b32;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c48 += a48 + b48;
+  c48 &= 0xFFFF;
+  return Timestamp.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+};
+
+/**
+ * Returns the difference of this and the given Timestamp.
+ *
+ * @param {Timestamp} other Timestamp to subtract from this.
+ * @return {Timestamp} the difference of this and the given Timestamp.
+ * @api public
+ */
+Timestamp.prototype.subtract = function(other) {
+  return this.add(other.negate());
+};
+
+/**
+ * Returns the product of this and the given Timestamp.
+ *
+ * @param {Timestamp} other Timestamp to multiply with this.
+ * @return {Timestamp} the product of this and the other.
+ * @api public
+ */
+Timestamp.prototype.multiply = function(other) {
+  if (this.isZero()) {
+    return Timestamp.ZERO;
+  } else if (other.isZero()) {
+    return Timestamp.ZERO;
+  }
+
+  if (this.equals(Timestamp.MIN_VALUE)) {
+    return other.isOdd() ? Timestamp.MIN_VALUE : Timestamp.ZERO;
+  } else if (other.equals(Timestamp.MIN_VALUE)) {
+    return this.isOdd() ? Timestamp.MIN_VALUE : Timestamp.ZERO;
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().multiply(other.negate());
+    } else {
+      return this.negate().multiply(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.multiply(other.negate()).negate();
+  }
+
+  // If both Timestamps are small, use float multiplication
+  if (this.lessThan(Timestamp.TWO_PWR_24_) &&
+      other.lessThan(Timestamp.TWO_PWR_24_)) {
+    return Timestamp.fromNumber(this.toNumber() * other.toNumber());
+  }
+
+  // Divide each Timestamp into 4 chunks of 16 bits, and then add up 4x4 products.
+  // We can skip products that would overflow.
+
+  var a48 = this.high_ >>> 16;
+  var a32 = this.high_ & 0xFFFF;
+  var a16 = this.low_ >>> 16;
+  var a00 = this.low_ & 0xFFFF;
+
+  var b48 = other.high_ >>> 16;
+  var b32 = other.high_ & 0xFFFF;
+  var b16 = other.low_ >>> 16;
+  var b00 = other.low_ & 0xFFFF;
+
+  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+  c00 += a00 * b00;
+  c16 += c00 >>> 16;
+  c00 &= 0xFFFF;
+  c16 += a16 * b00;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c16 += a00 * b16;
+  c32 += c16 >>> 16;
+  c16 &= 0xFFFF;
+  c32 += a32 * b00;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c32 += a16 * b16;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c32 += a00 * b32;
+  c48 += c32 >>> 16;
+  c32 &= 0xFFFF;
+  c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
+  c48 &= 0xFFFF;
+  return Timestamp.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+};
+
+/**
+ * Returns this Timestamp divided by the given one.
+ *
+ * @param {Timestamp} other Timestamp by which to divide.
+ * @return {Timestamp} this Timestamp divided by the given one.
+ * @api public
+ */
+Timestamp.prototype.div = function(other) {
+  if (other.isZero()) {
+    throw Error('division by zero');
+  } else if (this.isZero()) {
+    return Timestamp.ZERO;
+  }
+
+  if (this.equals(Timestamp.MIN_VALUE)) {
+    if (other.equals(Timestamp.ONE) ||
+        other.equals(Timestamp.NEG_ONE)) {
+      return Timestamp.MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE
+    } else if (other.equals(Timestamp.MIN_VALUE)) {
+      return Timestamp.ONE;
+    } else {
+      // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
+      var halfThis = this.shiftRight(1);
+      var approx = halfThis.div(other).shiftLeft(1);
+      if (approx.equals(Timestamp.ZERO)) {
+        return other.isNegative() ? Timestamp.ONE : Timestamp.NEG_ONE;
+      } else {
+        var rem = this.subtract(other.multiply(approx));
+        var result = approx.add(rem.div(other));
+        return result;
+      }
+    }
+  } else if (other.equals(Timestamp.MIN_VALUE)) {
+    return Timestamp.ZERO;
+  }
+
+  if (this.isNegative()) {
+    if (other.isNegative()) {
+      return this.negate().div(other.negate());
+    } else {
+      return this.negate().div(other).negate();
+    }
+  } else if (other.isNegative()) {
+    return this.div(other.negate()).negate();
+  }
+
+  // Repeat the following until the remainder is less than other:  find a
+  // floating-point that approximates remainder / other *from below*, add this
+  // into the result, and subtract it from the remainder.  It is critical that
+  // the approximate value is less than or equal to the real value so that the
+  // remainder never becomes negative.
+  var res = Timestamp.ZERO;
+  var rem = this;
+  while (rem.greaterThanOrEqual(other)) {
+    // Approximate the result of division. This may be a little greater or
+    // smaller than the actual value.
+    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
+
+    // We will tweak the approximate result by changing it in the 48-th digit or
+    // the smallest non-fractional digit, whichever is larger.
+    var log2 = Math.ceil(Math.log(approx) / Math.LN2);
+    var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);
+
+    // Decrease the approximation until it is smaller than the remainder.  Note
+    // that if it is too large, the product overflows and is negative.
+    var approxRes = Timestamp.fromNumber(approx);
+    var approxRem = approxRes.multiply(other);
+    while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
+      approx -= delta;
+      approxRes = Timestamp.fromNumber(approx);
+      approxRem = approxRes.multiply(other);
+    }
+
+    // We know the answer can't be zero... and actually, zero would cause
+    // infinite recursion since we would make no progress.
+    if (approxRes.isZero()) {
+      approxRes = Timestamp.ONE;
+    }
+
+    res = res.add(approxRes);
+    rem = rem.subtract(approxRem);
+  }
+  return res;
+};
+
+/**
+ * Returns this Timestamp modulo the given one.
+ *
+ * @param {Timestamp} other Timestamp by which to mod.
+ * @return {Timestamp} this Timestamp modulo the given one.
+ * @api public
+ */
+Timestamp.prototype.modulo = function(other) {
+  return this.subtract(this.div(other).multiply(other));
+};
+
+/**
+ * The bitwise-NOT of this value.
+ *
+ * @return {Timestamp} the bitwise-NOT of this value.
+ * @api public
+ */
+Timestamp.prototype.not = function() {
+  return Timestamp.fromBits(~this.low_, ~this.high_);
+};
+
+/**
+ * Returns the bitwise-AND of this Timestamp and the given one.
+ *
+ * @param {Timestamp} other the Timestamp with which to AND.
+ * @return {Timestamp} the bitwise-AND of this and the other.
+ * @api public
+ */
+Timestamp.prototype.and = function(other) {
+  return Timestamp.fromBits(this.low_ & other.low_, this.high_ & other.high_);
+};
+
+/**
+ * Returns the bitwise-OR of this Timestamp and the given one.
+ *
+ * @param {Timestamp} other the Timestamp with which to OR.
+ * @return {Timestamp} the bitwise-OR of this and the other.
+ * @api public
+ */
+Timestamp.prototype.or = function(other) {
+  return Timestamp.fromBits(this.low_ | other.low_, this.high_ | other.high_);
+};
+
+/**
+ * Returns the bitwise-XOR of this Timestamp and the given one.
+ *
+ * @param {Timestamp} other the Timestamp with which to XOR.
+ * @return {Timestamp} the bitwise-XOR of this and the other.
+ * @api public
+ */
+Timestamp.prototype.xor = function(other) {
+  return Timestamp.fromBits(this.low_ ^ other.low_, this.high_ ^ other.high_);
+};
+
+/**
+ * Returns this Timestamp with bits shifted to the left by the given amount.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Timestamp} this shifted to the left by the given amount.
+ * @api public
+ */
+Timestamp.prototype.shiftLeft = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var low = this.low_;
+    if (numBits < 32) {
+      var high = this.high_;
+      return Timestamp.fromBits(
+                 low << numBits,
+                 (high << numBits) | (low >>> (32 - numBits)));
+    } else {
+      return Timestamp.fromBits(0, low << (numBits - 32));
+    }
+  }
+};
+
+/**
+ * Returns this Timestamp with bits shifted to the right by the given amount.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Timestamp} this shifted to the right by the given amount.
+ * @api public
+ */
+Timestamp.prototype.shiftRight = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var high = this.high_;
+    if (numBits < 32) {
+      var low = this.low_;
+      return Timestamp.fromBits(
+                 (low >>> numBits) | (high << (32 - numBits)),
+                 high >> numBits);
+    } else {
+      return Timestamp.fromBits(
+                 high >> (numBits - 32),
+                 high >= 0 ? 0 : -1);
+    }
+  }
+};
+
+/**
+ * Returns this Timestamp with bits shifted to the right by the given amount, with the new top bits matching the current sign bit.
+ *
+ * @param {Number} numBits the number of bits by which to shift.
+ * @return {Timestamp} this shifted to the right by the given amount, with zeros placed into the new leading bits.
+ * @api public
+ */
+Timestamp.prototype.shiftRightUnsigned = function(numBits) {
+  numBits &= 63;
+  if (numBits == 0) {
+    return this;
+  } else {
+    var high = this.high_;
+    if (numBits < 32) {
+      var low = this.low_;
+      return Timestamp.fromBits(
+                 (low >>> numBits) | (high << (32 - numBits)),
+                 high >>> numBits);
+    } else if (numBits == 32) {
+      return Timestamp.fromBits(high, 0);
+    } else {
+      return Timestamp.fromBits(high >>> (numBits - 32), 0);
+    }
+  }
+};
+
+/**
+ * Returns a Timestamp representing the given (32-bit) integer value.
+ *
+ * @param {Number} value the 32-bit integer in question.
+ * @return {Timestamp} the corresponding Timestamp value.
+ * @api public
+ */
+Timestamp.fromInt = function(value) {
+  if (-128 <= value && value < 128) {
+    var cachedObj = Timestamp.INT_CACHE_[value];
+    if (cachedObj) {
+      return cachedObj;
+    }
+  }
+
+  var obj = new Timestamp(value | 0, value < 0 ? -1 : 0);
+  if (-128 <= value && value < 128) {
+    Timestamp.INT_CACHE_[value] = obj;
+  }
+  return obj;
+};
+
+/**
+ * Returns a Timestamp representing the given value, provided that it is a finite number. Otherwise, zero is returned.
+ *
+ * @param {Number} value the number in question.
+ * @return {Timestamp} the corresponding Timestamp value.
+ * @api public
+ */
+Timestamp.fromNumber = function(value) {
+  if (isNaN(value) || !isFinite(value)) {
+    return Timestamp.ZERO;
+  } else if (value <= -Timestamp.TWO_PWR_63_DBL_) {
+    return Timestamp.MIN_VALUE;
+  } else if (value + 1 >= Timestamp.TWO_PWR_63_DBL_) {
+    return Timestamp.MAX_VALUE;
+  } else if (value < 0) {
+    return Timestamp.fromNumber(-value).negate();
+  } else {
+    return new Timestamp(
+               (value % Timestamp.TWO_PWR_32_DBL_) | 0,
+               (value / Timestamp.TWO_PWR_32_DBL_) | 0);
+  }
+};
+
+/**
+ * Returns a Timestamp representing the 64-bit integer that comes by concatenating the given high and low bits. Each is assumed to use 32 bits.
+ *
+ * @param {Number} lowBits the low 32-bits.
+ * @param {Number} highBits the high 32-bits.
+ * @return {Timestamp} the corresponding Timestamp value.
+ * @api public
+ */
+Timestamp.fromBits = function(lowBits, highBits) {
+  return new Timestamp(lowBits, highBits);
+};
+
+/**
+ * Returns a Timestamp representation of the given string, written using the given radix.
+ *
+ * @param {String} str the textual representation of the Timestamp.
+ * @param {Number} opt_radix the radix in which the text is written.
+ * @return {Timestamp} the corresponding Timestamp value.
+ * @api public
+ */
+Timestamp.fromString = function(str, opt_radix) {
+  if (str.length == 0) {
+    throw Error('number format error: empty string');
+  }
+
+  var radix = opt_radix || 10;
+  if (radix < 2 || 36 < radix) {
+    throw Error('radix out of range: ' + radix);
+  }
+
+  if (str.charAt(0) == '-') {
+    return Timestamp.fromString(str.substring(1), radix).negate();
+  } else if (str.indexOf('-') >= 0) {
+    throw Error('number format error: interior "-" character: ' + str);
+  }
+
+  // Do several (8) digits each time through the loop, so as to
+  // minimize the calls to the very expensive emulated div.
+  var radixToPower = Timestamp.fromNumber(Math.pow(radix, 8));
+
+  var result = Timestamp.ZERO;
+  for (var i = 0; i < str.length; i += 8) {
+    var size = Math.min(8, str.length - i);
+    var value = parseInt(str.substring(i, i + size), radix);
+    if (size < 8) {
+      var power = Timestamp.fromNumber(Math.pow(radix, size));
+      result = result.multiply(power).add(Timestamp.fromNumber(value));
+    } else {
+      result = result.multiply(radixToPower);
+      result = result.add(Timestamp.fromNumber(value));
+    }
+  }
+  return result;
+};
+
+// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
+// from* methods on which they depend.
+
+
+/**
+ * A cache of the Timestamp representations of small integer values.
+ * @type {Object}
+ * @api private
+ */
+Timestamp.INT_CACHE_ = {};
+
+// NOTE: the compiler should inline these constant values below and then remove
+// these variables, so there should be no runtime penalty for these.
+
+/**
+ * Number used repeated below in calculations.  This must appear before the
+ * first call to any from* function below.
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_16_DBL_ = 1 << 16;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_24_DBL_ = 1 << 24;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_32_DBL_ = Timestamp.TWO_PWR_16_DBL_ * Timestamp.TWO_PWR_16_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_31_DBL_ = Timestamp.TWO_PWR_32_DBL_ / 2;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_48_DBL_ = Timestamp.TWO_PWR_32_DBL_ * Timestamp.TWO_PWR_16_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_64_DBL_ = Timestamp.TWO_PWR_32_DBL_ * Timestamp.TWO_PWR_32_DBL_;
+
+/**
+ * @type {number}
+ * @api private
+ */
+Timestamp.TWO_PWR_63_DBL_ = Timestamp.TWO_PWR_64_DBL_ / 2;
+
+/** @type {Timestamp} */
+Timestamp.ZERO = Timestamp.fromInt(0);
+
+/** @type {Timestamp} */
+Timestamp.ONE = Timestamp.fromInt(1);
+
+/** @type {Timestamp} */
+Timestamp.NEG_ONE = Timestamp.fromInt(-1);
+
+/** @type {Timestamp} */
+Timestamp.MAX_VALUE =
+    Timestamp.fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0);
+
+/** @type {Timestamp} */
+Timestamp.MIN_VALUE = Timestamp.fromBits(0, 0x80000000 | 0);
+
+/**
+ * @type {Timestamp}
+ * @api private
+ */
+Timestamp.TWO_PWR_24_ = Timestamp.fromInt(1 << 24);
+
+/**
+ * Expose.
+ */
+exports.Timestamp = Timestamp;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/bson/package.json b/node_modules/mongodb/node_modules/bson/package.json
new file mode 100644
index 0000000..e9eb5f1
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/package.json
@@ -0,0 +1,51 @@
+{
+  "name": "bson",
+  "description": "A bson parser for node.js and the browser",
+  "keywords": [
+    "mongodb",
+    "bson",
+    "parser"
+  ],
+  "version": "0.1.9",
+  "author": {
+    "name": "Christian Amor Kvalheim",
+    "email": "christkv@gmail.com"
+  },
+  "contributors": [],
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/mongodb/js-bson.git"
+  },
+  "bugs": {
+    "url": "https://github.com/mongodb/js-bson/issues"
+  },
+  "devDependencies": {
+    "nodeunit": "0.7.3",
+    "gleak": "0.2.3",
+    "one": "latest"
+  },
+  "config": {
+    "native": false
+  },
+  "main": "./lib/bson/index",
+  "directories": {
+    "lib": "./lib/bson"
+  },
+  "engines": {
+    "node": ">=0.6.19"
+  },
+  "scripts": {
+    "install": "(node-gyp rebuild 2> builderror.log) || (exit 0)",
+    "test": "nodeunit ./test/node && TEST_NATIVE=TRUE nodeunit ./test/node"
+  },
+  "licenses": [
+    {
+      "type": "Apache License, Version 2.0",
+      "url": "http://www.apache.org/licenses/LICENSE-2.0"
+    }
+  ],
+  "readme": "Javascript + C++ BSON parser\n============================\n\nThis BSON parser is primarily meant for usage with the `mongodb` node.js driver. However thanks to such wonderful tools at `onejs` we are able to package up a BSON parser that will work in the browser aswell. The current build is located in the `browser_build/bson.js` file.\n\nA simple example on how to use it\n\n    <head>\n      <script src=\"https://raw.github.com/mongodb/js-bson/master/browser_build/bson.js\">\n      </script>\n    </head>\n    <body onload=\"start();\">\n    <script>\n      function start() {\n        var BSON = bson().BSON;\n        var Long = bson().Long;\n\n        var doc = {long: Long.fromNumber(100)}\n\n        // Serialize a document\n        var data = BSON.serialize(doc, false, true, false);\n        // De serialize it again\n        var doc_2 = BSON.deserialize(data);\n      }\n    </script>\n    </body>\n\n  It's got two simple methods to use in your application.\n\n  * BSON.serialize(object, checkKeys, asBuffer, serializeFunctions)\n     * @param {Object} object the Javascript object to serialize.\n     * @param {Boolean} checkKeys the serializer will check if keys are valid.\n     * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.\n     * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**\n     * @return {TypedArray/Array} returns a TypedArray or Array depending on what your browser supports\n \n  * BSON.deserialize(buffer, options, isArray)\n     * Options\n       * **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.\n       * **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.\n       * **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.\n     * @param {TypedArray/Array} a TypedArray/Array containing the BSON data\n     * @param {Object} [options] additional options used for the deserialization.\n     * @param {Boolean} [isArray] ignore used for recursive parsing.\n     * @return {Object} returns the deserialized Javascript Object.\n",
+  "readmeFilename": "README.md",
+  "_id": "bson@0.1.9",
+  "_from": "bson@0.1.9"
+}
diff --git a/node_modules/mongodb/node_modules/bson/tools/gleak.js b/node_modules/mongodb/node_modules/bson/tools/gleak.js
new file mode 100644
index 0000000..c707cfc
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/tools/gleak.js
@@ -0,0 +1,21 @@
+
+var gleak = require('gleak')();
+gleak.ignore('AssertionError');
+gleak.ignore('testFullSpec_param_found');
+gleak.ignore('events');
+gleak.ignore('Uint8Array');
+gleak.ignore('Uint8ClampedArray');
+gleak.ignore('TAP_Global_Harness');
+gleak.ignore('setImmediate');
+gleak.ignore('clearImmediate');
+
+gleak.ignore('DTRACE_NET_SERVER_CONNECTION');
+gleak.ignore('DTRACE_NET_STREAM_END');
+gleak.ignore('DTRACE_NET_SOCKET_READ');
+gleak.ignore('DTRACE_NET_SOCKET_WRITE');
+gleak.ignore('DTRACE_HTTP_SERVER_REQUEST');
+gleak.ignore('DTRACE_HTTP_SERVER_RESPONSE');
+gleak.ignore('DTRACE_HTTP_CLIENT_REQUEST');
+gleak.ignore('DTRACE_HTTP_CLIENT_RESPONSE');
+
+module.exports = gleak;
diff --git a/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/MIT.LICENSE b/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/MIT.LICENSE
new file mode 100644
index 0000000..7c435ba
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/MIT.LICENSE
@@ -0,0 +1,20 @@
+Copyright (c) 2008-2011 Pivotal Labs
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine-html.js b/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine-html.js
new file mode 100644
index 0000000..7383401
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine-html.js
@@ -0,0 +1,190 @@
+jasmine.TrivialReporter = function(doc) {
+  this.document = doc || document;
+  this.suiteDivs = {};
+  this.logRunningSpecs = false;
+};
+
+jasmine.TrivialReporter.prototype.createDom = function(type, attrs, childrenVarArgs) {
+  var el = document.createElement(type);
+
+  for (var i = 2; i < arguments.length; i++) {
+    var child = arguments[i];
+
+    if (typeof child === 'string') {
+      el.appendChild(document.createTextNode(child));
+    } else {
+      if (child) { el.appendChild(child); }
+    }
+  }
+
+  for (var attr in attrs) {
+    if (attr == "className") {
+      el[attr] = attrs[attr];
+    } else {
+      el.setAttribute(attr, attrs[attr]);
+    }
+  }
+
+  return el;
+};
+
+jasmine.TrivialReporter.prototype.reportRunnerStarting = function(runner) {
+  var showPassed, showSkipped;
+
+  this.outerDiv = this.createDom('div', { className: 'jasmine_reporter' },
+      this.createDom('div', { className: 'banner' },
+        this.createDom('div', { className: 'logo' },
+            this.createDom('span', { className: 'title' }, "Jasmine"),
+            this.createDom('span', { className: 'version' }, runner.env.versionString())),
+        this.createDom('div', { className: 'options' },
+            "Show ",
+            showPassed = this.createDom('input', { id: "__jasmine_TrivialReporter_showPassed__", type: 'checkbox' }),
+            this.createDom('label', { "for": "__jasmine_TrivialReporter_showPassed__" }, " passed "),
+            showSkipped = this.createDom('input', { id: "__jasmine_TrivialReporter_showSkipped__", type: 'checkbox' }),
+            this.createDom('label', { "for": "__jasmine_TrivialReporter_showSkipped__" }, " skipped")
+            )
+          ),
+
+      this.runnerDiv = this.createDom('div', { className: 'runner running' },
+          this.createDom('a', { className: 'run_spec', href: '?' }, "run all"),
+          this.runnerMessageSpan = this.createDom('span', {}, "Running..."),
+          this.finishedAtSpan = this.createDom('span', { className: 'finished-at' }, ""))
+      );
+
+  this.document.body.appendChild(this.outerDiv);
+
+  var suites = runner.suites();
+  for (var i = 0; i < suites.length; i++) {
+    var suite = suites[i];
+    var suiteDiv = this.createDom('div', { className: 'suite' },
+        this.createDom('a', { className: 'run_spec', href: '?spec=' + encodeURIComponent(suite.getFullName()) }, "run"),
+        this.createDom('a', { className: 'description', href: '?spec=' + encodeURIComponent(suite.getFullName()) }, suite.description));
+    this.suiteDivs[suite.id] = suiteDiv;
+    var parentDiv = this.outerDiv;
+    if (suite.parentSuite) {
+      parentDiv = this.suiteDivs[suite.parentSuite.id];
+    }
+    parentDiv.appendChild(suiteDiv);
+  }
+
+  this.startedAt = new Date();
+
+  var self = this;
+  showPassed.onclick = function(evt) {
+    if (showPassed.checked) {
+      self.outerDiv.className += ' show-passed';
+    } else {
+      self.outerDiv.className = self.outerDiv.className.replace(/ show-passed/, '');
+    }
+  };
+
+  showSkipped.onclick = function(evt) {
+    if (showSkipped.checked) {
+      self.outerDiv.className += ' show-skipped';
+    } else {
+      self.outerDiv.className = self.outerDiv.className.replace(/ show-skipped/, '');
+    }
+  };
+};
+
+jasmine.TrivialReporter.prototype.reportRunnerResults = function(runner) {
+  var results = runner.results();
+  var className = (results.failedCount > 0) ? "runner failed" : "runner passed";
+  this.runnerDiv.setAttribute("class", className);
+  //do it twice for IE
+  this.runnerDiv.setAttribute("className", className);
+  var specs = runner.specs();
+  var specCount = 0;
+  for (var i = 0; i < specs.length; i++) {
+    if (this.specFilter(specs[i])) {
+      specCount++;
+    }
+  }
+  var message = "" + specCount + " spec" + (specCount == 1 ? "" : "s" ) + ", " + results.failedCount + " failure" + ((results.failedCount == 1) ? "" : "s");
+  message += " in " + ((new Date().getTime() - this.startedAt.getTime()) / 1000) + "s";
+  this.runnerMessageSpan.replaceChild(this.createDom('a', { className: 'description', href: '?'}, message), this.runnerMessageSpan.firstChild);
+
+  this.finishedAtSpan.appendChild(document.createTextNode("Finished at " + new Date().toString()));
+};
+
+jasmine.TrivialReporter.prototype.reportSuiteResults = function(suite) {
+  var results = suite.results();
+  var status = results.passed() ? 'passed' : 'failed';
+  if (results.totalCount === 0) { // todo: change this to check results.skipped
+    status = 'skipped';
+  }
+  this.suiteDivs[suite.id].className += " " + status;
+};
+
+jasmine.TrivialReporter.prototype.reportSpecStarting = function(spec) {
+  if (this.logRunningSpecs) {
+    this.log('>> Jasmine Running ' + spec.suite.description + ' ' + spec.description + '...');
+  }
+};
+
+jasmine.TrivialReporter.prototype.reportSpecResults = function(spec) {
+  var results = spec.results();
+  var status = results.passed() ? 'passed' : 'failed';
+  if (results.skipped) {
+    status = 'skipped';
+  }
+  var specDiv = this.createDom('div', { className: 'spec '  + status },
+      this.createDom('a', { className: 'run_spec', href: '?spec=' + encodeURIComponent(spec.getFullName()) }, "run"),
+      this.createDom('a', {
+        className: 'description',
+        href: '?spec=' + encodeURIComponent(spec.getFullName()),
+        title: spec.getFullName()
+      }, spec.description));
+
+
+  var resultItems = results.getItems();
+  var messagesDiv = this.createDom('div', { className: 'messages' });
+  for (var i = 0; i < resultItems.length; i++) {
+    var result = resultItems[i];
+
+    if (result.type == 'log') {
+      messagesDiv.appendChild(this.createDom('div', {className: 'resultMessage log'}, result.toString()));
+    } else if (result.type == 'expect' && result.passed && !result.passed()) {
+      messagesDiv.appendChild(this.createDom('div', {className: 'resultMessage fail'}, result.message));
+
+      if (result.trace.stack) {
+        messagesDiv.appendChild(this.createDom('div', {className: 'stackTrace'}, result.trace.stack));
+      }
+    }
+  }
+
+  if (messagesDiv.childNodes.length > 0) {
+    specDiv.appendChild(messagesDiv);
+  }
+
+  this.suiteDivs[spec.suite.id].appendChild(specDiv);
+};
+
+jasmine.TrivialReporter.prototype.log = function() {
+  var console = jasmine.getGlobal().console;
+  if (console && console.log) {
+    if (console.log.apply) {
+      console.log.apply(console, arguments);
+    } else {
+      console.log(arguments); // ie fix: console.log.apply doesn't exist on ie
+    }
+  }
+};
+
+jasmine.TrivialReporter.prototype.getLocation = function() {
+  return this.document.location;
+};
+
+jasmine.TrivialReporter.prototype.specFilter = function(spec) {
+  var paramMap = {};
+  var params = this.getLocation().search.substring(1).split('&');
+  for (var i = 0; i < params.length; i++) {
+    var p = params[i].split('=');
+    paramMap[decodeURIComponent(p[0])] = decodeURIComponent(p[1]);
+  }
+
+  if (!paramMap.spec) {
+    return true;
+  }
+  return spec.getFullName().indexOf(paramMap.spec) === 0;
+};
diff --git a/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine.css b/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine.css
new file mode 100644
index 0000000..6583fe7
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine.css
@@ -0,0 +1,166 @@
+body {
+  font-family: "Helvetica Neue Light", "Lucida Grande", "Calibri", "Arial", sans-serif;
+}
+
+
+.jasmine_reporter a:visited, .jasmine_reporter a {
+  color: #303; 
+}
+
+.jasmine_reporter a:hover, .jasmine_reporter a:active {
+  color: blue; 
+}
+
+.run_spec {
+  float:right;
+  padding-right: 5px;
+  font-size: .8em;
+  text-decoration: none;
+}
+
+.jasmine_reporter {
+  margin: 0 5px;
+}
+
+.banner {
+  color: #303;
+  background-color: #fef;
+  padding: 5px;
+}
+
+.logo {
+  float: left;
+  font-size: 1.1em;
+  padding-left: 5px;
+}
+
+.logo .version {
+  font-size: .6em;
+  padding-left: 1em;
+}
+
+.runner.running {
+  background-color: yellow;
+}
+
+
+.options {
+  text-align: right;
+  font-size: .8em;
+}
+
+
+
+
+.suite {
+  border: 1px outset gray;
+  margin: 5px 0;
+  padding-left: 1em;
+}
+
+.suite .suite {
+  margin: 5px; 
+}
+
+.suite.passed {
+  background-color: #dfd;
+}
+
+.suite.failed {
+  background-color: #fdd;
+}
+
+.spec {
+  margin: 5px;
+  padding-left: 1em;
+  clear: both;
+}
+
+.spec.failed, .spec.passed, .spec.skipped {
+  padding-bottom: 5px;
+  border: 1px solid gray;
+}
+
+.spec.failed {
+  background-color: #fbb;
+  border-color: red;
+}
+
+.spec.passed {
+  background-color: #bfb;
+  border-color: green;
+}
+
+.spec.skipped {
+  background-color: #bbb;
+}
+
+.messages {
+  border-left: 1px dashed gray;
+  padding-left: 1em;
+  padding-right: 1em;
+}
+
+.passed {
+  background-color: #cfc;
+  display: none;
+}
+
+.failed {
+  background-color: #fbb;
+}
+
+.skipped {
+  color: #777;
+  background-color: #eee;
+  display: none;
+}
+
+
+/*.resultMessage {*/
+  /*white-space: pre;*/
+/*}*/
+
+.resultMessage span.result {
+  display: block;
+  line-height: 2em;
+  color: black;
+}
+
+.resultMessage .mismatch {
+  color: black;
+}
+
+.stackTrace {
+  white-space: pre;
+  font-size: .8em;
+  margin-left: 10px;
+  max-height: 5em;
+  overflow: auto;
+  border: 1px inset red;
+  padding: 1em;
+  background: #eef;
+}
+
+.finished-at {
+  padding-left: 1em;
+  font-size: .6em;
+}
+
+.show-passed .passed,
+.show-skipped .skipped {
+  display: block;
+}
+
+
+#jasmine_content {
+  position:fixed;
+  right: 100%;
+}
+
+.runner {
+  border: 1px solid gray;
+  display: block;
+  margin: 5px 0;
+  padding: 2px 0 2px 10px;
+}
diff --git a/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine.js b/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine.js
new file mode 100644
index 0000000..c3d2dc7
--- /dev/null
+++ b/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine.js
@@ -0,0 +1,2476 @@
+var isCommonJS = typeof window == "undefined";
+
+/**
+ * Top level namespace for Jasmine, a lightweight JavaScript BDD/spec/testing framework.
+ *
+ * @namespace
+ */
+var jasmine = {};
+if (isCommonJS) exports.jasmine = jasmine;
+/**
+ * @private
+ */
+jasmine.unimplementedMethod_ = function() {
+  throw new Error("unimplemented method");
+};
+
+/**
+ * Use <code>jasmine.undefined</code> instead of <code>undefined</code>, since <code>undefined</code> is just
+ * a plain old variable and may be redefined by somebody else.
+ *
+ * @private
+ */
+jasmine.undefined = jasmine.___undefined___;
+
+/**
+ * Show diagnostic messages in the console if set to true
+ *
+ */
+jasmine.VERBOSE = false;
+
+/**
+ * Default interval in milliseconds for event loop yields (e.g. to allow network activity or to refresh the screen with the HTML-based runner). Small values here may result in slow test running. Zero means no updates until all tests have completed.
+ *
+ */
+jasmine.DEFAULT_UPDATE_INTERVAL = 250;
+
+/**
+ * Default timeout interval in milliseconds for waitsFor() blocks.
+ */
+jasmine.DEFAULT_TIMEOUT_INTERVAL = 5000;
+
+jasmine.getGlobal = function() {
+  function getGlobal() {
+    return this;
+  }
+
+  return getGlobal();
+};
+
+/**
+ * Allows for bound functions to be compared.  Internal use only.
+ *
+ * @ignore
+ * @private
+ * @param base {Object} bound 'this' for the function
+ * @param name {Function} function to find
+ */
+jasmine.bindOriginal_ = function(base, name) {
+  var original = base[name];
+  if (original.apply) {
+    return function() {
+      return original.apply(base, arguments);
+    };
+  } else {
+    // IE support
+    return jasmine.getGlobal()[name];
+  }
+};
+
+jasmine.setTimeout = jasmine.bindOriginal_(jasmine.getGlobal(), 'setTimeout');
+jasmine.clearTimeout = jasmine.bindOriginal_(jasmine.getGlobal(), 'clearTimeout');
+jasmine.setInterval = jasmine.bindOriginal_(jasmine.getGlobal(), 'setInterval');
+jasmine.clearInterval = jasmine.bindOriginal_(jasmine.getGlobal(), 'clearInterval');
+
+jasmine.MessageResult = function(values) {
+  this.type = 'log';
+  this.values = values;
+  this.trace = new Error(); // todo: test better
+};
+
+jasmine.MessageResult.prototype.toString = function() {
+  var text = "";
+  for (var i = 0; i < this.values.length; i++) {
+    if (i > 0) text += " ";
+    if (jasmine.isString_(this.values[i])) {
+      text += this.values[i];
+    } else {
+      text += jasmine.pp(this.values[i]);
+    }
+  }
+  return text;
+};
+
+jasmine.ExpectationResult = function(params) {
+  this.type = 'expect';
+  this.matcherName = params.matcherName;
+  this.passed_ = params.passed;
+  this.expected = params.expected;
+  this.actual = params.actual;
+  this.message = this.passed_ ? 'Passed.' : params.message;
+
+  var trace = (params.trace || new Error(this.message));
+  this.trace = this.passed_ ? '' : trace;
+};
+
+jasmine.ExpectationResult.prototype.toString = function () {
+  return this.message;
+};
+
+jasmine.ExpectationResult.prototype.passed = function () {
+  return this.passed_;
+};
+
+/**
+ * Getter for the Jasmine environment. Ensures one gets created
+ */
+jasmine.getEnv = function() {
+  var env = jasmine.currentEnv_ = jasmine.currentEnv_ || new jasmine.Env();
+  return env;
+};
+
+/**
+ * @ignore
+ * @private
+ * @param value
+ * @returns {Boolean}
+ */
+jasmine.isArray_ = function(value) {
+  return jasmine.isA_("Array", value);
+};
+
+/**
+ * @ignore
+ * @private
+ * @param value
+ * @returns {Boolean}
+ */
+jasmine.isString_ = function(value) {
+  return jasmine.isA_("String", value);
+};
+
+/**
+ * @ignore
+ * @private
+ * @param value
+ * @returns {Boolean}
+ */
+jasmine.isNumber_ = function(value) {
+  return jasmine.isA_("Number", value);
+};
+
+/**
+ * @ignore
+ * @private
+ * @param {String} typeName
+ * @param value
+ * @returns {Boolean}
+ */
+jasmine.isA_ = function(typeName, value) {
+  return Object.prototype.toString.apply(value) === '[object ' + typeName + ']';
+};
+
+/**
+ * Pretty printer for expecations.  Takes any object and turns it into a human-readable string.
+ *
+ * @param value {Object} an object to be outputted
+ * @returns {String}
+ */
+jasmine.pp = function(value) {
+  var stringPrettyPrinter = new jasmine.StringPrettyPrinter();
+  stringPrettyPrinter.format(value);
+  return stringPrettyPrinter.string;
+};
+
+/**
+ * Returns true if the object is a DOM Node.
+ *
+ * @param {Object} obj object to check
+ * @returns {Boolean}
+ */
+jasmine.isDomNode = function(obj) {
+  return obj.nodeType > 0;
+};
+
+/**
+ * Returns a matchable 'generic' object of the class type.  For use in expecations of type when values don't matter.
+ *
+ * @example
+ * // don't care about which function is passed in, as long as it's a function
+ * expect(mySpy).toHaveBeenCalledWith(jasmine.any(Function));
+ *
+ * @param {Class} clazz
+ * @returns matchable object of the type clazz
+ */
+jasmine.any = function(clazz) {
+  return new jasmine.Matchers.Any(clazz);
+};
+
+/**
+ * Jasmine Spies are test doubles that can act as stubs, spies, fakes or when used in an expecation, mocks.
+ *
+ * Spies should be created in test setup, before expectations.  They can then be checked, using the standard Jasmine
+ * expectation syntax. Spies can be checked if they were called or not and what the calling params were.
+ *
+ * A Spy has the following fields: wasCalled, callCount, mostRecentCall, and argsForCall (see docs).
+ *
+ * Spies are torn down at the end of every spec.
+ *
+ * Note: Do <b>not</b> call new jasmine.Spy() directly - a spy must be created using spyOn, jasmine.createSpy or jasmine.createSpyObj.
+ *
+ * @example
+ * // a stub
+ * var myStub = jasmine.createSpy('myStub');  // can be used anywhere
+ *
+ * // spy example
+ * var foo = {
+ *   not: function(bool) { return !bool; }
+ * }
+ *
+ * // actual foo.not will not be called, execution stops
+ * spyOn(foo, 'not');
+
+ // foo.not spied upon, execution will continue to implementation
+ * spyOn(foo, 'not').andCallThrough();
+ *
+ * // fake example
+ * var foo = {
+ *   not: function(bool) { return !bool; }
+ * }
+ *
+ * // foo.not(val) will return val
+ * spyOn(foo, 'not').andCallFake(function(value) {return value;});
+ *
+ * // mock example
+ * foo.not(7 == 7);
+ * expect(foo.not).toHaveBeenCalled();
+ * expect(foo.not).toHaveBeenCalledWith(true);
+ *
+ * @constructor
+ * @see spyOn, jasmine.createSpy, jasmine.createSpyObj
+ * @param {String} name
+ */
+jasmine.Spy = function(name) {
+  /**
+   * The name of the spy, if provided.
+   */
+  this.identity = name || 'unknown';
+  /**
+   *  Is this Object a spy?
+   */
+  this.isSpy = true;
+  /**
+   * The actual function this spy stubs.
+   */
+  this.plan = function() {
+  };
+  /**
+   * Tracking of the most recent call to the spy.
+   * @example
+   * var mySpy = jasmine.createSpy('foo');
+   * mySpy(1, 2);
+   * mySpy.mostRecentCall.args = [1, 2];
+   */
+  this.mostRecentCall = {};
+
+  /**
+   * Holds arguments for each call to the spy, indexed by call count
+   * @example
+   * var mySpy = jasmine.createSpy('foo');
+   * mySpy(1, 2);
+   * mySpy(7, 8);
+   * mySpy.mostRecentCall.args = [7, 8];
+   * mySpy.argsForCall[0] = [1, 2];
+   * mySpy.argsForCall[1] = [7, 8];
+   */
+  this.argsForCall = [];
+  this.calls = [];
+};
+
+/**
+ * Tells a spy to call through to the actual implemenatation.
+ *
+ * @example
+ * var foo = {
+ *   bar: function() { // do some stuff }
+ * }
+ *
+ * // defining a spy on an existing property: foo.bar
+ * spyOn(foo, 'bar').andCallThrough();
+ */
+jasmine.Spy.prototype.andCallThrough = function() {
+  this.plan = this.originalValue;
+  return this;
+};
+
+/**
+ * For setting the return value of a spy.
+ *
+ * @example
+ * // defining a spy from scratch: foo() returns 'baz'
+ * var foo = jasmine.createSpy('spy on foo').andReturn('baz');
+ *
+ * // defining a spy on an existing property: foo.bar() returns 'baz'
+ * spyOn(foo, 'bar').andReturn('baz');
+ *
+ * @param {Object} value
+ */
+jasmine.Spy.prototype.andReturn = function(value) {
+  this.plan = function() {
+    return value;
+  };
+  return this;
+};
+
+/**
+ * For throwing an exception when a spy is called.
+ *
+ * @example
+ * // defining a spy from scratch: foo() throws an exception w/ message 'ouch'
+ * var foo = jasmine.createSpy('spy on foo').andThrow('baz');
+ *
+ * // defining a spy on an existing property: foo.bar() throws an exception w/ message 'ouch'
+ * spyOn(foo, 'bar').andThrow('baz');
+ *
+ * @param {String} exceptionMsg
+ */
+jasmine.Spy.prototype.andThrow = function(exceptionMsg) {
+  this.plan = function() {
+    throw exceptionMsg;
+  };
+  return this;
+};
+
+/**
+ * Calls an alternate implementation when a spy is called.
+ *
+ * @example
+ * var baz = function() {
+ *   // do some stuff, return something
+ * }
+ * // defining a spy from scratch: foo() calls the function baz
+ * var foo = jasmine.createSpy('spy on foo').andCall(baz);
+ *
+ * // defining a spy on an existing property: foo.bar() calls an anonymnous function
+ * spyOn(foo, 'bar').andCall(function() { return 'baz';} );
+ *
+ * @param {Function} fakeFunc
+ */
+jasmine.Spy.prototype.andCallFake = function(fakeFunc) {
+  this.plan = fakeFunc;
+  return this;
+};
+
+/**
+ * Resets all of a spy's the tracking variables so that it can be used again.
+ *
+ * @example
+ * spyOn(foo, 'bar');
+ *
+ * foo.bar();
+ *
+ * expect(foo.bar.callCount).toEqual(1);
+ *
+ * foo.bar.reset();
+ *
+ * expect(foo.bar.callCount).toEqual(0);
+ */
+jasmine.Spy.prototype.reset = function() {
+  this.wasCalled = false;
+  this.callCount = 0;
+  this.argsForCall = [];
+  this.calls = [];
+  this.mostRecentCall = {};
+};
+
+jasmine.createSpy = function(name) {
+
+  var spyObj = function() {
+    spyObj.wasCalled = true;
+    spyObj.callCount++;
+    var args = jasmine.util.argsToArray(arguments);
+    spyObj.mostRecentCall.object = this;
+    spyObj.mostRecentCall.args = args;
+    spyObj.argsForCall.push(args);
+    spyObj.calls.push({object: this, args: args});
+    return spyObj.plan.apply(this, arguments);
+  };
+
+  var spy = new jasmine.Spy(name);
+
+  for (var prop in spy) {
+    spyObj[prop] = spy[prop];
+  }
+
+  spyObj.reset();
+
+  return spyObj;
+};
+
+/**
+ * Determines whether an object is a spy.
+ *
+ * @param {jasmine.Spy|Object} putativeSpy
+ * @returns {Boolean}
+ */
+jasmine.isSpy = function(putativeSpy) {
+  return putativeSpy && putativeSpy.isSpy;
+};
+
+/**
+ * Creates a more complicated spy: an Object that has every property a function that is a spy.  Used for stubbing something
+ * large in one call.
+ *
+ * @param {String} baseName name of spy class
+ * @param {Array} methodNames array of names of methods to make spies
+ */
+jasmine.createSpyObj = function(baseName, methodNames) {
+  if (!jasmine.isArray_(methodNames) || methodNames.length === 0) {
+    throw new Error('createSpyObj requires a non-empty array of method names to create spies for');
+  }
+  var obj = {};
+  for (var i = 0; i < methodNames.length; i++) {
+    obj[methodNames[i]] = jasmine.createSpy(baseName + '.' + methodNames[i]);
+  }
+  return obj;
+};
+
+/**
+ * All parameters are pretty-printed and concatenated together, then written to the current spec's output.
+ *
+ * Be careful not to leave calls to <code>jasmine.log</code> in production code.
+ */
+jasmine.log = function() {
+  var spec = jasmine.getEnv().currentSpec;
+  spec.log.apply(spec, arguments);
+};
+
+/**
+ * Function that installs a spy on an existing object's method name.  Used within a Spec to create a spy.
+ *
+ * @example
+ * // spy example
+ * var foo = {
+ *   not: function(bool) { return !bool; }
+ * }
+ * spyOn(foo, 'not'); // actual foo.not will not be called, execution stops
+ *
+ * @see jasmine.createSpy
+ * @param obj
+ * @param methodName
+ * @returns a Jasmine spy that can be chained with all spy methods
+ */
+var spyOn = function(obj, methodName) {
+  return jasmine.getEnv().currentSpec.spyOn(obj, methodName);
+};
+if (isCommonJS) exports.spyOn = spyOn;
+
+/**
+ * Creates a Jasmine spec that will be added to the current suite.
+ *
+ * // TODO: pending tests
+ *
+ * @example
+ * it('should be true', function() {
+ *   expect(true).toEqual(true);
+ * });
+ *
+ * @param {String} desc description of this specification
+ * @param {Function} func defines the preconditions and expectations of the spec
+ */
+var it = function(desc, func) {
+  return jasmine.getEnv().it(desc, func);
+};
+if (isCommonJS) exports.it = it;
+
+/**
+ * Creates a <em>disabled</em> Jasmine spec.
+ *
+ * A convenience method that allows existing specs to be disabled temporarily during development.
+ *
+ * @param {String} desc description of this specification
+ * @param {Function} func defines the preconditions and expectations of the spec
+ */
+var xit = function(desc, func) {
+  return jasmine.getEnv().xit(desc, func);
+};
+if (isCommonJS) exports.xit = xit;
+
+/**
+ * Starts a chain for a Jasmine expectation.
+ *
+ * It is passed an Object that is the actual value and should chain to one of the many
+ * jasmine.Matchers functions.
+ *
+ * @param {Object} actual Actual value to test against and expected value
+ */
+var expect = function(actual) {
+  return jasmine.getEnv().currentSpec.expect(actual);
+};
+if (isCommonJS) exports.expect = expect;
+
+/**
+ * Defines part of a jasmine spec.  Used in cominbination with waits or waitsFor in asynchrnous specs.
+ *
+ * @param {Function} func Function that defines part of a jasmine spec.
+ */
+var runs = function(func) {
+  jasmine.getEnv().currentSpec.runs(func);
+};
+if (isCommonJS) exports.runs = runs;
+
+/**
+ * Waits a fixed time period before moving to the next block.
+ *
+ * @deprecated Use waitsFor() instead
+ * @param {Number} timeout milliseconds to wait
+ */
+var waits = function(timeout) {
+  jasmine.getEnv().currentSpec.waits(timeout);
+};
+if (isCommonJS) exports.waits = waits;
+
+/**
+ * Waits for the latchFunction to return true before proceeding to the next block.
+ *
+ * @param {Function} latchFunction
+ * @param {String} optional_timeoutMessage
+ * @param {Number} optional_timeout
+ */
+var waitsFor = function(latchFunction, optional_timeoutMessage, optional_timeout) {
+  jasmine.getEnv().currentSpec.waitsFor.apply(jasmine.getEnv().currentSpec, arguments);
+};
+if (isCommonJS) exports.waitsFor = waitsFor;
+
+/**
+ * A function that is called before each spec in a suite.
+ *
+ * Used for spec setup, including validating assumptions.
+ *
+ * @param {Function} beforeEachFunction
+ */
+var beforeEach = function(beforeEachFunction) {
+  jasmine.getEnv().beforeEach(beforeEachFunction);
+};
+if (isCommonJS) exports.beforeEach = beforeEach;
+
+/**
+ * A function that is called after each spec in a suite.
+ *
+ * Used for restoring any state that is hijacked during spec execution.
+ *
+ * @param {Function} afterEachFunction
+ */
+var afterEach = function(afterEachFunction) {
+  jasmine.getEnv().afterEach(afterEachFunction);
+};
+if (isCommonJS) exports.afterEach = afterEach;
+
+/**
+ * Defines a suite of specifications.
+ *
+ * Stores the description and all defined specs in the Jasmine environment as one suite of specs. Variables declared
+ * are accessible by calls to beforeEach, it, and afterEach. Describe blocks can be nested, allowing for specialization
+ * of setup in some tests.
+ *
+ * @example
+ * // TODO: a simple suite
+ *
+ * // TODO: a simple suite with a nested describe block
+ *
+ * @param {String} description A string, usually the class under test.
+ * @param {Function} specDefinitions function that defines several specs.
+ */
+var describe = function(description, specDefinitions) {
+  return jasmine.getEnv().describe(description, specDefinitions);
+};
+if (isCommonJS) exports.describe = describe;
+
+/**
+ * Disables a suite of specifications.  Used to disable some suites in a file, or files, temporarily during development.
+ *
+ * @param {String} description A string, usually the class under test.
+ * @param {Function} specDefinitions function that defines several specs.
+ */
+var xdescribe = function(description, specDefinitions) {
+  return jasmine.getEnv().xdescribe(description, specDefinitions);
+};
+if (isCommonJS) exports.xdescribe = xdescribe;
+
+
+// Provide the XMLHttpRequest class for IE 5.x-6.x:
+jasmine.XmlHttpRequest = (typeof XMLHttpRequest == "undefined") ? function() {
+  function tryIt(f) {
+    try {
+      return f();
+    } catch(e) {
+    }
+    return null;
+  }
+
+  var xhr = tryIt(function() {
+    return new ActiveXObject("Msxml2.XMLHTTP.6.0");
+  }) ||
+    tryIt(function() {
+      return new ActiveXObject("Msxml2.XMLHTTP.3.0");
+    }) ||
+    tryIt(function() {
+      return new ActiveXObject("Msxml2.XMLHTTP");
+    }) ||
+    tryIt(function() {
+      return new ActiveXObject("Microsoft.XMLHTTP");
+    });
+
+  if (!xhr) throw new Error("This browser does not support XMLHttpRequest.");
+
+  return xhr;
+} : XMLHttpRequest;
+/**
+ * @namespace
+ */
+jasmine.util = {};
+
+/**
+ * Declare that a child class inherit it's prototype from the parent class.
+ *
+ * @private
+ * @param {Function} childClass
+ * @param {Function} parentClass
+ */
+jasmine.util.inherit = function(childClass, parentClass) {
+  /**
+   * @private
+   */
+  var subclass = function() {
+  };
+  subclass.prototype = parentClass.prototype;
+  childClass.prototype = new subclass();
+};
+
+jasmine.util.formatException = function(e) {
+  var lineNumber;
+  if (e.line) {
+    lineNumber = e.line;
+  }
+  else if (e.lineNumber) {
+    lineNumber = e.lineNumber;
+  }
+
+  var file;
+
+  if (e.sourceURL) {
+    file = e.sourceURL;
+  }
+  else if (e.fileName) {
+    file = e.fileName;
+  }
+
+  var message = (e.name && e.message) ? (e.name + ': ' + e.message) : e.toString();
+
+  if (file && lineNumber) {
+    message += ' in ' + file + ' (line ' + lineNumber + ')';
+  }
+
+  return message;
+};
+
+jasmine.util.htmlEscape = function(str) {
+  if (!str) return str;
+  return str.replace(/&/g, '&amp;')
+    .replace(/</g, '&lt;')
+    .replace(/>/g, '&gt;');
+};
+
+jasmine.util.argsToArray = function(args) {
+  var arrayOfArgs = [];
+  for (var i = 0; i < args.length; i++) arrayOfArgs.push(args[i]);
+  return arrayOfArgs;
+};
+
+jasmine.util.extend = function(destination, source) {
+  for (var property in source) destination[property] = source[property];
+  return destination;
+};
+
+/**
+ * Environment for Jasmine
+ *
+ * @constructor
+ */
+jasmine.Env = function() {
+  this.currentSpec = null;
+  this.currentSuite = null;
+  this.currentRunner_ = new jasmine.Runner(this);
+
+  this.reporter = new jasmine.MultiReporter();
+
+  this.updateInterval = jasmine.DEFAULT_UPDATE_INTERVAL;
+  this.defaultTimeoutInterval = jasmine.DEFAULT_TIMEOUT_INTERVAL;
+  this.lastUpdate = 0;
+  this.specFilter = function() {
+    return true;
+  };
+
+  this.nextSpecId_ = 0;
+  this.nextSuiteId_ = 0;
+  this.equalityTesters_ = [];
+
+  // wrap matchers
+  this.matchersClass = function() {
+    jasmine.Matchers.apply(this, arguments);
+  };
+  jasmine.util.inherit(this.matchersClass, jasmine.Matchers);
+
+  jasmine.Matchers.wrapInto_(jasmine.Matchers.prototype, this.matchersClass);
+};
+
+
+jasmine.Env.prototype.setTimeout = jasmine.setTimeout;
+jasmine.Env.prototype.clearTimeout = jasmine.clearTimeout;
+jasmine.Env.prototype.setInterval = jasmine.setInterval;
+jasmine.Env.prototype.clearInterval = jasmine.clearInterval;
+
+/**
+ * @returns an object containing jasmine version build info, if set.
+ */
+jasmine.Env.prototype.version = function () {
+  if (jasmine.version_) {
+    return jasmine.version_;
+  } else {
+    throw new Error('Version not set');
+  }
+};
+
+/**
+ * @returns string containing jasmine version build info, if set.
+ */
+jasmine.Env.prototype.versionString = function() {
+  if (!jasmine.version_) {
+    return "version unknown";
+  }
+
+  var version = this.version();
+  var versionString = version.major + "." + version.minor + "." + version.build;
+  if (version.release_candidate) {
+    versionString += ".rc" + version.release_candidate;
+  }
+  versionString += " revision " + version.revision;
+  return versionString;
+};
+
+/**
+ * @returns a sequential integer starting at 0
+ */
+jasmine.Env.prototype.nextSpecId = function () {
+  return this.nextSpecId_++;
+};
+
+/**
+ * @returns a sequential integer starting at 0
+ */
+jasmine.Env.prototype.nextSuiteId = function () {
+  return this.nextSuiteId_++;
+};
+
+/**
+ * Register a reporter to receive status updates from Jasmine.
+ * @param {jasmine.Reporter} reporter An object which will receive status updates.
+ */
+jasmine.Env.prototype.addReporter = function(reporter) {
+  this.reporter.addReporter(reporter);
+};
+
+jasmine.Env.prototype.execute = function() {
+  this.currentRunner_.execute();
+};
+
+jasmine.Env.prototype.describe = function(description, specDefinitions) {
+  var suite = new jasmine.Suite(this, description, specDefinitions, this.currentSuite);
+
+  var parentSuite = this.currentSuite;
+  if (parentSuite) {
+    parentSuite.add(suite);
+  } else {
+    this.currentRunner_.add(suite);
+  }
+
+  this.currentSuite = suite;
+
+  var declarationError = null;
+  try {
+    specDefinitions.call(suite);
+  } catch(e) {
+    declarationError = e;
+  }
+
+  if (declarationError) {
+    this.it("encountered a declaration exception", function() {
+      throw declarationError;
+    });
+  }
+
+  this.currentSuite = parentSuite;
+
+  return suite;
+};
+
+jasmine.Env.prototype.beforeEach = function(beforeEachFunction) {
+  if (this.currentSuite) {
+    this.currentSuite.beforeEach(beforeEachFunction);
+  } else {
+    this.currentRunner_.beforeEach(beforeEachFunction);
+  }
+};
+
+jasmine.Env.prototype.currentRunner = function () {
+  return this.currentRunner_;
+};
+
+jasmine.Env.prototype.afterEach = function(afterEachFunction) {
+  if (this.currentSuite) {
+    this.currentSuite.afterEach(afterEachFunction);
+  } else {
+    this.currentRunner_.afterEach(afterEachFunction);
+  }
+
+};
+
+jasmine.Env.prototype.xdescribe = function(desc, specDefinitions) {
+  return {
+    execute: function() {
+    }
+  };
+};
+
+jasmine.Env.prototype.it = function(description, func) {
+  var spec = new jasmine.Spec(this, this.currentSuite, description);
+  this.currentSuite.add(spec);
+  this.currentSpec = spec;
+
+  if (func) {
+    spec.runs(func);
+  }
+
+  return spec;
+};
+
+jasmine.Env.prototype.xit = function(desc, func) {
+  return {
+    id: this.nextSpecId(),
+    runs: function() {
+    }
+  };
+};
+
+jasmine.Env.prototype.compareObjects_ = function(a, b, mismatchKeys, mismatchValues) {
+  if (a.__Jasmine_been_here_before__ === b && b.__Jasmine_been_here_before__ === a) {
+    return true;
+  }
+
+  a.__Jasmine_been_here_before__ = b;
+  b.__Jasmine_been_here_before__ = a;
+
+  var hasKey = function(obj, keyName) {
+    return obj !== null && obj[keyName] !== jasmine.undefined;
+  };
+
+  for (var property in b) {
+    if (!hasKey(a, property) && hasKey(b, property)) {
+      mismatchKeys.push("expected has key '" + property + "', but missing from actual.");
+    }
+  }
+  for (property in a) {
+    if (!hasKey(b, property) && hasKey(a, property)) {
+      mismatchKeys.push("expected missing key '" + property + "', but present in actual.");
+    }
+  }
+  for (property in b) {
+    if (property == '__Jasmine_been_here_before__') continue;
+    if (!this.equals_(a[property], b[property], mismatchKeys, mismatchValues)) {
+      mismatchValues.push("'" + property + "' was '" + (b[property] ? jasmine.util.htmlEscape(b[property].toString()) : b[property]) + "' in expected, but was '" + (a[property] ? jasmine.util.htmlEscape(a[property].toString()) : a[property]) + "' in actual.");
+    }
+  }
+
+  if (jasmine.isArray_(a) && jasmine.isArray_(b) && a.length != b.length) {
+    mismatchValues.push("arrays were not the same length");
+  }
+
+  delete a.__Jasmine_been_here_before__;
+  delete b.__Jasmine_been_here_before__;
+  return (mismatchKeys.length === 0 && mismatchValues.length === 0);
+};
+
+jasmine.Env.prototype.equals_ = function(a, b, mismatchKeys, mismatchValues) {
+  mismatchKeys = mismatchKeys || [];
+  mismatchValues = mismatchValues || [];
+
+  for (var i = 0; i < this.equalityTesters_.length; i++) {
+    var equalityTester = this.equalityTesters_[i];
+    var result = equalityTester(a, b, this, mismatchKeys, mismatchValues);
+    if (result !== jasmine.undefined) return result;
+  }
+
+  if (a === b) return true;
+
+  if (a === jasmine.undefined || a === null || b === jasmine.undefined || b === null) {
+    return (a == jasmine.undefined && b == jasmine.undefined);
+  }
+
+  if (jasmine.isDomNode(a) && jasmine.isDomNode(b)) {
+    return a === b;
+  }
+
+  if (a instanceof Date && b instanceof Date) {
+    return a.getTime() == b.getTime();
+  }
+
+  if (a instanceof jasmine.Matchers.Any) {
+    return a.matches(b);
+  }
+
+  if (b instanceof jasmine.Matchers.Any) {
+    return b.matches(a);
+  }
+
+  if (jasmine.isString_(a) && jasmine.isString_(b)) {
+    return (a == b);
+  }
+
+  if (jasmine.isNumber_(a) && jasmine.isNumber_(b)) {
+    return (a == b);
+  }
+
+  if (typeof a === "object" && typeof b === "object") {
+    return this.compareObjects_(a, b, mismatchKeys, mismatchValues);
+  }
+
+  //Straight check
+  return (a === b);
+};
+
+jasmine.Env.prototype.contains_ = function(haystack, needle) {
+  if (jasmine.isArray_(haystack)) {
+    for (var i = 0; i < haystack.length; i++) {
+      if (this.equals_(haystack[i], needle)) return true;
+    }
+    return false;
+  }
+  return haystack.indexOf(needle) >= 0;
+};
+
+jasmine.Env.prototype.addEqualityTester = function(equalityTester) {
+  this.equalityTesters_.push(equalityTester);
+};
+/** No-op base class for Jasmine reporters.
+ *
+ * @constructor
+ */
+jasmine.Reporter = function() {
+};
+
+//noinspection JSUnusedLocalSymbols
+jasmine.Reporter.prototype.reportRunnerStarting = function(runner) {
+};
+
+//noinspection JSUnusedLocalSymbols
+jasmine.Reporter.prototype.reportRunnerResults = function(runner) {
+};
+
+//noinspection JSUnusedLocalSymbols
+jasmine.Reporter.prototype.reportSuiteResults = function(suite) {
+};
+
+//noinspection JSUnusedLocalSymbols
+jasmine.Reporter.prototype.reportSpecStarting = function(spec) {
+};
+
+//noinspection JSUnusedLocalSymbols
+jasmine.Reporter.prototype.reportSpecResults = function(spec) {
+};
+
+//noinspection JSUnusedLocalSymbols
+jasmine.Reporter.prototype.log = function(str) {
+};
+
+/**
+ * Blocks are functions with executable code that make up a spec.
+ *
+ * @constructor
+ * @param {jasmine.Env} env
+ * @param {Function} func
+ * @param {jasmine.Spec} spec
+ */
+jasmine.Block = function(env, func, spec) {
+  this.env = env;
+  this.func = func;
+  this.spec = spec;
+};
+
+jasmine.Block.prototype.execute = function(onComplete) {  
+  try {
+    this.func.apply(this.spec);
+  } catch (e) {
+    this.spec.fail(e);
+  }
+  onComplete();
+};
+/** JavaScript API reporter.
+ *
+ * @constructor
+ */
+jasmine.JsApiReporter = function() {
+  this.started = false;
+  this.finished = false;
+  this.suites_ = [];
+  this.results_ = {};
+};
+
+jasmine.JsApiReporter.prototype.reportRunnerStarting = function(runner) {
+  this.started = true;
+  var suites = runner.topLevelSuites();
+  for (var i = 0; i < suites.length; i++) {
+    var suite = suites[i];
+    this.suites_.push(this.summarize_(suite));
+  }
+};
+
+jasmine.JsApiReporter.prototype.suites = function() {
+  return this.suites_;
+};
+
+jasmine.JsApiReporter.prototype.summarize_ = function(suiteOrSpec) {
+  var isSuite = suiteOrSpec instanceof jasmine.Suite;
+  var summary = {
+    id: suiteOrSpec.id,
+    name: suiteOrSpec.description,
+    type: isSuite ? 'suite' : 'spec',
+    children: []
+  };
+  
+  if (isSuite) {
+    var children = suiteOrSpec.children();
+    for (var i = 0; i < children.length; i++) {
+      summary.children.push(this.summarize_(children[i]));
+    }
+  }
+  return summary;
+};
+
+jasmine.JsApiReporter.prototype.results = function() {
+  return this.results_;
+};
+
+jasmine.JsApiReporter.prototype.resultsForSpec = function(specId) {
+  return this.results_[specId];
+};
+
+//noinspection JSUnusedLocalSymbols
+jasmine.JsApiReporter.prototype.reportRunnerResults = function(runner) {
+  this.finished = true;
+};
+
+//noinspection JSUnusedLocalSymbols
+jasmine.JsApiReporter.prototype.reportSuiteResults = function(suite) {
+};
+
+//noinspection JSUnusedLocalSymbols
+jasmine.JsApiReporter.prototype.reportSpecResults = function(spec) {
+  this.results_[spec.id] = {
+    messages: spec.results().getItems(),
+    result: spec.results().failedCount > 0 ? "failed" : "passed"
+  };
+};
+
+//noinspection JSUnusedLocalSymbols
+jasmine.JsApiReporter.prototype.log = function(str) {
+};
+
+jasmine.JsApiReporter.prototype.resultsForSpecs = function(specIds){
+  var results = {};
+  for (var i = 0; i < specIds.length; i++) {
+    var specId = specIds[i];
+    results[specId] = this.summarizeResult_(this.results_[specId]);
+  }
+  return results;
+};
+
+jasmine.JsApiReporter.prototype.summarizeResult_ = function(result){
+  var summaryMessages = [];
+  var messagesLength = result.messages.length;
+  for (var messageIndex = 0; messageIndex < messagesLength; messageIndex++) {
+    var resultMessage = result.messages[messageIndex];
+    summaryMessages.push({
+      text: resultMessage.type == 'log' ? resultMessage.toString() : jasmine.undefined,
+      passed: resultMessage.passed ? resultMessage.passed() : true,
+      type: resultMessage.type,
+      message: resultMessage.message,
+      trace: {
+        stack: resultMessage.passed && !resultMessage.passed() ? resultMessage.trace.stack : jasmine.undefined
+      }
+    });
+  }
+
+  return {
+    result : result.result,
+    messages : summaryMessages
+  };
+};
+
+/**
+ * @constructor
+ * @param {jasmine.Env} env
+ * @param actual
+ * @param {jasmine.Spec} spec
+ */
+jasmine.Matchers = function(env, actual, spec, opt_isNot) {
+  this.env = env;
+  this.actual = actual;
+  this.spec = spec;
+  this.isNot = opt_isNot || false;
+  this.reportWasCalled_ = false;
+};
+
+// todo: @deprecated as of Jasmine 0.11, remove soon [xw]
+jasmine.Matchers.pp = function(str) {
+  throw new Error("jasmine.Matchers.pp() is no longer supported, please use jasmine.pp() instead!");
+};
+
+// todo: @deprecated Deprecated as of Jasmine 0.10. Rewrite your custom matchers to return true or false. [xw]
+jasmine.Matchers.prototype.report = function(result, failing_message, details) {
+  throw new Error("As of jasmine 0.11, custom matchers must be implemented differently -- please see jasmine docs");
+};
+
+jasmine.Matchers.wrapInto_ = function(prototype, matchersClass) {
+  for (var methodName in prototype) {
+    if (methodName == 'report') continue;
+    var orig = prototype[methodName];
+    matchersClass.prototype[methodName] = jasmine.Matchers.matcherFn_(methodName, orig);
+  }
+};
+
+jasmine.Matchers.matcherFn_ = function(matcherName, matcherFunction) {
+  return function() {
+    var matcherArgs = jasmine.util.argsToArray(arguments);
+    var result = matcherFunction.apply(this, arguments);
+
+    if (this.isNot) {
+      result = !result;
+    }
+
+    if (this.reportWasCalled_) return result;
+
+    var message;
+    if (!result) {
+      if (this.message) {
+        message = this.message.apply(this, arguments);
+        if (jasmine.isArray_(message)) {
+          message = message[this.isNot ? 1 : 0];
+        }
+      } else {
+        var englishyPredicate = matcherName.replace(/[A-Z]/g, function(s) { return ' ' + s.toLowerCase(); });
+        message = "Expected " + jasmine.pp(this.actual) + (this.isNot ? " not " : " ") + englishyPredicate;
+        if (matcherArgs.length > 0) {
+          for (var i = 0; i < matcherArgs.length; i++) {
+            if (i > 0) message += ",";
+            message += " " + jasmine.pp(matcherArgs[i]);
+          }
+        }
+        message += ".";
+      }
+    }
+    var expectationResult = new jasmine.ExpectationResult({
+      matcherName: matcherName,
+      passed: result,
+      expected: matcherArgs.length > 1 ? matcherArgs : matcherArgs[0],
+      actual: this.actual,
+      message: message
+    });
+    this.spec.addMatcherResult(expectationResult);
+    return jasmine.undefined;
+  };
+};
+
+
+
+
+/**
+ * toBe: compares the actual to the expected using ===
+ * @param expected
+ */
+jasmine.Matchers.prototype.toBe = function(expected) {
+  return this.actual === expected;
+};
+
+/**
+ * toNotBe: compares the actual to the expected using !==
+ * @param expected
+ * @deprecated as of 1.0. Use not.toBe() instead.
+ */
+jasmine.Matchers.prototype.toNotBe = function(expected) {
+  return this.actual !== expected;
+};
+
+/**
+ * toEqual: compares the actual to the expected using common sense equality. Handles Objects, Arrays, etc.
+ *
+ * @param expected
+ */
+jasmine.Matchers.prototype.toEqual = function(expected) {
+  return this.env.equals_(this.actual, expected);
+};
+
+/**
+ * toNotEqual: compares the actual to the expected using the ! of jasmine.Matchers.toEqual
+ * @param expected
+ * @deprecated as of 1.0. Use not.toNotEqual() instead.
+ */
+jasmine.Matchers.prototype.toNotEqual = function(expected) {
+  return !this.env.equals_(this.actual, expected);
+};
+
+/**
+ * Matcher that compares the actual to the expected using a regular expression.  Constructs a RegExp, so takes
+ * a pattern or a String.
+ *
+ * @param expected
+ */
+jasmine.Matchers.prototype.toMatch = function(expected) {
+  return new RegExp(expected).test(this.actual);
+};
+
+/**
+ * Matcher that compares the actual to the expected using the boolean inverse of jasmine.Matchers.toMatch
+ * @param expected
+ * @deprecated as of 1.0. Use not.toMatch() instead.
+ */
+jasmine.Matchers.prototype.toNotMatch = function(expected) {
+  return !(new RegExp(expected).test(this.actual));
+};
+
+/**
+ * Matcher that compares the actual to jasmine.undefined.
+ */
+jasmine.Matchers.prototype.toBeDefined = function() {
+  return (this.actual !== jasmine.undefined);
+};
+
+/**
+ * Matcher that compares the actual to jasmine.undefined.
+ */
+jasmine.Matchers.prototype.toBeUndefined = function() {
+  return (this.actual === jasmine.undefined);
+};
+
+/**
+ * Matcher that compares the actual to null.
+ */
+jasmine.Matchers.prototype.toBeNull = function() {
+  return (this.actual === null);
+};
+
+/**
+ * Matcher that boolean not-nots the actual.
+ */
+jasmine.Matchers.prototype.toBeTruthy = function() {
+  return !!this.actual;
+};
+
+
+/**
+ * Matcher that boolean nots the actual.
+ */
+jasmine.Matchers.prototype.toBeFalsy = function() {
+  return !this.actual;
+};
+
+
+/**
+ * Matcher that checks to see if the actual, a Jasmine spy, was called.
+ */
+jasmine.Matchers.prototype.toHaveBeenCalled = function() {
+  if (arguments.length > 0) {
+    throw new Error('toHaveBeenCalled does not take arguments, use toHaveBeenCalledWith');
+  }
+
+  if (!jasmine.isSpy(this.actual)) {
+    throw new Error('Expected a spy, but got ' + jasmine.pp(this.actual) + '.');
+  }
+
+  this.message = function() {
+    return [
+      "Expected spy " + this.actual.identity + " to have been called.",
+      "Expected spy " + this.actual.identity + " not to have been called."
+    ];
+  };
+
+  return this.actual.wasCalled;
+};
+
+/** @deprecated Use expect(xxx).toHaveBeenCalled() instead */
+jasmine.Matchers.prototype.wasCalled = jasmine.Matchers.prototype.toHaveBeenCalled;
+
+/**
+ * Matcher that checks to see if the actual, a Jasmine spy, was not called.
+ *
+ * @deprecated Use expect(xxx).not.toHaveBeenCalled() instead
+ */
+jasmine.Matchers.prototype.wasNotCalled = function() {
+  if (arguments.length > 0) {
+    throw new Error('wasNotCalled does not take arguments');
+  }
+
+  if (!jasmine.isSpy(this.actual)) {
+    throw new Error('Expected a spy, but got ' + jasmine.pp(this.actual) + '.');
+  }
+
+  this.message = function() {
+    return [
+      "Expected spy " + this.actual.identity + " to not have been called.",
+      "Expected spy " + this.actual.identity + " to have been called."
+    ];
+  };
+
+  return !this.actual.wasCalled;
+};
+
+/**
+ * Matcher that checks to see if the actual, a Jasmine spy, was called with a set of parameters.
+ *
+ * @example
+ *
+ */
+jasmine.Matchers.prototype.toHaveBeenCalledWith = function() {
+  var expectedArgs = jasmine.util.argsToArray(arguments);
+  if (!jasmine.isSpy(this.actual)) {
+    throw new Error('Expected a spy, but got ' + jasmine.pp(this.actual) + '.');
+  }
+  this.message = function() {
+    if (this.actual.callCount === 0) {
+      // todo: what should the failure message for .not.toHaveBeenCalledWith() be? is this right? test better. [xw]
+      return [
+        "Expected spy " + this.actual.identity + " to have been called with " + jasmine.pp(expectedArgs) + " but it was never called.",
+        "Expected spy " + this.actual.identity + " not to have been called with " + jasmine.pp(expectedArgs) + " but it was."
+      ];
+    } else {
+      return [
+        "Expected spy " + this.actual.identity + " to have been called with " + jasmine.pp(expectedArgs) + " but was called with " + jasmine.pp(this.actual.argsForCall),
+        "Expected spy " + this.actual.identity + " not to have been called with " + jasmine.pp(expectedArgs) + " but was called with " + jasmine.pp(this.actual.argsForCall)
+      ];
+    }
+  };
+
+  return this.env.contains_(this.actual.argsForCall, expectedArgs);
+};
+
+/** @deprecated Use expect(xxx).toHaveBeenCalledWith() instead */
+jasmine.Matchers.prototype.wasCalledWith = jasmine.Matchers.prototype.toHaveBeenCalledWith;
+
+/** @deprecated Use expect(xxx).not.toHaveBeenCalledWith() instead */
+jasmine.Matchers.prototype.wasNotCalledWith = function() {
+  var expectedArgs = jasmine.util.argsToArray(arguments);
+  if (!jasmine.isSpy(this.actual)) {
+    throw new Error('Expected a spy, but got ' + jasmine.pp(this.actual) + '.');
+  }
+
+  this.message = function() {
+    return [
+      "Expected spy not to have been called with " + jasmine.pp(expectedArgs) + " but it was",
+      "Expected spy to have been called with " + jasmine.pp(expectedArgs) + " but it was"
+    ];
+  };
+
+  return !this.env.contains_(this.actual.argsForCall, expectedArgs);
+};
+
+/**
+ * Matcher that checks that the expected item is an element in the actual Array.
+ *
+ * @param {Object} expected
+ */
+jasmine.Matchers.prototype.toContain = function(expected) {
+  return this.env.contains_(this.actual, expected);
+};
+
+/**
+ * Matcher that checks that the expected item is NOT an element in the actual Array.
+ *
+ * @param {Object} expected
+ * @deprecated as of 1.0. Use not.toNotContain() instead.
+ */
+jasmine.Matchers.prototype.toNotContain = function(expected) {
+  return !this.env.contains_(this.actual, expected);
+};
+
+jasmine.Matchers.prototype.toBeLessThan = function(expected) {
+  return this.actual < expected;
+};
+
+jasmine.Matchers.prototype.toBeGreaterThan = function(expected) {
+  return this.actual > expected;
+};
+
+/**
+ * Matcher that checks that the expected item is equal to the actual item
+ * up to a given level of decimal precision (default 2).
+ *
+ * @param {Number} expected
+ * @param {Number} precision
+ */
+jasmine.Matchers.prototype.toBeCloseTo = function(expected, precision) {
+  if (!(precision === 0)) {
+    precision = precision || 2;
+  }
+  var multiplier = Math.pow(10, precision);
+  var actual = Math.round(this.actual * multiplier);
+  expected = Math.round(expected * multiplier);
+  return expected == actual;
+};
+
+/**
+ * Matcher that checks that the expected exception was thrown by the actual.
+ *
+ * @param {String} expected
+ */
+jasmine.Matchers.prototype.toThrow = function(expected) {
+  var result = false;
+  var exception;
+  if (typeof this.actual != 'function') {
+    throw new Error('Actual is not a function');
+  }
+  try {
+    this.actual();
+  } catch (e) {
+    exception = e;
+  }
+  if (exception) {
+    result = (expected === jasmine.undefined || this.env.equals_(exception.message || exception, expected.message || expected));
+  }
+
+  var not = this.isNot ? "not " : "";
+
+  this.message = function() {
+    if (exception && (expected === jasmine.undefined || !this.env.equals_(exception.message || exception, expected.message || expected))) {
+      return ["Expected function " + not + "to throw", expected ? expected.message || expected : "an exception", ", but it threw", exception.message || exception].join(' ');
+    } else {
+      return "Expected function to throw an exception.";
+    }
+  };
+
+  return result;
+};
+
+jasmine.Matchers.Any = function(expectedClass) {
+  this.expectedClass = expectedClass;
+};
+
+jasmine.Matchers.Any.prototype.matches = function(other) {
+  if (this.expectedClass == String) {
+    return typeof other == 'string' || other instanceof String;
+  }
+
+  if (this.expectedClass == Number) {
+    return typeof other == 'number' || other instanceof Number;
+  }
+
+  if (this.expectedClass == Function) {
+    return typeof other == 'function' || other instanceof Function;
+  }
+
+  if (this.expectedClass == Object) {
+    return typeof other == 'object';
+  }
+
+  return other instanceof this.expectedClass;
+};
+
+jasmine.Matchers.Any.prototype.toString = function() {
+  return '<jasmine.any(' + this.expectedClass + ')>';
+};
+
+/**
+ * @constructor
+ */
+jasmine.MultiReporter = function() {
+  this.subReporters_ = [];
+};
+jasmine.util.inherit(jasmine.MultiReporter, jasmine.Reporter);
+
+jasmine.MultiReporter.prototype.addReporter = function(reporter) {
+  this.subReporters_.push(reporter);
+};
+
+(function() {
+  var functionNames = [
+    "reportRunnerStarting",
+    "reportRunnerResults",
+    "reportSuiteResults",
+    "reportSpecStarting",
+    "reportSpecResults",
+    "log"
+  ];
+  for (var i = 0; i < functionNames.length; i++) {
+    var functionName = functionNames[i];
+    jasmine.MultiReporter.prototype[functionName] = (function(functionName) {
+      return function() {
+        for (var j = 0; j < this.subReporters_.length; j++) {
+          var subReporter = this.subReporters_[j];
+          if (subReporter[functionName]) {
+            subReporter[functionName].apply(subReporter, arguments);
+          }
+        }
+      };
+    })(functionName);
+  }
+})();
+/**
+ * Holds results for a set of Jasmine spec. Allows for the results array to hold another jasmine.NestedResults
+ *
+ * @constructor
+ */
+jasmine.NestedResults = function() {
+  /**
+   * The total count of results
+   */
+  this.totalCount = 0;
+  /**
+   * Number of passed results
+   */
+  this.passedCount = 0;
+  /**
+   * Number of failed results
+   */
+  this.failedCount = 0;
+  /**
+   * Was this suite/spec skipped?
+   */
+  this.skipped = false;
+  /**
+   * @ignore
+   */
+  this.items_ = [];
+};
+
+/**
+ * Roll up the result counts.
+ *
+ * @param result
+ */
+jasmine.NestedResults.prototype.rollupCounts = function(result) {
+  this.totalCount += result.totalCount;
+  this.passedCount += result.passedCount;
+  this.failedCount += result.failedCount;
+};
+
+/**
+ * Adds a log message.
+ * @param values Array of message parts which will be concatenated later.
+ */
+jasmine.NestedResults.prototype.log = function(values) {
+  this.items_.push(new jasmine.MessageResult(values));
+};
+
+/**
+ * Getter for the results: message & results.
+ */
+jasmine.NestedResults.prototype.getItems = function() {
+  return this.items_;
+};
+
+/**
+ * Adds a result, tracking counts (total, passed, & failed)
+ * @param {jasmine.ExpectationResult|jasmine.NestedResults} result
+ */
+jasmine.NestedResults.prototype.addResult = function(result) {
+  if (result.type != 'log') {
+    if (result.items_) {
+      this.rollupCounts(result);
+    } else {
+      this.totalCount++;
+      if (result.passed()) {
+        this.passedCount++;
+      } else {
+        this.failedCount++;
+      }
+    }
+  }
+  this.items_.push(result);
+};
+
+/**
+ * @returns {Boolean} True if <b>everything</b> below passed
+ */
+jasmine.NestedResults.prototype.passed = function() {
+  return this.passedCount === this.totalCount;
+};
+/**
+ * Base class for pretty printing for expectation results.
+ */
+jasmine.PrettyPrinter = function() {
+  this.ppNestLevel_ = 0;
+};
+
+/**
+ * Formats a value in a nice, human-readable string.
+ *
+ * @param value
+ */
+jasmine.PrettyPrinter.prototype.format = function(value) {
+  if (this.ppNestLevel_ > 40) {
+    throw new Error('jasmine.PrettyPrinter: format() nested too deeply!');
+  }
+
+  this.ppNestLevel_++;
+  try {
+    if (value === jasmine.undefined) {
+      this.emitScalar('undefined');
+    } else if (value === null) {
+      this.emitScalar('null');
+    } else if (value === jasmine.getGlobal()) {
+      this.emitScalar('<global>');
+    } else if (value instanceof jasmine.Matchers.Any) {
+      this.emitScalar(value.toString());
+    } else if (typeof value === 'string') {
+      this.emitString(value);
+    } else if (jasmine.isSpy(value)) {
+      this.emitScalar("spy on " + value.identity);
+    } else if (value instanceof RegExp) {
+      this.emitScalar(value.toString());
+    } else if (typeof value === 'function') {
+      this.emitScalar('Function');
+    } else if (typeof value.nodeType === 'number') {
+      this.emitScalar('HTMLNode');
+    } else if (value instanceof Date) {
+      this.emitScalar('Date(' + value + ')');
+    } else if (value.__Jasmine_been_here_before__) {
+      this.emitScalar('<circular reference: ' + (jasmine.isArray_(value) ? 'Array' : 'Object') + '>');
+    } else if (jasmine.isArray_(value) || typeof value == 'object') {
+      value.__Jasmine_been_here_before__ = true;
+      if (jasmine.isArray_(value)) {
+        this.emitArray(value);
+      } else {
+        this.emitObject(value);
+      }
+      delete value.__Jasmine_been_here_before__;
+    } else {
+      this.emitScalar(value.toString());
+    }
+  } finally {
+    this.ppNestLevel_--;
+  }
+};
+
+jasmine.PrettyPrinter.prototype.iterateObject = function(obj, fn) {
+  for (var property in obj) {
+    if (property == '__Jasmine_been_here_before__') continue;
+    fn(property, obj.__lookupGetter__ ? (obj.__lookupGetter__(property) !== jasmine.undefined && 
+                                         obj.__lookupGetter__(property) !== null) : false);
+  }
+};
+
+jasmine.PrettyPrinter.prototype.emitArray = jasmine.unimplementedMethod_;
+jasmine.PrettyPrinter.prototype.emitObject = jasmine.unimplementedMethod_;
+jasmine.PrettyPrinter.prototype.emitScalar = jasmine.unimplementedMethod_;
+jasmine.PrettyPrinter.prototype.emitString = jasmine.unimplementedMethod_;
+
+jasmine.StringPrettyPrinter = function() {
+  jasmine.PrettyPrinter.call(this);
+
+  this.string = '';
+};
+jasmine.util.inherit(jasmine.StringPrettyPrinter, jasmine.PrettyPrinter);
+
+jasmine.StringPrettyPrinter.prototype.emitScalar = function(value) {
+  this.append(value);
+};
+
+jasmine.StringPrettyPrinter.prototype.emitString = function(value) {
+  this.append("'" + value + "'");
+};
+
+jasmine.StringPrettyPrinter.prototype.emitArray = function(array) {
+  this.append('[ ');
+  for (var i = 0; i < array.length; i++) {
+    if (i > 0) {
+      this.append(', ');
+    }
+    this.format(array[i]);
+  }
+  this.append(' ]');
+};
+
+jasmine.StringPrettyPrinter.prototype.emitObject = function(obj) {
+  var self = this;
+  this.append('{ ');
+  var first = true;
+
+  this.iterateObject(obj, function(property, isGetter) {
+    if (first) {
+      first = false;
+    } else {
+      self.append(', ');
+    }
+
+    self.append(property);
+    self.append(' : ');
+    if (isGetter) {
+      self.append('<getter>');
+    } else {
+      self.format(obj[property]);
+    }
+  });
+
+  this.append(' }');
+};
+
+jasmine.StringPrettyPrinter.prototype.append = function(value) {
+  this.string += value;
+};
+jasmine.Queue = function(env) {
+  this.env = env;
+  this.blocks = [];
+  this.running = false;
+  this.index = 0;
+  this.offset = 0;
+  this.abort = false;
+};
+
+jasmine.Queue.prototype.addBefore = function(block) {
+  this.blocks.unshift(block);
+};
+
+jasmine.Queue.prototype.add = function(block) {
+  this.blocks.push(block);
+};
+
+jasmine.Queue.prototype.insertNext = function(block) {
+  this.blocks.splice((this.index + this.offset + 1), 0, block);
+  this.offset++;
+};
+
+jasmine.Queue.prototype.start = function(onComplete) {
+  this.running = true;
+  this.onComplete = onComplete;
+  this.next_();
+};
+
+jasmine.Queue.prototype.isRunning = function() {
+  return this.running;
+};
+
+jasmine.Queue.LOOP_DONT_RECURSE = true;
+
+jasmine.Queue.prototype.next_ = function() {
+  var self = this;
+  var goAgain = true;
+
+  while (goAgain) {
+    goAgain = false;
+    
+    if (self.index < self.blocks.length && !this.abort) {
+      var calledSynchronously = true;
+      var completedSynchronously = false;
+
+      var onComplete = function () {
+        if (jasmine.Queue.LOOP_DONT_RECURSE && calledSynchronously) {
+          completedSynchronously = true;
+          return;
+        }
+
+        if (self.blocks[self.index].abort) {
+          self.abort = true;
+        }
+
+        self.offset = 0;
+        self.index++;
+
+        var now = new Date().getTime();
+        if (self.env.updateInterval && now - self.env.lastUpdate > self.env.updateInterval) {
+          self.env.lastUpdate = now;
+          self.env.setTimeout(function() {
+            self.next_();
+          }, 0);
+        } else {
+          if (jasmine.Queue.LOOP_DONT_RECURSE && completedSynchronously) {
+            goAgain = true;
+          } else {
+            self.next_();
+          }
+        }
+      };
+      self.blocks[self.index].execute(onComplete);
+
+      calledSynchronously = false;
+      if (completedSynchronously) {
+        onComplete();
+      }
+      
+    } else {
+      self.running = false;
+      if (self.onComplete) {
+        self.onComplete();
+      }
+    }
+  }
+};
+
+jasmine.Queue.prototype.results = function() {
+  var results = new jasmine.NestedResults();
+  for (var i = 0; i < this.blocks.length; i++) {
+    if (this.blocks[i].results) {
+      results.addResult(this.blocks[i].results());
+    }
+  }
+  return results;
+};
+
+
+/**
+ * Runner
+ *
+ * @constructor
+ * @param {jasmine.Env} env
+ */
+jasmine.Runner = function(env) {
+  var self = this;
+  self.env = env;
+  self.queue = new jasmine.Queue(env);
+  self.before_ = [];
+  self.after_ = [];
+  self.suites_ = [];
+};
+
+jasmine.Runner.prototype.execute = function() {
+  var self = this;
+  if (self.env.reporter.reportRunnerStarting) {
+    self.env.reporter.reportRunnerStarting(this);
+  }
+  self.queue.start(function () {
+    self.finishCallback();
+  });
+};
+
+jasmine.Runner.prototype.beforeEach = function(beforeEachFunction) {
+  beforeEachFunction.typeName = 'beforeEach';
+  this.before_.splice(0,0,beforeEachFunction);
+};
+
+jasmine.Runner.prototype.afterEach = function(afterEachFunction) {
+  afterEachFunction.typeName = 'afterEach';
+  this.after_.splice(0,0,afterEachFunction);
+};
+
+
+jasmine.Runner.prototype.finishCallback = function() {
+  this.env.reporter.reportRunnerResults(this);
+};
+
+jasmine.Runner.prototype.addSuite = function(suite) {
+  this.suites_.push(suite);
+};
+
+jasmine.Runner.prototype.add = function(block) {
+  if (block instanceof jasmine.Suite) {
+    this.addSuite(block);
+  }
+  this.queue.add(block);
+};
+
+jasmine.Runner.prototype.specs = function () {
+  var suites = this.suites();
+  var specs = [];
+  for (var i = 0; i < suites.length; i++) {
+    specs = specs.concat(suites[i].specs());
+  }
+  return specs;
+};
+
+jasmine.Runner.prototype.suites = function() {
+  return this.suites_;
+};
+
+jasmine.Runner.prototype.topLevelSuites = function() {
+  var topLevelSuites = [];
+  for (var i = 0; i < this.suites_.length; i++) {
+    if (!this.suites_[i].parentSuite) {
+      topLevelSuites.push(this.suites_[i]);
+    }
+  }
+  return topLevelSuites;
+};
+
+jasmine.Runner.prototype.results = function() {
+  return this.queue.results();
+};
+/**
+ * Internal representation of a Jasmine specification, or test.
+ *
+ * @constructor
+ * @param {jasmine.Env} env
+ * @param {jasmine.Suite} suite
+ * @param {String} description
+ */
+jasmine.Spec = function(env, suite, description) {
+  if (!env) {
+    throw new Error('jasmine.Env() required');
+  }
+  if (!suite) {
+    throw new Error('jasmine.Suite() required');
+  }
+  var spec = this;
+  spec.id = env.nextSpecId ? env.nextSpecId() : null;
+  spec.env = env;
+  spec.suite = suite;
+  spec.description = description;
+  spec.queue = new jasmine.Queue(env);
+
+  spec.afterCallbacks = [];
+  spec.spies_ = [];
+
+  spec.results_ = new jasmine.NestedResults();
+  spec.results_.description = description;
+  spec.matchersClass = null;
+};
+
+jasmine.Spec.prototype.getFullName = function() {
+  return this.suite.getFullName() + ' ' + this.description + '.';
+};
+
+
+jasmine.Spec.prototype.results = function() {
+  return this.results_;
+};
+
+/**
+ * All parameters are pretty-printed and concatenated together, then written to the spec's output.
+ *
+ * Be careful not to leave calls to <code>jasmine.log</code> in production code.
+ */
+jasmine.Spec.prototype.log = function() {
+  return this.results_.log(arguments);
+};
+
+jasmine.Spec.prototype.runs = function (func) {
+  var block = new jasmine.Block(this.env, func, this);
+  this.addToQueue(block);
+  return this;
+};
+
+jasmine.Spec.prototype.addToQueue = function (block) {
+  if (this.queue.isRunning()) {
+    this.queue.insertNext(block);
+  } else {
+    this.queue.add(block);
+  }
+};
+
+/**
+ * @param {jasmine.ExpectationResult} result
+ */
+jasmine.Spec.prototype.addMatcherResult = function(result) {
+  this.results_.addResult(result);
+};
+
+jasmine.Spec.prototype.expect = function(actual) {
+  var positive = new (this.getMatchersClass_())(this.env, actual, this);
+  positive.not = new (this.getMatchersClass_())(this.env, actual, this, true);
+  return positive;
+};
+
+/**
+ * Waits a fixed time period before moving to the next block.
+ *
+ * @deprecated Use waitsFor() instead
+ * @param {Number} timeout milliseconds to wait
+ */
+jasmine.Spec.prototype.waits = function(timeout) {
+  var waitsFunc = new jasmine.WaitsBlock(this.env, timeout, this);
+  this.addToQueue(waitsFunc);
+  return this;
+};
+
+/**
+ * Waits for the latchFunction to return true before proceeding to the next block.
+ *
+ * @param {Function} latchFunction
+ * @param {String} optional_timeoutMessage
+ * @param {Number} optional_timeout
+ */
+jasmine.Spec.prototype.waitsFor = function(latchFunction, optional_timeoutMessage, optional_timeout) {
+  var latchFunction_ = null;
+  var optional_timeoutMessage_ = null;
+  var optional_timeout_ = null;
+
+  for (var i = 0; i < arguments.length; i++) {
+    var arg = arguments[i];
+    switch (typeof arg) {
+      case 'function':
+        latchFunction_ = arg;
+        break;
+      case 'string':
+        optional_timeoutMessage_ = arg;
+        break;
+      case 'number':
+        optional_timeout_ = arg;
+        break;
+    }
+  }
+
+  var waitsForFunc = new jasmine.WaitsForBlock(this.env, optional_timeout_, latchFunction_, optional_timeoutMessage_, this);
+  this.addToQueue(waitsForFunc);
+  return this;
+};
+
+jasmine.Spec.prototype.fail = function (e) {
+  var expectationResult = new jasmine.ExpectationResult({
+    passed: false,
+    message: e ? jasmine.util.formatException(e) : 'Exception',
+    trace: { stack: e.stack }
+  });
+  this.results_.addResult(expectationResult);
+};
+
+jasmine.Spec.prototype.getMatchersClass_ = function() {
+  return this.matchersClass || this.env.matchersClass;
+};
+
+jasmine.Spec.prototype.addMatchers = function(matchersPrototype) {
+  var parent = this.getMatchersClass_();
+  var newMatchersClass = function() {
+    parent.apply(this, arguments);
+  };
+  jasmine.util.inherit(newMatchersClass, parent);
+  jasmine.Matchers.wrapInto_(matchersPrototype, newMatchersClass);
+  this.matchersClass = newMatchersClass;
+};
+
+jasmine.Spec.prototype.finishCallback = function() {
+  this.env.reporter.reportSpecResults(this);
+};
+
+jasmine.Spec.prototype.finish = function(onComplete) {
+  this.removeAllSpies();
+  this.finishCallback();
+  if (onComplete) {
+    onComplete();
+  }
+};
+
+jasmine.Spec.prototype.after = function(doAfter) {
+  if (this.queue.isRunning()) {
+    this.queue.add(new jasmine.Block(this.env, doAfter, this));
+  } else {
+    this.afterCallbacks.unshift(doAfter);
+  }
+};
+
+jasmine.Spec.prototype.execute = function(onComplete) {
+  var spec = this;
+  if (!spec.env.specFilter(spec)) {
+    spec.results_.skipped = true;
+    spec.finish(onComplete);
+    return;
+  }
+
+  this.env.reporter.reportSpecStarting(this);
+
+  spec.env.currentSpec = spec;
+
+  spec.addBeforesAndAftersToQueue();
+
+  spec.queue.start(function () {
+    spec.finish(onComplete);
+  });
+};
+
+jasmine.Spec.prototype.addBeforesAndAftersToQueue = function() {
+  var runner = this.env.currentRunner();
+  var i;
+
+  for (var suite = this.suite; suite; suite = suite.parentSuite) {
+    for (i = 0; i < suite.before_.length; i++) {
+      this.queue.addBefore(new jasmine.Block(this.env, suite.before_[i], this));
+    }
+  }
+  for (i = 0; i < runner.before_.length; i++) {
+    this.queue.addBefore(new jasmine.Block(this.env, runner.before_[i], this));
+  }
+  for (i = 0; i < this.afterCallbacks.length; i++) {
+    this.queue.add(new jasmine.Block(this.env, this.afterCallbacks[i], this));
+  }
+  for (suite = this.suite; suite; suite = suite.parentSuite) {
+    for (i = 0; i < suite.after_.length; i++) {
+      this.queue.add(new jasmine.Block(this.env, suite.after_[i], this));
+    }
+  }
+  for (i = 0; i < runner.after_.length; i++) {
+    this.queue.add(new jasmine.Block(this.env, runner.after_[i], this));
+  }
+};
+
+jasmine.Spec.prototype.explodes = function() {
+  throw 'explodes function should not have been called';
+};
+
+jasmine.Spec.prototype.spyOn = function(obj, methodName, ignoreMethodDoesntExist) {
+  if (obj == jasmine.undefined) {
+    throw "spyOn could not find an object to spy upon for " + methodName + "()";
+  }
+
+  if (!ignoreMethodDoesntExist && obj[methodName] === jasmine.undefined) {
+    throw methodName + '() method does not exist';
+  }
+
+  if (!ignoreMethodDoesntExist && obj[methodName] && obj[methodName].isSpy) {
+    throw new Error(methodName + ' has already been spied upon');
+  }
+
+  var spyObj = jasmine.createSpy(methodName);
+
+  this.spies_.push(spyObj);
+  spyObj.baseObj = obj;
+  spyObj.methodName = methodName;
+  spyObj.originalValue = obj[methodName];
+
+  obj[methodName] = spyObj;
+
+  return spyObj;
+};
+
+jasmine.Spec.prototype.removeAllSpies = function() {
+  for (var i = 0; i < this.spies_.length; i++) {
+    var spy = this.spies_[i];
+    spy.baseObj[spy.methodName] = spy.originalValue;
+  }
+  this.spies_ = [];
+};
+
+/**
+ * Internal representation of a Jasmine suite.
+ *
+ * @constructor
+ * @param {jasmine.Env} env
+ * @param {String} description
+ * @param {Function} specDefinitions
+ * @param {jasmine.Suite} parentSuite
+ */
+jasmine.Suite = function(env, description, specDefinitions, parentSuite) {
+  var self = this;
+  self.id = env.nextSuiteId ? env.nextSuiteId() : null;
+  self.description = description;
+  self.queue = new jasmine.Queue(env);
+  self.parentSuite = parentSuite;
+  self.env = env;
+  self.before_ = [];
+  self.after_ = [];
+  self.children_ = [];
+  self.suites_ = [];
+  self.specs_ = [];
+};
+
+jasmine.Suite.prototype.getFullName = function() {
+  var fullName = this.description;
+  for (var parentSuite = this.parentSuite; parentSuite; parentSuite = parentSuite.parentSuite) {
+    fullName = parentSuite.description + ' ' + fullName;
+  }
+  return fullName;
+};
+
+jasmine.Suite.prototype.finish = function(onComplete) {
+  this.env.reporter.reportSuiteResults(this);
+  this.finished = true;
+  if (typeof(onComplete) == 'function') {
+    onComplete();
+  }
+};
+
+jasmine.Suite.prototype.beforeEach = function(beforeEachFunction) {
+  beforeEachFunction.typeName = 'beforeEach';
+  this.before_.unshift(beforeEachFunction);
+};
+
+jasmine.Suite.prototype.afterEach = function(afterEachFunction) {
+  afterEachFunction.typeName = 'afterEach';
+  this.after_.unshift(afterEachFunction);
+};
+
+jasmine.Suite.prototype.results = function() {
+  return this.queue.results();
+};
+
+jasmine.Suite.prototype.add = function(suiteOrSpec) {
+  this.children_.push(suiteOrSpec);
+  if (suiteOrSpec instanceof jasmine.Suite) {
+    this.suites_.push(suiteOrSpec);
+    this.env.currentRunner().addSuite(suiteOrSpec);
+  } else {
+    this.specs_.push(suiteOrSpec);
+  }
+  this.queue.add(suiteOrSpec);
+};
+
+jasmine.Suite.prototype.specs = function() {
+  return this.specs_;
+};
+
+jasmine.Suite.prototype.suites = function() {
+  return this.suites_;
+};
+
+jasmine.Suite.prototype.children = function() {
+  return this.children_;
+};
+
+jasmine.Suite.prototype.execute = function(onComplete) {
+  var self = this;
+  this.queue.start(function () {
+    self.finish(onComplete);
+  });
+};
+jasmine.WaitsBlock = function(env, timeout, spec) {
+  this.timeout = timeout;
+  jasmine.Block.call(this, env, null, spec);
+};
+
+jasmine.util.inherit(jasmine.WaitsBlock, jasmine.Block);
+
+jasmine.WaitsBlock.prototype.execute = function (onComplete) {
+  if (jasmine.VERBOSE) {
+    this.env.reporter.log('>> Jasmine waiting for ' + this.timeout + ' ms...');
+  }
+  this.env.setTimeout(function () {
+    onComplete();
+  }, this.timeout);
+};
+/**
+ * A block which waits for some condition to become true, with timeout.
+ *
+ * @constructor
+ * @extends jasmine.Block
+ * @param {jasmine.Env} env The Jasmine environment.
+ * @param {Number} timeout The maximum time in milliseconds to wait for the condition to become true.
+ * @param {Function} latchFunction A function which returns true when the desired condition has been met.
+ * @param {String} message The message to display if the desired condition hasn't been met within the given time period.
+ * @param {jasmine.Spec} spec The Jasmine spec.
+ */
+jasmine.WaitsForBlock = function(env, timeout, latchFunction, message, spec) {
+  this.timeout = timeout || env.defaultTimeoutInterval;
+  this.latchFunction = latchFunction;
+  this.message = message;
+  this.totalTimeSpentWaitingForLatch = 0;
+  jasmine.Block.call(this, env, null, spec);
+};
+jasmine.util.inherit(jasmine.WaitsForBlock, jasmine.Block);
+
+jasmine.WaitsForBlock.TIMEOUT_INCREMENT = 10;
+
+jasmine.WaitsForBlock.prototype.execute = function(onComplete) {
+  if (jasmine.VERBOSE) {
+    this.env.reporter.log('>> Jasmine waiting for ' + (this.message || 'something to happen'));
+  }
+  var latchFunctionResult;
+  try {
+    latchFunctionResult = this.latchFunction.apply(this.spec);
+  } catch (e) {
+    this.spec.fail(e);
+    onComplete();
+    return;
+  }
+
+  if (latchFunctionResult) {
+    onComplete();
+  } else if (this.totalTimeSpentWaitingForLatch >= this.timeout) {
+    var message = 'timed out after ' + this.timeout + ' msec waiting for ' + (this.message || 'something to happen');
+    this.spec.fail({
+      name: 'timeout',
+      message: message
+    });
+
+    this.abort = true;
+    onComplete();
+  } else {
+    this.totalTimeSpentWaitingForLatch += jasmine.WaitsForBlock.TIMEOUT_INCREMENT;
+    var self = this;
+    this.env.setTimeout(function() {
+      self.execute(onComplete);
+    }, jasmine.WaitsForBlock.TIMEOUT_INCREMENT);
+  }
+};
+// Mock setTimeout, clearTimeout
+// Contributed by Pivotal Computer Systems, www.pivotalsf.com
+
+jasmine.FakeTimer = function() {
+  this.reset();
+
+  var self = this;
+  self.setTimeout = function(funcToCall, millis) {
+    self.timeoutsMade++;
+    self.scheduleFunction(self.timeoutsMade, funcToCall, millis, false);
+    return self.timeoutsMade;
+  };
+
+  self.setInterval = function(funcToCall, millis) {
+    self.timeoutsMade++;
+    self.scheduleFunction(self.timeoutsMade, funcToCall, millis, true);
+    return self.timeoutsMade;
+  };
+
+  self.clearTimeout = function(timeoutKey) {
+    self.scheduledFunctions[timeoutKey] = jasmine.undefined;
+  };
+
+  self.clearInterval = function(timeoutKey) {
+    self.scheduledFunctions[timeoutKey] = jasmine.undefined;
+  };
+
+};
+
+jasmine.FakeTimer.prototype.reset = function() {
+  this.timeoutsMade = 0;
+  this.scheduledFunctions = {};
+  this.nowMillis = 0;
+};
+
+jasmine.FakeTimer.prototype.tick = function(millis) {
+  var oldMillis = this.nowMillis;
+  var newMillis = oldMillis + millis;
+  this.runFunctionsWithinRange(oldMillis, newMillis);
+  this.nowMillis = newMillis;
+};
+
+jasmine.FakeTimer.prototype.runFunctionsWithinRange = function(oldMillis, nowMillis) {
+  var scheduledFunc;
+  var funcsToRun = [];
+  for (var timeoutKey in this.scheduledFunctions) {
+    scheduledFunc = this.scheduledFunctions[timeoutKey];
+    if (scheduledFunc != jasmine.undefined &&
+        scheduledFunc.runAtMillis >= oldMillis &&
+        scheduledFunc.runAtMillis <= nowMillis) {
+      funcsToRun.push(scheduledFunc);
+      this.scheduledFunctions[timeoutKey] = jasmine.undefined;
+    }
+  }
+
+  if (funcsToRun.length > 0) {
+    funcsToRun.sort(function(a, b) {
+      return a.runAtMillis - b.runAtMillis;
+    });
+    for (var i = 0; i < funcsToRun.length; ++i) {
+      try {
+        var funcToRun = funcsToRun[i];
+        this.nowMillis = funcToRun.runAtMillis;
+        funcToRun.funcToCall();
+        if (funcToRun.recurring) {
+          this.scheduleFunction(funcToRun.timeoutKey,
+              funcToRun.funcToCall,
+              funcToRun.millis,
+              true);
+        }
+      } catch(e) {
+      }
+    }
+    this.runFunctionsWithinRange(oldMillis, nowMillis);
+  }
+};
+
+jasmine.FakeTimer.prototype.scheduleFunction = function(timeoutKey, funcToCall, millis, recurring) {
+  this.scheduledFunctions[timeoutKey] = {
+    runAtMillis: this.nowMillis + millis,
+    funcToCall: funcToCall,
+    recurring: recurring,
+    timeoutKey: timeoutKey,
+    millis: millis
+  };
+};
+
+/**
+ * @namespace
+ */
+jasmine.Clock = {
+  defaultFakeTimer: new jasmine.FakeTimer(),
+
+  reset: function() {
+    jasmine.Clock.assertInstalled();
+    jasmine.Clock.defaultFakeTimer.reset();
+  },
+
+  tick: function(millis) {
+    jasmine.Clock.assertInstalled();
+    jasmine.Clock.defaultFakeTimer.tick(millis);
+  },
+
+  runFunctionsWithinRange: function(oldMillis, nowMillis) {
+    jasmine.Clock.defaultFakeTimer.runFunctionsWithinRange(oldMillis, nowMillis);
+  },
+
+  scheduleFunction: function(timeoutKey, funcToCall, millis, recurring) {
+    jasmine.Clock.defaultFakeTimer.scheduleFunction(timeoutKey, funcToCall, millis, recurring);
+  },
+
+  useMock: function() {
+    if (!jasmine.Clock.isInstalled()) {
+      var spec = jasmine.getEnv().currentSpec;
+      spec.after(jasmine.Clock.uninstallMock);
+
+      jasmine.Clock.installMock();
+    }
+  },
+
+  installMock: function() {
+    jasmine.Clock.installed = jasmine.Clock.defaultFakeTimer;
+  },
+
+  uninstallMock: function() {
+    jasmine.Clock.assertInstalled();
+    jasmine.Clock.installed = jasmine.Clock.real;
+  },
+
+  real: {
+    setTimeout: jasmine.getGlobal().setTimeout,
+    clearTimeout: jasmine.getGlobal().clearTimeout,
+    setInterval: jasmine.getGlobal().setInterval,
+    clearInterval: jasmine.getGlobal().clearInterval
+  },
+
+  assertInstalled: function() {
+    if (!jasmine.Clock.isInstalled()) {
+      throw new Error("Mock clock is not installed, use jasmine.Clock.useMock()");
+    }
+  },
+
+  isInstalled: function() {
+    return jasmine.Clock.installed == jasmine.Clock.defaultFakeTimer;
+  },
+
+  installed: null
+};
+jasmine.Clock.installed = jasmine.Clock.real;
+
+//else for IE support
+jasmine.getGlobal().setTimeout = function(funcToCall, millis) {
+  if (jasmine.Clock.installed.setTimeout.apply) {
+    return jasmine.Clock.installed.setTimeout.apply(this, arguments);
+  } else {
+    return jasmine.Clock.installed.setTimeout(funcToCall, millis);
+  }
+};
+
+jasmine.getGlobal().setInterval = function(funcToCall, millis) {
+  if (jasmine.Clock.installed.setInterval.apply) {
+    return jasmine.Clock.installed.setInterval.apply(this, arguments);
+  } else {
+    return jasmine.Clock.installed.setInterval(funcToCall, millis);
+  }
+};
+
+jasmine.getGlobal().clearTimeout = function(timeoutKey) {
+  if (jasmine.Clock.installed.clearTimeout.apply) {
+    return jasmine.Clock.installed.clearTimeout.apply(this, arguments);
+  } else {
+    return jasmine.Clock.installed.clearTimeout(timeoutKey);
+  }
+};
+
+jasmine.getGlobal().clearInterval = function(timeoutKey) {
+  if (jasmine.Clock.installed.clearTimeout.apply) {
+    return jasmine.Clock.installed.clearInterval.apply(this, arguments);
+  } else {
+    return jasmine.Clock.installed.clearInterval(timeoutKey);
+  }
+};
+
+jasmine.version_= {
+  "major": 1,
+  "minor": 1,
+  "build": 0,
+  "revision": 1315677058
+};
diff --git a/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine_favicon.png b/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine_favicon.png
new file mode 100644
index 0000000..218f3b4
Binary files /dev/null and b/node_modules/mongodb/node_modules/bson/tools/jasmine-1.1.0/jasmine_favicon.png differ
diff --git a/node_modules/mongodb/node_modules/kerberos/README.md b/node_modules/mongodb/node_modules/kerberos/README.md
new file mode 100644
index 0000000..7428b0d
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/README.md
@@ -0,0 +1,4 @@
+kerberos
+========
+
+Kerberos library for node.js
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/binding.gyp b/node_modules/mongodb/node_modules/kerberos/binding.gyp
new file mode 100644
index 0000000..027a70f
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/binding.gyp
@@ -0,0 +1,41 @@
+{
+  'targets': [
+    {
+      'target_name': 'kerberos',      
+      'cflags!': [ '-fno-exceptions' ],
+      'cflags_cc!': [ '-fno-exceptions' ],
+      'conditions': [
+        ['OS=="mac"', {
+          'sources': [ 'lib/kerberos.cc', 'lib/worker.cc', 'lib/kerberosgss.c', 'lib/base64.c', 'lib/kerberos_context.cc' ],
+          'defines': [
+            '__MACOSX_CORE__'
+          ],
+          'xcode_settings': {
+            'GCC_ENABLE_CPP_EXCEPTIONS': 'YES'
+          },
+          "link_settings": {
+            "libraries": [
+              "-lkrb5"
+            ]
+          }
+        }],
+        ['OS=="win"',  {
+          'sources': [ 
+            'lib/win32/kerberos.cc', 
+            'lib/win32/base64.c', 
+            'lib/win32/worker.cc',
+            'lib/win32/kerberos_sspi.c',
+            'lib/win32/wrappers/security_buffer.cc',
+            'lib/win32/wrappers/security_buffer_descriptor.cc',
+            'lib/win32/wrappers/security_context.cc',
+            'lib/win32/wrappers/security_credentials.cc'
+          ],          
+          "link_settings": {
+            "libraries": [
+            ]
+          }
+        }]
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Makefile b/node_modules/mongodb/node_modules/kerberos/build/Makefile
new file mode 100644
index 0000000..8569359
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/build/Makefile
@@ -0,0 +1,355 @@
+# We borrow heavily from the kernel build setup, though we are simpler since
+# we don't have Kconfig tweaking settings on us.
+
+# The implicit make rules have it looking for RCS files, among other things.
+# We instead explicitly write all the rules we care about.
+# It's even quicker (saves ~200ms) to pass -r on the command line.
+MAKEFLAGS=-r
+
+# The source directory tree.
+srcdir := ..
+abs_srcdir := $(abspath $(srcdir))
+
+# The name of the builddir.
+builddir_name ?= .
+
+# The V=1 flag on command line makes us verbosely print command lines.
+ifdef V
+  quiet=
+else
+  quiet=quiet_
+endif
+
+# Specify BUILDTYPE=Release on the command line for a release build.
+BUILDTYPE ?= Release
+
+# Directory all our build output goes into.
+# Note that this must be two directories beneath src/ for unit tests to pass,
+# as they reach into the src/ directory for data with relative paths.
+builddir ?= $(builddir_name)/$(BUILDTYPE)
+abs_builddir := $(abspath $(builddir))
+depsdir := $(builddir)/.deps
+
+# Object output directory.
+obj := $(builddir)/obj
+abs_obj := $(abspath $(obj))
+
+# We build up a list of every single one of the targets so we can slurp in the
+# generated dependency rule Makefiles in one pass.
+all_deps :=
+
+
+
+# C++ apps need to be linked with g++.
+#
+# Note: flock is used to seralize linking. Linking is a memory-intensive
+# process so running parallel links can often lead to thrashing.  To disable
+# the serialization, override LINK via an envrionment variable as follows:
+#
+#   export LINK=g++
+#
+# This will allow make to invoke N linker processes as specified in -jN.
+LINK ?= ./gyp-mac-tool flock $(builddir)/linker.lock $(CXX)
+
+CC.target ?= $(CC)
+CFLAGS.target ?= $(CFLAGS)
+CXX.target ?= $(CXX)
+CXXFLAGS.target ?= $(CXXFLAGS)
+LINK.target ?= $(LINK)
+LDFLAGS.target ?= $(LDFLAGS)
+AR.target ?= $(AR)
+
+# TODO(evan): move all cross-compilation logic to gyp-time so we don't need
+# to replicate this environment fallback in make as well.
+CC.host ?= gcc
+CFLAGS.host ?=
+CXX.host ?= g++
+CXXFLAGS.host ?=
+LINK.host ?= g++
+LDFLAGS.host ?=
+AR.host ?= ar
+
+# Define a dir function that can handle spaces.
+# http://www.gnu.org/software/make/manual/make.html#Syntax-of-Functions
+# "leading spaces cannot appear in the text of the first argument as written.
+# These characters can be put into the argument value by variable substitution."
+empty :=
+space := $(empty) $(empty)
+
+# http://stackoverflow.com/questions/1189781/using-make-dir-or-notdir-on-a-path-with-spaces
+replace_spaces = $(subst $(space),?,$1)
+unreplace_spaces = $(subst ?,$(space),$1)
+dirx = $(call unreplace_spaces,$(dir $(call replace_spaces,$1)))
+
+# Flags to make gcc output dependency info.  Note that you need to be
+# careful here to use the flags that ccache and distcc can understand.
+# We write to a dep file on the side first and then rename at the end
+# so we can't end up with a broken dep file.
+depfile = $(depsdir)/$(call replace_spaces,$@).d
+DEPFLAGS = -MMD -MF $(depfile).raw
+
+# We have to fixup the deps output in a few ways.
+# (1) the file output should mention the proper .o file.
+# ccache or distcc lose the path to the target, so we convert a rule of
+# the form:
+#   foobar.o: DEP1 DEP2
+# into
+#   path/to/foobar.o: DEP1 DEP2
+# (2) we want missing files not to cause us to fail to build.
+# We want to rewrite
+#   foobar.o: DEP1 DEP2 \
+#               DEP3
+# to
+#   DEP1:
+#   DEP2:
+#   DEP3:
+# so if the files are missing, they're just considered phony rules.
+# We have to do some pretty insane escaping to get those backslashes
+# and dollar signs past make, the shell, and sed at the same time.
+# Doesn't work with spaces, but that's fine: .d files have spaces in
+# their names replaced with other characters.
+define fixup_dep
+# The depfile may not exist if the input file didn't have any #includes.
+touch $(depfile).raw
+# Fixup path as in (1).
+sed -e "s|^$(notdir $@)|$@|" $(depfile).raw >> $(depfile)
+# Add extra rules as in (2).
+# We remove slashes and replace spaces with new lines;
+# remove blank lines;
+# delete the first line and append a colon to the remaining lines.
+sed -e 's|\\||' -e 'y| |\n|' $(depfile).raw |\
+  grep -v '^$$'                             |\
+  sed -e 1d -e 's|$$|:|'                     \
+    >> $(depfile)
+rm $(depfile).raw
+endef
+
+# Command definitions:
+# - cmd_foo is the actual command to run;
+# - quiet_cmd_foo is the brief-output summary of the command.
+
+quiet_cmd_cc = CC($(TOOLSET)) $@
+cmd_cc = $(CC.$(TOOLSET)) $(GYP_CFLAGS) $(DEPFLAGS) $(CFLAGS.$(TOOLSET)) -c -o $@ $<
+
+quiet_cmd_cxx = CXX($(TOOLSET)) $@
+cmd_cxx = $(CXX.$(TOOLSET)) $(GYP_CXXFLAGS) $(DEPFLAGS) $(CXXFLAGS.$(TOOLSET)) -c -o $@ $<
+
+quiet_cmd_objc = CXX($(TOOLSET)) $@
+cmd_objc = $(CC.$(TOOLSET)) $(GYP_OBJCFLAGS) $(DEPFLAGS) -c -o $@ $<
+
+quiet_cmd_objcxx = CXX($(TOOLSET)) $@
+cmd_objcxx = $(CXX.$(TOOLSET)) $(GYP_OBJCXXFLAGS) $(DEPFLAGS) -c -o $@ $<
+
+# Commands for precompiled header files.
+quiet_cmd_pch_c = CXX($(TOOLSET)) $@
+cmd_pch_c = $(CC.$(TOOLSET)) $(GYP_PCH_CFLAGS) $(DEPFLAGS) $(CXXFLAGS.$(TOOLSET)) -c -o $@ $<
+quiet_cmd_pch_cc = CXX($(TOOLSET)) $@
+cmd_pch_cc = $(CC.$(TOOLSET)) $(GYP_PCH_CXXFLAGS) $(DEPFLAGS) $(CXXFLAGS.$(TOOLSET)) -c -o $@ $<
+quiet_cmd_pch_m = CXX($(TOOLSET)) $@
+cmd_pch_m = $(CC.$(TOOLSET)) $(GYP_PCH_OBJCFLAGS) $(DEPFLAGS) -c -o $@ $<
+quiet_cmd_pch_mm = CXX($(TOOLSET)) $@
+cmd_pch_mm = $(CC.$(TOOLSET)) $(GYP_PCH_OBJCXXFLAGS) $(DEPFLAGS) -c -o $@ $<
+
+# gyp-mac-tool is written next to the root Makefile by gyp.
+# Use $(4) for the command, since $(2) and $(3) are used as flag by do_cmd
+# already.
+quiet_cmd_mac_tool = MACTOOL $(4) $<
+cmd_mac_tool = ./gyp-mac-tool $(4) $< "$@"
+
+quiet_cmd_mac_package_framework = PACKAGE FRAMEWORK $@
+cmd_mac_package_framework = ./gyp-mac-tool package-framework "$@" $(4)
+
+quiet_cmd_infoplist = INFOPLIST $@
+cmd_infoplist = $(CC.$(TOOLSET)) -E -P -Wno-trigraphs -x c $(INFOPLIST_DEFINES) "$<" -o "$@"
+
+quiet_cmd_touch = TOUCH $@
+cmd_touch = touch $@
+
+quiet_cmd_copy = COPY $@
+# send stderr to /dev/null to ignore messages when linking directories.
+cmd_copy = rm -rf "$@" && cp -af "$<" "$@"
+
+quiet_cmd_alink = LIBTOOL-STATIC $@
+cmd_alink = rm -f $@ && ./gyp-mac-tool filter-libtool libtool $(GYP_LIBTOOLFLAGS) -static -o $@ $(filter %.o,$^)
+
+quiet_cmd_link = LINK($(TOOLSET)) $@
+cmd_link = $(LINK.$(TOOLSET)) $(GYP_LDFLAGS) $(LDFLAGS.$(TOOLSET)) -o "$@" $(LD_INPUTS) $(LIBS)
+
+# TODO(thakis): Find out and document the difference between shared_library and
+# loadable_module on mac.
+quiet_cmd_solink = SOLINK($(TOOLSET)) $@
+cmd_solink = $(LINK.$(TOOLSET)) -shared $(GYP_LDFLAGS) $(LDFLAGS.$(TOOLSET)) -o "$@" $(LD_INPUTS) $(LIBS)
+
+# TODO(thakis): The solink_module rule is likely wrong. Xcode seems to pass
+# -bundle -single_module here (for osmesa.so).
+quiet_cmd_solink_module = SOLINK_MODULE($(TOOLSET)) $@
+cmd_solink_module = $(LINK.$(TOOLSET)) -shared $(GYP_LDFLAGS) $(LDFLAGS.$(TOOLSET)) -o $@ $(filter-out FORCE_DO_CMD, $^) $(LIBS)
+
+
+# Define an escape_quotes function to escape single quotes.
+# This allows us to handle quotes properly as long as we always use
+# use single quotes and escape_quotes.
+escape_quotes = $(subst ','\'',$(1))
+# This comment is here just to include a ' to unconfuse syntax highlighting.
+# Define an escape_vars function to escape '$' variable syntax.
+# This allows us to read/write command lines with shell variables (e.g.
+# $LD_LIBRARY_PATH), without triggering make substitution.
+escape_vars = $(subst $$,$$$$,$(1))
+# Helper that expands to a shell command to echo a string exactly as it is in
+# make. This uses printf instead of echo because printf's behaviour with respect
+# to escape sequences is more portable than echo's across different shells
+# (e.g., dash, bash).
+exact_echo = printf '%s\n' '$(call escape_quotes,$(1))'
+
+# Helper to compare the command we're about to run against the command
+# we logged the last time we ran the command.  Produces an empty
+# string (false) when the commands match.
+# Tricky point: Make has no string-equality test function.
+# The kernel uses the following, but it seems like it would have false
+# positives, where one string reordered its arguments.
+#   arg_check = $(strip $(filter-out $(cmd_$(1)), $(cmd_$@)) \
+#                       $(filter-out $(cmd_$@), $(cmd_$(1))))
+# We instead substitute each for the empty string into the other, and
+# say they're equal if both substitutions produce the empty string.
+# .d files contain ? instead of spaces, take that into account.
+command_changed = $(or $(subst $(cmd_$(1)),,$(cmd_$(call replace_spaces,$@))),\
+                       $(subst $(cmd_$(call replace_spaces,$@)),,$(cmd_$(1))))
+
+# Helper that is non-empty when a prerequisite changes.
+# Normally make does this implicitly, but we force rules to always run
+# so we can check their command lines.
+#   $? -- new prerequisites
+#   $| -- order-only dependencies
+prereq_changed = $(filter-out FORCE_DO_CMD,$(filter-out $|,$?))
+
+# Helper that executes all postbuilds, and deletes the output file when done
+# if any of the postbuilds failed.
+define do_postbuilds
+  @E=0;\
+  for p in $(POSTBUILDS); do\
+    eval $$p;\
+    F=$$?;\
+    if [ $$F -ne 0 ]; then\
+      E=$$F;\
+    fi;\
+  done;\
+  if [ $$E -ne 0 ]; then\
+    rm -rf "$@";\
+    exit $$E;\
+  fi
+endef
+
+# do_cmd: run a command via the above cmd_foo names, if necessary.
+# Should always run for a given target to handle command-line changes.
+# Second argument, if non-zero, makes it do asm/C/C++ dependency munging.
+# Third argument, if non-zero, makes it do POSTBUILDS processing.
+# Note: We intentionally do NOT call dirx for depfile, since it contains ? for
+# spaces already and dirx strips the ? characters.
+define do_cmd
+$(if $(or $(command_changed),$(prereq_changed)),
+  @$(call exact_echo,  $($(quiet)cmd_$(1)))
+  @mkdir -p "$(call dirx,$@)" "$(dir $(depfile))"
+  $(if $(findstring flock,$(word 2,$(cmd_$1))),
+    @$(cmd_$(1))
+    @echo "  $(quiet_cmd_$(1)): Finished",
+    @$(cmd_$(1))
+  )
+  @$(call exact_echo,$(call escape_vars,cmd_$(call replace_spaces,$@) := $(cmd_$(1)))) > $(depfile)
+  @$(if $(2),$(fixup_dep))
+  $(if $(and $(3), $(POSTBUILDS)),
+    $(call do_postbuilds)
+  )
+)
+endef
+
+# Declare the "all" target first so it is the default,
+# even though we don't have the deps yet.
+.PHONY: all
+all:
+
+# make looks for ways to re-generate included makefiles, but in our case, we
+# don't have a direct way. Explicitly telling make that it has nothing to do
+# for them makes it go faster.
+%.d: ;
+
+# Use FORCE_DO_CMD to force a target to run.  Should be coupled with
+# do_cmd.
+.PHONY: FORCE_DO_CMD
+FORCE_DO_CMD:
+
+TOOLSET := target
+# Suffix rules, putting all outputs into $(obj).
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.c FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.cpp FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.cxx FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.m FORCE_DO_CMD
+	@$(call do_cmd,objc,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.mm FORCE_DO_CMD
+	@$(call do_cmd,objcxx,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.S FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(srcdir)/%.s FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+
+# Try building from generated source, too.
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.c FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.cpp FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.cxx FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.m FORCE_DO_CMD
+	@$(call do_cmd,objc,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.mm FORCE_DO_CMD
+	@$(call do_cmd,objcxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.S FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(obj).$(TOOLSET)/%.s FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+
+$(obj).$(TOOLSET)/%.o: $(obj)/%.c FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.cpp FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.cxx FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.m FORCE_DO_CMD
+	@$(call do_cmd,objc,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.mm FORCE_DO_CMD
+	@$(call do_cmd,objcxx,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.S FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+$(obj).$(TOOLSET)/%.o: $(obj)/%.s FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+
+
+ifeq ($(strip $(foreach prefix,$(NO_LOAD),\
+    $(findstring $(join ^,$(prefix)),\
+                 $(join ^,kerberos.target.mk)))),)
+  include kerberos.target.mk
+endif
+
+quiet_cmd_regen_makefile = ACTION Regenerating $@
+cmd_regen_makefile = /usr/local/Cellar/node/0.10.8/lib/node_modules/npm/node_modules/node-gyp/gyp/gyp -fmake --ignore-environment "--toplevel-dir=." -I/Users/gootyfer/Documents/github/moocrank/node_modules/mongodb/node_modules/kerberos/build/config.gypi -I/usr/local/Cellar/node/0.10.8/lib/node_modules/npm/node_modules/node-gyp/addon.gypi -I/Users/gootyfer/.node-gyp/0.10.8/common.gypi "--depth=." "-Goutput_dir=." "--generator-output=build" "-Dlibrary=shared_library" "-Dvisibility=default" "-Dnode_root_dir=/Users/gootyfer/.node-gyp/0.10.8" "-Dmodule_root_dir=/Users/gootyfer/Documents/github/moocrank/node_modules/mongodb/node_modules/kerberos" binding.gyp
+Makefile: $(srcdir)/../../../../../../../.node-gyp/0.10.8/common.gypi $(srcdir)/build/config.gypi $(srcdir)/binding.gyp $(srcdir)/../../../../../../../../../usr/local/Cellar/node/0.10.8/lib/node_modules/npm/node_modules/node-gyp/addon.gypi
+	$(call do_cmd,regen_makefile)
+
+# "all" is a concatenation of the "all" targets from all the included
+# sub-makefiles. This is just here to clarify.
+all:
+
+# Add in dependency-tracking rules.  $(all_deps) is the list of every single
+# target in our tree. Only consider the ones with .d (dependency) info:
+d_files := $(wildcard $(foreach f,$(all_deps),$(depsdir)/$(f).d))
+ifneq ($(d_files),)
+  include $(d_files)
+endif
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/kerberos.node.d b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/kerberos.node.d
new file mode 100644
index 0000000..13950b5
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/kerberos.node.d
@@ -0,0 +1 @@
+cmd_Release/kerberos.node := ./gyp-mac-tool flock ./Release/linker.lock c++ -shared -Wl,-search_paths_first -mmacosx-version-min=10.5 -arch x86_64 -L./Release -install_name @rpath/kerberos.node  -o Release/kerberos.node Release/obj.target/kerberos/lib/kerberos.o Release/obj.target/kerberos/lib/worker.o Release/obj.target/kerberos/lib/kerberosgss.o Release/obj.target/kerberos/lib/base64.o Release/obj.target/kerberos/lib/kerberos_context.o -undefined dynamic_lookup -lkrb5
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/base64.o.d b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/base64.o.d
new file mode 100644
index 0000000..4a91ff6
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/base64.o.d
@@ -0,0 +1,4 @@
+cmd_Release/obj.target/kerberos/lib/base64.o := cc '-D_DARWIN_USE_64_BIT_INODE=1' '-D_LARGEFILE_SOURCE' '-D_FILE_OFFSET_BITS=64' '-D__MACOSX_CORE__' '-DBUILDING_NODE_EXTENSION' -I/Users/gootyfer/.node-gyp/0.10.8/src -I/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include -I/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include  -Os -gdwarf-2 -mmacosx-version-min=10.5 -arch x86_64 -Wall -Wendif-labels -W -Wno-unused-parameter -fno-strict-aliasing -MMD -MF ./Release/.deps/Release/obj.target/kerberos/lib/base64.o.d.raw  -c -o Release/obj.target/kerberos/lib/base64.o ../lib/base64.c
+Release/obj.target/kerberos/lib/base64.o: ../lib/base64.c ../lib/base64.h
+../lib/base64.c:
+../lib/base64.h:
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/kerberos.o.d b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/kerberos.o.d
new file mode 100644
index 0000000..f7ebb00
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/kerberos.o.d
@@ -0,0 +1,24 @@
+cmd_Release/obj.target/kerberos/lib/kerberos.o := c++ '-D_DARWIN_USE_64_BIT_INODE=1' '-D_LARGEFILE_SOURCE' '-D_FILE_OFFSET_BITS=64' '-D__MACOSX_CORE__' '-DBUILDING_NODE_EXTENSION' -I/Users/gootyfer/.node-gyp/0.10.8/src -I/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include -I/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include  -Os -gdwarf-2 -mmacosx-version-min=10.5 -arch x86_64 -Wall -Wendif-labels -W -Wno-unused-parameter -fno-rtti -fno-threadsafe-statics -fno-strict-aliasing -MMD -MF ./Release/.deps/Release/obj.target/kerberos/lib/kerberos.o.d.raw  -c -o Release/obj.target/kerberos/lib/kerberos.o ../lib/kerberos.cc
+Release/obj.target/kerberos/lib/kerberos.o: ../lib/kerberos.cc \
+  ../lib/kerberos.h /Users/gootyfer/.node-gyp/0.10.8/src/node.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-unix.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/ngx-queue.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-darwin.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8stdint.h \
+  /Users/gootyfer/.node-gyp/0.10.8/src/node_object_wrap.h \
+  ../lib/kerberosgss.h ../lib/worker.h ../lib/kerberos_context.h
+../lib/kerberos.cc:
+../lib/kerberos.h:
+/Users/gootyfer/.node-gyp/0.10.8/src/node.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-unix.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/ngx-queue.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-darwin.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8stdint.h:
+/Users/gootyfer/.node-gyp/0.10.8/src/node_object_wrap.h:
+../lib/kerberosgss.h:
+../lib/worker.h:
+../lib/kerberos_context.h:
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/kerberos_context.o.d b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/kerberos_context.o.d
new file mode 100644
index 0000000..7818fca
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/kerberos_context.o.d
@@ -0,0 +1,23 @@
+cmd_Release/obj.target/kerberos/lib/kerberos_context.o := c++ '-D_DARWIN_USE_64_BIT_INODE=1' '-D_LARGEFILE_SOURCE' '-D_FILE_OFFSET_BITS=64' '-D__MACOSX_CORE__' '-DBUILDING_NODE_EXTENSION' -I/Users/gootyfer/.node-gyp/0.10.8/src -I/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include -I/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include  -Os -gdwarf-2 -mmacosx-version-min=10.5 -arch x86_64 -Wall -Wendif-labels -W -Wno-unused-parameter -fno-rtti -fno-threadsafe-statics -fno-strict-aliasing -MMD -MF ./Release/.deps/Release/obj.target/kerberos/lib/kerberos_context.o.d.raw  -c -o Release/obj.target/kerberos/lib/kerberos_context.o ../lib/kerberos_context.cc
+Release/obj.target/kerberos/lib/kerberos_context.o: \
+  ../lib/kerberos_context.cc ../lib/kerberos_context.h \
+  /Users/gootyfer/.node-gyp/0.10.8/src/node.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-unix.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/ngx-queue.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-darwin.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8stdint.h \
+  /Users/gootyfer/.node-gyp/0.10.8/src/node_object_wrap.h \
+  ../lib/kerberosgss.h
+../lib/kerberos_context.cc:
+../lib/kerberos_context.h:
+/Users/gootyfer/.node-gyp/0.10.8/src/node.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-unix.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/ngx-queue.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-darwin.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8stdint.h:
+/Users/gootyfer/.node-gyp/0.10.8/src/node_object_wrap.h:
+../lib/kerberosgss.h:
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/kerberosgss.o.d b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/kerberosgss.o.d
new file mode 100644
index 0000000..647544b
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/kerberosgss.o.d
@@ -0,0 +1,6 @@
+cmd_Release/obj.target/kerberos/lib/kerberosgss.o := cc '-D_DARWIN_USE_64_BIT_INODE=1' '-D_LARGEFILE_SOURCE' '-D_FILE_OFFSET_BITS=64' '-D__MACOSX_CORE__' '-DBUILDING_NODE_EXTENSION' -I/Users/gootyfer/.node-gyp/0.10.8/src -I/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include -I/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include  -Os -gdwarf-2 -mmacosx-version-min=10.5 -arch x86_64 -Wall -Wendif-labels -W -Wno-unused-parameter -fno-strict-aliasing -MMD -MF ./Release/.deps/Release/obj.target/kerberos/lib/kerberosgss.o.d.raw  -c -o Release/obj.target/kerberos/lib/kerberosgss.o ../lib/kerberosgss.c
+Release/obj.target/kerberos/lib/kerberosgss.o: ../lib/kerberosgss.c \
+  ../lib/kerberosgss.h ../lib/base64.h
+../lib/kerberosgss.c:
+../lib/kerberosgss.h:
+../lib/base64.h:
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/worker.o.d b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/worker.o.d
new file mode 100644
index 0000000..7f74254
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/build/Release/.deps/Release/obj.target/kerberos/lib/worker.o.d
@@ -0,0 +1,20 @@
+cmd_Release/obj.target/kerberos/lib/worker.o := c++ '-D_DARWIN_USE_64_BIT_INODE=1' '-D_LARGEFILE_SOURCE' '-D_FILE_OFFSET_BITS=64' '-D__MACOSX_CORE__' '-DBUILDING_NODE_EXTENSION' -I/Users/gootyfer/.node-gyp/0.10.8/src -I/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include -I/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include  -Os -gdwarf-2 -mmacosx-version-min=10.5 -arch x86_64 -Wall -Wendif-labels -W -Wno-unused-parameter -fno-rtti -fno-threadsafe-statics -fno-strict-aliasing -MMD -MF ./Release/.deps/Release/obj.target/kerberos/lib/worker.o.d.raw  -c -o Release/obj.target/kerberos/lib/worker.o ../lib/worker.cc
+Release/obj.target/kerberos/lib/worker.o: ../lib/worker.cc \
+  ../lib/worker.h /Users/gootyfer/.node-gyp/0.10.8/src/node.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-unix.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/ngx-queue.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-darwin.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8.h \
+  /Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8stdint.h \
+  /Users/gootyfer/.node-gyp/0.10.8/src/node_object_wrap.h
+../lib/worker.cc:
+../lib/worker.h:
+/Users/gootyfer/.node-gyp/0.10.8/src/node.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-unix.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/ngx-queue.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include/uv-private/uv-darwin.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8.h:
+/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include/v8stdint.h:
+/Users/gootyfer/.node-gyp/0.10.8/src/node_object_wrap.h:
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/kerberos.node b/node_modules/mongodb/node_modules/kerberos/build/Release/kerberos.node
new file mode 100755
index 0000000..4674287
Binary files /dev/null and b/node_modules/mongodb/node_modules/kerberos/build/Release/kerberos.node differ
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/linker.lock b/node_modules/mongodb/node_modules/kerberos/build/Release/linker.lock
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/base64.o b/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/base64.o
new file mode 100644
index 0000000..a729b2d
Binary files /dev/null and b/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/base64.o differ
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/kerberos.o b/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/kerberos.o
new file mode 100644
index 0000000..2bf73b9
Binary files /dev/null and b/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/kerberos.o differ
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/kerberos_context.o b/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/kerberos_context.o
new file mode 100644
index 0000000..a2710bc
Binary files /dev/null and b/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/kerberos_context.o differ
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/kerberosgss.o b/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/kerberosgss.o
new file mode 100644
index 0000000..041f366
Binary files /dev/null and b/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/kerberosgss.o differ
diff --git a/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/worker.o b/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/worker.o
new file mode 100644
index 0000000..c5c38d6
Binary files /dev/null and b/node_modules/mongodb/node_modules/kerberos/build/Release/obj.target/kerberos/lib/worker.o differ
diff --git a/node_modules/mongodb/node_modules/kerberos/build/binding.Makefile b/node_modules/mongodb/node_modules/kerberos/build/binding.Makefile
new file mode 100644
index 0000000..d0d9c64
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/build/binding.Makefile
@@ -0,0 +1,6 @@
+# This file is generated by gyp; do not edit.
+
+export builddir_name ?= build/./.
+.PHONY: all
+all:
+	$(MAKE) kerberos
diff --git a/node_modules/mongodb/node_modules/kerberos/build/config.gypi b/node_modules/mongodb/node_modules/kerberos/build/config.gypi
new file mode 100644
index 0000000..f950c42
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/build/config.gypi
@@ -0,0 +1,111 @@
+# Do not edit. File was generated by node-gyp's "configure" step
+{
+  "target_defaults": {
+    "cflags": [],
+    "default_configuration": "Release",
+    "defines": [],
+    "include_dirs": [],
+    "libraries": []
+  },
+  "variables": {
+    "clang": 1,
+    "host_arch": "x64",
+    "node_install_npm": "true",
+    "node_prefix": "/usr/local/Cellar/node/0.10.8",
+    "node_shared_cares": "false",
+    "node_shared_http_parser": "false",
+    "node_shared_libuv": "false",
+    "node_shared_openssl": "false",
+    "node_shared_v8": "false",
+    "node_shared_zlib": "false",
+    "node_tag": "",
+    "node_unsafe_optimizations": 0,
+    "node_use_dtrace": "true",
+    "node_use_etw": "false",
+    "node_use_openssl": "true",
+    "node_use_perfctr": "false",
+    "python": "/usr/bin/python",
+    "target_arch": "x64",
+    "v8_enable_gdbjit": 0,
+    "v8_no_strict_aliasing": 1,
+    "v8_use_snapshot": "true",
+    "nodedir": "/Users/gootyfer/.node-gyp/0.10.8",
+    "copy_dev_lib": "true",
+    "standalone_static_library": 1,
+    "save_dev": "",
+    "browser": "",
+    "viewer": "man",
+    "rollback": "true",
+    "usage": "",
+    "globalignorefile": "/usr/local/share/npm/etc/npmignore",
+    "init_author_url": "",
+    "shell": "/bin/bash",
+    "parseable": "",
+    "userignorefile": "/Users/gootyfer/.npmignore",
+    "cache_max": "null",
+    "init_author_email": "",
+    "sign_git_tag": "",
+    "ignore": "",
+    "long": "",
+    "registry": "https://registry.npmjs.org/",
+    "fetch_retries": "2",
+    "npat": "",
+    "message": "%s",
+    "versions": "",
+    "globalconfig": "/usr/local/share/npm/etc/npmrc",
+    "always_auth": "",
+    "cache_lock_retries": "10",
+    "fetch_retry_mintimeout": "10000",
+    "proprietary_attribs": "true",
+    "coverage": "",
+    "json": "",
+    "pre": "",
+    "description": "true",
+    "engine_strict": "",
+    "https_proxy": "",
+    "init_module": "/Users/gootyfer/.npm-init.js",
+    "userconfig": "/Users/gootyfer/.npmrc",
+    "npaturl": "http://npat.npmjs.org/",
+    "node_version": "v0.10.8",
+    "user": "501",
+    "editor": "vi",
+    "save": "",
+    "tag": "latest",
+    "global": "",
+    "optional": "true",
+    "username": "",
+    "bin_links": "true",
+    "force": "",
+    "searchopts": "",
+    "depth": "null",
+    "rebuild_bundle": "true",
+    "searchsort": "name",
+    "unicode": "true",
+    "yes": "",
+    "fetch_retry_maxtimeout": "60000",
+    "strict_ssl": "true",
+    "dev": "",
+    "fetch_retry_factor": "10",
+    "group": "20",
+    "cache_lock_stale": "60000",
+    "version": "",
+    "cache_min": "10",
+    "cache": "/Users/gootyfer/.npm",
+    "searchexclude": "",
+    "color": "true",
+    "save_optional": "",
+    "user_agent": "node/v0.10.8 darwin x64",
+    "cache_lock_wait": "10000",
+    "production": "",
+    "save_bundle": "",
+    "init_version": "0.0.0",
+    "umask": "18",
+    "git": "git",
+    "init_author_name": "",
+    "onload_script": "",
+    "tmp": "/var/folders/v1/5nckjtlj63ddnl8s01cwl8pr0000gn/T/",
+    "unsafe_perm": "true",
+    "prefix": "/usr/local/share/npm",
+    "link": ""
+  }
+}
diff --git a/node_modules/mongodb/node_modules/kerberos/build/gyp-mac-tool b/node_modules/mongodb/node_modules/kerberos/build/gyp-mac-tool
new file mode 100755
index 0000000..bf059c3
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/build/gyp-mac-tool
@@ -0,0 +1,211 @@
+#!/usr/bin/env python
+# Generated by gyp. Do not edit.
+# Copyright (c) 2012 Google Inc. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+"""Utility functions to perform Xcode-style build steps.
+
+These functions are executed via gyp-mac-tool when using the Makefile generator.
+"""
+
+import fcntl
+import os
+import plistlib
+import re
+import shutil
+import string
+import subprocess
+import sys
+
+
+def main(args):
+  executor = MacTool()
+  exit_code = executor.Dispatch(args)
+  if exit_code is not None:
+    sys.exit(exit_code)
+
+
+class MacTool(object):
+  """This class performs all the Mac tooling steps. The methods can either be
+  executed directly, or dispatched from an argument list."""
+
+  def Dispatch(self, args):
+    """Dispatches a string command to a method."""
+    if len(args) < 1:
+      raise Exception("Not enough arguments")
+
+    method = "Exec%s" % self._CommandifyName(args[0])
+    return getattr(self, method)(*args[1:])
+
+  def _CommandifyName(self, name_string):
+    """Transforms a tool name like copy-info-plist to CopyInfoPlist"""
+    return name_string.title().replace('-', '')
+
+  def ExecCopyBundleResource(self, source, dest):
+    """Copies a resource file to the bundle/Resources directory, performing any
+    necessary compilation on each resource."""
+    extension = os.path.splitext(source)[1].lower()
+    if os.path.isdir(source):
+      # Copy tree.
+      if os.path.exists(dest):
+        shutil.rmtree(dest)
+      shutil.copytree(source, dest)
+    elif extension == '.xib':
+      return self._CopyXIBFile(source, dest)
+    elif extension == '.strings':
+      self._CopyStringsFile(source, dest)
+    else:
+      shutil.copyfile(source, dest)
+
+  def _CopyXIBFile(self, source, dest):
+    """Compiles a XIB file with ibtool into a binary plist in the bundle."""
+    tools_dir = os.environ.get('DEVELOPER_BIN_DIR', '/usr/bin')
+    args = [os.path.join(tools_dir, 'ibtool'), '--errors', '--warnings',
+        '--notices', '--output-format', 'human-readable-text', '--compile',
+        dest, source]
+    ibtool_section_re = re.compile(r'/\*.*\*/')
+    ibtool_re = re.compile(r'.*note:.*is clipping its content')
+    ibtoolout = subprocess.Popen(args, stdout=subprocess.PIPE)
+    current_section_header = None
+    for line in ibtoolout.stdout:
+      if ibtool_section_re.match(line):
+        current_section_header = line
+      elif not ibtool_re.match(line):
+        if current_section_header:
+          sys.stdout.write(current_section_header)
+          current_section_header = None
+        sys.stdout.write(line)
+    return ibtoolout.returncode
+
+  def _CopyStringsFile(self, source, dest):
+    """Copies a .strings file using iconv to reconvert the input into UTF-16."""
+    input_code = self._DetectInputEncoding(source) or "UTF-8"
+    fp = open(dest, 'w')
+    args = ['/usr/bin/iconv', '--from-code', input_code, '--to-code',
+        'UTF-16', source]
+    subprocess.call(args, stdout=fp)
+    fp.close()
+
+  def _DetectInputEncoding(self, file_name):
+    """Reads the first few bytes from file_name and tries to guess the text
+    encoding. Returns None as a guess if it can't detect it."""
+    fp = open(file_name, 'rb')
+    try:
+      header = fp.read(3)
+    except e:
+      fp.close()
+      return None
+    fp.close()
+    if header.startswith("\xFE\xFF"):
+      return "UTF-16BE"
+    elif header.startswith("\xFF\xFE"):
+      return "UTF-16LE"
+    elif header.startswith("\xEF\xBB\xBF"):
+      return "UTF-8"
+    else:
+      return None
+
+  def ExecCopyInfoPlist(self, source, dest):
+    """Copies the |source| Info.plist to the destination directory |dest|."""
+    # Read the source Info.plist into memory.
+    fd = open(source, 'r')
+    lines = fd.read()
+    fd.close()
+
+    # Go through all the environment variables and replace them as variables in
+    # the file.
+    for key in os.environ:
+      if key.startswith('_'):
+        continue
+      evar = '${%s}' % key
+      lines = string.replace(lines, evar, os.environ[key])
+
+    # Write out the file with variables replaced.
+    fd = open(dest, 'w')
+    fd.write(lines)
+    fd.close()
+
+    # Now write out PkgInfo file now that the Info.plist file has been
+    # "compiled".
+    self._WritePkgInfo(dest)
+
+  def _WritePkgInfo(self, info_plist):
+    """This writes the PkgInfo file from the data stored in Info.plist."""
+    plist = plistlib.readPlist(info_plist)
+    if not plist:
+      return
+
+    # Only create PkgInfo for executable types.
+    package_type = plist['CFBundlePackageType']
+    if package_type != 'APPL':
+      return
+
+    # The format of PkgInfo is eight characters, representing the bundle type
+    # and bundle signature, each four characters. If that is missing, four
+    # '?' characters are used instead.
+    signature_code = plist.get('CFBundleSignature', '????')
+    if len(signature_code) != 4:  # Wrong length resets everything, too.
+      signature_code = '?' * 4
+
+    dest = os.path.join(os.path.dirname(info_plist), 'PkgInfo')
+    fp = open(dest, 'w')
+    fp.write('%s%s' % (package_type, signature_code))
+    fp.close()
+
+  def ExecFlock(self, lockfile, *cmd_list):
+    """Emulates the most basic behavior of Linux's flock(1)."""
+    # Rely on exception handling to report errors.
+    fd = os.open(lockfile, os.O_RDONLY|os.O_NOCTTY|os.O_CREAT, 0o666)
+    fcntl.flock(fd, fcntl.LOCK_EX)
+    return subprocess.call(cmd_list)
+
+  def ExecFilterLibtool(self, *cmd_list):
+    """Calls libtool and filters out 'libtool: file: foo.o has no symbols'."""
+    libtool_re = re.compile(r'^libtool: file: .* has no symbols$')
+    libtoolout = subprocess.Popen(cmd_list, stderr=subprocess.PIPE)
+    _, err = libtoolout.communicate()
+    for line in err.splitlines():
+      if not libtool_re.match(line):
+        print >>sys.stderr, line
+    return libtoolout.returncode
+
+  def ExecPackageFramework(self, framework, version):
+    """Takes a path to Something.framework and the Current version of that and
+    sets up all the symlinks."""
+    # Find the name of the binary based on the part before the ".framework".
+    binary = os.path.basename(framework).split('.')[0]
+
+    CURRENT = 'Current'
+    RESOURCES = 'Resources'
+    VERSIONS = 'Versions'
+
+    if not os.path.exists(os.path.join(framework, VERSIONS, version, binary)):
+      # Binary-less frameworks don't seem to contain symlinks (see e.g.
+      # chromium's out/Debug/org.chromium.Chromium.manifest/ bundle).
+      return
+
+    # Move into the framework directory to set the symlinks correctly.
+    pwd = os.getcwd()
+    os.chdir(framework)
+
+    # Set up the Current version.
+    self._Relink(version, os.path.join(VERSIONS, CURRENT))
+
+    # Set up the root symlinks.
+    self._Relink(os.path.join(VERSIONS, CURRENT, binary), binary)
+    self._Relink(os.path.join(VERSIONS, CURRENT, RESOURCES), RESOURCES)
+
+    # Back to where we were before!
+    os.chdir(pwd)
+
+  def _Relink(self, dest, link):
+    """Creates a symlink to |dest| named |link|. If |link| already exists,
+    it is overwritten."""
+    if os.path.lexists(link):
+      os.remove(link)
+    os.symlink(dest, link)
+
+
+if __name__ == '__main__':
+  sys.exit(main(sys.argv[1:]))
diff --git a/node_modules/mongodb/node_modules/kerberos/build/kerberos.target.mk b/node_modules/mongodb/node_modules/kerberos/build/kerberos.target.mk
new file mode 100644
index 0000000..0ff0832
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/build/kerberos.target.mk
@@ -0,0 +1,170 @@
+# This file is generated by gyp; do not edit.
+
+TOOLSET := target
+TARGET := kerberos
+DEFS_Debug := \
+	'-D_DARWIN_USE_64_BIT_INODE=1' \
+	'-D_LARGEFILE_SOURCE' \
+	'-D_FILE_OFFSET_BITS=64' \
+	'-D__MACOSX_CORE__' \
+	'-DBUILDING_NODE_EXTENSION' \
+	'-DDEBUG' \
+	'-D_DEBUG'
+
+# Flags passed to all source files.
+CFLAGS_Debug := \
+	-O0 \
+	-gdwarf-2 \
+	-mmacosx-version-min=10.5 \
+	-arch x86_64 \
+	-Wall \
+	-Wendif-labels \
+	-W \
+	-Wno-unused-parameter
+
+# Flags passed to only C files.
+CFLAGS_C_Debug := \
+	-fno-strict-aliasing
+
+# Flags passed to only C++ files.
+CFLAGS_CC_Debug := \
+	-fno-rtti \
+	-fno-threadsafe-statics \
+	-fno-strict-aliasing
+
+# Flags passed to only ObjC files.
+CFLAGS_OBJC_Debug :=
+
+# Flags passed to only ObjC++ files.
+CFLAGS_OBJCC_Debug :=
+
+INCS_Debug := \
+	-I/Users/gootyfer/.node-gyp/0.10.8/src \
+	-I/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include \
+	-I/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include
+
+DEFS_Release := \
+	'-D_DARWIN_USE_64_BIT_INODE=1' \
+	'-D_LARGEFILE_SOURCE' \
+	'-D_FILE_OFFSET_BITS=64' \
+	'-D__MACOSX_CORE__' \
+	'-DBUILDING_NODE_EXTENSION'
+
+# Flags passed to all source files.
+CFLAGS_Release := \
+	-Os \
+	-gdwarf-2 \
+	-mmacosx-version-min=10.5 \
+	-arch x86_64 \
+	-Wall \
+	-Wendif-labels \
+	-W \
+	-Wno-unused-parameter
+
+# Flags passed to only C files.
+CFLAGS_C_Release := \
+	-fno-strict-aliasing
+
+# Flags passed to only C++ files.
+CFLAGS_CC_Release := \
+	-fno-rtti \
+	-fno-threadsafe-statics \
+	-fno-strict-aliasing
+
+# Flags passed to only ObjC files.
+CFLAGS_OBJC_Release :=
+
+# Flags passed to only ObjC++ files.
+CFLAGS_OBJCC_Release :=
+
+INCS_Release := \
+	-I/Users/gootyfer/.node-gyp/0.10.8/src \
+	-I/Users/gootyfer/.node-gyp/0.10.8/deps/uv/include \
+	-I/Users/gootyfer/.node-gyp/0.10.8/deps/v8/include
+
+OBJS := \
+	$(obj).target/$(TARGET)/lib/kerberos.o \
+	$(obj).target/$(TARGET)/lib/worker.o \
+	$(obj).target/$(TARGET)/lib/kerberosgss.o \
+	$(obj).target/$(TARGET)/lib/base64.o \
+	$(obj).target/$(TARGET)/lib/kerberos_context.o
+
+# Add to the list of files we specially track dependencies for.
+all_deps += $(OBJS)
+
+# CFLAGS et al overrides must be target-local.
+# See "Target-specific Variable Values" in the GNU Make manual.
+$(OBJS): TOOLSET := $(TOOLSET)
+$(OBJS): GYP_CFLAGS := $(DEFS_$(BUILDTYPE)) $(INCS_$(BUILDTYPE))  $(CFLAGS_$(BUILDTYPE)) $(CFLAGS_C_$(BUILDTYPE))
+$(OBJS): GYP_CXXFLAGS := $(DEFS_$(BUILDTYPE)) $(INCS_$(BUILDTYPE))  $(CFLAGS_$(BUILDTYPE)) $(CFLAGS_CC_$(BUILDTYPE))
+$(OBJS): GYP_OBJCFLAGS := $(DEFS_$(BUILDTYPE)) $(INCS_$(BUILDTYPE))  $(CFLAGS_$(BUILDTYPE)) $(CFLAGS_C_$(BUILDTYPE)) $(CFLAGS_OBJC_$(BUILDTYPE))
+$(OBJS): GYP_OBJCXXFLAGS := $(DEFS_$(BUILDTYPE)) $(INCS_$(BUILDTYPE))  $(CFLAGS_$(BUILDTYPE)) $(CFLAGS_CC_$(BUILDTYPE)) $(CFLAGS_OBJCC_$(BUILDTYPE))
+
+# Suffix rules, putting all outputs into $(obj).
+
+$(obj).$(TOOLSET)/$(TARGET)/%.o: $(srcdir)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+
+$(obj).$(TOOLSET)/$(TARGET)/%.o: $(srcdir)/%.c FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+
+# Try building from generated source, too.
+
+$(obj).$(TOOLSET)/$(TARGET)/%.o: $(obj).$(TOOLSET)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+
+$(obj).$(TOOLSET)/$(TARGET)/%.o: $(obj).$(TOOLSET)/%.c FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+
+$(obj).$(TOOLSET)/$(TARGET)/%.o: $(obj)/%.cc FORCE_DO_CMD
+	@$(call do_cmd,cxx,1)
+
+$(obj).$(TOOLSET)/$(TARGET)/%.o: $(obj)/%.c FORCE_DO_CMD
+	@$(call do_cmd,cc,1)
+
+# End of this set of suffix rules
+### Rules for final target.
+LDFLAGS_Debug := \
+	-Wl,-search_paths_first \
+	-mmacosx-version-min=10.5 \
+	-arch x86_64 \
+	-L$(builddir) \
+	-install_name @rpath/kerberos.node
+
+LIBTOOLFLAGS_Debug := \
+	-Wl,-search_paths_first
+
+LDFLAGS_Release := \
+	-Wl,-search_paths_first \
+	-mmacosx-version-min=10.5 \
+	-arch x86_64 \
+	-L$(builddir) \
+	-install_name @rpath/kerberos.node
+
+LIBTOOLFLAGS_Release := \
+	-Wl,-search_paths_first
+
+LIBS := \
+	-undefined dynamic_lookup \
+	-lkrb5
+
+$(builddir)/kerberos.node: GYP_LDFLAGS := $(LDFLAGS_$(BUILDTYPE))
+$(builddir)/kerberos.node: LIBS := $(LIBS)
+$(builddir)/kerberos.node: GYP_LIBTOOLFLAGS := $(LIBTOOLFLAGS_$(BUILDTYPE))
+$(builddir)/kerberos.node: TOOLSET := $(TOOLSET)
+$(builddir)/kerberos.node: $(OBJS) FORCE_DO_CMD
+	$(call do_cmd,solink_module)
+
+all_deps += $(builddir)/kerberos.node
+# Add target alias
+.PHONY: kerberos
+kerberos: $(builddir)/kerberos.node
+
+# Short alias for building this executable.
+.PHONY: kerberos.node
+kerberos.node: $(builddir)/kerberos.node
+
+# Add executable to "all" target.
+.PHONY: all
+all: $(builddir)/kerberos.node
+
diff --git a/node_modules/mongodb/node_modules/kerberos/builderror.log b/node_modules/mongodb/node_modules/kerberos/builderror.log
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mongodb/node_modules/kerberos/index.js b/node_modules/mongodb/node_modules/kerberos/index.js
new file mode 100644
index 0000000..b8c8532
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/index.js
@@ -0,0 +1,6 @@
+// Get the Kerberos library
+module.exports = require('./lib/kerberos');
+// Set up the auth processes
+module.exports['processes'] = {
+  MongoAuthProcess: require('./lib/auth_processes/mongodb').MongoAuthProcess
+}
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/auth_processes/mongodb.js b/node_modules/mongodb/node_modules/kerberos/lib/auth_processes/mongodb.js
new file mode 100644
index 0000000..afc30b7
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/auth_processes/mongodb.js
@@ -0,0 +1,278 @@
+var format = require('util').format;
+
+var MongoAuthProcess = function(host, port) {  
+  // Check what system we are on
+  if(process.platform == 'win32') {
+    this._processor = new Win32MongoProcessor(host, port);
+  } else {
+    this._processor = new UnixMongoProcessor(host, port);
+  }
+}
+
+MongoAuthProcess.prototype.init = function(username, password, callback) {
+  this._processor.init(username, password, callback);
+}
+
+MongoAuthProcess.prototype.transition = function(payload, callback) {
+  this._processor.transition(payload, callback);
+}
+
+/*******************************************************************
+ *
+ * Win32 SSIP Processor for MongoDB
+ *
+ *******************************************************************/
+var Win32MongoProcessor = function(host, port) {
+  this.host = host;
+  this.port = port  
+  // SSIP classes
+  this.ssip = require("../kerberos").SSIP;
+  // Set up first transition
+  this._transition = Win32MongoProcessor.first_transition(this);
+  // Set up target
+  this.target = format("mongodb/%s", host);
+  // Number of retries
+  this.retries = 10;
+}
+
+Win32MongoProcessor.prototype.init = function(username, password, callback) {
+  var self = this;
+  // Save the values used later
+  this.username = username;
+  this.password = password;
+  // Aquire credentials
+  this.ssip.SecurityCredentials.aquire_kerberos(username, password, function(err, security_credentials) {
+    if(err) return callback(err);
+    // Save credentials
+    self.security_credentials = security_credentials;
+    // Callback with success
+    callback(null);
+  });
+}
+
+Win32MongoProcessor.prototype.transition = function(payload, callback) {
+  if(this._transition == null) return callback(new Error("Transition finished"));
+  this._transition(payload, callback);
+}
+
+Win32MongoProcessor.first_transition = function(self) {
+  return function(payload, callback) {    
+    self.ssip.SecurityContext.initialize(
+      self.security_credentials, 
+      self.target, 
+      payload, function(err, security_context) {   
+        if(err) return callback(err);
+        
+        // If no context try again until we have no more retries
+        if(!security_context.hasContext) {
+          if(self.retries == 0) return callback(new Error("Failed to initialize security context"));
+          // Update the number of retries
+          self.retries = self.retries - 1;
+          // Set next transition
+          return self.transition(payload, callback);
+        }
+
+        // Set next transition
+        self._transition = Win32MongoProcessor.second_transition(self);
+        self.security_context = security_context;
+        // Return the payload
+        callback(null, security_context.payload);
+    });
+  }
+}
+
+Win32MongoProcessor.second_transition = function(self) {
+  return function(payload, callback) {    
+    // Perform a step
+    self.security_context.initialize(self.target, payload, function(err, security_context) {
+      if(err) return callback(err);
+
+      // If no context try again until we have no more retries
+      if(!security_context.hasContext) {
+        if(self.retries == 0) return callback(new Error("Failed to initialize security context"));
+        // Update the number of retries
+        self.retries = self.retries - 1;
+        // Set next transition
+        self._transition = Win32MongoProcessor.first_transition(self);
+        // Retry
+        return self.transition(payload, callback);
+      }
+
+      // Set next transition
+      self._transition = Win32MongoProcessor.third_transition(self);
+      // Return the payload
+      callback(null, security_context.payload);
+    });
+  }  
+}
+
+Win32MongoProcessor.third_transition = function(self) {
+  return function(payload, callback) {   
+    var messageLength = 0;
+    // Get the raw bytes
+    var encryptedBytes = new Buffer(payload, 'base64');
+    var encryptedMessage = new Buffer(messageLength);
+    // Copy first byte
+    encryptedBytes.copy(encryptedMessage, 0, 0, messageLength);
+    // Set up trailer
+    var securityTrailerLength = encryptedBytes.length - messageLength;
+    var securityTrailer = new Buffer(securityTrailerLength);
+    // Copy the bytes
+    encryptedBytes.copy(securityTrailer, 0, messageLength, securityTrailerLength);
+
+    // Types used
+    var SecurityBuffer = self.ssip.SecurityBuffer;
+    var SecurityBufferDescriptor = self.ssip.SecurityBufferDescriptor;
+
+    // Set up security buffers
+    var buffers = [
+        new SecurityBuffer(SecurityBuffer.DATA, encryptedBytes)
+      , new SecurityBuffer(SecurityBuffer.STREAM, securityTrailer)
+    ];
+
+    // Set up the descriptor
+    var descriptor = new SecurityBufferDescriptor(buffers);
+
+    // Decrypt the data
+    self.security_context.decryptMessage(descriptor, function(err, security_context) {
+      if(err) return callback(err);
+
+      var length = 4;
+      if(self.username != null) {
+        length += self.username.length;          
+      }
+
+      var bytesReceivedFromServer = new Buffer(length);
+      bytesReceivedFromServer[0] = 0x01;  // NO_PROTECTION
+      bytesReceivedFromServer[1] = 0x00;  // NO_PROTECTION
+      bytesReceivedFromServer[2] = 0x00;  // NO_PROTECTION
+      bytesReceivedFromServer[3] = 0x00;  // NO_PROTECTION        
+
+      if(self.username != null) {
+        var authorization_id_bytes = new Buffer(self.username, 'utf8');
+        authorization_id_bytes.copy(bytesReceivedFromServer, 4, 0);
+      }
+
+      self.security_context.queryContextAttributes(0x00, function(err, sizes) {
+        if(err) return callback(err);
+
+        var buffers = [
+            new SecurityBuffer(SecurityBuffer.TOKEN, new Buffer(sizes.securityTrailer))
+          , new SecurityBuffer(SecurityBuffer.DATA, bytesReceivedFromServer)
+          , new SecurityBuffer(SecurityBuffer.PADDING, new Buffer(sizes.blockSize))
+        ]
+
+        var descriptor = new SecurityBufferDescriptor(buffers);
+
+        self.security_context.encryptMessage(descriptor, 0x80000001, function(err, security_context) {
+          if(err) return callback(err);
+          callback(null, security_context.payload);
+        });
+      });
+    });
+  }  
+}
+
+/*******************************************************************
+ *
+ * UNIX MIT Kerberos processor
+ *
+ *******************************************************************/
+var UnixMongoProcessor = function(host, port) {
+  this.host = host;
+  this.port = port  
+  // SSIP classes
+  this.Kerberos = require("../kerberos").Kerberos;
+  this.kerberos = new this.Kerberos();
+  // Set up first transition
+  this._transition = UnixMongoProcessor.first_transition(this);
+  // Set up target
+  this.target = format("mongodb@%s", host);
+  // Number of retries
+  this.retries = 10;
+}
+
+UnixMongoProcessor.prototype.init = function(username, password, callback) {
+  var self = this;
+  this.username = username;
+  this.password = password;
+  // Call client initiate
+  this.kerberos.authGSSClientInit(
+      self.target
+    , this.Kerberos.GSS_C_MUTUAL_FLAG, function(err, context) {
+      self.context = context;
+      // Return the context
+      callback(null, context);
+  });
+}
+
+UnixMongoProcessor.prototype.transition = function(payload, callback) {
+  if(this._transition == null) return callback(new Error("Transition finished"));
+  this._transition(payload, callback);
+}
+
+UnixMongoProcessor.first_transition = function(self) {
+  return function(payload, callback) {    
+    self.kerberos.authGSSClientStep(self.context, '', function(err, result) {
+      if(err) return callback(err);
+      // Set up the next step
+      self._transition = UnixMongoProcessor.second_transition(self);
+      // Return the payload
+      callback(null, self.context.response);
+    })
+  }
+}
+
+UnixMongoProcessor.second_transition = function(self) {
+  return function(payload, callback) {    
+    self.kerberos.authGSSClientStep(self.context, payload, function(err, result) {
+      if(err && self.retries == 0) return callback(err);
+      // Attempt to re-establish a context
+      if(err) {
+        // Adjust the number of retries
+        self.retries = self.retries - 1;
+        // Call same step again
+        return self.transition(payload, callback);
+      }
+      
+      // Set up the next step
+      self._transition = UnixMongoProcessor.third_transition(self);
+      // Return the payload
+      callback(null, self.context.response || '');
+    });
+  }
+}
+
+UnixMongoProcessor.third_transition = function(self) {
+  return function(payload, callback) {    
+    // GSS Client Unwrap
+    self.kerberos.authGSSClientUnwrap(self.context, payload, function(err, result) {
+      if(err) return callback(err, false);
+      
+      // Wrap the response
+      self.kerberos.authGSSClientWrap(self.context, self.context.response, self.username, function(err, result) {
+        if(err) return callback(err, false);
+        // Set up the next step
+        self._transition = UnixMongoProcessor.fourth_transition(self);
+        // Return the payload
+        callback(null, self.context.response);
+      });
+    });
+  }
+}
+
+UnixMongoProcessor.fourth_transition = function(self) {
+  return function(payload, callback) {    
+    // Clean up context
+    self.kerberos.authGSSClientClean(self.context, function(err, result) {
+      if(err) return callback(err, false);
+      // Set the transition to null
+      self._transition = null;
+      // Callback with valid authentication
+      callback(null, true);
+    });
+  }
+}
+
+// Set the process
+exports.MongoAuthProcess = MongoAuthProcess;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/base64.c b/node_modules/mongodb/node_modules/kerberos/lib/base64.c
new file mode 100644
index 0000000..4232106
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/base64.c
@@ -0,0 +1,120 @@
+/**
+ * Copyright (c) 2006-2008 Apple Inc. All rights reserved.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ **/
+
+#include "base64.h"
+
+#include <stdlib.h>
+#include <string.h>
+
+// base64 tables
+static char basis_64[] =
+    "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+static signed char index_64[128] =
+{
+    -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1,
+    -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1,
+    -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,62, -1,-1,-1,63,
+    52,53,54,55, 56,57,58,59, 60,61,-1,-1, -1,-1,-1,-1,
+    -1, 0, 1, 2,  3, 4, 5, 6,  7, 8, 9,10, 11,12,13,14,
+    15,16,17,18, 19,20,21,22, 23,24,25,-1, -1,-1,-1,-1,
+    -1,26,27,28, 29,30,31,32, 33,34,35,36, 37,38,39,40,
+    41,42,43,44, 45,46,47,48, 49,50,51,-1, -1,-1,-1,-1
+};
+#define CHAR64(c)  (((c) < 0 || (c) > 127) ? -1 : index_64[(c)])
+
+// base64_encode    :    base64 encode
+//
+// value            :    data to encode
+// vlen             :    length of data
+// (result)         :    new char[] - c-str of result
+char *base64_encode(const unsigned char *value, int vlen)
+{
+    char *result = (char *)malloc((vlen * 4) / 3 + 5);
+    char *out = result;
+    while (vlen >= 3)
+    {
+        *out++ = basis_64[value[0] >> 2];
+        *out++ = basis_64[((value[0] << 4) & 0x30) | (value[1] >> 4)];
+        *out++ = basis_64[((value[1] << 2) & 0x3C) | (value[2] >> 6)];
+        *out++ = basis_64[value[2] & 0x3F];
+        value += 3;
+        vlen -= 3;
+    }
+    if (vlen > 0)
+    {
+        *out++ = basis_64[value[0] >> 2];
+        unsigned char oval = (value[0] << 4) & 0x30;
+        if (vlen > 1) oval |= value[1] >> 4;
+        *out++ = basis_64[oval];
+        *out++ = (vlen < 2) ? '=' : basis_64[(value[1] << 2) & 0x3C];
+        *out++ = '=';
+    }
+    *out = '\0';
+
+    return result;
+}
+
+// base64_decode    :    base64 decode
+//
+// value            :    c-str to decode
+// rlen             :    length of decoded result
+// (result)         :    new unsigned char[] - decoded result
+unsigned char *base64_decode(const char *value, int *rlen)
+{
+    *rlen = 0;
+    int c1, c2, c3, c4;
+
+    int vlen = strlen(value);
+    unsigned char *result =(unsigned char *)malloc((vlen * 3) / 4 + 1);
+    unsigned char *out = result;
+
+    while (1)
+    {
+        if (value[0]==0)
+            return result;
+        c1 = value[0];
+        if (CHAR64(c1) == -1)
+            goto base64_decode_error;;
+        c2 = value[1];
+        if (CHAR64(c2) == -1)
+            goto base64_decode_error;;
+        c3 = value[2];
+        if ((c3 != '=') && (CHAR64(c3) == -1))
+            goto base64_decode_error;;
+        c4 = value[3];
+        if ((c4 != '=') && (CHAR64(c4) == -1))
+            goto base64_decode_error;;
+
+        value += 4;
+        *out++ = (CHAR64(c1) << 2) | (CHAR64(c2) >> 4);
+        *rlen += 1;
+        if (c3 != '=')
+        {
+            *out++ = ((CHAR64(c2) << 4) & 0xf0) | (CHAR64(c3) >> 2);
+            *rlen += 1;
+            if (c4 != '=')
+            {
+                *out++ = ((CHAR64(c3) << 6) & 0xc0) | CHAR64(c4);
+                *rlen += 1;
+            }
+        }
+    }
+
+base64_decode_error:
+    *result = 0;
+    *rlen = 0;
+    return result;
+}
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/base64.h b/node_modules/mongodb/node_modules/kerberos/lib/base64.h
new file mode 100644
index 0000000..f0e1f06
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/base64.h
@@ -0,0 +1,18 @@
+/**
+ * Copyright (c) 2006-2008 Apple Inc. All rights reserved.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ **/
+
+char *base64_encode(const unsigned char *value, int vlen);
+unsigned char *base64_decode(const char *value, int *rlen);
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/kerberos.cc b/node_modules/mongodb/node_modules/kerberos/lib/kerberos.cc
new file mode 100644
index 0000000..08eda82
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/kerberos.cc
@@ -0,0 +1,563 @@
+#include "kerberos.h"
+#include <stdlib.h>
+#include "worker.h"
+#include "kerberos_context.h"
+
+#ifndef ARRAY_SIZE
+# define ARRAY_SIZE(a) (sizeof((a)) / sizeof((a)[0]))
+#endif
+
+Persistent<FunctionTemplate> Kerberos::constructor_template;
+
+// Call structs
+typedef struct AuthGSSClientCall {
+  uint32_t  flags;
+  char *uri;
+} AuthGSSClientCall;
+
+typedef struct AuthGSSClientStepCall {
+  KerberosContext *context;
+  char *challenge;
+} AuthGSSClientStepCall;
+
+typedef struct AuthGSSClientUnwrapCall {
+  KerberosContext *context;
+  char *challenge;
+} AuthGSSClientUnwrapCall;
+
+typedef struct AuthGSSClientWrapCall {
+  KerberosContext *context;
+  char *challenge;
+  char *user_name;
+} AuthGSSClientWrapCall;
+
+typedef struct AuthGSSClientCleanCall {
+  KerberosContext *context;
+} AuthGSSClientCleanCall;
+
+// VException object (causes throw in calling code)
+static Handle<Value> VException(const char *msg) {
+  HandleScope scope;
+  return ThrowException(Exception::Error(String::New(msg)));
+}
+
+Kerberos::Kerberos() : ObjectWrap() {
+}
+
+void Kerberos::Initialize(v8::Handle<v8::Object> target) {
+  // Grab the scope of the call from Node
+  HandleScope scope;
+  // Define a new function template
+  Local<FunctionTemplate> t = FunctionTemplate::New(Kerberos::New);
+  constructor_template = Persistent<FunctionTemplate>::New(t);
+  constructor_template->InstanceTemplate()->SetInternalFieldCount(1);
+  constructor_template->SetClassName(String::NewSymbol("Kerberos"));
+
+  // Set up method for the Kerberos instance
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "authGSSClientInit", AuthGSSClientInit);  
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "authGSSClientStep", AuthGSSClientStep);  
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "authGSSClientUnwrap", AuthGSSClientUnwrap);
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "authGSSClientWrap", AuthGSSClientWrap);
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "authGSSClientClean", AuthGSSClientClean);
+
+  // Set the symbol
+  target->ForceSet(String::NewSymbol("Kerberos"), constructor_template->GetFunction());
+}
+
+Handle<Value> Kerberos::New(const Arguments &args) {
+  // Create a Kerberos instance
+  Kerberos *kerberos = new Kerberos();
+  // Return the kerberos object
+  kerberos->Wrap(args.This());
+  return args.This();
+}
+
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+// authGSSClientInit
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+static void _authGSSClientInit(Worker *worker) {
+  gss_client_state *state;
+  gss_client_response *response;
+
+  // Allocate state
+  state = (gss_client_state *)malloc(sizeof(gss_client_state));
+  
+  // Unpack the parameter data struct
+  AuthGSSClientCall *call = (AuthGSSClientCall *)worker->parameters;
+  // Start the kerberos client
+  response = authenticate_gss_client_init(call->uri, call->flags, state);
+
+  // Release the parameter struct memory
+  free(call->uri);
+  free(call);
+
+  // If we have an error mark worker as having had an error
+  if(response->return_code == AUTH_GSS_ERROR) {
+    worker->error = TRUE;
+    worker->error_code = response->return_code;
+    worker->error_message = response->message;
+  } else {
+    worker->return_value = state;
+  }
+
+  // Free structure
+  free(response);
+}
+
+static Handle<Value> _map_authGSSClientInit(Worker *worker) {
+  HandleScope scope;
+
+  KerberosContext *context = KerberosContext::New();
+  context->state = (gss_client_state *)worker->return_value;
+  // Persistent<Value> _context = Persistent<Value>::New(context->handle_);
+  return scope.Close(context->handle_);
+}
+
+// Initialize method
+Handle<Value> Kerberos::AuthGSSClientInit(const Arguments &args) {
+  HandleScope scope;
+
+  // Ensure valid call
+  if(args.Length() != 3) return VException("Requires a service string uri, integer flags and a callback function");
+  if(args.Length() == 3 && !args[0]->IsString() && !args[1]->IsInt32() && !args[2]->IsFunction()) 
+      return VException("Requires a service string uri, integer flags and a callback function");    
+
+  Local<String> service = args[0]->ToString();
+  // Convert uri string to c-string
+  char *service_str = (char *)calloc(service->Utf8Length() + 1, sizeof(char));
+  // Write v8 string to c-string
+  service->WriteUtf8(service_str);
+
+  // Allocate a structure
+  AuthGSSClientCall *call = (AuthGSSClientCall *)calloc(1, sizeof(AuthGSSClientCall));
+  call->flags =args[1]->ToInt32()->Uint32Value();
+  call->uri = service_str;
+
+  // Unpack the callback
+  Local<Function> callback = Local<Function>::Cast(args[2]);
+
+  // Let's allocate some space
+  Worker *worker = new Worker();
+  worker->error = false;
+  worker->request.data = worker;
+  worker->callback = Persistent<Function>::New(callback);
+  worker->parameters = call;
+  worker->execute = _authGSSClientInit;
+  worker->mapper = _map_authGSSClientInit;
+
+  // Schedule the worker with lib_uv
+  uv_queue_work(uv_default_loop(), &worker->request, Kerberos::Process, (uv_after_work_cb)Kerberos::After);
+  // Return no value as it's callback based
+  return scope.Close(Undefined());
+}
+
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+// authGSSClientStep
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+static void _authGSSClientStep(Worker *worker) {
+  gss_client_state *state;
+  gss_client_response *response;
+  char *challenge;
+
+  // Unpack the parameter data struct
+  AuthGSSClientStepCall *call = (AuthGSSClientStepCall *)worker->parameters;
+  // Get the state
+  state = call->context->state;
+  challenge = call->challenge;
+
+  // Check what kind of challenge we have
+  if(call->challenge == NULL) {
+    challenge = (char *)"";
+  }
+
+  // Perform authentication step
+  response = authenticate_gss_client_step(state, challenge);
+
+  // If we have an error mark worker as having had an error
+  if(response->return_code == AUTH_GSS_ERROR) {
+    worker->error = TRUE;
+    worker->error_code = response->return_code;
+    worker->error_message = response->message;
+  } else {
+    worker->return_code = response->return_code;
+  }
+
+  // Free up structure
+  if(call->challenge != NULL) free(call->challenge);
+  free(call);
+  free(response);
+}
+
+static Handle<Value> _map_authGSSClientStep(Worker *worker) {
+  HandleScope scope;
+  // Return the return code
+  return scope.Close(Int32::New(worker->return_code));
+}
+
+// Initialize method
+Handle<Value> Kerberos::AuthGSSClientStep(const Arguments &args) {
+  HandleScope scope;
+
+  // Ensure valid call
+  if(args.Length() != 2 && args.Length() != 3) return VException("Requires a GSS context, optional challenge string and callback function");
+  if(args.Length() == 2 && !KerberosContext::HasInstance(args[0])) return VException("Requires a GSS context, optional challenge string and callback function");
+  if(args.Length() == 3 && !KerberosContext::HasInstance(args[0]) && !args[1]->IsString()) return VException("Requires a GSS context, optional challenge string and callback function");
+
+  // Challenge string
+  char *challenge_str = NULL;
+  // Let's unpack the parameters
+  Local<Object> object = args[0]->ToObject();
+  KerberosContext *kerberos_context = KerberosContext::Unwrap<KerberosContext>(object);
+
+  // If we have a challenge string
+  if(args.Length() == 3) {
+    // Unpack the challenge string
+    Local<String> challenge = args[1]->ToString();
+    // Convert uri string to c-string
+    challenge_str = (char *)calloc(challenge->Utf8Length() + 1, sizeof(char));
+    // Write v8 string to c-string
+    challenge->WriteUtf8(challenge_str);    
+  }
+
+  // Allocate a structure
+  AuthGSSClientStepCall *call = (AuthGSSClientStepCall *)calloc(1, sizeof(AuthGSSClientCall));
+  call->context = kerberos_context;
+  call->challenge = challenge_str;
+
+  // Unpack the callback
+  Local<Function> callback = Local<Function>::Cast(args[2]);
+
+  // Let's allocate some space
+  Worker *worker = new Worker();
+  worker->error = false;
+  worker->request.data = worker;
+  worker->callback = Persistent<Function>::New(callback);
+  worker->parameters = call;
+  worker->execute = _authGSSClientStep;
+  worker->mapper = _map_authGSSClientStep;
+
+  // Schedule the worker with lib_uv
+  uv_queue_work(uv_default_loop(), &worker->request, Kerberos::Process, (uv_after_work_cb)Kerberos::After);
+
+  // Return no value as it's callback based
+  return scope.Close(Undefined());
+}
+
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+// authGSSClientUnwrap
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+static void _authGSSClientUnwrap(Worker *worker) {
+  gss_client_response *response;
+  char *challenge;
+
+  // Unpack the parameter data struct
+  AuthGSSClientUnwrapCall *call = (AuthGSSClientUnwrapCall *)worker->parameters;
+  challenge = call->challenge;
+
+  // Check what kind of challenge we have
+  if(call->challenge == NULL) {
+    challenge = (char *)"";
+  }
+
+  // Perform authentication step
+  response = authenticate_gss_client_unwrap(call->context->state, challenge);
+
+  // If we have an error mark worker as having had an error
+  if(response->return_code == AUTH_GSS_ERROR) {
+    worker->error = TRUE;
+    worker->error_code = response->return_code;
+    worker->error_message = response->message;
+  } else {
+    worker->return_code = response->return_code;
+  }
+
+  // Free up structure
+  if(call->challenge != NULL) free(call->challenge);
+  free(call);
+  free(response);
+}
+
+static Handle<Value> _map_authGSSClientUnwrap(Worker *worker) {
+  HandleScope scope;
+  // Return the return code
+  return scope.Close(Int32::New(worker->return_code));
+}
+
+// Initialize method
+Handle<Value> Kerberos::AuthGSSClientUnwrap(const Arguments &args) {
+  HandleScope scope;
+
+  // Ensure valid call
+  if(args.Length() != 2 && args.Length() != 3) return VException("Requires a GSS context, optional challenge string and callback function");
+  if(args.Length() == 2 && !KerberosContext::HasInstance(args[0]) && !args[1]->IsFunction()) return VException("Requires a GSS context, optional challenge string and callback function");
+  if(args.Length() == 3 && !KerberosContext::HasInstance(args[0]) && !args[1]->IsString() && !args[2]->IsFunction()) return VException("Requires a GSS context, optional challenge string and callback function");
+
+  // Challenge string
+  char *challenge_str = NULL;
+  // Let's unpack the parameters
+  Local<Object> object = args[0]->ToObject();
+  KerberosContext *kerberos_context = KerberosContext::Unwrap<KerberosContext>(object);
+
+  // If we have a challenge string
+  if(args.Length() == 3) {
+    // Unpack the challenge string
+    Local<String> challenge = args[1]->ToString();
+    // Convert uri string to c-string
+    challenge_str = (char *)calloc(challenge->Utf8Length() + 1, sizeof(char));
+    // Write v8 string to c-string
+    challenge->WriteUtf8(challenge_str);    
+  }
+
+  // Allocate a structure
+  AuthGSSClientUnwrapCall *call = (AuthGSSClientUnwrapCall *)calloc(1, sizeof(AuthGSSClientUnwrapCall));
+  call->context = kerberos_context;
+  call->challenge = challenge_str;
+
+  // Unpack the callback
+  Local<Function> callback = args.Length() == 3 ? Local<Function>::Cast(args[2]) : Local<Function>::Cast(args[1]);
+
+  // Let's allocate some space
+  Worker *worker = new Worker();
+  worker->error = false;
+  worker->request.data = worker;
+  worker->callback = Persistent<Function>::New(callback);
+  worker->parameters = call;
+  worker->execute = _authGSSClientUnwrap;
+  worker->mapper = _map_authGSSClientUnwrap;
+
+  // Schedule the worker with lib_uv
+  uv_queue_work(uv_default_loop(), &worker->request, Kerberos::Process, (uv_after_work_cb)Kerberos::After);
+
+  // Return no value as it's callback based
+  return scope.Close(Undefined());
+}
+
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+// authGSSClientWrap
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+static void _authGSSClientWrap(Worker *worker) {
+  gss_client_response *response;
+  char *user_name = NULL;
+
+  // Unpack the parameter data struct
+  AuthGSSClientWrapCall *call = (AuthGSSClientWrapCall *)worker->parameters;
+  user_name = call->user_name;  
+
+  // Check what kind of challenge we have
+  if(call->user_name == NULL) {
+    user_name = (char *)"";
+  }
+
+  // Perform authentication step
+  response = authenticate_gss_client_wrap(call->context->state, call->challenge, user_name);
+
+  // If we have an error mark worker as having had an error
+  if(response->return_code == AUTH_GSS_ERROR) {
+    worker->error = TRUE;
+    worker->error_code = response->return_code;
+    worker->error_message = response->message;
+  } else {
+    worker->return_code = response->return_code;
+  }
+
+  // Free up structure
+  if(call->challenge != NULL) free(call->challenge);
+  if(call->user_name != NULL) free(call->user_name);
+  free(call);
+  free(response);
+}
+
+static Handle<Value> _map_authGSSClientWrap(Worker *worker) {
+  HandleScope scope;
+  // Return the return code
+  return scope.Close(Int32::New(worker->return_code));
+}
+
+// Initialize method
+Handle<Value> Kerberos::AuthGSSClientWrap(const Arguments &args) {
+  HandleScope scope;
+
+  // Ensure valid call
+  if(args.Length() != 3 && args.Length() != 4) return VException("Requires a GSS context, the result from the authGSSClientResponse after authGSSClientUnwrap, optional user name and callback function");
+  if(args.Length() == 3 && !KerberosContext::HasInstance(args[0]) && !args[1]->IsString() && !args[2]->IsFunction()) return VException("Requires a GSS context, the result from the authGSSClientResponse after authGSSClientUnwrap, optional user name and callback function");
+  if(args.Length() == 4 && !KerberosContext::HasInstance(args[0]) && !args[1]->IsString() && !args[2]->IsString() && !args[2]->IsFunction()) return VException("Requires a GSS context, the result from the authGSSClientResponse after authGSSClientUnwrap, optional user name and callback function");
+
+  // Challenge string
+  char *challenge_str = NULL;
+  char *user_name_str = NULL;
+  
+  // Let's unpack the kerberos context
+  Local<Object> object = args[0]->ToObject();
+  KerberosContext *kerberos_context = KerberosContext::Unwrap<KerberosContext>(object);
+
+  // Unpack the challenge string
+  Local<String> challenge = args[1]->ToString();
+  // Convert uri string to c-string
+  challenge_str = (char *)calloc(challenge->Utf8Length() + 1, sizeof(char));
+  // Write v8 string to c-string
+  challenge->WriteUtf8(challenge_str);    
+
+  // If we have a user string
+  if(args.Length() == 4) {
+    // Unpack user name
+    Local<String> user_name = args[2]->ToString();
+    // Convert uri string to c-string
+    user_name_str = (char *)calloc(user_name->Utf8Length() + 1, sizeof(char));
+    // Write v8 string to c-string
+    user_name->WriteUtf8(user_name_str);
+  }
+
+  // Allocate a structure
+  AuthGSSClientWrapCall *call = (AuthGSSClientWrapCall *)calloc(1, sizeof(AuthGSSClientWrapCall));
+  call->context = kerberos_context;
+  call->challenge = challenge_str;
+  call->user_name = user_name_str;
+
+  // Unpack the callback
+  Local<Function> callback = args.Length() == 4 ? Local<Function>::Cast(args[3]) : Local<Function>::Cast(args[2]);
+
+  // Let's allocate some space
+  Worker *worker = new Worker();
+  worker->error = false;
+  worker->request.data = worker;
+  worker->callback = Persistent<Function>::New(callback);
+  worker->parameters = call;
+  worker->execute = _authGSSClientWrap;
+  worker->mapper = _map_authGSSClientWrap;
+
+  // Schedule the worker with lib_uv
+  uv_queue_work(uv_default_loop(), &worker->request, Kerberos::Process, (uv_after_work_cb)Kerberos::After);
+
+  // Return no value as it's callback based
+  return scope.Close(Undefined());
+}
+
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+// authGSSClientWrap
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+static void _authGSSClientClean(Worker *worker) {
+  gss_client_response *response;
+
+  // Unpack the parameter data struct
+  AuthGSSClientCleanCall *call = (AuthGSSClientCleanCall *)worker->parameters;
+
+  // Perform authentication step
+  response = authenticate_gss_client_clean(call->context->state);
+
+  // If we have an error mark worker as having had an error
+  if(response->return_code == AUTH_GSS_ERROR) {
+    worker->error = TRUE;
+    worker->error_code = response->return_code;
+    worker->error_message = response->message;
+  } else {
+    worker->return_code = response->return_code;
+  }
+
+  // Free up structure
+  free(call);
+  free(response);
+}
+
+static Handle<Value> _map_authGSSClientClean(Worker *worker) {
+  HandleScope scope;
+  // Return the return code
+  return scope.Close(Int32::New(worker->return_code));
+}
+
+// Initialize method
+Handle<Value> Kerberos::AuthGSSClientClean(const Arguments &args) {
+  HandleScope scope;
+
+  // // Ensure valid call
+  if(args.Length() != 2) return VException("Requires a GSS context and callback function");
+  if(!KerberosContext::HasInstance(args[0]) && !args[1]->IsFunction()) return VException("Requires a GSS context and callback function");
+
+  // Let's unpack the kerberos context
+  Local<Object> object = args[0]->ToObject();
+  KerberosContext *kerberos_context = KerberosContext::Unwrap<KerberosContext>(object);
+
+  // Allocate a structure
+  AuthGSSClientCleanCall *call = (AuthGSSClientCleanCall *)calloc(1, sizeof(AuthGSSClientCleanCall));
+  call->context = kerberos_context;
+
+  // Unpack the callback
+  Local<Function> callback = Local<Function>::Cast(args[1]);
+
+  // Let's allocate some space
+  Worker *worker = new Worker();
+  worker->error = false;
+  worker->request.data = worker;
+  worker->callback = Persistent<Function>::New(callback);
+  worker->parameters = call;
+  worker->execute = _authGSSClientClean;
+  worker->mapper = _map_authGSSClientClean;
+
+  // Schedule the worker with lib_uv
+  uv_queue_work(uv_default_loop(), &worker->request, Kerberos::Process, (uv_after_work_cb)Kerberos::After);
+
+  // Return no value as it's callback based
+  return scope.Close(Undefined());
+}
+
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+// UV Lib callbacks
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+void Kerberos::Process(uv_work_t* work_req) {
+  // Grab the worker
+  Worker *worker = static_cast<Worker*>(work_req->data);
+  // Execute the worker code
+  worker->execute(worker);
+}
+
+void Kerberos::After(uv_work_t* work_req) {
+  // Grab the scope of the call from Node
+  v8::HandleScope scope;
+
+  // Get the worker reference
+  Worker *worker = static_cast<Worker*>(work_req->data);
+
+  // If we have an error
+  if(worker->error) {
+    v8::Local<v8::Value> err = v8::Exception::Error(v8::String::New(worker->error_message));
+    Local<Object> obj = err->ToObject();
+    obj->Set(NODE_PSYMBOL("code"), Int32::New(worker->error_code));
+    v8::Local<v8::Value> args[2] = { err, v8::Local<v8::Value>::New(v8::Null()) };
+    // Execute the error
+    v8::TryCatch try_catch;
+    // Call the callback
+    worker->callback->Call(v8::Context::GetCurrent()->Global(), ARRAY_SIZE(args), args);
+    // If we have an exception handle it as a fatalexception
+    if (try_catch.HasCaught()) {
+      node::FatalException(try_catch);
+    }
+  } else {
+    // // Map the data
+    v8::Handle<v8::Value> result = worker->mapper(worker);
+    // Set up the callback with a null first
+    v8::Handle<v8::Value> args[2] = { v8::Local<v8::Value>::New(v8::Null()), result};
+    // Wrap the callback function call in a TryCatch so that we can call
+    // node's FatalException afterwards. This makes it possible to catch
+    // the exception from JavaScript land using the
+    // process.on('uncaughtException') event.
+    v8::TryCatch try_catch;
+    // Call the callback
+    worker->callback->Call(v8::Context::GetCurrent()->Global(), ARRAY_SIZE(args), args);
+    // If we have an exception handle it as a fatalexception
+    if (try_catch.HasCaught()) {
+      node::FatalException(try_catch);
+    }
+  }
+
+  // Clean up the memory
+  worker->callback.Dispose();
+  delete worker;
+}
+
+// Exporting function
+extern "C" void init(Handle<Object> target) {
+  HandleScope scope;
+  Kerberos::Initialize(target);
+  KerberosContext::Initialize(target);
+}
+
+NODE_MODULE(kerberos, init);
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/kerberos.h b/node_modules/mongodb/node_modules/kerberos/lib/kerberos.h
new file mode 100644
index 0000000..f0fbcdc
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/kerberos.h
@@ -0,0 +1,47 @@
+#ifndef KERBEROS_H
+#define KERBEROS_H
+
+#include <gssapi/gssapi.h>
+#include <gssapi/gssapi_generic.h>
+#include <gssapi/gssapi_krb5.h>
+
+#include <node.h>
+#include <node_object_wrap.h>
+#include <v8.h>
+
+extern "C" {
+  #include "kerberosgss.h"
+}
+
+using namespace v8;
+using namespace node;
+
+class Kerberos : public ObjectWrap {
+
+public:
+  Kerberos();
+  ~Kerberos() {};
+
+  // Constructor used for creating new Kerberos objects from C++
+  static Persistent<FunctionTemplate> constructor_template;
+
+  // Initialize function for the object
+  static void Initialize(Handle<Object> target);
+
+  // Method available
+  static Handle<Value> AuthGSSClientInit(const Arguments &args);
+  static Handle<Value> AuthGSSClientStep(const Arguments &args);
+  static Handle<Value> AuthGSSClientUnwrap(const Arguments &args);
+  static Handle<Value> AuthGSSClientWrap(const Arguments &args);
+  static Handle<Value> AuthGSSClientClean(const Arguments &args);
+
+private:
+  static Handle<Value> New(const Arguments &args);  
+
+  // Handles the uv calls
+  static void Process(uv_work_t* work_req);
+  // Called after work is done
+  static void After(uv_work_t* work_req);
+};
+
+#endif
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/kerberos.js b/node_modules/mongodb/node_modules/kerberos/lib/kerberos.js
new file mode 100644
index 0000000..b1a701b
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/kerberos.js
@@ -0,0 +1,91 @@
+var kerberos = require('../build/Release/kerberos')
+  , KerberosNative = kerberos.Kerberos;
+
+var Kerberos = function() {
+  this._native_kerberos = new KerberosNative(); 
+}
+
+Kerberos.prototype.authGSSClientInit = function(uri, flags, callback) {
+  return this._native_kerberos.authGSSClientInit(uri, flags, callback);
+}
+
+Kerberos.prototype.authGSSClientStep = function(context, challenge, callback) {
+  if(typeof challenge == 'function') {
+    callback = challenge;
+    challenge = '';
+  }
+
+  return this._native_kerberos.authGSSClientStep(context, challenge, callback);
+}
+
+Kerberos.prototype.authGSSClientUnwrap = function(context, challenge, callback) {
+  if(typeof challenge == 'function') {
+    callback = challenge;
+    challenge = '';
+  }
+
+  return this._native_kerberos.authGSSClientUnwrap(context, challenge, callback);
+}
+
+Kerberos.prototype.authGSSClientWrap = function(context, challenge, user_name, callback) {
+  if(typeof user_name == 'function') {
+    callback = user_name;
+    user_name = '';
+  }
+
+  return this._native_kerberos.authGSSClientWrap(context, challenge, user_name, callback);
+}
+
+Kerberos.prototype.authGSSClientClean = function(context, callback) {
+  return this._native_kerberos.authGSSClientClean(context, callback);
+}
+
+Kerberos.prototype.acquireAlternateCredentials = function(user_name, password, domain) {
+  return this._native_kerberos.acquireAlternateCredentials(user_name, password, domain); 
+}
+
+Kerberos.prototype.prepareOutboundPackage = function(principal, inputdata) {
+  return this._native_kerberos.prepareOutboundPackage(principal, inputdata); 
+}
+
+Kerberos.prototype.decryptMessage = function(challenge) {
+  return this._native_kerberos.decryptMessage(challenge);
+}
+
+Kerberos.prototype.encryptMessage = function(challenge) {
+  return this._native_kerberos.encryptMessage(challenge); 
+}
+
+Kerberos.prototype.queryContextAttribute = function(attribute) {
+  if(typeof attribute != 'number' && attribute != 0x00) throw new Error("Attribute not supported");
+  return this._native_kerberos.queryContextAttribute(attribute);
+}
+
+// Some useful result codes
+Kerberos.AUTH_GSS_CONTINUE     = 0;
+Kerberos.AUTH_GSS_COMPLETE     = 1;
+     
+// Some useful gss flags 
+Kerberos.GSS_C_DELEG_FLAG      = 1;
+Kerberos.GSS_C_MUTUAL_FLAG     = 2;
+Kerberos.GSS_C_REPLAY_FLAG     = 4;
+Kerberos.GSS_C_SEQUENCE_FLAG   = 8;
+Kerberos.GSS_C_CONF_FLAG       = 16; 
+Kerberos.GSS_C_INTEG_FLAG      = 32;
+Kerberos.GSS_C_ANON_FLAG       = 64;
+Kerberos.GSS_C_PROT_READY_FLAG = 128; 
+Kerberos.GSS_C_TRANS_FLAG      = 256;
+
+// Export Kerberos class
+exports.Kerberos = Kerberos;
+
+// If we have SSPI (windows)
+if(kerberos.SecurityCredentials) {
+  // Put all SSPI classes in it's own namespace
+  exports.SSIP = {
+      SecurityCredentials: require('./win32/wrappers/security_credentials').SecurityCredentials
+    , SecurityContext: require('./win32/wrappers/security_context').SecurityContext
+    , SecurityBuffer: require('./win32/wrappers/security_buffer').SecurityBuffer
+    , SecurityBufferDescriptor: require('./win32/wrappers/security_buffer_descriptor').SecurityBufferDescriptor
+  }
+}
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/kerberos_context.cc b/node_modules/mongodb/node_modules/kerberos/lib/kerberos_context.cc
new file mode 100644
index 0000000..7a5f4eb
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/kerberos_context.cc
@@ -0,0 +1,74 @@
+#include "kerberos_context.h"
+
+Persistent<FunctionTemplate> KerberosContext::constructor_template;
+
+KerberosContext::KerberosContext() : ObjectWrap() {
+}
+
+KerberosContext::~KerberosContext() {
+}
+
+KerberosContext* KerberosContext::New() {
+  HandleScope scope;
+  
+  Local<Object> obj = constructor_template->GetFunction()->NewInstance();
+  KerberosContext *kerberos_context = ObjectWrap::Unwrap<KerberosContext>(obj);  
+  
+  return kerberos_context;
+}
+
+Handle<Value> KerberosContext::New(const Arguments &args) {
+  HandleScope scope;    
+  // Create code object
+  KerberosContext *kerberos_context = new KerberosContext();
+  // Wrap it
+  kerberos_context->Wrap(args.This());
+  // Return the object
+  return args.This();    
+}
+
+static Persistent<String> response_symbol;
+
+void KerberosContext::Initialize(Handle<Object> target) {
+  // Grab the scope of the call from Node
+  HandleScope scope;
+  // Define a new function template
+  Local<FunctionTemplate> t = FunctionTemplate::New(New);
+  constructor_template = Persistent<FunctionTemplate>::New(t);
+  constructor_template->InstanceTemplate()->SetInternalFieldCount(1);
+  constructor_template->SetClassName(String::NewSymbol("KerberosContext"));
+
+  // Property symbols
+  response_symbol = NODE_PSYMBOL("response");
+    
+  // Getter for the response
+  constructor_template->InstanceTemplate()->SetAccessor(response_symbol, ResponseGetter);
+
+  // Set up the Symbol for the Class on the Module
+  target->Set(String::NewSymbol("KerberosContext"), constructor_template->GetFunction());
+}
+
+//
+// Response Setter / Getter
+Handle<Value> KerberosContext::ResponseGetter(Local<String> property, const AccessorInfo& info) {
+  HandleScope scope;
+  gss_client_state *state;
+
+  // Unpack the object
+  KerberosContext *context = ObjectWrap::Unwrap<KerberosContext>(info.Holder());
+  // Let's grab the response
+  state = context->state;
+  // No state no response
+  if(state == NULL || state->response == NULL) return scope.Close(Null());
+  // Return the response
+  return scope.Close(String::New(state->response));
+}
+
+
+
+
+
+
+
+
+
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/kerberos_context.h b/node_modules/mongodb/node_modules/kerberos/lib/kerberos_context.h
new file mode 100644
index 0000000..1b62cba
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/kerberos_context.h
@@ -0,0 +1,48 @@
+#ifndef KERBEROS_CONTEXT_H
+#define KERBEROS_CONTEXT_H
+
+#include <gssapi/gssapi.h>
+#include <gssapi/gssapi_generic.h>
+#include <gssapi/gssapi_krb5.h>
+
+#include <node.h>
+#include <node_object_wrap.h>
+#include <v8.h>
+
+extern "C" {
+  #include "kerberosgss.h"
+}
+
+using namespace v8;
+using namespace node;
+
+class KerberosContext : public ObjectWrap {
+
+public:
+  KerberosContext();
+  ~KerberosContext();
+
+  static inline bool HasInstance(Handle<Value> val) {
+    if (!val->IsObject()) return false;
+    Local<Object> obj = val->ToObject();
+    return constructor_template->HasInstance(obj);
+  };
+
+  // Constructor used for creating new Kerberos objects from C++
+  static Persistent<FunctionTemplate> constructor_template;
+
+  // Initialize function for the object
+  static void Initialize(Handle<Object> target);
+
+  // Public constructor
+  static KerberosContext* New();
+
+  // Handle to the kerberos context
+  gss_client_state *state;
+
+private:
+  static Handle<Value> New(const Arguments &args);  
+
+  static Handle<Value> ResponseGetter(Local<String> property, const AccessorInfo& info);  
+};
+#endif
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/kerberosgss.c b/node_modules/mongodb/node_modules/kerberos/lib/kerberosgss.c
new file mode 100644
index 0000000..ddf8c4a
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/kerberosgss.c
@@ -0,0 +1,668 @@
+/**
+ * Copyright (c) 2006-2010 Apple Inc. All rights reserved.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ **/
+
+#include "kerberosgss.h"
+
+#include "base64.h"
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <arpa/inet.h>
+
+static void set_gss_error(OM_uint32 err_maj, OM_uint32 err_min);
+
+/*extern PyObject *GssException_class;
+extern PyObject *KrbException_class;
+
+char* server_principal_details(const char* service, const char* hostname)
+{
+    char match[1024];
+    int match_len = 0;
+    char* result = NULL;
+    
+    int code;
+    krb5_context kcontext;
+    krb5_keytab kt = NULL;
+    krb5_kt_cursor cursor = NULL;
+    krb5_keytab_entry entry;
+    char* pname = NULL;
+    
+    // Generate the principal prefix we want to match
+    snprintf(match, 1024, "%s/%s@", service, hostname);
+    match_len = strlen(match);
+    
+    code = krb5_init_context(&kcontext);
+    if (code)
+    {
+        PyErr_SetObject(KrbException_class, Py_BuildValue("((s:i))",
+                                                          "Cannot initialize Kerberos5 context", code));
+        return NULL;
+    }
+    
+    if ((code = krb5_kt_default(kcontext, &kt)))
+    {
+        PyErr_SetObject(KrbException_class, Py_BuildValue("((s:i))",
+                                                          "Cannot get default keytab", code));
+        goto end;
+    }
+    
+    if ((code = krb5_kt_start_seq_get(kcontext, kt, &cursor)))
+    {
+        PyErr_SetObject(KrbException_class, Py_BuildValue("((s:i))",
+                                                          "Cannot get sequence cursor from keytab", code));
+        goto end;
+    }
+    
+    while ((code = krb5_kt_next_entry(kcontext, kt, &entry, &cursor)) == 0)
+    {
+        if ((code = krb5_unparse_name(kcontext, entry.principal, &pname)))
+        {
+            PyErr_SetObject(KrbException_class, Py_BuildValue("((s:i))",
+                                                              "Cannot parse principal name from keytab", code));
+            goto end;
+        }
+        
+        if (strncmp(pname, match, match_len) == 0)
+        {
+            result = malloc(strlen(pname) + 1);
+            strcpy(result, pname);
+            krb5_free_unparsed_name(kcontext, pname);
+            krb5_free_keytab_entry_contents(kcontext, &entry);
+            break;
+        }
+        
+        krb5_free_unparsed_name(kcontext, pname);
+        krb5_free_keytab_entry_contents(kcontext, &entry);
+    }
+    
+    if (result == NULL)
+    {
+        PyErr_SetObject(KrbException_class, Py_BuildValue("((s:i))",
+                                                          "Principal not found in keytab", -1));
+    }
+    
+end:
+    if (cursor)
+        krb5_kt_end_seq_get(kcontext, kt, &cursor);
+    if (kt)
+        krb5_kt_close(kcontext, kt);
+    krb5_free_context(kcontext);
+    
+    return result;
+}
+*/
+gss_client_response *authenticate_gss_client_init(const char* service, long int gss_flags, gss_client_state* state) {
+  OM_uint32 maj_stat;
+  OM_uint32 min_stat;
+  gss_buffer_desc name_token = GSS_C_EMPTY_BUFFER;
+  gss_client_response *response = NULL;
+  int ret = AUTH_GSS_COMPLETE;
+
+  state->server_name = GSS_C_NO_NAME;
+  state->context = GSS_C_NO_CONTEXT;
+  state->gss_flags = gss_flags;
+  state->username = NULL;
+  state->response = NULL;
+  
+  // Import server name first
+  name_token.length = strlen(service);
+  name_token.value = (char *)service;
+  
+  maj_stat = gss_import_name(&min_stat, &name_token, gss_krb5_nt_service_name, &state->server_name);
+  
+  if (GSS_ERROR(maj_stat)) {
+    response = gss_error(maj_stat, min_stat);
+    response->return_code = AUTH_GSS_ERROR;
+    goto end;
+  }
+  
+end:
+  if(response == NULL) {
+    response = calloc(1, sizeof(gss_client_response));
+    response->return_code = ret;    
+  }
+
+  return response;
+}
+
+gss_client_response *authenticate_gss_client_clean(gss_client_state *state) {
+  OM_uint32 maj_stat;
+  OM_uint32 min_stat;
+  int ret = AUTH_GSS_COMPLETE;
+  gss_client_response *response = NULL;
+  
+  if(state->context != GSS_C_NO_CONTEXT)
+    maj_stat = gss_delete_sec_context(&min_stat, &state->context, GSS_C_NO_BUFFER);
+  
+  if(state->server_name != GSS_C_NO_NAME)
+    maj_stat = gss_release_name(&min_stat, &state->server_name);
+  
+  if(state->username != NULL) {
+    free(state->username);
+    state->username = NULL;
+  }
+
+  if (state->response != NULL) {
+    free(state->response);
+    state->response = NULL;
+  }
+  
+  if(response == NULL) {
+    response = calloc(1, sizeof(gss_client_response));
+    response->return_code = ret;    
+  }
+
+  return response;
+}
+
+gss_client_response *authenticate_gss_client_step(gss_client_state* state, const char* challenge) {
+  OM_uint32 maj_stat;
+  OM_uint32 min_stat;
+  gss_buffer_desc input_token = GSS_C_EMPTY_BUFFER;
+  gss_buffer_desc output_token = GSS_C_EMPTY_BUFFER;
+  int ret = AUTH_GSS_CONTINUE;
+  gss_client_response *response = NULL;
+  
+  // Always clear out the old response
+  if (state->response != NULL) {
+    free(state->response);
+    state->response = NULL;
+  }
+  
+  // If there is a challenge (data from the server) we need to give it to GSS
+  if (challenge && *challenge) {
+    int len;
+    input_token.value = base64_decode(challenge, &len);
+    input_token.length = len;
+  }
+  
+  // Do GSSAPI step
+  maj_stat = gss_init_sec_context(&min_stat,
+                                  GSS_C_NO_CREDENTIAL,
+                                  &state->context,
+                                  state->server_name,
+                                  GSS_C_NO_OID,
+                                  (OM_uint32)state->gss_flags,
+                                  0,
+                                  GSS_C_NO_CHANNEL_BINDINGS,
+                                  &input_token,
+                                  NULL,
+                                  &output_token,
+                                  NULL,
+                                  NULL);
+
+  if ((maj_stat != GSS_S_COMPLETE) && (maj_stat != GSS_S_CONTINUE_NEEDED)) {
+    response = gss_error(maj_stat, min_stat);
+    response->return_code = AUTH_GSS_ERROR;
+    goto end;
+  }
+  
+  ret = (maj_stat == GSS_S_COMPLETE) ? AUTH_GSS_COMPLETE : AUTH_GSS_CONTINUE;
+  // Grab the client response to send back to the server
+  if(output_token.length) {
+    state->response = base64_encode((const unsigned char *)output_token.value, output_token.length);
+    maj_stat = gss_release_buffer(&min_stat, &output_token);
+  }
+  
+  // Try to get the user name if we have completed all GSS operations
+  if (ret == AUTH_GSS_COMPLETE) {
+    gss_name_t gssuser = GSS_C_NO_NAME;
+    maj_stat = gss_inquire_context(&min_stat, state->context, &gssuser, NULL, NULL, NULL,  NULL, NULL, NULL);
+    
+    if(GSS_ERROR(maj_stat)) {
+      response = gss_error(maj_stat, min_stat);
+      response->return_code = AUTH_GSS_ERROR;
+      goto end;
+    }
+    
+    gss_buffer_desc name_token;
+    name_token.length = 0;
+    maj_stat = gss_display_name(&min_stat, gssuser, &name_token, NULL);
+    
+    if(GSS_ERROR(maj_stat)) {
+      if(name_token.value)
+        gss_release_buffer(&min_stat, &name_token);
+      gss_release_name(&min_stat, &gssuser);
+      
+      response = gss_error(maj_stat, min_stat);
+      response->return_code = AUTH_GSS_ERROR;
+      goto end;
+    } else {
+      state->username = (char *)malloc(name_token.length + 1);
+      strncpy(state->username, (char*) name_token.value, name_token.length);
+      state->username[name_token.length] = 0;
+      gss_release_buffer(&min_stat, &name_token);
+      gss_release_name(&min_stat, &gssuser);
+    }
+  }
+
+end:
+  if(output_token.value)
+    gss_release_buffer(&min_stat, &output_token);
+  if(input_token.value)
+    free(input_token.value);
+
+  if(response == NULL) {
+    response = calloc(1, sizeof(gss_client_response));
+    response->return_code = ret;
+  }
+
+  // Return the response
+  return response;
+}
+
+gss_client_response *authenticate_gss_client_unwrap(gss_client_state *state, const char *challenge) {
+  OM_uint32 maj_stat;
+  OM_uint32 min_stat;
+  gss_buffer_desc input_token = GSS_C_EMPTY_BUFFER;
+  gss_buffer_desc output_token = GSS_C_EMPTY_BUFFER;
+  gss_client_response *response = NULL;
+  int ret = AUTH_GSS_CONTINUE;
+    
+  // Always clear out the old response
+  if(state->response != NULL) {
+    free(state->response);
+    state->response = NULL;
+  }
+    
+  // If there is a challenge (data from the server) we need to give it to GSS
+  if(challenge && *challenge) {
+    int len;
+    input_token.value = base64_decode(challenge, &len);
+    input_token.length = len;
+  }
+    
+  // Do GSSAPI step
+  maj_stat = gss_unwrap(&min_stat,
+                          state->context,
+                          &input_token,
+                          &output_token,
+                          NULL,
+                          NULL);
+    
+  if(maj_stat != GSS_S_COMPLETE) {
+    response = gss_error(maj_stat, min_stat);
+    response->return_code = AUTH_GSS_ERROR;
+    goto end;
+  } else {
+    ret = AUTH_GSS_COMPLETE;    
+  }
+    
+  // Grab the client response
+  if(output_token.length) {
+    state->response = base64_encode((const unsigned char *)output_token.value, output_token.length);
+    maj_stat = gss_release_buffer(&min_stat, &output_token);
+  }
+end:
+  if(output_token.value)
+    gss_release_buffer(&min_stat, &output_token);
+  if(input_token.value)
+    free(input_token.value);
+
+  if(response == NULL) {
+    response = calloc(1, sizeof(gss_client_response));
+    response->return_code = ret;
+  }
+
+  // Return the response
+  return response;
+}
+
+gss_client_response *authenticate_gss_client_wrap(gss_client_state* state, const char* challenge, const char* user) {
+  OM_uint32 maj_stat;
+  OM_uint32 min_stat;
+  gss_buffer_desc input_token = GSS_C_EMPTY_BUFFER;
+  gss_buffer_desc output_token = GSS_C_EMPTY_BUFFER;
+  int ret = AUTH_GSS_CONTINUE;
+  gss_client_response *response = NULL;
+  char buf[4096], server_conf_flags;
+  unsigned long buf_size;
+    
+  // Always clear out the old response
+  if(state->response != NULL) {
+    free(state->response);
+    state->response = NULL;
+  }
+    
+  if(challenge && *challenge) {
+    int len;
+    input_token.value = base64_decode(challenge, &len);
+    input_token.length = len;
+  }
+    
+  if(user) {
+    // get bufsize
+    server_conf_flags = ((char*) input_token.value)[0];
+    ((char*) input_token.value)[0] = 0;
+    buf_size = ntohl(*((long *) input_token.value));
+    free(input_token.value);
+#ifdef PRINTFS
+    printf("User: %s, %c%c%c\n", user,
+               server_conf_flags & GSS_AUTH_P_NONE      ? 'N' : '-',
+               server_conf_flags & GSS_AUTH_P_INTEGRITY ? 'I' : '-',
+               server_conf_flags & GSS_AUTH_P_PRIVACY   ? 'P' : '-');
+    printf("Maximum GSS token size is %ld\n", buf_size);
+#endif
+        
+    // agree to terms (hack!)
+    buf_size = htonl(buf_size); // not relevant without integrity/privacy
+    memcpy(buf, &buf_size, 4);
+    buf[0] = GSS_AUTH_P_NONE;
+    // server decides if principal can log in as user
+    strncpy(buf + 4, user, sizeof(buf) - 4);
+    input_token.value = buf;
+    input_token.length = 4 + strlen(user);
+  }
+    
+  // Do GSSAPI wrap
+  maj_stat = gss_wrap(&min_stat,
+            state->context,
+            0,
+            GSS_C_QOP_DEFAULT,
+            &input_token,
+            NULL,
+            &output_token);
+    
+  if (maj_stat != GSS_S_COMPLETE) {
+    response = gss_error(maj_stat, min_stat);
+    response->return_code = AUTH_GSS_ERROR;
+    goto end;
+  } else
+    ret = AUTH_GSS_COMPLETE;
+  // Grab the client response to send back to the server
+  if (output_token.length) {
+    state->response = base64_encode((const unsigned char *)output_token.value, output_token.length);;
+    maj_stat = gss_release_buffer(&min_stat, &output_token);
+  }
+end:
+  if (output_token.value)
+    gss_release_buffer(&min_stat, &output_token);
+
+  if(response == NULL) {
+    response = calloc(1, sizeof(gss_client_response));
+    response->return_code = ret;
+  }
+
+  // Return the response
+  return response;
+}
+
+int authenticate_gss_server_init(const char *service, gss_server_state *state)
+{
+    OM_uint32 maj_stat;
+    OM_uint32 min_stat;
+    gss_buffer_desc name_token = GSS_C_EMPTY_BUFFER;
+    int ret = AUTH_GSS_COMPLETE;
+    
+    state->context = GSS_C_NO_CONTEXT;
+    state->server_name = GSS_C_NO_NAME;
+    state->client_name = GSS_C_NO_NAME;
+    state->server_creds = GSS_C_NO_CREDENTIAL;
+    state->client_creds = GSS_C_NO_CREDENTIAL;
+    state->username = NULL;
+    state->targetname = NULL;
+    state->response = NULL;
+    
+    // Server name may be empty which means we aren't going to create our own creds
+    size_t service_len = strlen(service);
+    if (service_len != 0)
+    {
+        // Import server name first
+        name_token.length = strlen(service);
+        name_token.value = (char *)service;
+        
+        maj_stat = gss_import_name(&min_stat, &name_token, GSS_C_NT_HOSTBASED_SERVICE, &state->server_name);
+        
+        if (GSS_ERROR(maj_stat))
+        {
+            set_gss_error(maj_stat, min_stat);
+            ret = AUTH_GSS_ERROR;
+            goto end;
+        }
+        
+        // Get credentials
+        maj_stat = gss_acquire_cred(&min_stat, state->server_name, GSS_C_INDEFINITE,
+                                    GSS_C_NO_OID_SET, GSS_C_ACCEPT, &state->server_creds, NULL, NULL);
+        
+        if (GSS_ERROR(maj_stat))
+        {
+            set_gss_error(maj_stat, min_stat);
+            ret = AUTH_GSS_ERROR;
+            goto end;
+        }
+    }
+    
+end:
+    return ret;
+}
+
+int authenticate_gss_server_clean(gss_server_state *state)
+{
+    OM_uint32 maj_stat;
+    OM_uint32 min_stat;
+    int ret = AUTH_GSS_COMPLETE;
+    
+    if (state->context != GSS_C_NO_CONTEXT)
+        maj_stat = gss_delete_sec_context(&min_stat, &state->context, GSS_C_NO_BUFFER);
+    if (state->server_name != GSS_C_NO_NAME)
+        maj_stat = gss_release_name(&min_stat, &state->server_name);
+    if (state->client_name != GSS_C_NO_NAME)
+        maj_stat = gss_release_name(&min_stat, &state->client_name);
+    if (state->server_creds != GSS_C_NO_CREDENTIAL)
+        maj_stat = gss_release_cred(&min_stat, &state->server_creds);
+    if (state->client_creds != GSS_C_NO_CREDENTIAL)
+        maj_stat = gss_release_cred(&min_stat, &state->client_creds);
+    if (state->username != NULL)
+    {
+        free(state->username);
+        state->username = NULL;
+    }
+    if (state->targetname != NULL)
+    {
+        free(state->targetname);
+        state->targetname = NULL;
+    }
+    if (state->response != NULL)
+    {
+        free(state->response);
+        state->response = NULL;
+    }
+    
+    return ret;
+}
+
+/*int authenticate_gss_server_step(gss_server_state *state, const char *challenge)
+{
+    OM_uint32 maj_stat;
+    OM_uint32 min_stat;
+    gss_buffer_desc input_token = GSS_C_EMPTY_BUFFER;
+    gss_buffer_desc output_token = GSS_C_EMPTY_BUFFER;
+    int ret = AUTH_GSS_CONTINUE;
+    
+    // Always clear out the old response
+    if (state->response != NULL)
+    {
+        free(state->response);
+        state->response = NULL;
+    }
+    
+    // If there is a challenge (data from the server) we need to give it to GSS
+    if (challenge && *challenge)
+    {
+        int len;
+        input_token.value = base64_decode(challenge, &len);
+        input_token.length = len;
+    }
+    else
+    {
+        PyErr_SetString(KrbException_class, "No challenge parameter in request from client");
+        ret = AUTH_GSS_ERROR;
+        goto end;
+    }
+    
+    maj_stat = gss_accept_sec_context(&min_stat,
+                                      &state->context,
+                                      state->server_creds,
+                                      &input_token,
+                                      GSS_C_NO_CHANNEL_BINDINGS,
+                                      &state->client_name,
+                                      NULL,
+                                      &output_token,
+                                      NULL,
+                                      NULL,
+                                      &state->client_creds);
+    
+    if (GSS_ERROR(maj_stat))
+    {
+        set_gss_error(maj_stat, min_stat);
+        ret = AUTH_GSS_ERROR;
+        goto end;
+    }
+    
+    // Grab the server response to send back to the client
+    if (output_token.length)
+    {
+        state->response = base64_encode((const unsigned char *)output_token.value, output_token.length);;
+        maj_stat = gss_release_buffer(&min_stat, &output_token);
+    }
+    
+    // Get the user name
+    maj_stat = gss_display_name(&min_stat, state->client_name, &output_token, NULL);
+    if (GSS_ERROR(maj_stat))
+    {
+        set_gss_error(maj_stat, min_stat);
+        ret = AUTH_GSS_ERROR;
+        goto end;
+    }
+    state->username = (char *)malloc(output_token.length + 1);
+    strncpy(state->username, (char*) output_token.value, output_token.length);
+    state->username[output_token.length] = 0;
+    
+    // Get the target name if no server creds were supplied
+    if (state->server_creds == GSS_C_NO_CREDENTIAL)
+    {
+        gss_name_t target_name = GSS_C_NO_NAME;
+        maj_stat = gss_inquire_context(&min_stat, state->context, NULL, &target_name, NULL, NULL, NULL, NULL, NULL);
+        if (GSS_ERROR(maj_stat))
+        {
+            set_gss_error(maj_stat, min_stat);
+            ret = AUTH_GSS_ERROR;
+            goto end;
+        }
+        maj_stat = gss_display_name(&min_stat, target_name, &output_token, NULL);
+        if (GSS_ERROR(maj_stat))
+        {
+            set_gss_error(maj_stat, min_stat);
+            ret = AUTH_GSS_ERROR;
+            goto end;
+        }
+        state->targetname = (char *)malloc(output_token.length + 1);
+        strncpy(state->targetname, (char*) output_token.value, output_token.length);
+        state->targetname[output_token.length] = 0;
+    }
+
+    ret = AUTH_GSS_COMPLETE;
+    
+end:
+    if (output_token.length)
+        gss_release_buffer(&min_stat, &output_token);
+    if (input_token.value)
+        free(input_token.value);
+    return ret;
+}
+*/
+
+static void set_gss_error(OM_uint32 err_maj, OM_uint32 err_min) {
+  OM_uint32 maj_stat, min_stat;
+  OM_uint32 msg_ctx = 0;
+  gss_buffer_desc status_string;
+  char buf_maj[512];
+  char buf_min[512];
+  
+  do {
+    maj_stat = gss_display_status (&min_stat,
+                                   err_maj,
+                                   GSS_C_GSS_CODE,
+                                   GSS_C_NO_OID,
+                                   &msg_ctx,
+                                   &status_string);
+    if(GSS_ERROR(maj_stat))
+      break;
+    
+    strncpy(buf_maj, (char*) status_string.value, sizeof(buf_maj));
+    gss_release_buffer(&min_stat, &status_string);
+    
+    maj_stat = gss_display_status (&min_stat,
+                                   err_min,
+                                   GSS_C_MECH_CODE,
+                                   GSS_C_NULL_OID,
+                                   &msg_ctx,
+                                   &status_string);
+    if (!GSS_ERROR(maj_stat)) {
+
+      strncpy(buf_min, (char*) status_string.value , sizeof(buf_min));
+      gss_release_buffer(&min_stat, &status_string);
+    }
+  } while (!GSS_ERROR(maj_stat) && msg_ctx != 0);
+}
+
+gss_client_response *gss_error(OM_uint32 err_maj, OM_uint32 err_min) {
+  OM_uint32 maj_stat, min_stat;
+  OM_uint32 msg_ctx = 0;
+  gss_buffer_desc status_string;
+  char *buf_maj = calloc(512, sizeof(char));
+  char *buf_min = calloc(512, sizeof(char));
+  char *message = NULL;
+  gss_client_response *response = calloc(1, sizeof(gss_client_response));
+  
+  do {
+    maj_stat = gss_display_status (&min_stat,
+                                   err_maj,
+                                   GSS_C_GSS_CODE,
+                                   GSS_C_NO_OID,
+                                   &msg_ctx,
+                                   &status_string);
+    if(GSS_ERROR(maj_stat))
+      break;
+    
+    strncpy(buf_maj, (char*) status_string.value, 512);
+    gss_release_buffer(&min_stat, &status_string);
+    
+    maj_stat = gss_display_status (&min_stat,
+                                   err_min,
+                                   GSS_C_MECH_CODE,
+                                   GSS_C_NULL_OID,
+                                   &msg_ctx,
+                                   &status_string);
+    if(!GSS_ERROR(maj_stat)) {
+      strncpy(buf_min, (char*) status_string.value , 512);
+      gss_release_buffer(&min_stat, &status_string);
+    }
+  } while (!GSS_ERROR(maj_stat) && msg_ctx != 0);
+
+  // Join the strings
+  message = calloc(1024, sizeof(1));
+  // Join the two messages
+  sprintf(message, "%s, %s", buf_maj, buf_min);
+  // Free data
+  free(buf_min);
+  free(buf_maj);
+  // Set the message
+  response->message = message;
+  // Return the message
+  return response;
+}
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/kerberosgss.h b/node_modules/mongodb/node_modules/kerberos/lib/kerberosgss.h
new file mode 100644
index 0000000..58ac0b7
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/kerberosgss.h
@@ -0,0 +1,70 @@
+/**
+ * Copyright (c) 2006-2009 Apple Inc. All rights reserved.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ **/
+#ifndef KERBEROS_GSS_H
+#define KERBEROS_GSS_H
+
+#include <gssapi/gssapi.h>
+#include <gssapi/gssapi_generic.h>
+#include <gssapi/gssapi_krb5.h>
+
+#define krb5_get_err_text(context,code) error_message(code)
+
+#define AUTH_GSS_ERROR      -1
+#define AUTH_GSS_COMPLETE    1
+#define AUTH_GSS_CONTINUE    0
+
+#define GSS_AUTH_P_NONE         1
+#define GSS_AUTH_P_INTEGRITY    2
+#define GSS_AUTH_P_PRIVACY      4
+
+typedef struct {
+  int return_code;
+  char *message;
+} gss_client_response;
+
+typedef struct {
+  gss_ctx_id_t     context;
+  gss_name_t       server_name;
+  long int         gss_flags;
+  char*            username;
+  char*            response;
+} gss_client_state;
+
+typedef struct {
+  gss_ctx_id_t     context;
+  gss_name_t       server_name;
+  gss_name_t       client_name;
+  gss_cred_id_t    server_creds;
+  gss_cred_id_t    client_creds;
+  char*            username;
+  char*            targetname;
+  char*            response;
+} gss_server_state;
+
+// char* server_principal_details(const char* service, const char* hostname);
+
+gss_client_response *authenticate_gss_client_init(const char* service, long int gss_flags, gss_client_state* state);
+gss_client_response *authenticate_gss_client_clean(gss_client_state *state);
+gss_client_response *authenticate_gss_client_step(gss_client_state *state, const char *challenge);
+gss_client_response *authenticate_gss_client_unwrap(gss_client_state* state, const char* challenge);
+gss_client_response *authenticate_gss_client_wrap(gss_client_state* state, const char* challenge, const char* user);
+
+int authenticate_gss_server_init(const char* service, gss_server_state* state);
+int authenticate_gss_server_clean(gss_server_state *state);
+// int authenticate_gss_server_step(gss_server_state *state, const char *challenge);
+
+gss_client_response *gss_error(OM_uint32 err_maj, OM_uint32 err_min);
+#endif
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/sspi.js b/node_modules/mongodb/node_modules/kerberos/lib/sspi.js
new file mode 100644
index 0000000..d9120fb
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/sspi.js
@@ -0,0 +1,15 @@
+// Load the native SSPI classes
+var kerberos = require('../build/Release/kerberos')
+  , Kerberos = kerberos.Kerberos
+  , SecurityBuffer = require('./win32/wrappers/security_buffer').SecurityBuffer
+  , SecurityBufferDescriptor = require('./win32/wrappers/security_buffer_descriptor').SecurityBufferDescriptor
+  , SecurityCredentials = require('./win32/wrappers/security_credentials').SecurityCredentials
+  , SecurityContext = require('./win32/wrappers/security_context').SecurityContext;
+var SSPI = function() {
+}
+
+exports.SSPI = SSPI;
+exports.SecurityBuffer = SecurityBuffer;
+exports.SecurityBufferDescriptor = SecurityBufferDescriptor;
+exports.SecurityCredentials = SecurityCredentials;
+exports.SecurityContext = SecurityContext;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/base64.c b/node_modules/mongodb/node_modules/kerberos/lib/win32/base64.c
new file mode 100644
index 0000000..502a021
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/base64.c
@@ -0,0 +1,121 @@
+/**
+ * Copyright (c) 2006-2008 Apple Inc. All rights reserved.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ **/
+
+#include "base64.h"
+
+#include <stdlib.h>
+#include <string.h>
+
+// base64 tables
+static char basis_64[] =
+    "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+static signed char index_64[128] =
+{
+    -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1,
+    -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,-1,
+    -1,-1,-1,-1, -1,-1,-1,-1, -1,-1,-1,62, -1,-1,-1,63,
+    52,53,54,55, 56,57,58,59, 60,61,-1,-1, -1,-1,-1,-1,
+    -1, 0, 1, 2,  3, 4, 5, 6,  7, 8, 9,10, 11,12,13,14,
+    15,16,17,18, 19,20,21,22, 23,24,25,-1, -1,-1,-1,-1,
+    -1,26,27,28, 29,30,31,32, 33,34,35,36, 37,38,39,40,
+    41,42,43,44, 45,46,47,48, 49,50,51,-1, -1,-1,-1,-1
+};
+#define CHAR64(c)  (((c) < 0 || (c) > 127) ? -1 : index_64[(c)])
+
+// base64_encode    :    base64 encode
+//
+// value            :    data to encode
+// vlen             :    length of data
+// (result)         :    new char[] - c-str of result
+char *base64_encode(const unsigned char *value, int vlen)
+{
+    char *result = (char *)malloc((vlen * 4) / 3 + 5);
+    char *out = result;
+    unsigned char oval;
+
+    while (vlen >= 3)
+    {
+        *out++ = basis_64[value[0] >> 2];
+        *out++ = basis_64[((value[0] << 4) & 0x30) | (value[1] >> 4)];
+        *out++ = basis_64[((value[1] << 2) & 0x3C) | (value[2] >> 6)];
+        *out++ = basis_64[value[2] & 0x3F];
+        value += 3;
+        vlen -= 3;
+    }
+    if (vlen > 0)
+    {
+        *out++ = basis_64[value[0] >> 2];
+        oval = (value[0] << 4) & 0x30;
+        if (vlen > 1) oval |= value[1] >> 4;
+        *out++ = basis_64[oval];
+        *out++ = (vlen < 2) ? '=' : basis_64[(value[1] << 2) & 0x3C];
+        *out++ = '=';
+    }
+    *out = '\0';
+
+    return result;
+}
+
+// base64_decode    :    base64 decode
+//
+// value            :    c-str to decode
+// rlen             :    length of decoded result
+// (result)         :    new unsigned char[] - decoded result
+unsigned char *base64_decode(const char *value, int *rlen)
+{
+    int c1, c2, c3, c4;
+    int vlen = (int)strlen(value);
+    unsigned char *result =(unsigned char *)malloc((vlen * 3) / 4 + 1);
+    unsigned char *out = result;
+    *rlen = 0;
+
+    while (1)
+    {
+        if (value[0]==0)
+            return result;
+        c1 = value[0];
+        if (CHAR64(c1) == -1)
+            goto base64_decode_error;;
+        c2 = value[1];
+        if (CHAR64(c2) == -1)
+            goto base64_decode_error;;
+        c3 = value[2];
+        if ((c3 != '=') && (CHAR64(c3) == -1))
+            goto base64_decode_error;;
+        c4 = value[3];
+        if ((c4 != '=') && (CHAR64(c4) == -1))
+            goto base64_decode_error;;
+
+        value += 4;
+        *out++ = (CHAR64(c1) << 2) | (CHAR64(c2) >> 4);
+        *rlen += 1;
+        if (c3 != '=')
+        {
+            *out++ = ((CHAR64(c2) << 4) & 0xf0) | (CHAR64(c3) >> 2);
+            *rlen += 1;
+            if (c4 != '=')
+            {
+                *out++ = ((CHAR64(c3) << 6) & 0xc0) | CHAR64(c4);
+                *rlen += 1;
+            }
+        }
+    }
+
+base64_decode_error:
+    *result = 0;
+    *rlen = 0;
+    return result;
+}
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/base64.h b/node_modules/mongodb/node_modules/kerberos/lib/win32/base64.h
new file mode 100644
index 0000000..f0e1f06
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/base64.h
@@ -0,0 +1,18 @@
+/**
+ * Copyright (c) 2006-2008 Apple Inc. All rights reserved.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ **/
+
+char *base64_encode(const unsigned char *value, int vlen);
+unsigned char *base64_decode(const char *value, int *rlen);
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos.cc b/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos.cc
new file mode 100644
index 0000000..7fd521b
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos.cc
@@ -0,0 +1,53 @@
+#include "kerberos.h"
+#include <stdlib.h>
+#include <tchar.h>
+#include "base64.h"
+#include "wrappers/security_buffer.h"
+#include "wrappers/security_buffer_descriptor.h"
+#include "wrappers/security_context.h"
+#include "wrappers/security_credentials.h"
+
+Persistent<FunctionTemplate> Kerberos::constructor_template;
+
+// VException object (causes throw in calling code)
+static Handle<Value> VException(const char *msg) {
+  HandleScope scope;
+  return ThrowException(Exception::Error(String::New(msg)));
+}
+
+Kerberos::Kerberos() : ObjectWrap() {
+}
+
+void Kerberos::Initialize(v8::Handle<v8::Object> target) {
+  // Grab the scope of the call from Node
+  HandleScope scope;
+  // Define a new function template
+  Local<FunctionTemplate> t = FunctionTemplate::New(Kerberos::New);
+  constructor_template = Persistent<FunctionTemplate>::New(t);
+  constructor_template->InstanceTemplate()->SetInternalFieldCount(1);
+  constructor_template->SetClassName(String::NewSymbol("Kerberos"));
+  // Set the symbol
+  target->ForceSet(String::NewSymbol("Kerberos"), constructor_template->GetFunction());
+}
+
+Handle<Value> Kerberos::New(const Arguments &args) {
+  // Load the security.dll library
+  load_library();
+  // Create a Kerberos instance
+  Kerberos *kerberos = new Kerberos();
+  // Return the kerberos object
+  kerberos->Wrap(args.This());
+  return args.This();
+}
+
+// Exporting function
+extern "C" void init(Handle<Object> target) {
+  HandleScope scope;
+  Kerberos::Initialize(target);
+  SecurityContext::Initialize(target);
+  SecurityBuffer::Initialize(target);
+  SecurityBufferDescriptor::Initialize(target);
+  SecurityCredentials::Initialize(target);
+}
+
+NODE_MODULE(kerberos, init);
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos.h b/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos.h
new file mode 100644
index 0000000..8443e78
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos.h
@@ -0,0 +1,59 @@
+#ifndef KERBEROS_H
+#define KERBEROS_H
+
+#include <node.h>
+#include <node_object_wrap.h>
+#include <v8.h>
+
+extern "C" {
+  #include "kerberos_sspi.h"
+  #include "base64.h"
+}
+
+using namespace v8;
+using namespace node;
+
+class Kerberos : public ObjectWrap {
+
+public:
+  Kerberos();
+  ~Kerberos() {};
+
+  // Constructor used for creating new Kerberos objects from C++
+  static Persistent<FunctionTemplate> constructor_template;
+
+  // Initialize function for the object
+  static void Initialize(Handle<Object> target);
+
+  // Method available
+  static Handle<Value> AcquireAlternateCredentials(const Arguments &args);
+  static Handle<Value> PrepareOutboundPackage(const Arguments &args);
+  static Handle<Value> DecryptMessage(const Arguments &args);
+  static Handle<Value> EncryptMessage(const Arguments &args);
+  static Handle<Value> QueryContextAttributes(const Arguments &args);
+
+private:
+  static Handle<Value> New(const Arguments &args);  
+
+  // Pointer to context object
+  SEC_WINNT_AUTH_IDENTITY m_Identity;
+  // credentials
+  CredHandle m_Credentials;
+  // Expiry time for ticket
+  TimeStamp Expiration;
+  // package info
+  SecPkgInfo m_PkgInfo;
+  // context
+  CtxtHandle m_Context;
+  // Do we have a context
+  bool m_HaveContext;
+  // Attributes
+  DWORD CtxtAttr;
+
+  // Handles the uv calls
+  static void Process(uv_work_t* work_req);
+  // Called after work is done
+  static void After(uv_work_t* work_req);
+};
+
+#endif
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos_sspi.c b/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos_sspi.c
new file mode 100644
index 0000000..d75c9ab
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos_sspi.c
@@ -0,0 +1,244 @@
+#include "kerberos_sspi.h"
+#include <stdlib.h>
+#include <stdio.h>
+
+static HINSTANCE _sspi_security_dll = NULL; 
+static HINSTANCE _sspi_secur32_dll = NULL;
+
+/**
+ * Encrypt A Message
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_EncryptMessage(PCtxtHandle phContext, unsigned long fQOP, PSecBufferDesc pMessage, unsigned long MessageSeqNo) {
+  // Create function pointer instance
+  encryptMessage_fn pfn_encryptMessage = NULL;
+
+  // Return error if library not loaded
+  if(_sspi_security_dll == NULL) return -1;
+
+  // Map function to library method
+  pfn_encryptMessage = (encryptMessage_fn)GetProcAddress(_sspi_security_dll, "EncryptMessage");
+  // Check if the we managed to map function pointer
+  if(!pfn_encryptMessage) {
+    printf("GetProcAddress failed.\n");
+    return -2;
+  }
+
+  // Call the function
+  return (*pfn_encryptMessage)(phContext, fQOP, pMessage, MessageSeqNo);
+}
+
+/**
+ * Acquire Credentials
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_AcquireCredentialsHandle(
+  LPSTR pszPrincipal, LPSTR pszPackage, unsigned long fCredentialUse,
+  void * pvLogonId, void * pAuthData, SEC_GET_KEY_FN pGetKeyFn, void * pvGetKeyArgument,
+  PCredHandle phCredential, PTimeStamp ptsExpiry
+) {
+  SECURITY_STATUS     status;
+  // Create function pointer instance
+  acquireCredentialsHandle_fn pfn_acquireCredentialsHandle = NULL;
+
+  // Return error if library not loaded
+  if(_sspi_security_dll == NULL) return -1;
+
+  // Map function
+  #ifdef _UNICODE
+      pfn_acquireCredentialsHandle = (acquireCredentialsHandle_fn)GetProcAddress(_sspi_security_dll, "AcquireCredentialsHandleW");
+  #else
+      pfn_acquireCredentialsHandle = (acquireCredentialsHandle_fn)GetProcAddress(_sspi_security_dll, "AcquireCredentialsHandleA");
+  #endif
+
+  // Check if the we managed to map function pointer
+  if(!pfn_acquireCredentialsHandle) {
+    printf("GetProcAddress failed.\n");
+    return -2;
+  }
+
+  // Status
+  status = (*pfn_acquireCredentialsHandle)(pszPrincipal, pszPackage, fCredentialUse,
+      pvLogonId, pAuthData, pGetKeyFn, pvGetKeyArgument, phCredential, ptsExpiry
+    );
+
+  // Call the function
+  return status;
+}
+
+/**
+ * Delete Security Context
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_DeleteSecurityContext(PCtxtHandle phContext) {
+  // Create function pointer instance
+  deleteSecurityContext_fn pfn_deleteSecurityContext = NULL;
+
+  // Return error if library not loaded
+  if(_sspi_security_dll == NULL) return -1;
+  // Map function
+  pfn_deleteSecurityContext = (deleteSecurityContext_fn)GetProcAddress(_sspi_security_dll, "DeleteSecurityContext");
+
+  // Check if the we managed to map function pointer
+  if(!pfn_deleteSecurityContext) {
+    printf("GetProcAddress failed.\n");
+    return -2;
+  }
+
+  // Call the function
+  return (*pfn_deleteSecurityContext)(phContext);
+}
+
+/**
+ * Decrypt Message
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_DecryptMessage(PCtxtHandle phContext, PSecBufferDesc pMessage, unsigned long MessageSeqNo, unsigned long pfQOP) {
+  // Create function pointer instance
+  decryptMessage_fn pfn_decryptMessage = NULL;
+
+  // Return error if library not loaded
+  if(_sspi_security_dll == NULL) return -1;
+  // Map function
+  pfn_decryptMessage = (decryptMessage_fn)GetProcAddress(_sspi_security_dll, "DecryptMessage");
+
+  // Check if the we managed to map function pointer
+  if(!pfn_decryptMessage) {
+    printf("GetProcAddress failed.\n");
+    return -2;
+  }
+
+  // Call the function
+  return (*pfn_decryptMessage)(phContext, pMessage, MessageSeqNo, pfQOP);
+}
+
+/**
+ * Initialize Security Context
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_initializeSecurityContext(
+  PCredHandle phCredential, PCtxtHandle phContext,
+  LPSTR pszTargetName, unsigned long fContextReq, 
+  unsigned long Reserved1, unsigned long TargetDataRep, 
+  PSecBufferDesc pInput, unsigned long Reserved2,
+  PCtxtHandle phNewContext, PSecBufferDesc pOutput,
+  unsigned long * pfContextAttr, PTimeStamp ptsExpiry
+) {
+  SECURITY_STATUS status;
+  // Create function pointer instance
+  initializeSecurityContext_fn pfn_initializeSecurityContext = NULL;
+
+  // Return error if library not loaded
+  if(_sspi_security_dll == NULL) return -1;
+  
+  // Map function
+  #ifdef _UNICODE
+    pfn_initializeSecurityContext = (initializeSecurityContext_fn)GetProcAddress(_sspi_security_dll, "InitializeSecurityContextW");
+  #else
+    pfn_initializeSecurityContext = (initializeSecurityContext_fn)GetProcAddress(_sspi_security_dll, "InitializeSecurityContextA");
+  #endif
+
+  // Check if the we managed to map function pointer
+  if(!pfn_initializeSecurityContext) {
+    printf("GetProcAddress failed.\n");
+    return -2;
+  }
+
+  // Execute intialize context
+  status = (*pfn_initializeSecurityContext)(
+    phCredential, phContext, pszTargetName, fContextReq, 
+    Reserved1, TargetDataRep, pInput, Reserved2,
+    phNewContext, pOutput, pfContextAttr, ptsExpiry
+  );
+
+  // Call the function
+  return status;
+}
+/**
+ * Query Context Attributes
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_QueryContextAttributes(
+  PCtxtHandle phContext, unsigned long ulAttribute, void * pBuffer
+) {
+  // Create function pointer instance
+  queryContextAttributes_fn pfn_queryContextAttributes = NULL;
+
+  // Return error if library not loaded
+  if(_sspi_security_dll == NULL) return -1;
+
+  #ifdef _UNICODE
+    pfn_queryContextAttributes = (queryContextAttributes_fn)GetProcAddress(_sspi_security_dll, "QueryContextAttributesW");
+  #else
+    pfn_queryContextAttributes = (queryContextAttributes_fn)GetProcAddress(_sspi_security_dll, "QueryContextAttributesA");
+  #endif
+
+  // Check if the we managed to map function pointer
+  if(!pfn_queryContextAttributes) {
+    printf("GetProcAddress failed.\n");
+    return -2;
+  }
+
+  // Call the function
+  return (*pfn_queryContextAttributes)(
+    phContext, ulAttribute, pBuffer
+  );
+}
+
+/**
+ * InitSecurityInterface
+ */
+PSecurityFunctionTable _ssip_InitSecurityInterface() {
+  INIT_SECURITY_INTERFACE InitSecurityInterface;
+  PSecurityFunctionTable pSecurityInterface = NULL;
+
+  // Return error if library not loaded
+  if(_sspi_security_dll == NULL) return NULL;
+
+  #ifdef _UNICODE
+    // Get the address of the InitSecurityInterface function.
+    InitSecurityInterface = (INIT_SECURITY_INTERFACE) GetProcAddress (
+                                          _sspi_secur32_dll, 
+                                          TEXT("InitSecurityInterfaceW"));
+  #else
+    // Get the address of the InitSecurityInterface function.
+    InitSecurityInterface = (INIT_SECURITY_INTERFACE) GetProcAddress (
+                                          _sspi_secur32_dll, 
+                                          TEXT("InitSecurityInterfaceA"));
+  #endif
+
+  if(!InitSecurityInterface) {
+    printf (TEXT("Failed in getting the function address, Error: %x"), GetLastError ());
+    return NULL;
+  }
+
+  // Use InitSecurityInterface to get the function table.
+  pSecurityInterface = (*InitSecurityInterface)();
+
+  if(!pSecurityInterface) {
+    printf (TEXT("Failed in getting the function table, Error: %x"), GetLastError ());
+    return NULL;
+  }
+
+  return pSecurityInterface;
+}
+
+/**
+ * Load security.dll dynamically
+ */
+int load_library() {
+  DWORD err;
+  // Load the library
+  _sspi_security_dll = LoadLibrary("security.dll");
+
+  // Check if the library loaded
+  if(_sspi_security_dll == NULL) {
+    err = GetLastError();
+    return err;
+  }
+
+  // Load the library
+  _sspi_secur32_dll = LoadLibrary("secur32.dll");
+
+  // Check if the library loaded
+  if(_sspi_secur32_dll == NULL) {
+    err = GetLastError();
+    return err;
+  }
+
+  return 0;
+}
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos_sspi.h b/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos_sspi.h
new file mode 100644
index 0000000..a3008dc
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/kerberos_sspi.h
@@ -0,0 +1,106 @@
+#ifndef SSPI_C_H
+#define SSPI_C_H
+
+#define SECURITY_WIN32 1
+
+#include <windows.h>
+#include <sspi.h>
+
+/**
+ * Encrypt A Message
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_EncryptMessage(PCtxtHandle phContext, unsigned long fQOP, PSecBufferDesc pMessage, unsigned long MessageSeqNo);
+
+typedef DWORD (WINAPI *encryptMessage_fn)(PCtxtHandle phContext, ULONG fQOP, PSecBufferDesc pMessage, ULONG MessageSeqNo);  
+
+/**
+ * Acquire Credentials
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_AcquireCredentialsHandle(
+  LPSTR pszPrincipal,                 // Name of principal
+  LPSTR pszPackage,                   // Name of package
+  unsigned long fCredentialUse,       // Flags indicating use
+  void * pvLogonId,                   // Pointer to logon ID
+  void * pAuthData,                   // Package specific data
+  SEC_GET_KEY_FN pGetKeyFn,           // Pointer to GetKey() func
+  void * pvGetKeyArgument,            // Value to pass to GetKey()
+  PCredHandle phCredential,           // (out) Cred Handle
+  PTimeStamp ptsExpiry                // (out) Lifetime (optional)
+);
+
+typedef DWORD (WINAPI *acquireCredentialsHandle_fn)(
+    LPSTR pszPrincipal, LPSTR pszPackage, unsigned long fCredentialUse,
+    void * pvLogonId, void * pAuthData, SEC_GET_KEY_FN pGetKeyFn, void * pvGetKeyArgument,
+    PCredHandle phCredential, PTimeStamp ptsExpiry
+  );
+
+/**
+ * Delete Security Context
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_DeleteSecurityContext(
+  PCtxtHandle phContext               // Context to delete
+);
+
+typedef DWORD (WINAPI *deleteSecurityContext_fn)(PCtxtHandle phContext);  
+
+/**
+ * Decrypt Message
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_DecryptMessage(
+  PCtxtHandle phContext, 
+  PSecBufferDesc pMessage, 
+  unsigned long MessageSeqNo, 
+  unsigned long pfQOP
+);
+
+typedef DWORD (WINAPI *decryptMessage_fn)(
+  PCtxtHandle phContext, PSecBufferDesc pMessage, unsigned long MessageSeqNo, unsigned long pfQOP);
+
+/**
+ * Initialize Security Context
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_initializeSecurityContext(
+  PCredHandle phCredential,       // Cred to base context
+  PCtxtHandle phContext,          // Existing context (OPT)
+  LPSTR pszTargetName,            // Name of target
+  unsigned long fContextReq,      // Context Requirements
+  unsigned long Reserved1,        // Reserved, MBZ
+  unsigned long TargetDataRep,    // Data rep of target
+  PSecBufferDesc pInput,          // Input Buffers
+  unsigned long Reserved2,        // Reserved, MBZ
+  PCtxtHandle phNewContext,       // (out) New Context handle
+  PSecBufferDesc pOutput,         // (inout) Output Buffers
+  unsigned long * pfContextAttr,  // (out) Context attrs
+  PTimeStamp ptsExpiry            // (out) Life span (OPT)
+);
+
+typedef DWORD (WINAPI *initializeSecurityContext_fn)(
+  PCredHandle phCredential, PCtxtHandle phContext, LPSTR pszTargetName, unsigned long fContextReq, 
+  unsigned long Reserved1, unsigned long TargetDataRep, PSecBufferDesc pInput, unsigned long Reserved2,
+  PCtxtHandle phNewContext, PSecBufferDesc pOutput, unsigned long * pfContextAttr, PTimeStamp ptsExpiry);
+
+/**
+ * Query Context Attributes
+ */
+SECURITY_STATUS SEC_ENTRY _sspi_QueryContextAttributes(
+  PCtxtHandle phContext,          // Context to query
+  unsigned long ulAttribute,      // Attribute to query
+  void * pBuffer                  // Buffer for attributes
+);
+
+typedef DWORD (WINAPI *queryContextAttributes_fn)(
+  PCtxtHandle phContext, unsigned long ulAttribute, void * pBuffer);
+
+/**
+ * InitSecurityInterface
+ */
+PSecurityFunctionTable _ssip_InitSecurityInterface();
+
+typedef DWORD (WINAPI *initSecurityInterface_fn) ();
+
+/**
+ * Load security.dll dynamically
+ */
+int load_library();
+
+#endif
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/worker.cc b/node_modules/mongodb/node_modules/kerberos/lib/win32/worker.cc
new file mode 100644
index 0000000..e7a472f
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/worker.cc
@@ -0,0 +1,7 @@
+#include "worker.h"
+
+Worker::Worker() {
+}
+
+Worker::~Worker() {  
+}
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/worker.h b/node_modules/mongodb/node_modules/kerberos/lib/win32/worker.h
new file mode 100644
index 0000000..f73a4a7
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/worker.h
@@ -0,0 +1,37 @@
+#ifndef WORKER_H_
+#define WORKER_H_
+
+#include <node.h>
+#include <node_object_wrap.h>
+#include <v8.h>
+
+using namespace node;
+using namespace v8;
+
+class Worker {
+  public:
+    Worker();
+    virtual ~Worker();
+
+    // libuv's request struct.
+    uv_work_t request;
+    // Callback
+    v8::Persistent<v8::Function> callback;
+    // Parameters
+    void *parameters;
+    // Results
+    void *return_value;
+    // Did we raise an error
+    bool error;
+    // The error message
+    char *error_message;
+    // Error code if not message
+    int error_code;
+    // Any return code
+    int return_code;
+    // Method we are going to fire
+    void (*execute)(Worker *worker);
+    Handle<Value> (*mapper)(Worker *worker);
+};
+
+#endif  // WORKER_H_
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer.cc b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer.cc
new file mode 100644
index 0000000..e583336
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer.cc
@@ -0,0 +1,110 @@
+#include <assert.h>
+#include <string.h>
+#include <stdlib.h>
+#include <v8.h>
+#include <node.h>
+#include <node_buffer.h>
+#include <cstring>
+#include <cmath>
+#include <cstdlib>
+#include <iostream>
+#include <limits>
+
+#include "security_buffer.h"
+
+using namespace node;
+
+static Handle<Value> VException(const char *msg) {
+  HandleScope scope;
+  return ThrowException(Exception::Error(String::New(msg)));
+};
+
+Persistent<FunctionTemplate> SecurityBuffer::constructor_template;
+
+SecurityBuffer::SecurityBuffer(uint32_t security_type, size_t size) : ObjectWrap() {
+  this->size = size;
+  this->data = calloc(size, sizeof(char));
+  this->security_type = security_type;
+  // Set up the data in the sec_buffer
+  this->sec_buffer.BufferType = security_type;
+  this->sec_buffer.cbBuffer = (unsigned long)size;
+  this->sec_buffer.pvBuffer = this->data;  
+}
+
+SecurityBuffer::SecurityBuffer(uint32_t security_type, size_t size, void *data) : ObjectWrap() {
+  this->size = size;
+  this->data = data;
+  this->security_type = security_type;
+  // Set up the data in the sec_buffer
+  this->sec_buffer.BufferType = security_type;
+  this->sec_buffer.cbBuffer = (unsigned long)size;
+  this->sec_buffer.pvBuffer = this->data;  
+}
+
+SecurityBuffer::~SecurityBuffer() {
+  free(this->data);
+}
+
+Handle<Value> SecurityBuffer::New(const Arguments &args) {
+  HandleScope scope;  
+  SecurityBuffer *security_obj;
+
+  if(args.Length() != 2)
+    return VException("Two parameters needed integer buffer type and  [32 bit integer/Buffer] required");
+
+  if(!args[0]->IsInt32())
+    return VException("Two parameters needed integer buffer type and  [32 bit integer/Buffer] required");
+
+  if(!args[1]->IsInt32() && !Buffer::HasInstance(args[1]))
+    return VException("Two parameters needed integer buffer type and  [32 bit integer/Buffer] required");
+
+  // Unpack buffer type
+  uint32_t buffer_type = args[0]->ToUint32()->Value();
+
+  // If we have an integer
+  if(args[1]->IsInt32()) {
+    security_obj = new SecurityBuffer(buffer_type, args[1]->ToUint32()->Value());
+  } else {
+    // Get the length of the Buffer
+    size_t length = Buffer::Length(args[1]->ToObject());
+    // Allocate space for the internal void data pointer
+    void *data = calloc(length, sizeof(char));
+    // Write the data to out of V8 heap space
+    memcpy(data, Buffer::Data(args[1]->ToObject()), length);
+    // Create new SecurityBuffer
+    security_obj = new SecurityBuffer(buffer_type, length, data);
+  }
+  
+  // Wrap it
+  security_obj->Wrap(args.This());
+  // Return the object
+  return args.This();    
+}
+
+Handle<Value> SecurityBuffer::ToBuffer(const Arguments &args) {
+  HandleScope scope; 
+
+  // Unpack the Security Buffer object
+  SecurityBuffer *security_obj = ObjectWrap::Unwrap<SecurityBuffer>(args.This());
+  // Create a Buffer
+  Buffer *buffer = Buffer::New((char *)security_obj->data, (size_t)security_obj->size);
+
+  // Return the buffer
+  return scope.Close(buffer->handle_);  
+}
+
+void SecurityBuffer::Initialize(Handle<Object> target) {
+  // Grab the scope of the call from Node
+  HandleScope scope;
+  // Define a new function template
+  Local<FunctionTemplate> t = FunctionTemplate::New(New);
+  constructor_template = Persistent<FunctionTemplate>::New(t);
+  constructor_template->InstanceTemplate()->SetInternalFieldCount(1);
+  constructor_template->SetClassName(String::NewSymbol("SecurityBuffer"));
+
+  // Set up method for the Kerberos instance
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "toBuffer", ToBuffer);
+ 
+  // Set up class
+  target->Set(String::NewSymbol("SecurityBuffer"), constructor_template->GetFunction());  
+}
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer.h b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer.h
new file mode 100644
index 0000000..d6a5675
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer.h
@@ -0,0 +1,46 @@
+#ifndef SECURITY_BUFFER_H
+#define SECURITY_BUFFER_H
+
+#include <node.h>
+#include <node_object_wrap.h>
+#include <v8.h>
+
+#define SECURITY_WIN32 1
+
+#include <windows.h>
+#include <sspi.h>
+
+using namespace v8;
+using namespace node;
+
+class SecurityBuffer : public ObjectWrap {  
+  public:    
+    SecurityBuffer(uint32_t security_type, size_t size);
+    SecurityBuffer(uint32_t security_type, size_t size, void *data);
+    ~SecurityBuffer();    
+
+    // Internal values
+    void *data;
+    size_t size;
+    uint32_t security_type;
+    SecBuffer sec_buffer;
+
+    // Has instance check
+    static inline bool HasInstance(Handle<Value> val) {
+      if (!val->IsObject()) return false;
+      Local<Object> obj = val->ToObject();
+      return constructor_template->HasInstance(obj);
+    };
+
+    // Functions available from V8
+    static void Initialize(Handle<Object> target);    
+    static Handle<Value> ToBuffer(const Arguments &args);
+
+    // Constructor used for creating new Long objects from C++
+    static Persistent<FunctionTemplate> constructor_template;
+    
+  private:
+    static Handle<Value> New(const Arguments &args);
+};
+
+#endif
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer.js b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer.js
new file mode 100644
index 0000000..4996163
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer.js
@@ -0,0 +1,12 @@
+var SecurityBufferNative = require('../../../build/Release/kerberos').SecurityBuffer;
+
+// Add some attributes
+SecurityBufferNative.VERSION  = 0;
+SecurityBufferNative.EMPTY    = 0;
+SecurityBufferNative.DATA     = 1;
+SecurityBufferNative.TOKEN    = 2;
+SecurityBufferNative.PADDING  = 9;
+SecurityBufferNative.STREAM   = 10;
+
+// Export the modified class
+exports.SecurityBuffer = SecurityBufferNative;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer_descriptor.cc b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer_descriptor.cc
new file mode 100644
index 0000000..3bda0b7
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer_descriptor.cc
@@ -0,0 +1,177 @@
+#include <assert.h>
+#include <string.h>
+#include <stdlib.h>
+#include <v8.h>
+#include <node.h>
+#include <node_buffer.h>
+#include <cstring>
+#include <cmath>
+#include <cstdlib>
+#include <iostream>
+#include <limits>
+
+#define SECURITY_WIN32 1
+
+#include "security_buffer_descriptor.h"
+#include "security_buffer.h"
+
+static Handle<Value> VException(const char *msg) {
+  HandleScope scope;
+  return ThrowException(Exception::Error(String::New(msg)));
+};
+
+Persistent<FunctionTemplate> SecurityBufferDescriptor::constructor_template;
+
+SecurityBufferDescriptor::SecurityBufferDescriptor() : ObjectWrap() {
+}
+
+SecurityBufferDescriptor::SecurityBufferDescriptor(Persistent<Array> arrayObject) : ObjectWrap() {
+  SecurityBuffer *security_obj = NULL;
+  // Safe reference to array
+  this->arrayObject = arrayObject;
+
+  // Unpack the array and ensure we have a valid descriptor
+  this->secBufferDesc.cBuffers = arrayObject->Length();
+  this->secBufferDesc.ulVersion = SECBUFFER_VERSION;
+
+  if(arrayObject->Length() == 1) {
+    // Unwrap  the buffer
+    security_obj = ObjectWrap::Unwrap<SecurityBuffer>(arrayObject->Get(0)->ToObject());
+    // Assign the buffer
+    this->secBufferDesc.pBuffers = &security_obj->sec_buffer;
+  } else {
+    this->secBufferDesc.pBuffers = new SecBuffer[arrayObject->Length()];
+    this->secBufferDesc.cBuffers = arrayObject->Length();
+    
+    // Assign the buffers
+    for(uint32_t i = 0; i < arrayObject->Length(); i++) {
+      security_obj = ObjectWrap::Unwrap<SecurityBuffer>(arrayObject->Get(i)->ToObject());
+      this->secBufferDesc.pBuffers[i].BufferType = security_obj->sec_buffer.BufferType;
+      this->secBufferDesc.pBuffers[i].pvBuffer = security_obj->sec_buffer.pvBuffer;
+      this->secBufferDesc.pBuffers[i].cbBuffer = security_obj->sec_buffer.cbBuffer;
+    }
+  }
+}
+
+SecurityBufferDescriptor::~SecurityBufferDescriptor() {
+}
+
+size_t SecurityBufferDescriptor::bufferSize() {
+  SecurityBuffer *security_obj = NULL;
+
+  if(this->secBufferDesc.cBuffers == 1) {
+    security_obj = ObjectWrap::Unwrap<SecurityBuffer>(arrayObject->Get(0)->ToObject());
+    return security_obj->size;
+  } else {
+    int bytesToAllocate = 0;
+
+    for(unsigned int i = 0; i < this->secBufferDesc.cBuffers; i++) {
+      bytesToAllocate += this->secBufferDesc.pBuffers[i].cbBuffer;
+    }
+
+    // Return total size
+    return bytesToAllocate;
+  }
+}
+
+char *SecurityBufferDescriptor::toBuffer() {
+  SecurityBuffer *security_obj = NULL;
+  char *data = NULL;
+
+  if(this->secBufferDesc.cBuffers == 1) {
+    security_obj = ObjectWrap::Unwrap<SecurityBuffer>(arrayObject->Get(0)->ToObject());
+    data = (char *)malloc(security_obj->size * sizeof(char));
+    memcpy(data, security_obj->data, security_obj->size);
+  } else {
+    size_t bytesToAllocate = this->bufferSize();
+    char *data = (char *)calloc(bytesToAllocate, sizeof(char));
+    int offset = 0;
+
+    for(unsigned int i = 0; i < this->secBufferDesc.cBuffers; i++) {
+      memcpy((data + offset), this->secBufferDesc.pBuffers[i].pvBuffer, this->secBufferDesc.pBuffers[i].cbBuffer);
+      offset +=this->secBufferDesc.pBuffers[i].cbBuffer;
+    }
+
+    // Return the data
+    return data;
+  }
+
+  return data;
+}
+
+Handle<Value> SecurityBufferDescriptor::New(const Arguments &args) {
+  HandleScope scope;  
+  SecurityBufferDescriptor *security_obj;
+  Persistent<Array> arrayObject;
+
+  if(args.Length() != 1)
+    return VException("There must be 1 argument passed in where the first argument is a [int32 or an Array of SecurityBuffers]");
+
+  if(!args[0]->IsInt32() && !args[0]->IsArray())
+    return VException("There must be 1 argument passed in where the first argument is a [int32 or an Array of SecurityBuffers]");
+
+  if(args[0]->IsArray()) {
+    Handle<Array> array = Handle<Array>::Cast(args[0]);
+    // Iterate over all items and ensure we the right type
+    for(uint32_t i = 0; i < array->Length(); i++) {
+      if(!SecurityBuffer::HasInstance(array->Get(i))) {
+        return VException("There must be 1 argument passed in where the first argument is a [int32 or an Array of SecurityBuffers]");
+      }
+    }
+  }
+
+  // We have a single integer
+  if(args[0]->IsInt32()) {
+    // Create new SecurityBuffer instance
+    Local<Value> argv[] = {Int32::New(0x02), args[0]};
+    Handle<Value> security_buffer = SecurityBuffer::constructor_template->GetFunction()->NewInstance(2, argv);    
+    // Create a new array
+    Local<Array> array = Array::New(1);
+    // Set the first value
+    array->Set(0, security_buffer);
+    // Create persistent handle
+    arrayObject = Persistent<Array>::New(array);
+    // Create descriptor
+    security_obj = new SecurityBufferDescriptor(arrayObject);
+  } else {
+    arrayObject = Persistent<Array>::New(Handle<Array>::Cast(args[0]));
+    security_obj = new SecurityBufferDescriptor(arrayObject);
+  }
+
+  // Wrap it
+  security_obj->Wrap(args.This());
+  // Return the object
+  return args.This();    
+}
+
+Handle<Value> SecurityBufferDescriptor::ToBuffer(const Arguments &args) {
+  HandleScope scope; 
+
+  // Unpack the Security Buffer object
+  SecurityBufferDescriptor *security_obj = ObjectWrap::Unwrap<SecurityBufferDescriptor>(args.This());
+
+  // Get the buffer
+  char *buffer_data = security_obj->toBuffer();
+  size_t buffer_size = security_obj->bufferSize();
+
+  // Create a Buffer
+  Buffer *buffer = Buffer::New(buffer_data, buffer_size);
+
+  // Return the buffer
+  return scope.Close(buffer->handle_);  
+}
+
+void SecurityBufferDescriptor::Initialize(Handle<Object> target) {
+  // Grab the scope of the call from Node
+  HandleScope scope;
+  // Define a new function template
+  Local<FunctionTemplate> t = FunctionTemplate::New(New);
+  constructor_template = Persistent<FunctionTemplate>::New(t);
+  constructor_template->InstanceTemplate()->SetInternalFieldCount(1);
+  constructor_template->SetClassName(String::NewSymbol("SecurityBufferDescriptor"));
+
+  // Set up method for the Kerberos instance
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "toBuffer", ToBuffer);
+
+  target->Set(String::NewSymbol("SecurityBufferDescriptor"), constructor_template->GetFunction());
+}
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer_descriptor.h b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer_descriptor.h
new file mode 100644
index 0000000..8588632
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer_descriptor.h
@@ -0,0 +1,44 @@
+#ifndef SECURITY_BUFFER_DESCRIPTOR_H
+#define SECURITY_BUFFER_DESCRIPTOR_H
+
+#include <node.h>
+#include <node_object_wrap.h>
+#include <v8.h>
+
+#include <windows.h>
+#include <sspi.h>
+
+using namespace v8;
+using namespace node;
+
+class SecurityBufferDescriptor : public ObjectWrap {  
+  public:    
+    Persistent<Array> arrayObject;
+    SecBufferDesc secBufferDesc;
+    
+    SecurityBufferDescriptor();
+    SecurityBufferDescriptor(Persistent<Array> arrayObject);
+    ~SecurityBufferDescriptor();    
+
+    // Has instance check
+    static inline bool HasInstance(Handle<Value> val) {
+      if (!val->IsObject()) return false;
+      Local<Object> obj = val->ToObject();
+      return constructor_template->HasInstance(obj);
+    };
+
+    char *toBuffer();
+    size_t bufferSize();
+
+    // Functions available from V8
+    static void Initialize(Handle<Object> target);    
+    static Handle<Value> ToBuffer(const Arguments &args);
+
+    // Constructor used for creating new Long objects from C++
+    static Persistent<FunctionTemplate> constructor_template;
+    
+  private:
+    static Handle<Value> New(const Arguments &args);
+};
+
+#endif
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer_descriptor.js b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer_descriptor.js
new file mode 100644
index 0000000..9421392
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_buffer_descriptor.js
@@ -0,0 +1,3 @@
+var SecurityBufferDescriptorNative = require('../../../build/Release/kerberos').SecurityBufferDescriptor;
+// Export the modified class
+exports.SecurityBufferDescriptor = SecurityBufferDescriptorNative;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_context.cc b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_context.cc
new file mode 100644
index 0000000..8c3691a
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_context.cc
@@ -0,0 +1,1211 @@
+#include <assert.h>
+#include <string.h>
+#include <stdlib.h>
+#include <v8.h>
+#include <node.h>
+#include <node_buffer.h>
+#include <cstring>
+#include <cmath>
+#include <cstdlib>
+#include <iostream>
+#include <limits>
+
+#include "security_context.h"
+#include "security_buffer_descriptor.h"
+
+#ifndef ARRAY_SIZE
+# define ARRAY_SIZE(a) (sizeof((a)) / sizeof((a)[0]))
+#endif
+
+static LPSTR DisplaySECError(DWORD ErrCode);
+
+static Handle<Value> VException(const char *msg) {
+  HandleScope scope;
+  return ThrowException(Exception::Error(String::New(msg)));
+};
+
+static Handle<Value> VExceptionErrNo(const char *msg, const int errorNumber) {
+  HandleScope scope;
+
+  Local<Value> err = Exception::Error(String::New(msg));
+  Local<Object> obj = err->ToObject();
+  obj->Set(NODE_PSYMBOL("code"), Int32::New(errorNumber));
+  return ThrowException(err);
+};
+
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+// UV Lib callbacks
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+static void Process(uv_work_t* work_req) {
+  // Grab the worker
+  Worker *worker = static_cast<Worker*>(work_req->data);
+  // Execute the worker code
+  worker->execute(worker);
+}
+
+static void After(uv_work_t* work_req) {
+  // Grab the scope of the call from Node
+  v8::HandleScope scope;
+
+  // Get the worker reference
+  Worker *worker = static_cast<Worker*>(work_req->data);
+
+  // If we have an error
+  if(worker->error) {
+    v8::Local<v8::Value> err = v8::Exception::Error(v8::String::New(worker->error_message));
+    Local<Object> obj = err->ToObject();
+    obj->Set(NODE_PSYMBOL("code"), Int32::New(worker->error_code));
+    v8::Local<v8::Value> args[2] = { err, v8::Local<v8::Value>::New(v8::Null()) };
+    // Execute the error
+    v8::TryCatch try_catch;
+    // Call the callback
+    worker->callback->Call(v8::Context::GetCurrent()->Global(), ARRAY_SIZE(args), args);
+    // If we have an exception handle it as a fatalexception
+    if (try_catch.HasCaught()) {
+      node::FatalException(try_catch);
+    }
+  } else {
+    // // Map the data
+    v8::Handle<v8::Value> result = worker->mapper(worker);
+    // Set up the callback with a null first
+    v8::Handle<v8::Value> args[2] = { v8::Local<v8::Value>::New(v8::Null()), result};
+    // Wrap the callback function call in a TryCatch so that we can call
+    // node's FatalException afterwards. This makes it possible to catch
+    // the exception from JavaScript land using the
+    // process.on('uncaughtException') event.
+    v8::TryCatch try_catch;
+    // Call the callback
+    worker->callback->Call(v8::Context::GetCurrent()->Global(), ARRAY_SIZE(args), args);
+    // If we have an exception handle it as a fatalexception
+    if (try_catch.HasCaught()) {
+      node::FatalException(try_catch);
+    }
+  }
+
+  // Clean up the memory
+  worker->callback.Dispose();
+  free(worker->parameters);
+  delete worker;
+}
+
+Persistent<FunctionTemplate> SecurityContext::constructor_template;
+
+SecurityContext::SecurityContext() : ObjectWrap() {
+}
+
+SecurityContext::~SecurityContext() {
+  if(this->hasContext) {
+    _sspi_DeleteSecurityContext(&this->m_Context);
+  }
+}
+
+Handle<Value> SecurityContext::New(const Arguments &args) {
+  HandleScope scope;    
+
+  PSecurityFunctionTable pSecurityInterface = NULL;
+  DWORD dwNumOfPkgs;
+  SECURITY_STATUS status;
+
+  // Create code object
+  SecurityContext *security_obj = new SecurityContext();
+  // Get security table interface
+  pSecurityInterface = _ssip_InitSecurityInterface();
+  // Call the security interface
+  status = (*pSecurityInterface->EnumerateSecurityPackages)(
+                                                    &dwNumOfPkgs, 
+                                                    &security_obj->m_PkgInfo);
+  if(status != SEC_E_OK) {
+    printf(TEXT("Failed in retrieving security packages, Error: %x"), GetLastError());
+    return VException("Failed in retrieving security packages");
+  }
+
+  // Wrap it
+  security_obj->Wrap(args.This());
+  // Return the object
+  return args.This();    
+}
+
+Handle<Value> SecurityContext::InitializeContextSync(const Arguments &args) {
+  HandleScope scope;  
+  char *service_principal_name_str = NULL, *input_str = NULL, *decoded_input_str = NULL;
+  BYTE *out_bound_data_str = NULL;
+  int decoded_input_str_length = NULL;
+  // Store reference to security credentials
+  SecurityCredentials *security_credentials = NULL;
+  // Status of operation
+  SECURITY_STATUS status;
+
+  // We need 3 parameters
+  if(args.Length() != 3)
+    return VException("Initialize must be called with either [credential:SecurityCredential, servicePrincipalName:string, input:string]");
+
+  // First parameter must be an instance of SecurityCredentials
+  if(!SecurityCredentials::HasInstance(args[0]))
+    return VException("First parameter for Initialize must be an instance of SecurityCredentials");
+
+  // Second parameter must be a string
+  if(!args[1]->IsString())
+    return VException("Second parameter for Initialize must be a string");
+
+  // Third parameter must be a base64 encoded string
+  if(!args[2]->IsString())
+    return VException("Second parameter for Initialize must be a string");
+
+  // Let's unpack the values
+  Local<String> service_principal_name = args[1]->ToString();
+  service_principal_name_str = (char *)calloc(service_principal_name->Utf8Length() + 1, sizeof(char));
+  service_principal_name->WriteUtf8(service_principal_name_str);
+
+  // Unpack the user name
+  Local<String> input = args[2]->ToString();
+
+  if(input->Utf8Length() > 0) {
+    input_str = (char *)calloc(input->Utf8Length() + 1, sizeof(char));
+    input->WriteUtf8(input_str);
+
+    // Now let's get the base64 decoded string
+    decoded_input_str = (char *)base64_decode(input_str, &decoded_input_str_length);
+  }
+
+  // Unpack the Security credentials
+  security_credentials = ObjectWrap::Unwrap<SecurityCredentials>(args[0]->ToObject());
+
+  // Create Security context instance
+  Local<Object> security_context_value = constructor_template->GetFunction()->NewInstance();
+  // Unwrap the security context
+  SecurityContext *security_context = ObjectWrap::Unwrap<SecurityContext>(security_context_value);
+  // Add a reference to the security_credentials
+  security_context->security_credentials = security_credentials;
+
+  // Structures used for c calls
+  SecBufferDesc ibd, obd;
+  SecBuffer ib, ob;
+
+  // 
+  // Prepare data structure for returned data from SSPI
+  ob.BufferType = SECBUFFER_TOKEN;
+  ob.cbBuffer = security_context->m_PkgInfo->cbMaxToken;
+  // Allocate space for return data
+  out_bound_data_str = new BYTE[ob.cbBuffer + sizeof(DWORD)];
+  ob.pvBuffer = out_bound_data_str;
+  // prepare buffer description
+  obd.cBuffers  = 1;
+  obd.ulVersion = SECBUFFER_VERSION;
+  obd.pBuffers  = &ob;
+
+  //
+  // Prepare the data we are passing to the SSPI method
+  if(input->Utf8Length() > 0) {
+    ib.BufferType = SECBUFFER_TOKEN;
+    ib.cbBuffer   = decoded_input_str_length;
+    ib.pvBuffer   = decoded_input_str;
+    // prepare buffer description
+    ibd.cBuffers  = 1;
+    ibd.ulVersion = SECBUFFER_VERSION;
+    ibd.pBuffers  = &ib;    
+  }
+
+  // Perform initialization step
+  status = _sspi_initializeSecurityContext(
+      &security_credentials->m_Credentials
+    , NULL
+    , const_cast<TCHAR*>(service_principal_name_str)
+    , 0x02  // MUTUAL
+    , 0
+    , 0     // Network
+    , input->Utf8Length() > 0 ? &ibd : NULL
+    , 0
+    , &security_context->m_Context
+    , &obd
+    , &security_context->CtxtAttr
+    , &security_context->Expiration
+  );
+
+  // If we have a ok or continue let's prepare the result
+  if(status == SEC_E_OK 
+    || status == SEC_I_COMPLETE_NEEDED
+    || status == SEC_I_CONTINUE_NEEDED
+    || status == SEC_I_COMPLETE_AND_CONTINUE
+  ) {
+    security_context->hasContext = true;
+    security_context->payload = base64_encode((const unsigned char *)ob.pvBuffer, ob.cbBuffer);
+  } else {
+    LPSTR err_message = DisplaySECError(status);
+
+    if(err_message != NULL) {
+      return VExceptionErrNo(err_message, status);
+    } else {
+      return VExceptionErrNo("Unknown error", status);
+    }
+  }
+
+  // Return security context
+  return scope.Close(security_context_value);
+}
+
+//
+//  Async InitializeContext
+//
+typedef struct SecurityContextStaticInitializeCall {
+  char *service_principal_name_str;
+  char *decoded_input_str;
+  int decoded_input_str_length;
+  SecurityContext *context;
+} SecurityContextStaticInitializeCall;
+
+static void _initializeContext(Worker *worker) {
+  // Status of operation
+  SECURITY_STATUS status;
+  BYTE *out_bound_data_str = NULL;
+  SecurityContextStaticInitializeCall *call = (SecurityContextStaticInitializeCall *)worker->parameters;
+
+  // Structures used for c calls
+  SecBufferDesc ibd, obd;
+  SecBuffer ib, ob;
+
+  // 
+  // Prepare data structure for returned data from SSPI
+  ob.BufferType = SECBUFFER_TOKEN;
+  ob.cbBuffer = call->context->m_PkgInfo->cbMaxToken;
+  // Allocate space for return data
+  out_bound_data_str = new BYTE[ob.cbBuffer + sizeof(DWORD)];
+  ob.pvBuffer = out_bound_data_str;
+  // prepare buffer description
+  obd.cBuffers  = 1;
+  obd.ulVersion = SECBUFFER_VERSION;
+  obd.pBuffers  = &ob;
+
+  //
+  // Prepare the data we are passing to the SSPI method
+  if(call->decoded_input_str_length > 0) {
+    ib.BufferType = SECBUFFER_TOKEN;
+    ib.cbBuffer   = call->decoded_input_str_length;
+    ib.pvBuffer   = call->decoded_input_str;
+    // prepare buffer description
+    ibd.cBuffers  = 1;
+    ibd.ulVersion = SECBUFFER_VERSION;
+    ibd.pBuffers  = &ib;    
+  }
+
+  // Perform initialization step
+  status = _sspi_initializeSecurityContext(
+      &call->context->security_credentials->m_Credentials
+    , NULL
+    , const_cast<TCHAR*>(call->service_principal_name_str)
+    , 0x02  // MUTUAL
+    , 0
+    , 0     // Network
+    , call->decoded_input_str_length > 0 ? &ibd : NULL
+    , 0
+    , &call->context->m_Context
+    , &obd
+    , &call->context->CtxtAttr
+    , &call->context->Expiration
+  );
+
+  // If we have a ok or continue let's prepare the result
+  if(status == SEC_E_OK 
+    || status == SEC_I_COMPLETE_NEEDED
+    || status == SEC_I_CONTINUE_NEEDED
+    || status == SEC_I_COMPLETE_AND_CONTINUE
+  ) {
+    call->context->hasContext = true;
+    call->context->payload = base64_encode((const unsigned char *)ob.pvBuffer, ob.cbBuffer);
+
+    // Set the context
+    worker->return_code = status;
+    worker->return_value = call->context;
+  } else {
+    worker->error = TRUE;
+    worker->error_code = status;
+    worker->error_message = DisplaySECError(status);
+  }
+
+  // Clean up data
+  if(call->decoded_input_str != NULL) free(call->decoded_input_str);
+  if(call->service_principal_name_str != NULL) free(call->service_principal_name_str);
+}
+
+static Handle<Value> _map_initializeContext(Worker *worker) {
+  HandleScope scope;
+
+  // Unwrap the security context
+  SecurityContext *context = (SecurityContext *)worker->return_value;
+  // Return the value
+  return scope.Close(context->handle_);
+}
+
+Handle<Value> SecurityContext::InitializeContext(const Arguments &args) {
+  HandleScope scope;  
+  char *service_principal_name_str = NULL, *input_str = NULL, *decoded_input_str = NULL;
+  int decoded_input_str_length = NULL;
+  // Store reference to security credentials
+  SecurityCredentials *security_credentials = NULL;
+
+  // We need 3 parameters
+  if(args.Length() != 4)
+    return VException("Initialize must be called with [credential:SecurityCredential, servicePrincipalName:string, input:string, callback:function]");
+
+  // First parameter must be an instance of SecurityCredentials
+  if(!SecurityCredentials::HasInstance(args[0]))
+    return VException("First parameter for Initialize must be an instance of SecurityCredentials");
+
+  // Second parameter must be a string
+  if(!args[1]->IsString())
+    return VException("Second parameter for Initialize must be a string");
+
+  // Third parameter must be a base64 encoded string
+  if(!args[2]->IsString())
+    return VException("Second parameter for Initialize must be a string");
+
+  // Third parameter must be a callback
+  if(!args[3]->IsFunction())
+    return VException("Third parameter for Initialize must be a callback function");
+
+  // Let's unpack the values
+  Local<String> service_principal_name = args[1]->ToString();
+  service_principal_name_str = (char *)calloc(service_principal_name->Utf8Length() + 1, sizeof(char));
+  service_principal_name->WriteUtf8(service_principal_name_str);
+
+  // Unpack the user name
+  Local<String> input = args[2]->ToString();
+
+  if(input->Utf8Length() > 0) {
+    input_str = (char *)calloc(input->Utf8Length() + 1, sizeof(char));
+    input->WriteUtf8(input_str);
+
+    // Now let's get the base64 decoded string
+    decoded_input_str = (char *)base64_decode(input_str, &decoded_input_str_length);
+    // Free original allocation
+    free(input_str);
+  }
+
+  // Unpack the Security credentials
+  security_credentials = ObjectWrap::Unwrap<SecurityCredentials>(args[0]->ToObject());
+  // Create Security context instance
+  Local<Object> security_context_value = constructor_template->GetFunction()->NewInstance();
+  // Unwrap the security context
+  SecurityContext *security_context = ObjectWrap::Unwrap<SecurityContext>(security_context_value);
+  // Add a reference to the security_credentials
+  security_context->security_credentials = security_credentials;
+
+  // Build the call function
+  SecurityContextStaticInitializeCall *call = (SecurityContextStaticInitializeCall *)calloc(1, sizeof(SecurityContextStaticInitializeCall));
+  call->context = security_context;
+  call->decoded_input_str = decoded_input_str;
+  call->decoded_input_str_length = decoded_input_str_length;
+  call->service_principal_name_str = service_principal_name_str;
+
+  // Callback
+  Local<Function> callback = Local<Function>::Cast(args[3]);
+
+  // Let's allocate some space
+  Worker *worker = new Worker();
+  worker->error = false;
+  worker->request.data = worker;
+  worker->callback = Persistent<Function>::New(callback);
+  worker->parameters = call;
+  worker->execute = _initializeContext;
+  worker->mapper = _map_initializeContext;
+
+  // Schedule the worker with lib_uv
+  uv_queue_work(uv_default_loop(), &worker->request, Process, (uv_after_work_cb)After);
+
+  // Return no value
+  return scope.Close(Undefined());  
+}
+
+Handle<Value> SecurityContext::PayloadGetter(Local<String> property, const AccessorInfo& info) {
+  HandleScope scope;
+  // Unpack the context object
+  SecurityContext *context = ObjectWrap::Unwrap<SecurityContext>(info.Holder());
+  // Return the low bits
+  return scope.Close(String::New(context->payload));
+}
+
+Handle<Value> SecurityContext::HasContextGetter(Local<String> property, const AccessorInfo& info) {
+  HandleScope scope;
+  // Unpack the context object
+  SecurityContext *context = ObjectWrap::Unwrap<SecurityContext>(info.Holder());
+  // Return the low bits
+  return scope.Close(Boolean::New(context->hasContext));  
+}
+
+//
+//  Async InitializeContextStep
+//
+typedef struct SecurityContextStepStaticInitializeCall {
+  char *service_principal_name_str;
+  char *decoded_input_str;
+  int decoded_input_str_length;
+  SecurityContext *context;
+} SecurityContextStepStaticInitializeCall;
+
+static void _initializeContextStep(Worker *worker) {
+  // Outbound data array
+  BYTE *out_bound_data_str = NULL;
+  // Status of operation
+  SECURITY_STATUS status;
+  // Unpack data
+  SecurityContextStepStaticInitializeCall *call = (SecurityContextStepStaticInitializeCall *)worker->parameters;
+  SecurityContext *context = call->context;
+  // Structures used for c calls
+  SecBufferDesc ibd, obd;
+  SecBuffer ib, ob;
+
+  // 
+  // Prepare data structure for returned data from SSPI
+  ob.BufferType = SECBUFFER_TOKEN;
+  ob.cbBuffer = context->m_PkgInfo->cbMaxToken;
+  // Allocate space for return data
+  out_bound_data_str = new BYTE[ob.cbBuffer + sizeof(DWORD)];
+  ob.pvBuffer = out_bound_data_str;
+  // prepare buffer description
+  obd.cBuffers  = 1;
+  obd.ulVersion = SECBUFFER_VERSION;
+  obd.pBuffers  = &ob;
+
+  //
+  // Prepare the data we are passing to the SSPI method
+  if(call->decoded_input_str_length > 0) {
+    ib.BufferType = SECBUFFER_TOKEN;
+    ib.cbBuffer   = call->decoded_input_str_length;
+    ib.pvBuffer   = call->decoded_input_str;
+    // prepare buffer description
+    ibd.cBuffers  = 1;
+    ibd.ulVersion = SECBUFFER_VERSION;
+    ibd.pBuffers  = &ib;    
+  }
+
+  // Perform initialization step
+  status = _sspi_initializeSecurityContext(
+      &context->security_credentials->m_Credentials
+    , context->hasContext == true ? &context->m_Context : NULL
+    , const_cast<TCHAR*>(call->service_principal_name_str)
+    , 0x02  // MUTUAL
+    , 0
+    , 0     // Network
+    , call->decoded_input_str_length ? &ibd : NULL
+    , 0
+    , &context->m_Context
+    , &obd
+    , &context->CtxtAttr
+    , &context->Expiration
+  );
+
+  // If we have a ok or continue let's prepare the result
+  if(status == SEC_E_OK 
+    || status == SEC_I_COMPLETE_NEEDED
+    || status == SEC_I_CONTINUE_NEEDED
+    || status == SEC_I_COMPLETE_AND_CONTINUE
+  ) {
+    // Set the new payload
+    if(context->payload != NULL) free(context->payload);
+    context->payload = base64_encode((const unsigned char *)ob.pvBuffer, ob.cbBuffer);
+    worker->return_code = status;
+    worker->return_value = context;
+  } else {
+    worker->error = TRUE;
+    worker->error_code = status;
+    worker->error_message = DisplaySECError(status);
+  }
+
+  // Clean up data
+  if(call->decoded_input_str != NULL) free(call->decoded_input_str);
+  if(call->service_principal_name_str != NULL) free(call->service_principal_name_str);
+}
+
+static Handle<Value> _map_initializeContextStep(Worker *worker) {
+  HandleScope scope;
+  // Unwrap the security context
+  SecurityContext *context = (SecurityContext *)worker->return_value;
+  // Return the value
+  return scope.Close(context->handle_);
+}
+
+Handle<Value> SecurityContext::InitalizeStep(const Arguments &args) {
+  HandleScope scope;
+
+  char *service_principal_name_str = NULL, *input_str = NULL, *decoded_input_str = NULL;
+  int decoded_input_str_length = NULL;
+
+  // We need 3 parameters
+  if(args.Length() != 3)
+    return VException("Initialize must be called with [servicePrincipalName:string, input:string, callback:function]");
+
+  // Second parameter must be a string
+  if(!args[0]->IsString())
+    return VException("First parameter for Initialize must be a string");
+
+  // Third parameter must be a base64 encoded string
+  if(!args[1]->IsString())
+    return VException("Second parameter for Initialize must be a string");
+
+  // Third parameter must be a base64 encoded string
+  if(!args[2]->IsFunction())
+    return VException("Third parameter for Initialize must be a callback function");
+
+  // Let's unpack the values
+  Local<String> service_principal_name = args[0]->ToString();
+  service_principal_name_str = (char *)calloc(service_principal_name->Utf8Length() + 1, sizeof(char));
+  service_principal_name->WriteUtf8(service_principal_name_str);
+
+  // Unpack the user name
+  Local<String> input = args[1]->ToString();
+
+  if(input->Utf8Length() > 0) {
+    input_str = (char *)calloc(input->Utf8Length() + 1, sizeof(char));
+    input->WriteUtf8(input_str);
+    // Now let's get the base64 decoded string
+    decoded_input_str = (char *)base64_decode(input_str, &decoded_input_str_length);
+    // Free input string
+    free(input_str);
+  }
+
+  // Unwrap the security context
+  SecurityContext *security_context = ObjectWrap::Unwrap<SecurityContext>(args.This());
+
+  // Create call structure
+  SecurityContextStepStaticInitializeCall *call = (SecurityContextStepStaticInitializeCall *)calloc(1, sizeof(SecurityContextStepStaticInitializeCall));
+  call->context = security_context;
+  call->decoded_input_str = decoded_input_str;
+  call->decoded_input_str_length = decoded_input_str_length;
+  call->service_principal_name_str = service_principal_name_str;
+
+  // Callback
+  Local<Function> callback = Local<Function>::Cast(args[2]);
+
+  // Let's allocate some space
+  Worker *worker = new Worker();
+  worker->error = false;
+  worker->request.data = worker;
+  worker->callback = Persistent<Function>::New(callback);
+  worker->parameters = call;
+  worker->execute = _initializeContextStep;
+  worker->mapper = _map_initializeContextStep;
+
+  // Schedule the worker with lib_uv
+  uv_queue_work(uv_default_loop(), &worker->request, Process, (uv_after_work_cb)After);
+
+  // Return undefined
+  return scope.Close(Undefined());  
+}
+
+Handle<Value> SecurityContext::InitalizeStepSync(const Arguments &args) {
+  HandleScope scope;
+
+  char *service_principal_name_str = NULL, *input_str = NULL, *decoded_input_str = NULL;
+  BYTE *out_bound_data_str = NULL;
+  int decoded_input_str_length = NULL;
+  // Status of operation
+  SECURITY_STATUS status;
+
+  // We need 3 parameters
+  if(args.Length() != 2)
+    return VException("Initialize must be called with [servicePrincipalName:string, input:string]");
+
+  // Second parameter must be a string
+  if(!args[0]->IsString())
+    return VException("First parameter for Initialize must be a string");
+
+  // Third parameter must be a base64 encoded string
+  if(!args[1]->IsString())
+    return VException("Second parameter for Initialize must be a string");
+
+  // Let's unpack the values
+  Local<String> service_principal_name = args[0]->ToString();
+  service_principal_name_str = (char *)calloc(service_principal_name->Utf8Length() + 1, sizeof(char));
+  service_principal_name->WriteUtf8(service_principal_name_str);
+
+  // Unpack the user name
+  Local<String> input = args[1]->ToString();
+
+  if(input->Utf8Length() > 0) {
+    input_str = (char *)calloc(input->Utf8Length() + 1, sizeof(char));
+    input->WriteUtf8(input_str);
+    // Now let's get the base64 decoded string
+    decoded_input_str = (char *)base64_decode(input_str, &decoded_input_str_length);
+  }
+
+  // Unpack the long object
+  SecurityContext *security_context = ObjectWrap::Unwrap<SecurityContext>(args.This());  
+  SecurityCredentials *security_credentials = security_context->security_credentials;
+
+  // Structures used for c calls
+  SecBufferDesc ibd, obd;
+  SecBuffer ib, ob;
+
+  // 
+  // Prepare data structure for returned data from SSPI
+  ob.BufferType = SECBUFFER_TOKEN;
+  ob.cbBuffer = security_context->m_PkgInfo->cbMaxToken;
+  // Allocate space for return data
+  out_bound_data_str = new BYTE[ob.cbBuffer + sizeof(DWORD)];
+  ob.pvBuffer = out_bound_data_str;
+  // prepare buffer description
+  obd.cBuffers  = 1;
+  obd.ulVersion = SECBUFFER_VERSION;
+  obd.pBuffers  = &ob;
+
+  //
+  // Prepare the data we are passing to the SSPI method
+  if(input->Utf8Length() > 0) {
+    ib.BufferType = SECBUFFER_TOKEN;
+    ib.cbBuffer   = decoded_input_str_length;
+    ib.pvBuffer   = decoded_input_str;
+    // prepare buffer description
+    ibd.cBuffers  = 1;
+    ibd.ulVersion = SECBUFFER_VERSION;
+    ibd.pBuffers  = &ib;    
+  }
+
+  // Perform initialization step
+  status = _sspi_initializeSecurityContext(
+      &security_credentials->m_Credentials
+    , security_context->hasContext == true ? &security_context->m_Context : NULL
+    , const_cast<TCHAR*>(service_principal_name_str)
+    , 0x02  // MUTUAL
+    , 0
+    , 0     // Network
+    , input->Utf8Length() > 0 ? &ibd : NULL
+    , 0
+    , &security_context->m_Context
+    , &obd
+    , &security_context->CtxtAttr
+    , &security_context->Expiration
+  );
+
+  // If we have a ok or continue let's prepare the result
+  if(status == SEC_E_OK 
+    || status == SEC_I_COMPLETE_NEEDED
+    || status == SEC_I_CONTINUE_NEEDED
+    || status == SEC_I_COMPLETE_AND_CONTINUE
+  ) {
+    // Set the new payload
+    if(security_context->payload != NULL) free(security_context->payload);
+    security_context->payload = base64_encode((const unsigned char *)ob.pvBuffer, ob.cbBuffer);
+  } else {
+    LPSTR err_message = DisplaySECError(status);
+
+    if(err_message != NULL) {
+      return VExceptionErrNo(err_message, status);
+    } else {
+      return VExceptionErrNo("Unknown error", status);
+    }
+  }
+
+  return scope.Close(Null());
+}
+
+//
+//  Async EncryptMessage
+//
+typedef struct SecurityContextEncryptMessageCall {
+  SecurityContext *context;
+  SecurityBufferDescriptor *descriptor;
+  unsigned long flags;
+} SecurityContextEncryptMessageCall;
+
+static void _encryptMessage(Worker *worker) {
+  SECURITY_STATUS status;
+  // Unpack call
+  SecurityContextEncryptMessageCall *call = (SecurityContextEncryptMessageCall *)worker->parameters;
+  // Unpack the security context
+  SecurityContext *context = call->context;
+  SecurityBufferDescriptor *descriptor = call->descriptor;
+
+  // Let's execute encryption
+  status = _sspi_EncryptMessage(
+      &context->m_Context
+    , call->flags
+    , &descriptor->secBufferDesc
+    , 0
+  );
+
+  // We've got ok
+  if(status == SEC_E_OK) {
+    int bytesToAllocate = (int)descriptor->bufferSize();    
+    // Free up existing payload
+    if(context->payload != NULL) free(context->payload);
+    // Save the payload
+    context->payload = base64_encode((unsigned char *)descriptor->toBuffer(), bytesToAllocate);
+    // Set result
+    worker->return_code = status;
+    worker->return_value = context;
+  } else {
+    worker->error = TRUE;
+    worker->error_code = status;
+    worker->error_message = DisplaySECError(status);
+  }
+}
+
+static Handle<Value> _map_encryptMessage(Worker *worker) {
+  HandleScope scope;
+  // Unwrap the security context
+  SecurityContext *context = (SecurityContext *)worker->return_value;
+  // Return the value
+  return scope.Close(context->handle_);
+}
+
+Handle<Value> SecurityContext::EncryptMessage(const Arguments &args) {
+  HandleScope scope;
+
+  if(args.Length() != 3)
+    return VException("EncryptMessage takes an instance of SecurityBufferDescriptor, an integer flag and a callback function");  
+  if(!SecurityBufferDescriptor::HasInstance(args[0]))
+    return VException("EncryptMessage takes an instance of SecurityBufferDescriptor, an integer flag and a callback function");  
+  if(!args[1]->IsUint32())
+    return VException("EncryptMessage takes an instance of SecurityBufferDescriptor, an integer flag and a callback function");  
+  if(!args[2]->IsFunction())
+    return VException("EncryptMessage takes an instance of SecurityBufferDescriptor, an integer flag and a callback function");  
+
+  // Unpack the security context
+  SecurityContext *security_context = ObjectWrap::Unwrap<SecurityContext>(args.This());
+
+  // Unpack the descriptor
+  SecurityBufferDescriptor *descriptor = ObjectWrap::Unwrap<SecurityBufferDescriptor>(args[0]->ToObject());
+
+  // Create call structure
+  SecurityContextEncryptMessageCall *call = (SecurityContextEncryptMessageCall *)calloc(1, sizeof(SecurityContextEncryptMessageCall));
+  call->context = security_context;
+  call->descriptor = descriptor;
+  call->flags = (unsigned long)args[1]->ToInteger()->Value();
+
+  // Callback
+  Local<Function> callback = Local<Function>::Cast(args[2]);
+
+  // Let's allocate some space
+  Worker *worker = new Worker();
+  worker->error = false;
+  worker->request.data = worker;
+  worker->callback = Persistent<Function>::New(callback);
+  worker->parameters = call;
+  worker->execute = _encryptMessage;
+  worker->mapper = _map_encryptMessage;
+
+  // Schedule the worker with lib_uv
+  uv_queue_work(uv_default_loop(), &worker->request, Process, (uv_after_work_cb)After);
+
+  // Return undefined
+  return scope.Close(Undefined());  
+}
+
+Handle<Value> SecurityContext::EncryptMessageSync(const Arguments &args) {
+  HandleScope scope;
+  SECURITY_STATUS status;
+
+  if(args.Length() != 2)
+    return VException("EncryptMessageSync takes an instance of SecurityBufferDescriptor and an integer flag");  
+  if(!SecurityBufferDescriptor::HasInstance(args[0]))
+    return VException("EncryptMessageSync takes an instance of SecurityBufferDescriptor and an integer flag");  
+  if(!args[1]->IsUint32())
+    return VException("EncryptMessageSync takes an instance of SecurityBufferDescriptor and an integer flag");  
+
+  // Unpack the security context
+  SecurityContext *security_context = ObjectWrap::Unwrap<SecurityContext>(args.This());
+
+  // Unpack the descriptor
+  SecurityBufferDescriptor *descriptor = ObjectWrap::Unwrap<SecurityBufferDescriptor>(args[0]->ToObject());
+
+  // Let's execute encryption
+  status = _sspi_EncryptMessage(
+      &security_context->m_Context
+    , (unsigned long)args[1]->ToInteger()->Value()
+    , &descriptor->secBufferDesc
+    , 0
+  );
+
+  // We've got ok
+  if(status == SEC_E_OK) {
+    int bytesToAllocate = (int)descriptor->bufferSize();    
+    // Free up existing payload
+    if(security_context->payload != NULL) free(security_context->payload);
+    // Save the payload
+    security_context->payload = base64_encode((unsigned char *)descriptor->toBuffer(), bytesToAllocate);
+  } else {
+    LPSTR err_message = DisplaySECError(status);
+
+    if(err_message != NULL) {
+      return VExceptionErrNo(err_message, status);
+    } else {
+      return VExceptionErrNo("Unknown error", status);
+    }
+  }
+
+  return scope.Close(Null());
+}
+
+//
+//  Async DecryptMessage
+//
+typedef struct SecurityContextDecryptMessageCall {
+  SecurityContext *context;
+  SecurityBufferDescriptor *descriptor;
+} SecurityContextDecryptMessageCall;
+
+static void _decryptMessage(Worker *worker) {
+  unsigned long quality = 0;
+  SECURITY_STATUS status;
+  
+  // Unpack parameters
+  SecurityContextDecryptMessageCall *call = (SecurityContextDecryptMessageCall *)worker->parameters;
+  SecurityContext *context = call->context;
+  SecurityBufferDescriptor *descriptor = call->descriptor;
+
+  // Let's execute encryption
+  status = _sspi_DecryptMessage(
+      &context->m_Context
+    , &descriptor->secBufferDesc
+    , 0
+    , (unsigned long)&quality
+  );
+
+  // We've got ok
+  if(status == SEC_E_OK) {
+    int bytesToAllocate = (int)descriptor->bufferSize();    
+    // Free up existing payload
+    if(context->payload != NULL) free(context->payload);
+    // Save the payload
+    context->payload = base64_encode((unsigned char *)descriptor->toBuffer(), bytesToAllocate);
+    // Set return values
+    worker->return_code = status;
+    worker->return_value = context;
+  } else {
+    worker->error = TRUE;
+    worker->error_code = status;
+    worker->error_message = DisplaySECError(status);
+  }
+}
+
+static Handle<Value> _map_decryptMessage(Worker *worker) {
+  HandleScope scope;
+  // Unwrap the security context
+  SecurityContext *context = (SecurityContext *)worker->return_value;
+  // Return the value
+  return scope.Close(context->handle_);
+}
+
+Handle<Value> SecurityContext::DecryptMessage(const Arguments &args) {
+  HandleScope scope;
+
+  if(args.Length() != 2)
+    return VException("DecryptMessage takes an instance of SecurityBufferDescriptor and a callback function");
+  if(!SecurityBufferDescriptor::HasInstance(args[0]))
+    return VException("DecryptMessage takes an instance of SecurityBufferDescriptor and a callback function");
+  if(!args[1]->IsFunction())
+    return VException("DecryptMessage takes an instance of SecurityBufferDescriptor and a callback function");
+
+  // Unpack the security context
+  SecurityContext *security_context = ObjectWrap::Unwrap<SecurityContext>(args.This());
+  // Unpack the descriptor
+  SecurityBufferDescriptor *descriptor = ObjectWrap::Unwrap<SecurityBufferDescriptor>(args[0]->ToObject());
+  // Create call structure
+  SecurityContextDecryptMessageCall *call = (SecurityContextDecryptMessageCall *)calloc(1, sizeof(SecurityContextDecryptMessageCall));
+  call->context = security_context;
+  call->descriptor = descriptor;
+
+  // Callback
+  Local<Function> callback = Local<Function>::Cast(args[1]);
+
+  // Let's allocate some space
+  Worker *worker = new Worker();
+  worker->error = false;
+  worker->request.data = worker;
+  worker->callback = Persistent<Function>::New(callback);
+  worker->parameters = call;
+  worker->execute = _decryptMessage;
+  worker->mapper = _map_decryptMessage;
+
+  // Schedule the worker with lib_uv
+  uv_queue_work(uv_default_loop(), &worker->request, Process, (uv_after_work_cb)After);
+
+  // Return undefined
+  return scope.Close(Undefined());  
+}
+
+Handle<Value> SecurityContext::DecryptMessageSync(const Arguments &args) {
+  HandleScope scope;
+  unsigned long quality = 0;
+  SECURITY_STATUS status;
+
+  if(args.Length() != 1)
+    return VException("DecryptMessageSync takes an instance of SecurityBufferDescriptor");
+  if(!SecurityBufferDescriptor::HasInstance(args[0]))
+    return VException("DecryptMessageSync takes an instance of SecurityBufferDescriptor");
+
+  // Unpack the security context
+  SecurityContext *security_context = ObjectWrap::Unwrap<SecurityContext>(args.This());
+
+  // Unpack the descriptor
+  SecurityBufferDescriptor *descriptor = ObjectWrap::Unwrap<SecurityBufferDescriptor>(args[0]->ToObject());
+
+  // Let's execute encryption
+  status = _sspi_DecryptMessage(
+      &security_context->m_Context
+    , &descriptor->secBufferDesc
+    , 0
+    , (unsigned long)&quality
+  );
+
+  // We've got ok
+  if(status == SEC_E_OK) {
+    int bytesToAllocate = (int)descriptor->bufferSize();    
+    // Free up existing payload
+    if(security_context->payload != NULL) free(security_context->payload);
+    // Save the payload
+    security_context->payload = base64_encode((unsigned char *)descriptor->toBuffer(), bytesToAllocate);
+  } else {
+    LPSTR err_message = DisplaySECError(status);
+
+    if(err_message != NULL) {
+      return VExceptionErrNo(err_message, status);
+    } else {
+      return VExceptionErrNo("Unknown error", status);
+    }
+  }
+
+  return scope.Close(Null());
+}
+
+//
+//  Async QueryContextAttributes
+//
+typedef struct SecurityContextQueryContextAttributesCall {
+  SecurityContext *context;
+  uint32_t attribute;
+} SecurityContextQueryContextAttributesCall;
+
+static void _queryContextAttributes(Worker *worker) {
+  SECURITY_STATUS status;
+
+  // Cast to data structure
+  SecurityContextQueryContextAttributesCall *call = (SecurityContextQueryContextAttributesCall *)worker->parameters;  
+
+  // Allocate some space
+  SecPkgContext_Sizes *sizes = (SecPkgContext_Sizes *)calloc(1, sizeof(SecPkgContext_Sizes));
+  // Let's grab the query context attribute
+  status = _sspi_QueryContextAttributes(
+    &call->context->m_Context,
+    call->attribute,
+    sizes
+  );  
+  
+  if(status == SEC_E_OK) {
+    worker->return_code = status;
+    worker->return_value = sizes;
+  } else {
+    worker->error = TRUE;
+    worker->error_code = status;
+    worker->error_message = DisplaySECError(status);
+  }
+}
+
+static Handle<Value> _map_queryContextAttributes(Worker *worker) {
+  HandleScope scope;
+
+  // Cast to data structure
+  SecurityContextQueryContextAttributesCall *call = (SecurityContextQueryContextAttributesCall *)worker->parameters;  
+  // Unpack the attribute
+  uint32_t attribute = call->attribute;
+
+  // Convert data
+  if(attribute == SECPKG_ATTR_SIZES) {
+    SecPkgContext_Sizes *sizes = (SecPkgContext_Sizes *)worker->return_value;
+    // Create object
+    Local<Object> value = Object::New();
+    value->Set(String::New("maxToken"), Integer::New(sizes->cbMaxToken));
+    value->Set(String::New("maxSignature"), Integer::New(sizes->cbMaxSignature));
+    value->Set(String::New("blockSize"), Integer::New(sizes->cbBlockSize));
+    value->Set(String::New("securityTrailer"), Integer::New(sizes->cbSecurityTrailer));
+    return scope.Close(value);
+  }
+
+  // Return the value
+  return scope.Close(Null());
+}
+
+Handle<Value> SecurityContext::QueryContextAttributes(const Arguments &args) {
+  HandleScope scope;
+
+  if(args.Length() != 2)
+    return VException("QueryContextAttributesSync method takes a an integer Attribute specifier and a callback function");
+  if(!args[0]->IsInt32())
+    return VException("QueryContextAttributes method takes a an integer Attribute specifier and a callback function");
+  if(!args[1]->IsFunction())
+    return VException("QueryContextAttributes method takes a an integer Attribute specifier and a callback function");
+
+  // Unpack the security context
+  SecurityContext *security_context = ObjectWrap::Unwrap<SecurityContext>(args.This());
+
+  // Unpack the int value
+  uint32_t attribute = args[0]->ToInt32()->Value();  
+
+  // Check that we have a supported attribute
+  if(attribute != SECPKG_ATTR_SIZES) 
+    return VException("QueryContextAttributes only supports the SECPKG_ATTR_SIZES attribute");
+
+  // Create call structure
+  SecurityContextQueryContextAttributesCall *call = (SecurityContextQueryContextAttributesCall *)calloc(1, sizeof(SecurityContextQueryContextAttributesCall));
+  call->attribute = attribute;
+  call->context = security_context;
+
+  // Callback
+  Local<Function> callback = Local<Function>::Cast(args[1]);
+
+  // Let's allocate some space
+  Worker *worker = new Worker();
+  worker->error = false;
+  worker->request.data = worker;
+  worker->callback = Persistent<Function>::New(callback);
+  worker->parameters = call;
+  worker->execute = _queryContextAttributes;
+  worker->mapper = _map_queryContextAttributes;
+
+  // Schedule the worker with lib_uv
+  uv_queue_work(uv_default_loop(), &worker->request, Process, (uv_after_work_cb)After);
+
+  // Return undefined
+  return scope.Close(Undefined());  
+}
+
+Handle<Value> SecurityContext::QueryContextAttributesSync(const Arguments &args) {
+  HandleScope scope;
+  SECURITY_STATUS status;
+
+  if(args.Length() != 1)
+    return VException("QueryContextAttributesSync method takes a an integer Attribute specifier");
+  if(!args[0]->IsInt32())
+    return VException("QueryContextAttributesSync method takes a an integer Attribute specifier");
+
+  // Unpack the security context
+  SecurityContext *security_context = ObjectWrap::Unwrap<SecurityContext>(args.This());
+  uint32_t attribute = args[0]->ToInt32()->Value();
+
+  if(attribute != SECPKG_ATTR_SIZES) 
+    return VException("QueryContextAttributes only supports the SECPKG_ATTR_SIZES attribute");
+
+  // Check what attribute we are asking for
+  if(attribute == SECPKG_ATTR_SIZES) {
+    SecPkgContext_Sizes sizes;
+
+    // Let's grab the query context attribute
+    status = _sspi_QueryContextAttributes(
+      &security_context->m_Context,
+      attribute,
+      &sizes
+    );  
+    
+    if(status == SEC_E_OK) {
+      Local<Object> value = Object::New();
+      value->Set(String::New("maxToken"), Integer::New(sizes.cbMaxToken));
+      value->Set(String::New("maxSignature"), Integer::New(sizes.cbMaxSignature));
+      value->Set(String::New("blockSize"), Integer::New(sizes.cbBlockSize));
+      value->Set(String::New("securityTrailer"), Integer::New(sizes.cbSecurityTrailer));
+      return scope.Close(value);
+    } else {
+      LPSTR err_message = DisplaySECError(status);
+
+      if(err_message != NULL) {
+        return VExceptionErrNo(err_message, status);
+      } else {
+        return VExceptionErrNo("Unknown error", status);
+      }      
+    }
+  }
+
+  return scope.Close(Null());
+}
+
+void SecurityContext::Initialize(Handle<Object> target) {
+  // Grab the scope of the call from Node
+  HandleScope scope;
+  // Define a new function template
+  Local<FunctionTemplate> t = FunctionTemplate::New(New);
+  constructor_template = Persistent<FunctionTemplate>::New(t);
+  constructor_template->InstanceTemplate()->SetInternalFieldCount(1);
+  constructor_template->SetClassName(String::NewSymbol("SecurityContext"));
+
+  // Class methods
+  NODE_SET_METHOD(constructor_template, "initializeSync", InitializeContextSync);
+  NODE_SET_METHOD(constructor_template, "initialize", InitializeContext);
+  
+  // Set up method for the instance
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "initializeSync", InitalizeStepSync);
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "initialize", InitalizeStep);
+
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "decryptMessageSync", DecryptMessageSync);
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "decryptMessage", DecryptMessage);
+
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "queryContextAttributesSync", QueryContextAttributesSync);
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "queryContextAttributes", QueryContextAttributes);
+
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "encryptMessageSync", EncryptMessageSync);
+  NODE_SET_PROTOTYPE_METHOD(constructor_template, "encryptMessage", EncryptMessage);
+
+  // Getters for correct serialization of the object  
+  constructor_template->InstanceTemplate()->SetAccessor(String::NewSymbol("payload"), PayloadGetter);
+  // Getters for correct serialization of the object  
+  constructor_template->InstanceTemplate()->SetAccessor(String::NewSymbol("hasContext"), HasContextGetter);
+
+  // Set template class name
+  target->Set(String::NewSymbol("SecurityContext"), constructor_template->GetFunction());  
+}
+
+static LPSTR DisplaySECError(DWORD ErrCode) {
+  LPSTR pszName = NULL; // WinError.h
+
+  switch(ErrCode) {
+    case SEC_E_BUFFER_TOO_SMALL:
+      pszName = "SEC_E_BUFFER_TOO_SMALL - The message buffer is too small. Used with the Digest SSP.";
+      break;
+
+    case SEC_E_CRYPTO_SYSTEM_INVALID:
+      pszName = "SEC_E_CRYPTO_SYSTEM_INVALID - The cipher chosen for the security context is not supported. Used with the Digest SSP."; 
+      break;
+    case SEC_E_INCOMPLETE_MESSAGE:
+      pszName = "SEC_E_INCOMPLETE_MESSAGE - The data in the input buffer is incomplete. The application needs to read more data from the server and call DecryptMessageSync (General) again."; 
+      break;
+
+    case SEC_E_INVALID_HANDLE:
+      pszName = "SEC_E_INVALID_HANDLE - A context handle that is not valid was specified in the phContext parameter. Used with the Digest and Schannel SSPs."; 
+      break;
+
+    case SEC_E_INVALID_TOKEN:
+      pszName = "SEC_E_INVALID_TOKEN - The buffers are of the wrong type or no buffer of type SECBUFFER_DATA was found. Used with the Schannel SSP."; 
+      break;
+        
+    case SEC_E_MESSAGE_ALTERED:
+      pszName = "SEC_E_MESSAGE_ALTERED - The message has been altered. Used with the Digest and Schannel SSPs."; 
+      break;
+        
+    case SEC_E_OUT_OF_SEQUENCE:
+      pszName = "SEC_E_OUT_OF_SEQUENCE - The message was not received in the correct sequence."; 
+      break;
+        
+    case SEC_E_QOP_NOT_SUPPORTED:
+      pszName = "SEC_E_QOP_NOT_SUPPORTED - Neither confidentiality nor integrity are supported by the security context. Used with the Digest SSP."; 
+      break;
+        
+    case SEC_I_CONTEXT_EXPIRED:
+      pszName = "SEC_I_CONTEXT_EXPIRED - The message sender has finished using the connection and has initiated a shutdown."; 
+      break;
+        
+    case SEC_I_RENEGOTIATE:
+      pszName = "SEC_I_RENEGOTIATE - The remote party requires a new handshake sequence or the application has just initiated a shutdown."; 
+      break;
+        
+    case SEC_E_ENCRYPT_FAILURE:
+      pszName = "SEC_E_ENCRYPT_FAILURE - The specified data could not be encrypted."; 
+      break;
+        
+    case SEC_E_DECRYPT_FAILURE:
+      pszName = "SEC_E_DECRYPT_FAILURE - The specified data could not be decrypted."; 
+      break;
+    case -1:
+      pszName = "Failed to load security.dll library"; 
+      break;
+  }
+
+  return pszName;
+}
+
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_context.h b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_context.h
new file mode 100644
index 0000000..b0059e3
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_context.h
@@ -0,0 +1,85 @@
+#ifndef SECURITY_CONTEXT_H
+#define SECURITY_CONTEXT_H
+
+#include <node.h>
+#include <node_object_wrap.h>
+#include <v8.h>
+
+#define SECURITY_WIN32 1
+
+#include <sspi.h>
+#include <tchar.h>
+#include "security_credentials.h"
+#include "../worker.h"
+
+extern "C" {
+  #include "../kerberos_sspi.h"
+  #include "../base64.h"
+}
+
+using namespace v8;
+using namespace node;
+
+class SecurityContext : public ObjectWrap {  
+  public:    
+    SecurityContext();
+    ~SecurityContext();    
+
+    // Security info package
+    PSecPkgInfo m_PkgInfo;
+    // Do we have a context
+    bool hasContext;
+    // Reference to security credentials
+    SecurityCredentials *security_credentials;
+    // Security context
+    CtxtHandle m_Context;
+    // Attributes
+    DWORD CtxtAttr;
+    // Expiry time for ticket
+    TimeStamp Expiration;
+    // Payload
+    char *payload;
+
+    // Has instance check
+    static inline bool HasInstance(Handle<Value> val) {
+      if (!val->IsObject()) return false;
+      Local<Object> obj = val->ToObject();
+      return constructor_template->HasInstance(obj);
+    };
+
+    // Functions available from V8
+    static void Initialize(Handle<Object> target);    
+
+    static Handle<Value> InitializeContext(const Arguments &args);
+    static Handle<Value> InitializeContextSync(const Arguments &args);
+    
+    static Handle<Value> InitalizeStep(const Arguments &args);
+    static Handle<Value> InitalizeStepSync(const Arguments &args);
+
+    static Handle<Value> DecryptMessage(const Arguments &args);
+    static Handle<Value> DecryptMessageSync(const Arguments &args);
+
+    static Handle<Value> QueryContextAttributesSync(const Arguments &args);
+    static Handle<Value> QueryContextAttributes(const Arguments &args);
+
+    static Handle<Value> EncryptMessageSync(const Arguments &args);
+    static Handle<Value> EncryptMessage(const Arguments &args);
+
+    // Payload getter
+    static Handle<Value> PayloadGetter(Local<String> property, const AccessorInfo& info);
+    // hasContext getter
+    static Handle<Value> HasContextGetter(Local<String> property, const AccessorInfo& info);
+
+    // Constructor used for creating new Long objects from C++
+    static Persistent<FunctionTemplate> constructor_template;
+    
+  private:
+    // Create a new instance
+    static Handle<Value> New(const Arguments &args);
+    // // Handles the uv calls
+    // static void Process(uv_work_t* work_req);
+    // // Called after work is done
+    // static void After(uv_work_t* work_req);
+};
+
+#endif
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_context.js b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_context.js
new file mode 100644
index 0000000..ef04e92
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_context.js
@@ -0,0 +1,3 @@
+var SecurityContextNative = require('../../../build/Release/kerberos').SecurityContext;
+// Export the modified class
+exports.SecurityContext = SecurityContextNative;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_credentials.cc b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_credentials.cc
new file mode 100644
index 0000000..14c1cdc
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_credentials.cc
@@ -0,0 +1,468 @@
+#include <assert.h>
+#include <string.h>
+#include <stdlib.h>
+#include <v8.h>
+#include <node.h>
+#include <node_buffer.h>
+#include <cstring>
+#include <cmath>
+#include <cstdlib>
+#include <iostream>
+#include <limits>
+
+#include "security_credentials.h"
+
+#ifndef ARRAY_SIZE
+# define ARRAY_SIZE(a) (sizeof((a)) / sizeof((a)[0]))
+#endif
+
+static LPSTR DisplaySECError(DWORD ErrCode);
+
+static Handle<Value> VException(const char *msg) {
+  HandleScope scope;
+  return ThrowException(Exception::Error(String::New(msg)));
+};
+
+static Handle<Value> VExceptionErrNo(const char *msg, const int errorNumber) {
+  HandleScope scope;
+
+  Local<Value> err = Exception::Error(String::New(msg));
+  Local<Object> obj = err->ToObject();
+  obj->Set(NODE_PSYMBOL("code"), Int32::New(errorNumber));
+  return ThrowException(err);
+};
+
+Persistent<FunctionTemplate> SecurityCredentials::constructor_template;
+
+SecurityCredentials::SecurityCredentials() : ObjectWrap() {
+}
+
+SecurityCredentials::~SecurityCredentials() {
+}
+
+Handle<Value> SecurityCredentials::New(const Arguments &args) {
+  HandleScope scope;  
+
+  // Create security credentials instance
+  SecurityCredentials *security_credentials = new SecurityCredentials();
+  // Wrap it
+  security_credentials->Wrap(args.This());
+  // Return the object
+  return args.This();
+}
+
+Handle<Value> SecurityCredentials::AquireSync(const Arguments &args) {
+  HandleScope scope;  
+  char *package_str = NULL, *username_str = NULL, *password_str = NULL, *domain_str = NULL;
+  // Status of operation
+  SECURITY_STATUS status;
+
+  // Unpack the variables
+  if(args.Length() != 2 && args.Length() != 3 && args.Length() != 4)
+    return VException("Aquire must be called with either [package:string, username:string, [password:string, domain:string]]");
+
+  if(!args[0]->IsString())
+    return VException("Aquire must be called with either [package:string, username:string, [password:string, domain:string]]");
+
+  if(!args[1]->IsString())
+    return VException("Aquire must be called with either [package:string, username:string, [password:string, domain:string]]");
+
+  if(args.Length() == 3 && !args[2]->IsString())
+    return VException("Aquire must be called with either [package:string, username:string, [password:string, domain:string]]");
+
+  if(args.Length() == 4 && (!args[3]->IsString() && !args[3]->IsUndefined() && !args[3]->IsNull()))
+    return VException("Aquire must be called with either [package:string, username:string, [password:string, domain:string]]");
+
+  // Unpack the package
+  Local<String> package = args[0]->ToString();
+  package_str = (char *)calloc(package->Utf8Length() + 1, sizeof(char));
+  package->WriteUtf8(package_str);
+
+  // Unpack the user name
+  Local<String> username = args[1]->ToString();
+  username_str = (char *)calloc(username->Utf8Length() + 1, sizeof(char));
+  username->WriteUtf8(username_str);
+
+  // If we have a password
+  if(args.Length() == 3 || args.Length() == 4) {
+    Local<String> password = args[2]->ToString();
+    password_str = (char *)calloc(password->Utf8Length() + 1, sizeof(char));
+    password->WriteUtf8(password_str);    
+  }
+
+  // If we have a domain
+  if(args.Length() == 4 && args[3]->IsString()) {
+    Local<String> domain = args[3]->ToString();
+    domain_str = (char *)calloc(domain->Utf8Length() + 1, sizeof(char));
+    domain->WriteUtf8(domain_str);    
+  }
+
+  // Create Security instance
+  Local<Object> security_credentials_value = constructor_template->GetFunction()->NewInstance();
+
+  // Unwrap the credentials
+  SecurityCredentials *security_credentials = ObjectWrap::Unwrap<SecurityCredentials>(security_credentials_value);
+
+  // If we have domain string
+  if(domain_str != NULL) {
+    security_credentials->m_Identity.Domain = USTR(_tcsdup(domain_str));
+    security_credentials->m_Identity.DomainLength = (unsigned long)_tcslen(domain_str);
+  } else {
+    security_credentials->m_Identity.Domain = NULL;
+    security_credentials->m_Identity.DomainLength = 0;
+  }
+
+  // Set up the user
+  security_credentials->m_Identity.User = USTR(_tcsdup(username_str));
+  security_credentials->m_Identity.UserLength = (unsigned long)_tcslen(username_str);
+
+  // If we have a password string
+  if(password_str != NULL) {
+    // Set up the password
+    security_credentials->m_Identity.Password = USTR(_tcsdup(password_str));
+    security_credentials->m_Identity.PasswordLength = (unsigned long)_tcslen(password_str);    
+  }
+
+  #ifdef _UNICODE
+    security_credentials->m_Identity.Flags = SEC_WINNT_AUTH_IDENTITY_UNICODE;
+  #else
+    security_credentials->m_Identity.Flags = SEC_WINNT_AUTH_IDENTITY_ANSI;
+  #endif
+
+  // Attempt to acquire credentials
+  status = _sspi_AcquireCredentialsHandle(
+    NULL,
+    package_str,
+    SECPKG_CRED_OUTBOUND,
+    NULL, 
+    password_str != NULL ? &security_credentials->m_Identity : NULL,
+    NULL, NULL,
+    &security_credentials->m_Credentials,
+    &security_credentials->Expiration
+  );
+
+  // We have an error
+  if(status != SEC_E_OK) {
+    LPSTR err_message = DisplaySECError(status);
+
+    if(err_message != NULL) {
+      return VExceptionErrNo(err_message, status);
+    } else {
+      return VExceptionErrNo("Unknown error", status);
+    }
+  }
+
+  // Make object persistent
+  Persistent<Object> persistent = Persistent<Object>::New(security_credentials_value);
+  // Return the object
+  return scope.Close(persistent);
+}
+
+// Call structs
+typedef struct SecurityCredentialCall {
+  char *package_str;
+  char *username_str;
+  char *password_str;
+  char *domain_str;
+  SecurityCredentials *credentials;
+} SecurityCredentialCall;
+
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+// authGSSClientInit
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+static void _authSSPIAquire(Worker *worker) {
+  // Status of operation
+  SECURITY_STATUS status;
+
+  // Unpack data
+  SecurityCredentialCall *call = (SecurityCredentialCall *)worker->parameters;  
+
+  // Unwrap the credentials
+  SecurityCredentials *security_credentials = (SecurityCredentials *)call->credentials;
+
+  // If we have domain string
+  if(call->domain_str != NULL) {
+    security_credentials->m_Identity.Domain = USTR(_tcsdup(call->domain_str));
+    security_credentials->m_Identity.DomainLength = (unsigned long)_tcslen(call->domain_str);
+  } else {
+    security_credentials->m_Identity.Domain = NULL;
+    security_credentials->m_Identity.DomainLength = 0;
+  }
+
+  // Set up the user
+  security_credentials->m_Identity.User = USTR(_tcsdup(call->username_str));
+  security_credentials->m_Identity.UserLength = (unsigned long)_tcslen(call->username_str);
+
+  // If we have a password string
+  if(call->password_str != NULL) {
+    // Set up the password
+    security_credentials->m_Identity.Password = USTR(_tcsdup(call->password_str));
+    security_credentials->m_Identity.PasswordLength = (unsigned long)_tcslen(call->password_str);    
+  }
+
+  #ifdef _UNICODE
+    security_credentials->m_Identity.Flags = SEC_WINNT_AUTH_IDENTITY_UNICODE;
+  #else
+    security_credentials->m_Identity.Flags = SEC_WINNT_AUTH_IDENTITY_ANSI;
+  #endif
+
+  // Attempt to acquire credentials
+  status = _sspi_AcquireCredentialsHandle(
+    NULL,
+    call->package_str,
+    SECPKG_CRED_OUTBOUND,
+    NULL, 
+    call->password_str != NULL ? &security_credentials->m_Identity : NULL,
+    NULL, NULL,
+    &security_credentials->m_Credentials,
+    &security_credentials->Expiration
+  );
+
+  // We have an error
+  if(status != SEC_E_OK) {
+    worker->error = TRUE;
+    worker->error_code = status;
+    worker->error_message = DisplaySECError(status);
+  } else {
+    worker->return_code = status;
+    worker->return_value = security_credentials;
+  }
+
+  // Free up parameter structure
+  if(call->package_str != NULL) free(call->package_str);
+  if(call->domain_str != NULL) free(call->domain_str);
+  if(call->password_str != NULL) free(call->password_str);
+  if(call->username_str != NULL) free(call->username_str);
+  free(call);
+}
+
+static Handle<Value> _map_authSSPIAquire(Worker *worker) {
+  HandleScope scope;
+
+  // Unpack the credentials
+  SecurityCredentials *security_credentials = (SecurityCredentials *)worker->return_value;
+  // Make object persistent
+  Persistent<Object> persistent = Persistent<Object>::New(security_credentials->handle_);
+  // Return the object
+  return scope.Close(persistent);
+}
+
+Handle<Value> SecurityCredentials::Aquire(const Arguments &args) {
+  HandleScope scope;  
+  char *package_str = NULL, *username_str = NULL, *password_str = NULL, *domain_str = NULL;
+  // Unpack the variables
+  if(args.Length() != 2 && args.Length() != 3 && args.Length() != 4 && args.Length() != 5)
+    return VException("Aquire must be called with either [package:string, username:string, [password:string, domain:string], callback:function]");
+
+  if(!args[0]->IsString())
+    return VException("Aquire must be called with either [package:string, username:string, [password:string, domain:string], callback:function]");
+
+  if(!args[1]->IsString())
+    return VException("Aquire must be called with either [package:string, username:string, [password:string, domain:string], callback:function]");
+
+  if(args.Length() == 3 && (!args[2]->IsString() && !args[2]->IsFunction()))
+    return VException("Aquire must be called with either [package:string, username:string, [password:string, domain:string], callback:function]");
+
+  if(args.Length() == 4 && (!args[3]->IsString() && !args[3]->IsUndefined() && !args[3]->IsNull()) && !args[3]->IsFunction())
+    return VException("Aquire must be called with either [package:string, username:string, [password:string, domain:string], callback:function]");
+
+  if(args.Length() == 5 && !args[4]->IsFunction())
+    return VException("Aquire must be called with either [package:string, username:string, [password:string, domain:string], callback:function]");
+
+  Local<Function> callback;
+
+  // Figure out which parameter is the callback
+  if(args.Length() == 5) {
+    callback = Local<Function>::Cast(args[4]);
+  } else if(args.Length() == 4) {
+    callback = Local<Function>::Cast(args[3]);
+  } else if(args.Length() == 3) {
+    callback = Local<Function>::Cast(args[2]);
+  }
+
+  // Unpack the package
+  Local<String> package = args[0]->ToString();
+  package_str = (char *)calloc(package->Utf8Length() + 1, sizeof(char));
+  package->WriteUtf8(package_str);
+
+  // Unpack the user name
+  Local<String> username = args[1]->ToString();
+  username_str = (char *)calloc(username->Utf8Length() + 1, sizeof(char));
+  username->WriteUtf8(username_str);
+
+  // If we have a password
+  if(args.Length() == 3 || args.Length() == 4 || args.Length() == 5) {
+    Local<String> password = args[2]->ToString();
+    password_str = (char *)calloc(password->Utf8Length() + 1, sizeof(char));
+    password->WriteUtf8(password_str);    
+  }
+
+  // If we have a domain
+  if((args.Length() == 4 || args.Length() == 5) && args[3]->IsString()) {
+    Local<String> domain = args[3]->ToString();
+    domain_str = (char *)calloc(domain->Utf8Length() + 1, sizeof(char));
+    domain->WriteUtf8(domain_str);    
+  }
+
+  // Create reference object
+  Local<Object> security_credentials_value = constructor_template->GetFunction()->NewInstance();
+  // Unwrap object
+  SecurityCredentials *security_credentials = ObjectWrap::Unwrap<SecurityCredentials>(security_credentials_value);
+
+  // Allocate call structure
+  SecurityCredentialCall *call = (SecurityCredentialCall *)calloc(1, sizeof(SecurityCredentialCall));
+  call->domain_str = domain_str;
+  call->package_str = package_str;
+  call->password_str = password_str;
+  call->username_str = username_str;
+  call->credentials = security_credentials;
+
+  // Let's allocate some space
+  Worker *worker = new Worker();
+  worker->error = false;
+  worker->request.data = worker;
+  worker->callback = Persistent<Function>::New(callback);
+  worker->parameters = call;
+  worker->execute = _authSSPIAquire;
+  worker->mapper = _map_authSSPIAquire;
+
+  // Schedule the worker with lib_uv
+  uv_queue_work(uv_default_loop(), &worker->request, SecurityCredentials::Process, (uv_after_work_cb)SecurityCredentials::After);
+
+  // Return the undefined value
+  return scope.Close(Undefined());
+}
+
+void SecurityCredentials::Initialize(Handle<Object> target) {
+  // Grab the scope of the call from Node
+  HandleScope scope;
+  // Define a new function template
+  Local<FunctionTemplate> t = FunctionTemplate::New(New);
+  constructor_template = Persistent<FunctionTemplate>::New(t);
+  constructor_template->InstanceTemplate()->SetInternalFieldCount(1);
+  constructor_template->SetClassName(String::NewSymbol("SecurityCredentials"));
+
+  // Class methods
+  NODE_SET_METHOD(constructor_template, "aquireSync", AquireSync);
+  NODE_SET_METHOD(constructor_template, "aquire", Aquire);
+
+  // Set the class on the target module
+  target->Set(String::NewSymbol("SecurityCredentials"), constructor_template->GetFunction());  
+
+  // Attempt to load the security.dll library
+  load_library();
+}
+
+static LPSTR DisplaySECError(DWORD ErrCode) {
+  LPSTR pszName = NULL; // WinError.h
+
+  switch(ErrCode) {
+    case SEC_E_BUFFER_TOO_SMALL:
+      pszName = "SEC_E_BUFFER_TOO_SMALL - The message buffer is too small. Used with the Digest SSP.";
+      break;
+
+    case SEC_E_CRYPTO_SYSTEM_INVALID:
+      pszName = "SEC_E_CRYPTO_SYSTEM_INVALID - The cipher chosen for the security context is not supported. Used with the Digest SSP."; 
+      break;
+    case SEC_E_INCOMPLETE_MESSAGE:
+      pszName = "SEC_E_INCOMPLETE_MESSAGE - The data in the input buffer is incomplete. The application needs to read more data from the server and call DecryptMessage (General) again."; 
+      break;
+
+    case SEC_E_INVALID_HANDLE:
+      pszName = "SEC_E_INVALID_HANDLE - A context handle that is not valid was specified in the phContext parameter. Used with the Digest and Schannel SSPs."; 
+      break;
+
+    case SEC_E_INVALID_TOKEN:
+      pszName = "SEC_E_INVALID_TOKEN - The buffers are of the wrong type or no buffer of type SECBUFFER_DATA was found. Used with the Schannel SSP."; 
+      break;
+        
+    case SEC_E_MESSAGE_ALTERED:
+      pszName = "SEC_E_MESSAGE_ALTERED - The message has been altered. Used with the Digest and Schannel SSPs."; 
+      break;
+        
+    case SEC_E_OUT_OF_SEQUENCE:
+      pszName = "SEC_E_OUT_OF_SEQUENCE - The message was not received in the correct sequence."; 
+      break;
+        
+    case SEC_E_QOP_NOT_SUPPORTED:
+      pszName = "SEC_E_QOP_NOT_SUPPORTED - Neither confidentiality nor integrity are supported by the security context. Used with the Digest SSP."; 
+      break;
+        
+    case SEC_I_CONTEXT_EXPIRED:
+      pszName = "SEC_I_CONTEXT_EXPIRED - The message sender has finished using the connection and has initiated a shutdown."; 
+      break;
+        
+    case SEC_I_RENEGOTIATE:
+      pszName = "SEC_I_RENEGOTIATE - The remote party requires a new handshake sequence or the application has just initiated a shutdown."; 
+      break;
+        
+    case SEC_E_ENCRYPT_FAILURE:
+      pszName = "SEC_E_ENCRYPT_FAILURE - The specified data could not be encrypted."; 
+      break;
+        
+    case SEC_E_DECRYPT_FAILURE:
+      pszName = "SEC_E_DECRYPT_FAILURE - The specified data could not be decrypted."; 
+      break;
+    case -1:
+      pszName = "Failed to load security.dll library"; 
+      break;
+
+  }
+
+  return pszName;
+}
+
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+// UV Lib callbacks
+// +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+void SecurityCredentials::Process(uv_work_t* work_req) {
+  // Grab the worker
+  Worker *worker = static_cast<Worker*>(work_req->data);
+  // Execute the worker code
+  worker->execute(worker);
+}
+
+void SecurityCredentials::After(uv_work_t* work_req) {
+  // Grab the scope of the call from Node
+  v8::HandleScope scope;
+
+  // Get the worker reference
+  Worker *worker = static_cast<Worker*>(work_req->data);
+
+  // If we have an error
+  if(worker->error) {
+    v8::Local<v8::Value> err = v8::Exception::Error(v8::String::New(worker->error_message));
+    Local<Object> obj = err->ToObject();
+    obj->Set(NODE_PSYMBOL("code"), Int32::New(worker->error_code));
+    v8::Local<v8::Value> args[2] = { err, v8::Local<v8::Value>::New(v8::Null()) };
+    // Execute the error
+    v8::TryCatch try_catch;
+    // Call the callback
+    worker->callback->Call(v8::Context::GetCurrent()->Global(), ARRAY_SIZE(args), args);
+    // If we have an exception handle it as a fatalexception
+    if (try_catch.HasCaught()) {
+      node::FatalException(try_catch);
+    }
+  } else {
+    // // Map the data
+    v8::Handle<v8::Value> result = worker->mapper(worker);
+    // Set up the callback with a null first
+    v8::Handle<v8::Value> args[2] = { v8::Local<v8::Value>::New(v8::Null()), result};
+    // Wrap the callback function call in a TryCatch so that we can call
+    // node's FatalException afterwards. This makes it possible to catch
+    // the exception from JavaScript land using the
+    // process.on('uncaughtException') event.
+    v8::TryCatch try_catch;
+    // Call the callback
+    worker->callback->Call(v8::Context::GetCurrent()->Global(), ARRAY_SIZE(args), args);
+    // If we have an exception handle it as a fatalexception
+    if (try_catch.HasCaught()) {
+      node::FatalException(try_catch);
+    }
+  }
+
+  // Clean up the memory
+  worker->callback.Dispose();
+  delete worker;
+}
+
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_credentials.h b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_credentials.h
new file mode 100644
index 0000000..10b3eda
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_credentials.h
@@ -0,0 +1,67 @@
+#ifndef SECURITY_CREDENTIALS_H
+#define SECURITY_CREDENTIALS_H
+
+#include <node.h>
+#include <node_object_wrap.h>
+#include <v8.h>
+
+#define SECURITY_WIN32 1
+
+#include <windows.h>
+#include <sspi.h>
+#include <tchar.h>
+#include "../worker.h"
+#include <uv.h>
+
+extern "C" {
+  #include "../kerberos_sspi.h"
+}
+
+// SEC_WINNT_AUTH_IDENTITY makes it unusually hard
+// to compile for both Unicode and ansi, so I use this macro:
+#ifdef _UNICODE
+#define USTR(str) (str)
+#else
+#define USTR(str) ((unsigned char*)(str))
+#endif
+
+using namespace v8;
+using namespace node;
+
+class SecurityCredentials : public ObjectWrap {  
+  public:    
+    SecurityCredentials();
+    ~SecurityCredentials();    
+
+    // Pointer to context object
+    SEC_WINNT_AUTH_IDENTITY m_Identity;
+    // credentials
+    CredHandle m_Credentials;    
+    // Expiry time for ticket
+    TimeStamp Expiration;
+
+    // Has instance check
+    static inline bool HasInstance(Handle<Value> val) {
+      if (!val->IsObject()) return false;
+      Local<Object> obj = val->ToObject();
+      return constructor_template->HasInstance(obj);
+    };
+
+    // Functions available from V8
+    static void Initialize(Handle<Object> target);    
+    static Handle<Value> AquireSync(const Arguments &args);
+    static Handle<Value> Aquire(const Arguments &args);
+
+    // Constructor used for creating new Long objects from C++
+    static Persistent<FunctionTemplate> constructor_template;
+    
+  private:
+    // Create a new instance
+    static Handle<Value> New(const Arguments &args);
+    // Handles the uv calls
+    static void Process(uv_work_t* work_req);
+    // Called after work is done
+    static void After(uv_work_t* work_req);
+};
+
+#endif
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_credentials.js b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_credentials.js
new file mode 100644
index 0000000..4215c92
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/win32/wrappers/security_credentials.js
@@ -0,0 +1,22 @@
+var SecurityCredentialsNative = require('../../../build/Release/kerberos').SecurityCredentials;
+
+// Add simple kebros helper
+SecurityCredentialsNative.aquire_kerberos = function(username, password, domain, callback) {
+  if(typeof password == 'function') {
+    callback = password;
+    password = null;
+  } else if(typeof domain == 'function') {
+    callback = domain;
+    domain = null;
+  }
+
+  // We are going to use the async version
+  if(typeof callback == 'function') {
+    return SecurityCredentialsNative.aquire('Kerberos', username, password, domain, callback);
+  } else {
+    return SecurityCredentialsNative.aquireSync('Kerberos', username, password, domain);
+  }
+}
+
+// Export the modified class
+exports.SecurityCredentials = SecurityCredentialsNative;
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/worker.cc b/node_modules/mongodb/node_modules/kerberos/lib/worker.cc
new file mode 100644
index 0000000..e7a472f
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/worker.cc
@@ -0,0 +1,7 @@
+#include "worker.h"
+
+Worker::Worker() {
+}
+
+Worker::~Worker() {  
+}
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/lib/worker.h b/node_modules/mongodb/node_modules/kerberos/lib/worker.h
new file mode 100644
index 0000000..c5f86f5
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/lib/worker.h
@@ -0,0 +1,39 @@
+#ifndef WORKER_H_
+#define WORKER_H_
+
+#include <node.h>
+#include <node_object_wrap.h>
+#include <v8.h>
+
+using namespace node;
+using namespace v8;
+
+class Worker {
+  public:
+    Worker();
+    virtual ~Worker();
+
+    // libuv's request struct.
+    uv_work_t request;
+    // Callback
+    v8::Persistent<v8::Function> callback;
+    // // Arguments
+    // v8::Persistent<v8::Array> arguments;
+    // Parameters
+    void *parameters;
+    // Results
+    void *return_value;
+    // Did we raise an error
+    bool error;
+    // The error message
+    char *error_message;
+    // Error code if not message
+    int error_code;
+    // Any return code
+    int return_code;
+    // Method we are going to fire
+    void (*execute)(Worker *worker);
+    Handle<Value> (*mapper)(Worker *worker);
+};
+
+#endif  // WORKER_H_
diff --git a/node_modules/mongodb/node_modules/kerberos/package.json b/node_modules/mongodb/node_modules/kerberos/package.json
new file mode 100644
index 0000000..46e144b
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/package.json
@@ -0,0 +1,34 @@
+{
+  "name": "kerberos",
+  "version": "0.0.2",
+  "description": "Kerberos library for Node.js",
+  "main": "index.js",
+  "scripts": {
+    "install": "(node-gyp rebuild 2> builderror.log) || (exit 0)",
+    "test": "nodeunit ./test"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/christkv/kerberos.git"
+  },
+  "keywords": [
+    "kerberos",
+    "security",
+    "authentication"
+  ],
+  "devDependencies": {
+    "nodeunit": "latest"
+  },
+  "author": {
+    "name": "Christian Amor Kvalheim"
+  },
+  "license": "Apache 2.0",
+  "readmeFilename": "README.md",
+  "gitHead": "bb01d4fe322e022999aca19da564e7d9db59a8ed",
+  "readme": "kerberos\n========\n\nKerberos library for node.js",
+  "bugs": {
+    "url": "https://github.com/christkv/kerberos/issues"
+  },
+  "_id": "kerberos@0.0.2",
+  "_from": "kerberos@latest"
+}
diff --git a/node_modules/mongodb/node_modules/kerberos/test/kerberos_tests.js b/node_modules/mongodb/node_modules/kerberos/test/kerberos_tests.js
new file mode 100644
index 0000000..a06c5fd
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/test/kerberos_tests.js
@@ -0,0 +1,34 @@
+exports.setUp = function(callback) {
+  callback();
+}
+
+exports.tearDown = function(callback) {
+  callback();
+}
+
+exports['Simple initialize of Kerberos object'] = function(test) {
+  var Kerberos = require('../lib/kerberos.js').Kerberos;
+  var kerberos = new Kerberos();
+  // console.dir(kerberos)
+
+  // Initiate kerberos client
+  kerberos.authGSSClientInit('mongodb@kdc.10gen.me', Kerberos.GSS_C_MUTUAL_FLAG, function(err, context) {
+    console.log("===================================== authGSSClientInit")
+    test.equal(null, err);
+    test.ok(context != null && typeof context == 'object');
+    // console.log("===================================== authGSSClientInit")
+    console.dir(err)
+    console.dir(context)
+    // console.dir(typeof result)
+
+    // Perform the first step
+    kerberos.authGSSClientStep(context, function(err, result) {
+      console.log("===================================== authGSSClientStep")
+      console.dir(err)
+      console.dir(result)
+      console.dir(context)
+
+      test.done();
+    });
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/test/kerberos_win32_test.js b/node_modules/mongodb/node_modules/kerberos/test/kerberos_win32_test.js
new file mode 100644
index 0000000..d2f7046
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/test/kerberos_win32_test.js
@@ -0,0 +1,19 @@
+exports.setUp = function(callback) {
+  callback();
+}
+
+exports.tearDown = function(callback) {
+  callback();
+}
+
+exports['Simple initialize of Kerberos win32 object'] = function(test) {
+  var KerberosNative = require('../build/Release/kerberos').Kerberos;
+  // console.dir(KerberosNative)
+  var kerberos = new KerberosNative();
+  console.log("=========================================== 0")
+  console.dir(kerberos.acquireAlternateCredentials("dev1@10GEN.ME", "a"));
+  console.log("=========================================== 1")
+  console.dir(kerberos.prepareOutboundPackage("mongodb/kdc.10gen.com"));
+  console.log("=========================================== 2")
+  test.done();
+}
diff --git a/node_modules/mongodb/node_modules/kerberos/test/win32/security_buffer_descriptor_tests.js b/node_modules/mongodb/node_modules/kerberos/test/win32/security_buffer_descriptor_tests.js
new file mode 100644
index 0000000..3531b6b
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/test/win32/security_buffer_descriptor_tests.js
@@ -0,0 +1,41 @@
+exports.setUp = function(callback) {
+  callback();
+}
+
+exports.tearDown = function(callback) {
+  callback();
+}
+
+exports['Initialize a security Buffer Descriptor'] = function(test) {
+  var SecurityBufferDescriptor = require('../../lib/sspi.js').SecurityBufferDescriptor
+    SecurityBuffer = require('../../lib/sspi.js').SecurityBuffer;
+
+  // Create descriptor with single Buffer
+  var securityDescriptor = new SecurityBufferDescriptor(100);
+  try {
+    // Fail to work due to no valid Security Buffer
+    securityDescriptor = new SecurityBufferDescriptor(["hello"]);
+    test.ok(false);
+  } catch(err){}
+
+  // Should Correctly construct SecurityBuffer
+  var buffer = new SecurityBuffer(SecurityBuffer.DATA, 100);
+  securityDescriptor = new SecurityBufferDescriptor([buffer]);
+  // Should correctly return a buffer
+  var result = securityDescriptor.toBuffer();
+  test.equal(100, result.length);
+
+  // Should Correctly construct SecurityBuffer
+  var buffer = new SecurityBuffer(SecurityBuffer.DATA, new Buffer("hello world"));
+  securityDescriptor = new SecurityBufferDescriptor([buffer]);
+  var result = securityDescriptor.toBuffer();
+  test.equal("hello world", result.toString());
+
+  // Test passing in more than one Buffer
+  var buffer = new SecurityBuffer(SecurityBuffer.DATA, new Buffer("hello world"));
+  var buffer2 = new SecurityBuffer(SecurityBuffer.STREAM, new Buffer("adam and eve"));
+  securityDescriptor = new SecurityBufferDescriptor([buffer, buffer2]);
+  var result = securityDescriptor.toBuffer();
+  test.equal("hello worldadam and eve", result.toString());
+  test.done();
+}
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/test/win32/security_buffer_tests.js b/node_modules/mongodb/node_modules/kerberos/test/win32/security_buffer_tests.js
new file mode 100644
index 0000000..b52b959
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/test/win32/security_buffer_tests.js
@@ -0,0 +1,22 @@
+exports.setUp = function(callback) {
+  callback();
+}
+
+exports.tearDown = function(callback) {
+  callback();
+}
+
+exports['Initialize a security Buffer'] = function(test) {
+  var SecurityBuffer = require('../../lib/sspi.js').SecurityBuffer;
+  // Create empty buffer
+  var securityBuffer = new SecurityBuffer(SecurityBuffer.DATA, 100);
+  var buffer = securityBuffer.toBuffer();
+  test.equal(100, buffer.length);
+
+  // Access data passed in
+  var allocated_buffer = new Buffer(256);
+  securityBuffer = new SecurityBuffer(SecurityBuffer.DATA, allocated_buffer);
+  buffer = securityBuffer.toBuffer();
+  test.deepEqual(allocated_buffer, buffer);
+  test.done();
+}
\ No newline at end of file
diff --git a/node_modules/mongodb/node_modules/kerberos/test/win32/security_credentials_tests.js b/node_modules/mongodb/node_modules/kerberos/test/win32/security_credentials_tests.js
new file mode 100644
index 0000000..7758180
--- /dev/null
+++ b/node_modules/mongodb/node_modules/kerberos/test/win32/security_credentials_tests.js
@@ -0,0 +1,55 @@
+exports.setUp = function(callback) {
+  callback();
+}
+
+exports.tearDown = function(callback) {
+  callback();
+}
+
+exports['Initialize a set of security credentials'] = function(test) {
+  var SecurityCredentials = require('../../lib/sspi.js').SecurityCredentials;
+
+  // Aquire some credentials
+  try {
+    var credentials = SecurityCredentials.aquire('Kerberos', 'dev1@10GEN.ME', 'a');    
+  } catch(err) {    
+    console.dir(err)
+    test.ok(false);
+  }
+
+
+
+  // console.dir(SecurityCredentials);
+
+  // var SecurityBufferDescriptor = require('../../lib/sspi.js').SecurityBufferDescriptor
+  //   SecurityBuffer = require('../../lib/sspi.js').SecurityBuffer;
+
+  // // Create descriptor with single Buffer
+  // var securityDescriptor = new SecurityBufferDescriptor(100);
+  // try {
+  //   // Fail to work due to no valid Security Buffer
+  //   securityDescriptor = new SecurityBufferDescriptor(["hello"]);
+  //   test.ok(false);
+  // } catch(err){}
+
+  // // Should Correctly construct SecurityBuffer
+  // var buffer = new SecurityBuffer(SecurityBuffer.DATA, 100);
+  // securityDescriptor = new SecurityBufferDescriptor([buffer]);
+  // // Should correctly return a buffer
+  // var result = securityDescriptor.toBuffer();
+  // test.equal(100, result.length);
+
+  // // Should Correctly construct SecurityBuffer
+  // var buffer = new SecurityBuffer(SecurityBuffer.DATA, new Buffer("hello world"));
+  // securityDescriptor = new SecurityBufferDescriptor([buffer]);
+  // var result = securityDescriptor.toBuffer();
+  // test.equal("hello world", result.toString());
+
+  // // Test passing in more than one Buffer
+  // var buffer = new SecurityBuffer(SecurityBuffer.DATA, new Buffer("hello world"));
+  // var buffer2 = new SecurityBuffer(SecurityBuffer.STREAM, new Buffer("adam and eve"));
+  // securityDescriptor = new SecurityBufferDescriptor([buffer, buffer2]);
+  // var result = securityDescriptor.toBuffer();
+  // test.equal("hello worldadam and eve", result.toString());
+  test.done();
+}
\ No newline at end of file
diff --git a/node_modules/mongodb/package.json b/node_modules/mongodb/package.json
new file mode 100755
index 0000000..5e21c65
--- /dev/null
+++ b/node_modules/mongodb/package.json
@@ -0,0 +1,224 @@
+{
+  "name": "mongodb",
+  "description": "A node.js driver for MongoDB",
+  "keywords": [
+    "mongodb",
+    "mongo",
+    "driver",
+    "db"
+  ],
+  "version": "1.3.10",
+  "author": {
+    "name": "Christian Amor Kvalheim",
+    "email": "christkv@gmail.com"
+  },
+  "contributors": [
+    {
+      "name": "Aaron Heckmann"
+    },
+    {
+      "name": "Christoph Pojer"
+    },
+    {
+      "name": "Pau Ramon Revilla"
+    },
+    {
+      "name": "Nathan White"
+    },
+    {
+      "name": "Emmerman"
+    },
+    {
+      "name": "Seth LaForge"
+    },
+    {
+      "name": "Boris Filipov"
+    },
+    {
+      "name": "Stefan Schärmeli"
+    },
+    {
+      "name": "Tedde Lundgren"
+    },
+    {
+      "name": "renctan"
+    },
+    {
+      "name": "Sergey Ukustov"
+    },
+    {
+      "name": "Ciaran Jessup"
+    },
+    {
+      "name": "kuno"
+    },
+    {
+      "name": "srimonti"
+    },
+    {
+      "name": "Erik Abele"
+    },
+    {
+      "name": "Pratik Daga"
+    },
+    {
+      "name": "Slobodan Utvic"
+    },
+    {
+      "name": "Kristina Chodorow"
+    },
+    {
+      "name": "Yonathan Randolph"
+    },
+    {
+      "name": "Brian Noguchi"
+    },
+    {
+      "name": "Sam Epstein"
+    },
+    {
+      "name": "James Harrison Fisher"
+    },
+    {
+      "name": "Vladimir Dronnikov"
+    },
+    {
+      "name": "Ben Hockey"
+    },
+    {
+      "name": "Henrik Johansson"
+    },
+    {
+      "name": "Simon Weare"
+    },
+    {
+      "name": "Alex Gorbatchev"
+    },
+    {
+      "name": "Shimon Doodkin"
+    },
+    {
+      "name": "Kyle Mueller"
+    },
+    {
+      "name": "Eran Hammer-Lahav"
+    },
+    {
+      "name": "Marcin Ciszak"
+    },
+    {
+      "name": "François de Metz"
+    },
+    {
+      "name": "Vinay Pulim"
+    },
+    {
+      "name": "nstielau"
+    },
+    {
+      "name": "Adam Wiggins"
+    },
+    {
+      "name": "entrinzikyl"
+    },
+    {
+      "name": "Jeremy Selier"
+    },
+    {
+      "name": "Ian Millington"
+    },
+    {
+      "name": "Public Keating"
+    },
+    {
+      "name": "andrewjstone"
+    },
+    {
+      "name": "Christopher Stott"
+    },
+    {
+      "name": "Corey Jewett"
+    },
+    {
+      "name": "brettkiefer"
+    },
+    {
+      "name": "Rob Holland"
+    },
+    {
+      "name": "Senmiao Liu"
+    },
+    {
+      "name": "heroic"
+    },
+    {
+      "name": "gitfy"
+    },
+    {
+      "name": "Andrew Stone"
+    },
+    {
+      "name": "John Le Drew"
+    },
+    {
+      "name": "Lucasfilm Singapore"
+    },
+    {
+      "name": "Roman Shtylman"
+    },
+    {
+      "name": "Matt Self"
+    }
+  ],
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/mongodb/node-mongodb-native.git"
+  },
+  "bugs": {
+    "url": "http://github.com/mongodb/node-mongodb-native/issues"
+  },
+  "dependencies": {
+    "bson": "0.1.9",
+    "kerberos": "latest"
+  },
+  "devDependencies": {
+    "dox": "0.2.0",
+    "uglify-js": "1.2.5",
+    "ejs": "0.6.1",
+    "request": "2.12.0",
+    "nodeunit": "0.7.4",
+    "markdown": "0.3.1",
+    "gleak": "0.2.3",
+    "step": "0.0.5",
+    "async": "0.1.22",
+    "integra": "latest",
+    "optimist": "latest"
+  },
+  "optionalDependencies": {
+    "kerberos": "latest"
+  },
+  "config": {
+    "native": false
+  },
+  "main": "./lib/mongodb/index",
+  "homepage": "http://mongodb.github.com/node-mongodb-native/",
+  "directories": {
+    "lib": "./lib/mongodb"
+  },
+  "engines": {
+    "node": ">=0.6.19"
+  },
+  "scripts": {
+    "test": "make test_functional"
+  },
+  "licenses": [
+    {
+      "type": "Apache License, Version 2.0",
+      "url": "http://www.apache.org/licenses/LICENSE-2.0"
+    }
+  ],
+  "readme": "Up to date documentation\n========================\n\n[Documentation](http://mongodb.github.com/node-mongodb-native/)\n\nInstall\n=======\n\nTo install the most recent release from npm, run:\n\n    npm install mongodb\n\nThat may give you a warning telling you that bugs['web'] should be bugs['url'], it would be safe to ignore it (this has been fixed in the development version)\n\nTo install the latest from the repository, run::\n\n    npm install path/to/node-mongodb-native\n\nCommunity\n=========\nCheck out the google group [node-mongodb-native](http://groups.google.com/group/node-mongodb-native) for questions/answers from users of the driver.\n\nLive Examples\n============\n<a href=\"https://runnable.com/node-mongodb-native\" target=\"_blank\"><img src=\"https://runnable.com/external/styles/assets/runnablebtn.png\" style=\"width:67px;height:25px;\"></a>\n\nIntroduction\n============\n\nThis is a node.js driver for MongoDB. It's a port (or close to a port) of the library for ruby at http://github.com/mongodb/mongo-ruby-driver/.\n\nA simple example of inserting a document.\n\n```javascript\n    var client = new Db('test', new Server(\"127.0.0.1\", 27017, {}), {w: 1}),\n        test = function (err, collection) {\n          collection.insert({a:2}, function(err, docs) {\n\n            collection.count(function(err, count) {\n              test.assertEquals(1, count);\n            });\n\n            // Locate all the entries using find\n            collection.find().toArray(function(err, results) {\n              test.assertEquals(1, results.length);\n              test.assertTrue(results[0].a === 2);\n\n              // Let's close the db\n              client.close();\n            });\n          });\n        };\n\n    client.open(function(err, p_client) {\n      client.collection('test_insert', test);\n    });\n```\n\nData types\n==========\n\nTo store and retrieve the non-JSON MongoDb primitives ([ObjectID](http://www.mongodb.org/display/DOCS/Object+IDs), Long, Binary, [Timestamp](http://www.mongodb.org/display/DOCS/Timestamp+data+type), [DBRef](http://www.mongodb.org/display/DOCS/Database+References#DatabaseReferences-DBRef), Code).\n\nIn particular, every document has a unique `_id` which can be almost any type, and by default a 12-byte ObjectID is created. ObjectIDs can be represented as 24-digit hexadecimal strings, but you must convert the string back into an ObjectID before you can use it in the database. For example:\n\n```javascript\n    // Get the objectID type\n    var ObjectID = require('mongodb').ObjectID;\n\n    var idString = '4e4e1638c85e808431000003';\n    collection.findOne({_id: new ObjectID(idString)}, console.log)  // ok\n    collection.findOne({_id: idString}, console.log)  // wrong! callback gets undefined\n```\n\nHere are the constructors the non-Javascript BSON primitive types:\n\n```javascript\n    // Fetch the library\n    var mongo = require('mongodb');\n    // Create new instances of BSON types\n    new mongo.Long(numberString)\n    new mongo.ObjectID(hexString)\n    new mongo.Timestamp()  // the actual unique number is generated on insert.\n    new mongo.DBRef(collectionName, id, dbName)\n    new mongo.Binary(buffer)  // takes a string or Buffer\n    new mongo.Code(code, [context])\n    new mongo.Symbol(string)\n    new mongo.MinKey()\n    new mongo.MaxKey()\n    new mongo.Double(number)\t// Force double storage\n```\n\nThe C/C++ bson parser/serializer\n--------------------------------\n\nIf you are running a version of this library has the C/C++ parser compiled, to enable the driver to use the C/C++ bson parser pass it the option native_parser:true like below\n\n```javascript\n    // using native_parser:\n    var client = new Db('integration_tests_20',\n                        new Server(\"127.0.0.1\", 27017),\n                        {native_parser:true});\n```\n\nThe C++ parser uses the js objects both for serialization and deserialization.\n\nGitHub information\n==================\n\nThe source code is available at http://github.com/mongodb/node-mongodb-native.\nYou can either clone the repository or download a tarball of the latest release.\n\nOnce you have the source you can test the driver by running\n\n    $ make test\n\nin the main directory. You will need to have a mongo instance running on localhost for the integration tests to pass.\n\nExamples\n========\n\nFor examples look in the examples/ directory. You can execute the examples using node.\n\n    $ cd examples\n    $ node queries.js\n\nGridStore\n=========\n\nThe GridStore class allows for storage of binary files in mongoDB using the mongoDB defined files and chunks collection definition.\n\nFor more information have a look at [Gridstore](https://github.com/mongodb/node-mongodb-native/blob/master/docs/gridfs.md)\n\nReplicasets\n===========\nFor more information about how to connect to a replicaset have a look at [Replicasets](https://github.com/mongodb/node-mongodb-native/blob/master/docs/replicaset.md)\n\nPrimary Key Factories\n---------------------\n\nDefining your own primary key factory allows you to generate your own series of id's\n(this could f.ex be to use something like ISBN numbers). The generated the id needs to be a 12 byte long \"string\".\n\nSimple example below\n\n```javascript\n    // Custom factory (need to provide a 12 byte array);\n    CustomPKFactory = function() {}\n    CustomPKFactory.prototype = new Object();\n    CustomPKFactory.createPk = function() {\n      return new ObjectID(\"aaaaaaaaaaaa\");\n    }\n\n    var p_client = new Db('integration_tests_20', new Server(\"127.0.0.1\", 27017, {}), {'pk':CustomPKFactory});\n    p_client.open(function(err, p_client) {\n      p_client.dropDatabase(function(err, done) {\n        p_client.createCollection('test_custom_key', function(err, collection) {\n          collection.insert({'a':1}, function(err, docs) {\n            collection.find({'_id':new ObjectID(\"aaaaaaaaaaaa\")}, function(err, cursor) {\n              cursor.toArray(function(err, items) {\n                test.assertEquals(1, items.length);\n\n                // Let's close the db\n                p_client.close();\n              });\n            });\n          });\n        });\n      });\n    });\n```\n\nStrict mode\n-----------\n\nEach database has an optional strict mode. If it is set then asking for a collection\nthat does not exist will return an Error object in the callback. Similarly if you\nattempt to create a collection that already exists. Strict is provided for convenience.\n\n```javascript\n    var error_client = new Db('integration_tests_', new Server(\"127.0.0.1\", 27017, {auto_reconnect: false}), {strict:true});\n      test.assertEquals(true, error_client.strict);\n\n      error_client.open(function(err, error_client) {\n      error_client.collection('does-not-exist', function(err, collection) {\n        test.assertTrue(err instanceof Error);\n        test.assertEquals(\"Collection does-not-exist does not exist. Currently in strict mode.\", err.message);\n      });\n\n      error_client.createCollection('test_strict_access_collection', function(err, collection) {\n        error_client.collection('test_strict_access_collection', function(err, collection) {\n          test.assertTrue(collection instanceof Collection);\n          // Let's close the db\n          error_client.close();\n        });\n      });\n    });\n```\n\nDocumentation\n=============\n\nIf this document doesn't answer your questions, see the source of\n[Collection](https://github.com/mongodb/node-mongodb-native/blob/master/lib/mongodb/collection.js)\nor [Cursor](https://github.com/mongodb/node-mongodb-native/blob/master/lib/mongodb/cursor.js),\nor the documentation at MongoDB for query and update formats.\n\nFind\n----\n\nThe find method is actually a factory method to create\nCursor objects. A Cursor lazily uses the connection the first time\nyou call `nextObject`, `each`, or `toArray`.\n\nThe basic operation on a cursor is the `nextObject` method\nthat fetches the next matching document from the database. The convenience\nmethods `each` and `toArray` call `nextObject` until the cursor is exhausted.\n\nSignatures:\n\n```javascript\n    var cursor = collection.find(query, [fields], options);\n    cursor.sort(fields).limit(n).skip(m).\n\n    cursor.nextObject(function(err, doc) {});\n    cursor.each(function(err, doc) {});\n    cursor.toArray(function(err, docs) {});\n\n    cursor.rewind()  // reset the cursor to its initial state.\n```\n\nUseful chainable methods of cursor. These can optionally be options of `find` instead of method calls:\n\n* `.limit(n).skip(m)` to control paging.\n* `.sort(fields)` Order by the given fields. There are several equivalent syntaxes:\n  * `.sort({field1: -1, field2: 1})` descending by field1, then ascending by field2.\n  * `.sort([['field1', 'desc'], ['field2', 'asc']])` same as above\n  * `.sort([['field1', 'desc'], 'field2'])` same as above\n  * `.sort('field1')` ascending by field1\n\nOther options of `find`:\n\n* `fields` the fields to fetch (to avoid transferring the entire document)\n* `tailable` if true, makes the cursor [tailable](http://www.mongodb.org/display/DOCS/Tailable+Cursors).\n* `batchSize` The number of the subset of results to request the database\nto return for every request. This should initially be greater than 1 otherwise\nthe database will automatically close the cursor. The batch size can be set to 1\nwith `batchSize(n, function(err){})` after performing the initial query to the database.\n* `hint` See [Optimization: hint](http://www.mongodb.org/display/DOCS/Optimization#Optimization-Hint).\n* `explain` turns this into an explain query. You can also call\n`explain()` on any cursor to fetch the explanation.\n* `snapshot` prevents documents that are updated while the query is active\nfrom being returned multiple times. See more\n[details about query snapshots](http://www.mongodb.org/display/DOCS/How+to+do+Snapshotted+Queries+in+the+Mongo+Database).\n* `timeout` if false, asks MongoDb not to time out this cursor after an\ninactivity period.\n\n\nFor information on how to create queries, see the\n[MongoDB section on querying](http://www.mongodb.org/display/DOCS/Querying).\n\n```javascript\n    var mongodb = require('mongodb');\n    var server = new mongodb.Server(\"127.0.0.1\", 27017, {});\n    new mongodb.Db('test', server, {}).open(function (error, client) {\n      if (error) throw error;\n      var collection = new mongodb.Collection(client, 'test_collection');\n      collection.find({}, {limit:10}).toArray(function(err, docs) {\n        console.dir(docs);\n      });\n    });\n```\n\nInsert\n------\n\nSignature:\n\n```javascript\n    collection.insert(docs, options, [callback]);\n```\n\nwhere `docs` can be a single document or an array of documents.\n\nUseful options:\n\n* `safe:true` Should always set if you have a callback.\n\nSee also: [MongoDB docs for insert](http://www.mongodb.org/display/DOCS/Inserting).\n\n```javascript\n    var mongodb = require('mongodb');\n    var server = new mongodb.Server(\"127.0.0.1\", 27017, {});\n    new mongodb.Db('test', server, {w: 1}).open(function (error, client) {\n      if (error) throw error;\n      var collection = new mongodb.Collection(client, 'test_collection');\n      collection.insert({hello: 'world'}, {safe:true},\n                        function(err, objects) {\n        if (err) console.warn(err.message);\n        if (err && err.message.indexOf('E11000 ') !== -1) {\n          // this _id was already inserted in the database\n        }\n      });\n    });\n```\n\nNote that there's no reason to pass a callback to the insert or update commands\nunless you use the `safe:true` option. If you don't specify `safe:true`, then\nyour callback will be called immediately.\n\nUpdate; update and insert (upsert)\n----------------------------------\n\nThe update operation will update the first document that matches your query\n(or all documents that match if you use `multi:true`).\nIf `safe:true`, `upsert` is not set, and no documents match, your callback will return 0 documents updated.\n\nSee the [MongoDB docs](http://www.mongodb.org/display/DOCS/Updating) for\nthe modifier (`$inc`, `$set`, `$push`, etc.) formats.\n\nSignature:\n\n```javascript\n    collection.update(criteria, objNew, options, [callback]);\n```\n\nUseful options:\n\n* `safe:true` Should always set if you have a callback.\n* `multi:true` If set, all matching documents are updated, not just the first.\n* `upsert:true` Atomically inserts the document if no documents matched.\n\nExample for `update`:\n\n```javascript\n    var mongodb = require('mongodb');\n    var server = new mongodb.Server(\"127.0.0.1\", 27017, {});\n    new mongodb.Db('test', server, {w: 1}).open(function (error, client) {\n      if (error) throw error;\n      var collection = new mongodb.Collection(client, 'test_collection');\n      collection.update({hi: 'here'}, {$set: {hi: 'there'}}, {safe:true},\n                        function(err) {\n        if (err) console.warn(err.message);\n        else console.log('successfully updated');\n      });\n    });\n```\n\nFind and modify\n---------------\n\n`findAndModify` is like `update`, but it also gives the updated document to\nyour callback. But there are a few key differences between findAndModify and\nupdate:\n\n  1. The signatures differ.\n  2. You can only findAndModify a single item, not multiple items.\n\nSignature:\n\n```javascript\n    collection.findAndModify(query, sort, update, options, callback)\n```\n\nThe sort parameter is used to specify which object to operate on, if more than\none document matches. It takes the same format as the cursor sort (see\nConnection.find above).\n\nSee the\n[MongoDB docs for findAndModify](http://www.mongodb.org/display/DOCS/findAndModify+Command)\nfor more details.\n\nUseful options:\n\n* `remove:true` set to a true to remove the object before returning\n* `new:true` set to true if you want to return the modified object rather than the original. Ignored for remove.\n* `upsert:true` Atomically inserts the document if no documents matched.\n\nExample for `findAndModify`:\n\n```javascript\n    var mongodb = require('mongodb');\n    var server = new mongodb.Server(\"127.0.0.1\", 27017, {});\n    new mongodb.Db('test', server, {w: 1}).open(function (error, client) {\n      if (error) throw error;\n      var collection = new mongodb.Collection(client, 'test_collection');\n      collection.findAndModify({hello: 'world'}, [['_id','asc']], {$set: {hi: 'there'}}, {},\n                        function(err, object) {\n        if (err) console.warn(err.message);\n        else console.dir(object);  // undefined if no matching object exists.\n      });\n    });\n```\n\nSave\n----\n\nThe `save` method is a shorthand for upsert if the document contains an\n`_id`, or an insert if there is no `_id`.\n\nSponsors\n========\nJust as Felix Geisendörfer I'm also working on the driver for my own startup and this driver is a big project that also benefits other companies who are using MongoDB.\n\nIf your company could benefit from a even better-engineered node.js mongodb driver I would appreciate any type of sponsorship you may be able to provide. All the sponsors will get a lifetime display in this readme, priority support and help on problems and votes on the roadmap decisions for the driver. If you are interested contact me on [christkv AT g m a i l.com](mailto:christkv@gmail.com) for details.\n\nAnd I'm very thankful for code contributions. If you are interested in working on features please contact me so we can discuss API design and testing.\n\nRelease Notes\n=============\n\nSee HISTORY\n\nCredits\n=======\n\n1. [10gen](http://github.com/mongodb/mongo-ruby-driver/)\n2. [Google Closure Library](http://code.google.com/closure/library/)\n3. [Jonas Raoni Soares Silva](http://jsfromhell.com/classes/binary-parser)\n\nContributors\n============\n\nAaron Heckmann, Christoph Pojer, Pau Ramon Revilla, Nathan White, Emmerman, Seth LaForge, Boris Filipov, Stefan Schärmeli, Tedde Lundgren, renctan, Sergey Ukustov, Ciaran Jessup, kuno, srimonti, Erik Abele, Pratik Daga, Slobodan Utvic, Kristina Chodorow, Yonathan Randolph, Brian Noguchi, Sam Epstein, James Harrison Fisher, Vladimir Dronnikov, Ben Hockey, Henrik Johansson, Simon Weare, Alex Gorbatchev, Shimon Doodkin, Kyle Mueller, Eran Hammer-Lahav, Marcin Ciszak, François de Metz, Vinay Pulim, nstielau, Adam Wiggins, entrinzikyl, Jeremy Selier, Ian Millington, Public Keating, andrewjstone, Christopher Stott, Corey Jewett, brettkiefer, Rob Holland, Senmiao Liu, heroic, gitfy\n\nLicense\n=======\n\n Copyright 2009 - 2012 Christian Amor Kvalheim.\n\n   Licensed under the Apache License, Version 2.0 (the \"License\");\n   you may not use this file except in compliance with the License.\n   You may obtain a copy of the License at\n\n       http://www.apache.org/licenses/LICENSE-2.0\n\n   Unless required by applicable law or agreed to in writing, software\n   distributed under the License is distributed on an \"AS IS\" BASIS,\n   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n   See the License for the specific language governing permissions and\n   limitations under the License.\n\n",
+  "readmeFilename": "Readme.md",
+  "_id": "mongodb@1.3.10",
+  "_from": "mongodb@latest"
+}
diff --git a/node_modules/xml2js/.npmignore b/node_modules/xml2js/.npmignore
new file mode 100644
index 0000000..ef7b9b9
--- /dev/null
+++ b/node_modules/xml2js/.npmignore
@@ -0,0 +1,6 @@
+*.swp
+.idea
+node_modules
+src
+test
+Cakefile
\ No newline at end of file
diff --git a/node_modules/xml2js/.travis.yml b/node_modules/xml2js/.travis.yml
new file mode 100644
index 0000000..755a6b7
--- /dev/null
+++ b/node_modules/xml2js/.travis.yml
@@ -0,0 +1,5 @@
+language: node_js
+
+node_js:
+  - "0.8"
+  - "0.10"
diff --git a/node_modules/xml2js/83.coffee b/node_modules/xml2js/83.coffee
new file mode 100644
index 0000000..3443540
--- /dev/null
+++ b/node_modules/xml2js/83.coffee
@@ -0,0 +1,6 @@
+xml2js = require 'xml2js'
+util = require 'util'
+
+body = '<sample><chartest desc="Test for CHARs">Character data here!</chartest></sample>'
+xml2js.parseString body, (err, result) ->
+  console.log util.inspect result, false, null
diff --git a/node_modules/xml2js/LICENSE b/node_modules/xml2js/LICENSE
new file mode 100644
index 0000000..e3b4222
--- /dev/null
+++ b/node_modules/xml2js/LICENSE
@@ -0,0 +1,19 @@
+Copyright 2010, 2011, 2012, 2013. All rights reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to
+deal in the Software without restriction, including without limitation the
+rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+sell copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+IN THE SOFTWARE.
diff --git a/node_modules/xml2js/README.md b/node_modules/xml2js/README.md
new file mode 100644
index 0000000..b009724
--- /dev/null
+++ b/node_modules/xml2js/README.md
@@ -0,0 +1,248 @@
+node-xml2js
+===========
+
+Ever had the urge to parse XML? And wanted to access the data in some sane,
+easy way? Don't want to compile a C parser, for whatever reason? Then xml2js is
+what you're looking for!
+
+Description
+===========
+
+Simple XML to JavaScript object converter. Uses
+[sax-js](https://github.com/isaacs/sax-js/).
+
+Note: If you're looking for a full DOM parser, you probably want
+[JSDom](https://github.com/tmpvar/jsdom).
+
+Installation
+============
+
+Simplest way to install `xml2js` is to use [npm](http://npmjs.org), just `npm
+install xml2js` which will download xml2js and all dependencies.
+
+Usage
+=====
+
+No extensive tutorials required because you are a smart developer! The task of
+parsing XML should be an easy one, so let's make it so! Here's some examples.
+
+Shoot-and-forget usage
+----------------------
+
+You want to parse XML as simple and easy as possible? It's dangerous to go
+alone, take this:
+
+```javascript
+var parseString = require('xml2js').parseString;
+var xml = "<root>Hello xml2js!</root>"
+parseString(xml, function (err, result) {
+    console.dir(result);
+});
+```
+
+Can't get easier than this, right? This works starting with `xml2js` 0.2.3.
+With CoffeeScript it looks like this:
+
+```coffeescript
+parseString = require('xml2js').parseString
+xml = "<root>Hello xml2js!</root>"
+parseString xml, (err, result) ->
+    console.dir result
+```
+
+If you need some special options, fear not, `xml2js` supports a number of
+options (see below), you can specify these as second argument:
+
+```javascript
+parseString(xml, {trim: true}, function (err, result) {
+});
+```
+
+Simple as pie usage
+-------------------
+
+That's right, if you have been using xml-simple or a home-grown
+wrapper, this is was added in 0.1.11 just for you:
+
+```javascript
+var fs = require('fs'),
+    xml2js = require('xml2js');
+
+var parser = new xml2js.Parser();
+fs.readFile(__dirname + '/foo.xml', function(err, data) {
+    parser.parseString(data, function (err, result) {
+        console.dir(result);
+        console.log('Done');
+    });
+});
+```
+
+Look ma, no event listeners!
+
+You can also use `xml2js` from
+[CoffeeScript](http://jashkenas.github.com/coffee-script/), further reducing
+the clutter:
+
+```coffeescript
+fs = require 'fs',
+xml2js = require 'xml2js'
+
+parser = new xml2js.Parser()
+fs.readFile __dirname + '/foo.xml', (err, data) ->
+  parser.parseString data, (err, result) ->
+    console.dir result
+    console.log 'Done.'
+```
+
+But what happens if you forget the `new` keyword to create a new `Parser`? In
+the middle of a nightly coding session, it might get lost, after all. Worry
+not, we got you covered! Starting with 0.2.8 you can also leave it out, in
+which case `xml2js` will helpfully add it for you, no bad surprises and
+inexplicable bugs!
+
+"Traditional" usage
+-------------------
+
+Alternatively you can still use the traditional `addListener` variant that was
+supported since forever:
+
+```javascript
+var fs = require('fs'),
+    xml2js = require('xml2js');
+
+var parser = new xml2js.Parser();
+parser.addListener('end', function(result) {
+    console.dir(result);
+    console.log('Done.');
+});
+fs.readFile(__dirname + '/foo.xml', function(err, data) {
+    parser.parseString(data);
+});
+```
+
+If you want to parse multiple files, you have multiple possibilites:
+
+  * You can create one `xml2js.Parser` per file. That's the recommended one
+    and is promised to always *just work*.
+  * You can call `reset()` on your parser object.
+  * You can hope everything goes well anyway. This behaviour is not
+    guaranteed work always, if ever. Use option #1 if possible. Thanks!
+
+So you wanna some JSON?
+-----------------------
+
+Just wrap the `result` object in a call to `JSON.stringify` like this
+`JSON.stringify(result)`. You get a string containing the JSON representation
+of the parsed object that you can feed to JSON-hungry consumers.
+
+Displaying results
+------------------
+
+You might wonder why, using `console.dir` or `console.log` the output at some
+level is only `[Object]`. Don't worry, this is not because xml2js got lazy.
+That's because Node uses `util.inspect` to convert the object into strings and
+that function stops after `depth=2` which is a bit low for most XML.
+
+To display the whole deal, you can use `console.log(util.inspect(result, false,
+null))`, which displays the whole result.
+
+So much for that, but what if you use
+[eyes](https://github.com/cloudhead/eyes.js) for nice colored output and it
+truncates the output with `…`? Don't fear, there's also a solution for that,
+you just need to increase the `maxLength` limit by creating a custom inspector
+`var inspect = require('eyes').inspector({maxLength: false})` and then you can
+easily `inspect(result)`.
+
+Options
+=======
+
+Apart from the default settings, there is a number of options that can be
+specified for the parser. Options are specified by ``new Parser({optionName:
+value})``. Possible options are:
+
+  * `attrkey` (default: `$`): Prefix that is used to access the attributes.
+    Version 0.1 default was `@`.
+  * `charkey` (default: `_`): Prefix that is used to access the character
+    content. Version 0.1 default was `#`.
+  * `explicitCharkey` (default: `false`)
+  * `trim` (default: `false`): Trim the whitespace at the beginning and end of
+    text nodes.
+  * `normalizeTags` (default: `false`): Normalize all tag names to lowercase.
+  * `normalize` (default: `false`): Trim whitespaces inside text nodes.
+  * `explicitRoot` (default: `true`): Set this if you want to get the root
+    node in the resulting object.
+  * `emptyTag` (default: `undefined`): what will the value of empty nodes be.
+    Default is `{}`.
+  * `explicitArray` (default: `true`): Always put child nodes in an array if
+    true; otherwise an array is created only if there is more than one.
+  * `ignoreAttrs` (default: `false`): Ignore all XML attributes and only create
+    text nodes.
+  * `mergeAttrs` (default: `false`): Merge attributes and child elements as
+    properties of the parent, instead of keying attributes off a child
+    attribute object. This option is ignored if `ignoreAttrs` is `false`.
+  * `validator` (default `null`): You can specify a callable that validates
+    the resulting structure somehow, however you want. See unit tests
+    for an example.
+  * `xmlns` (default `false`): Give each element a field usually called '$ns'
+    (the first character is the same as attrkey) that contains its local name
+    and namespace URI.
+  * `explicitChildren` (default `false`): Put child elements to separate
+    property. Doesn't work with `mergeAttrs = true`. If element has no children
+    then "children" won't be created. Added in 0.2.5.
+  * `childkey` (default `$$`): Prefix that is used to access child elements if
+    `explicitChildren` is set to `true`. Added in 0.2.5.
+  * `charsAsChildren` (default `false`): Determines whether chars should be
+    considered children if `explicitChildren` is on. Added in 0.2.5.
+  * `async` (default `false`): Should the callbacks be async? This *might* be
+    an incompatible change if your code depends on sync execution of callbacks.
+    xml2js 0.3 might change this default, so the recommendation is to not
+    depend on sync execution anyway. Added in 0.2.6.
+  * `strict` (default `true`): Set sax-js to strict or non-strict parsing mode.
+    Defaults to `true` which is *highly* recommended, since parsing HTML which
+    is not well-formed XML might yield just about anything. Added in 0.2.7.
+
+Updating to new version
+=======================
+
+Version 0.2 changed the default parsing settings, but version 0.1.14 introduced
+the default settings for version 0.2, so these settings can be tried before the
+migration.
+
+```javascript
+var xml2js = require('xml2js');
+var parser = new xml2js.Parser(xml2js.defaults["0.2"]);
+```
+
+To get the 0.1 defaults in version 0.2 you can just use
+`xml2js.defaults["0.1"]` in the same place. This provides you with enough time
+to migrate to the saner way of parsing in xml2js 0.2. We try to make the
+migration as simple and gentle as possible, but some breakage cannot be
+avoided.
+
+So, what exactly did change and why? In 0.2 we changed some defaults to parse
+the XML in a more universal and sane way. So we disabled `normalize` and `trim`
+so xml2js does not cut out any text content. You can reenable this at will of
+course. A more important change is that we return the root tag in the resulting
+JavaScript structure via the `explicitRoot` setting, so you need to access the
+first element. This is useful for anybody who wants to know what the root node
+is and preserves more information. The last major change was to enable
+`explicitArray`, so everytime it is possible that one might embed more than one
+sub-tag into a tag, xml2js >= 0.2 returns an array even if the array just
+includes one element. This is useful when dealing with APIs that return
+variable amounts of subtags.
+
+Running tests, development
+==========================
+
+[![Build Status](https://secure.travis-ci.org/Leonidas-from-XIV/node-xml2js.png?branch=master)](https://travis-ci.org/Leonidas-from-XIV/node-xml2js)
+
+The development requirements are handled by npm, you just need to install them.
+We also have a number of unit tests, they can be run using `npm test` directly
+from the project root. This runs zap to discover all the tests and execute
+them.
+
+If you like to contribute, keep in mind that xml2js is written in CoffeeScript,
+so don't develop on the JavaScript files that are checked into the repository
+for convenience reasons. Also, please write some unit test to check your
+behaviour and if it is some user-facing thing, add some documentation to this
+README, so people will know it exists. Thanks in advance!
diff --git a/node_modules/xml2js/canon.xml b/node_modules/xml2js/canon.xml
new file mode 100644
index 0000000..f24ddd1
--- /dev/null
+++ b/node_modules/xml2js/canon.xml
@@ -0,0 +1,482 @@
+<GBSet>
+<GBSeq>
+  <GBSeq_locus>AF485783</GBSeq_locus>
+  <GBSeq_length>14758</GBSeq_length>
+  <GBSeq_strandedness>double</GBSeq_strandedness>
+  <GBSeq_moltype>DNA</GBSeq_moltype>
+  <GBSeq_topology>circular</GBSeq_topology>
+  <GBSeq_division>SYN</GBSeq_division>
+  <GBSeq_update-date>15-MAY-2003</GBSeq_update-date>
+  <GBSeq_create-date>21-MAR-2002</GBSeq_create-date>
+  <GBSeq_definition>Binary vector pBI121, complete sequence</GBSeq_definition>
+  <GBSeq_primary-accession>AF485783</GBSeq_primary-accession>
+  <GBSeq_accession-version>AF485783.1</GBSeq_accession-version>
+  <GBSeq_other-seqids>
+    <GBSeqid>gb|AF485783.1|</GBSeqid>
+    <GBSeqid>gi|19569229</GBSeqid>
+  </GBSeq_other-seqids>
+  <GBSeq_source>Binary vector pBI121</GBSeq_source>
+  <GBSeq_organism>Binary vector pBI121</GBSeq_organism>
+  <GBSeq_taxonomy>other sequences; artificial sequences; vectors</GBSeq_taxonomy>
+  <GBSeq_references>
+    <GBReference>
+      <GBReference_reference>1</GBReference_reference>
+      <GBReference_position>1..14758</GBReference_position>
+      <GBReference_authors>
+        <GBAuthor>Chen,P.Y.</GBAuthor>
+        <GBAuthor>Wang,C.K.</GBAuthor>
+        <GBAuthor>Soong,S.C.</GBAuthor>
+        <GBAuthor>To,K.Y.</GBAuthor>
+      </GBReference_authors>
+      <GBReference_title>Complete sequence of the binary vector pBI121 and its application in cloning T-DNA insertion from transgenic plants</GBReference_title>
+      <GBReference_journal>Mol. Breed. 11, 287-293 (2003)</GBReference_journal>
+    </GBReference>
+    <GBReference>
+      <GBReference_reference>2</GBReference_reference>
+      <GBReference_position>1..14758</GBReference_position>
+      <GBReference_authors>
+        <GBAuthor>To,K.Y.</GBAuthor>
+      </GBReference_authors>
+      <GBReference_title>Direct Submission</GBReference_title>
+      <GBReference_journal>Submitted (20-FEB-2002) Institute of BioAgricultural Sciences, Academia Sinica, Taipei 11529, Taiwan</GBReference_journal>
+    </GBReference>
+  </GBSeq_references>
+  <GBSeq_feature-table>
+    <GBFeature>
+      <GBFeature_key>source</GBFeature_key>
+      <GBFeature_location>1..14758</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>1</GBInterval_from>
+          <GBInterval_to>14758</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>organism</GBQualifier_name>
+          <GBQualifier_value>Binary vector pBI121</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>mol_type</GBQualifier_name>
+          <GBQualifier_value>genomic DNA</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>db_xref</GBQualifier_name>
+          <GBQualifier_value>taxon:189807</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>constructed using pB221 from Clontech Laboratories and Bin19 described in GenBank Accession Number U09365</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(13..796)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>796</GBInterval_from>
+          <GBInterval_to>13</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to traF in GenBank Accession Number X54459</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>rep_origin</GBFeature_key>
+      <GBFeature_location>complement(790..1168)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>1168</GBInterval_from>
+          <GBInterval_to>790</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>ColE1 ori; similar to sequence in GenBank Accession Number V00268</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(1161..2344)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>2344</GBInterval_from>
+          <GBInterval_to>1161</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to tetA in GenBank Accession Number X75761</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(2454..2478)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>2478</GBInterval_from>
+          <GBInterval_to>2454</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>T-DNA right border</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>promoter</GBFeature_key>
+      <GBFeature_location>2519..2825</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>2519</GBInterval_from>
+          <GBInterval_to>2825</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>NOS</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>gene</GBFeature_key>
+      <GBFeature_location>2838..3632</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>2838</GBInterval_from>
+          <GBInterval_to>3632</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>gene</GBQualifier_name>
+          <GBQualifier_value>nptII</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>CDS</GBFeature_key>
+      <GBFeature_location>2838..3632</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>2838</GBInterval_from>
+          <GBInterval_to>3632</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>gene</GBQualifier_name>
+          <GBQualifier_value>nptII</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>codon_start</GBQualifier_name>
+          <GBQualifier_value>1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>transl_table</GBQualifier_name>
+          <GBQualifier_value>1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>product</GBQualifier_name>
+          <GBQualifier_value>neomycin phosphotransferase II</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>protein_id</GBQualifier_name>
+          <GBQualifier_value>AAL92039.1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>db_xref</GBQualifier_name>
+          <GBQualifier_value>GI:19569230</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>translation</GBQualifier_name>
+          <GBQualifier_value>MIEQDGLHAGSPAAWVERLFGYDWAQQTIGCSDAAVFRLSAQGRPVLFVKTDLSGALNELQDEAARLSWLATTGVPCAAVLDVVTEAGRDWLLLGEVPGQDLLSSHLAPAEKVSIMADAMRRLHTLDPATCPFDHQAKHRIERARTRMEAGLVDQDDLDEEHQGLAPAELFARLKARMPDGDDLVVTHGDACLPNIMVENGRFSGFIDCGRLGVADRYQDIALATRDIAEELGGEWADRFLVLYGIAAPDSQRIAFYRLLDEFF</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>terminator</GBFeature_key>
+      <GBFeature_location>4022..4277</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>4022</GBInterval_from>
+          <GBInterval_to>4277</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>NOS</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>promoter</GBFeature_key>
+      <GBFeature_location>4974..5808</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>4974</GBInterval_from>
+          <GBInterval_to>5808</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>CaMV 35S</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>gene</GBFeature_key>
+      <GBFeature_location>5845..7656</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>5845</GBInterval_from>
+          <GBInterval_to>7656</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>gene</GBQualifier_name>
+          <GBQualifier_value>gusA</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>CDS</GBFeature_key>
+      <GBFeature_location>5845..7656</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>5845</GBInterval_from>
+          <GBInterval_to>7656</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>gene</GBQualifier_name>
+          <GBQualifier_value>gusA</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>GUS</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>codon_start</GBQualifier_name>
+          <GBQualifier_value>1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>transl_table</GBQualifier_name>
+          <GBQualifier_value>1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>product</GBQualifier_name>
+          <GBQualifier_value>beta-glucuronidase</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>protein_id</GBQualifier_name>
+          <GBQualifier_value>AAL92040.1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>db_xref</GBQualifier_name>
+          <GBQualifier_value>GI:19569231</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>translation</GBQualifier_name>
+          <GBQualifier_value>MLRPVETPTREIKKLDGLWAFSLDRENCGIDQRWWESALQESRAIAVPGSFNDQFADADIRNYAGNVWYQREVFIPKGWAGQRIVLRFDAVTHYGKVWVNNQEVMEHQGGYTPFEADVTPYVIAGKSVRITVCVNNELNWQTIPPGMVITDENGKKKQSYFHDFFNYAGIHRSVMLYTTPNTWVDDITVVTHVAQDCNHASVDWQVVANGDVSVELRDADQQVVATGQGTSGTLQVVNPHLWQPGEGYLYELCVTAKSQTECDIYPLRVGIRSVAVKGEQFLINHKPFYFTGFGRHEDADLRGKGFDNVLMVHDHALMDWIGANSYRTSHYPYAEEMLDWADEHGIVVIDETAAVGFNLSLGIGFEAGNKPKELYSEEAVNGETQQAHLQAIKELIARDKNHPSVVMWSIANEPDTRPQGAREYFAPLAEATRKLDPTRPITCVNVMFCDAHTDTISDLFDVLCLNRYYGWYVQSGDLETAEKVLEKELLAWQEKLHQPIIITEYGVDTLAGLHSMYTDMWSEEYQCAWLDMYHRVFDRVSAVVGEQVWNFADFATSQGILRVGGNKKGIFTRDRKPKSAAFLLQKRWTGMNFGEKPQQGGKQ</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>terminator</GBFeature_key>
+      <GBFeature_location>7727..7979</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>7727</GBInterval_from>
+          <GBInterval_to>7979</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>NOS</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(8621..8646)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>8646</GBInterval_from>
+          <GBInterval_to>8621</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>T-DNA left border</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(9156..10198)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>10198</GBInterval_from>
+          <GBInterval_to>9156</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to tetA in GenBank Accession Number L13842</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(10199..11680)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>11680</GBInterval_from>
+          <GBInterval_to>10199</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to trfA in GenBank Accession Number X00713</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(11681..12673)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>12673</GBInterval_from>
+          <GBInterval_to>11681</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to NPTIII gene in GenBank Accession Number V01547</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(12674..13443)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>13443</GBInterval_from>
+          <GBInterval_to>12674</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to transposable element IS1 in GenBank Accession Number X58999</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(13444..13794)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>13794</GBInterval_from>
+          <GBInterval_to>13444</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similarity to NPT III gene in GenBank Accession Number V01547</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(13795..14066)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>14066</GBInterval_from>
+          <GBInterval_to>13795</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to kilA in GenBank Accession Number M62846</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>rep_origin</GBFeature_key>
+      <GBFeature_location>complement(14141..14758)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>14758</GBInterval_from>
+          <GBInterval_to>14141</GBInterval_to>
+          <GBInterval_iscomp value="true"></GBInterval_iscomp>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>ori V; similar to sequence in GenBank Accession Number M20134</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+  </GBSeq_feature-table>
+  <GBSeq_sequence>tgagcgtcgcaaaggcgctcggtcttgccttgctcgtcggtgatgtacttcaccagctccgcgaagtcgctcttcttgatggagcgcatggggacgtgcttggcaatcacgcgcaccccccggccgttttagcggctaaaaaagtcatggctctgccctcgggcggaccacgcccatcatgaccttgccaagctcgtcctgcttctcttcgatcttcgccagcagggcgaggatcgtggcatcaccgaaccgcgccgtgcgcgggtcgtcggtgagccagagtttcagcaggccgcccaggcggcccaggtcgccattgatgcgggccagctcgcggacgtgctcatagtccacgacgcccgtgattttgtagccctggccgacggccagcaggtaggccgacaggctcatgccggccgccgccgccttttcctcaatcgctcttcgttcgtctggaaggcagtacaccttgataggtgggctgcccttcctggttggcttggtttcatcagccatccgcttgccctcatctgttacgccggcggtagccggccagcctcgcagagcaggattcccgttgagcaccgccaggtgcgaataagggacagtgaagaaggaacacccgctcgcgggtgggcctacttcacctatcctgcccggctgacgccgttggatacaccaaggaaagtctacacgaaccctttggcaaaatcctgtatatcgtgcgaaaaaggatggatataccgaaaaaatcgctataatgaccccgaagcagggttatgcagcggaaaagcgccacgcttcccgaagggagaaaggcggacaggtatccggtaagcggcagggtcggaacaggagagcgcacgagggagcttccagggggaaacgcctggtatctttatagtcctgtcgggtttcgccacctctgacttgagcgtcgatttttgtgatgctcgtcaggggggcggagcctatggaaaaacgccagcaacgcggcctttttacggttcctggccttttgctggccttttgctcacatgttctttcctgcgttatcccctgattctgtggataaccgtattaccgcctttgagtgagctgataccgctcgccgcagccgaacgaccgagcgcagcgagtcagtgagcgaggaagcggaagagcgccagaaggccgccagagaggccgagcgcggccgtgaggcttggacgctagggcagggcatgaaaaagcccgtagcgggctgctacgggcgtctgacgcggtggaaagggggaggggatgttgtctacatggctctgctgtagtgagtgggttgcgctccggcagcggtcctgatcaatcgtcaccctttctcggtccttcaacgttcctgacaacgagcctccttttcgccaatccatcgacaatcaccgcgagtccctgctcgaacgctgcgtccggaccggcttcgtcgaaggcgtctatcgcggcccgcaacagcggcgagagcggagcctgttcaacggtgccgccgcgctcgccggcatcgctgtcgccggcctgctcctcaagcacggccccaacagtgaagtagctgattgtcatcagcgcattgacggcgtccccggccgaaaaacccgcctcgcagaggaagcgaagctgcgcgtcggccgtttccatctgcggtgcgcccggtcgcgtgccggcatggatgcgcgcgccatcgcggtaggcgagcagcgcctgcctgaagctgcgggcattcccgatcagaaatgagcgccagtcgtcgtcggctctcggcaccgaatgcgtatgattctccgccagcatggcttcggccagtgcgtcgagcagcgcccgcttgttcctgaagtgccagtaaagcgccggctgctgaacccccaaccgttccgccagtttgcgtgtcgtcagaccgtctacgccgacctcgttcaacaggtccagggcggcacggatcactgtattcggctgcaactttgtcatgcttgacactttatcactgataaacataatatgtccaccaacttatcagtgataaagaatccgcgcgttcaatcggaccagcggaggctggtccggaggccagacgtgaaacccaacatacccctgatcgtaattctgagcactgtcgcgctcgacgctgtcggcatcggcctgattatgccggtgctgccgggcctcctgcgcgatctggttcactcgaacgacgtcaccgcccactatggcattctgctggcgctgtatgcgttggtgcaatttgcctgcgcacctgtgctgggcgcgctgtcggatcgtttcgggcggcggccaatcttgctcgtctcgctggccggcgccagatctggggaaccctgtggttggcatgcacatacaaatggacgaacggataaaccttttcacgcccttttaaatatccgattattctaataaacgctcttttctcttaggtttacccgccaatatatcctgtcaaacactgatagtttaaactgaaggcgggaaacgacaatctgatcatgagcggagaattaagggagtcacgttatgacccccgccgatgacgcgggacaagccgttttacgtttggaactgacagaaccgcaacgttgaaggagccactcagccgcgggtttctggagtttaatgagctaagcacatacgtcagaaaccattattgcgcgttcaaaagtcgcctaaggtcactatcagctagcaaatatttcttgtcaaaaatgctccactgacgttccataaattcccctcggtatccaattagagtctcatattcactctcaatccaaataatctgcaccggatctggatcgtttcgcatgattgaacaagatggattgcacgcaggttctccggccgcttgggtggagaggctattcggctatgactgggcacaacagacaatcggctgctctgatgccgccgtgttccggctgtcagcgcaggggcgcccggttctttttgtcaagaccgacctgtccggtgccctgaatgaactgcaggacgaggcagcgcggctatcgtggctggccacgacgggcgttccttgcgcagctgtgctcgacgttgtcactgaagcgggaagggactggctgctattgggcgaagtgccggggcaggatctcctgtcatctcaccttgctcctgccgagaaagtatccatcatggctgatgcaatgcggcggctgcatacgcttgatccggctacctgcccattcgaccaccaagcgaaacatcgcatcgagcgagcacgtactcggatggaagccggtcttgtcgatcaggatgatctggacgaagagcatcaggggctcgcgccagccgaactgttcgccaggctcaaggcgcgcatgcccgacggcgatgatctcgtcgtgacccatggcgatgcctgcttgccgaatatcatggtggaaaatggccgcttttctggattcatcgactgtggccggctgggtgtggcggaccgctatcaggacatagcgttggctacccgtgatattgctgaagagcttggcggcgaatgggctgaccgcttcctcgtgctttacggtatcgccgctcccgattcgcagcgcatcgccttctatcgccttcttgacgagttcttctgagcgggactctggggttcgaaatgaccgaccaagcgacgcccaacctgccatcacgagatttcgattccaccgccgccttctatgaaaggttgggcttcggaatcgttttccgggacgccggctggatgatcctccagcgcggggatctcatgctggagttcttcgcccacgggatctctgcggaacaggcggtcgaaggtgccgatatcattacgacagcaacggccgacaagcacaacgccacgatcctgagcgacaatatgatcgggcccggcgtccacatcaacggcgtcggcggcgactgcccaggcaagaccgagatgcaccgcgatatcttgctgcgttcggatattttcgtggagttcccgccacagacccggatgatccccgatcgttcaaacatttggcaataaagtttcttaagattgaatcctgttgccggtcttgcgatgattatcatataatttctgttgaattacgttaagcatgtaataattaacatgtaatgcatgacgttatttatgagatgggtttttatgattagagtcccgcaattatacatttaatacgcgatagaaaacaaaatatagcgcgcaaactaggataaattatcgcgcgcggtgtcatctatgttactagatcgggcctcctgtcaatgctggcggcggctctggtggtggttctggtggcggctctgagggtggtggctctgagggtggcggttctgagggtggcggctctgagggaggcggttccggtggtggctctggttccggtgattttgattatgaaaagatggcaaacgctaataagggggctatgaccgaaaatgccgatgaaaacgcgctacagtctgacgctaaaggcaaacttgattctgtcgctactgattacggtgctgctatcgatggtttcattggtgacgtttccggccttgctaatggtaatggtgctactggtgattttgctggctctaattcccaaatggctcaagtcggtgacggtgataattcacctttaatgaataatttccgtcaatatttaccttccctccctcaatcggttgaatgtcgcccttttgtctttggcccaatacgcaaaccgcctctccccgcgcgttggccgattcattaatgcagctggcacgacaggtttcccgactggaaagcgggcagtgagcgcaacgcaattaatgtgagttagctcactcattaggcaccccaggctttacactttatgcttccggctcgtatgttgtgtggaattgtgagcggataacaatttcacacaggaaacagctatgaccatgattacgccaagcttgcatgcctgcaggtccccagattagccttttcaatttcagaaagaatgctaacccacagatggttagagaggcttacgcagcaggtctcatcaagacgatctacccgagcaataatctccaggaaatcaaataccttcccaagaaggttaaagatgcagtcaaaagattcaggactaactgcatcaagaacacagagaaagatatatttctcaagatcagaagtactattccagtatggacgattcaaggcttgcttcacaaaccaaggcaagtaatagagattggagtctctaaaaaggtagttcccactgaatcaaaggccatggagtcaaagattcaaatagaggacctaacagaactcgccgtaaagactggcgaacagttcatacagagtctcttacgactcaatgacaagaagaaaatcttcgtcaacatggtggagcacgacacacttgtctactccaaaaatatcaaagatacagtctcagaagaccaaagggcaattgagacttttcaacaaagggtaatatccggaaacctcctcggattccattgcccagctatctgtcactttattgtgaagatagtggaaaaggaaggtggctcctacaaatgccatcattgcgataaaggaaaggccatcgttgaagatgcctctgccgacagtggtcccaaagatggacccccacccacgaggagcatcgtggaaaaagaagacgttccaaccacgtcttcaaagcaagtggattgatgtgatatctccactgacgtaagggatgacgcacaatcccactatccttcgcaagacccttcctctatataaggaagttcatttcatttggagagaacacgggggactctagaggatccccgggtggtcagtcccttatgttacgtcctgtagaaaccccaacccgtgaaatcaaaaaactcgacggcctgtgggcattcagtctggatcgcgaaaactgtggaattgatcagcgttggtgggaaagcgcgttacaagaaagccgggcaattgctgtgccaggcagttttaacgatcagttcgccgatgcagatattcgtaattatgcgggcaacgtctggtatcagcgcgaagtctttataccgaaaggttgggcaggccagcgtatcgtgctgcgtttcgatgcggtcactcattacggcaaagtgtgggtcaataatcaggaagtgatggagcatcagggcggctatacgccatttgaagccgatgtcacgccgtatgttattgccgggaaaagtgtacgtatcaccgtttgtgtgaacaacgaactgaactggcagactatcccgccgggaatggtgattaccgacgaaaacggcaagaaaaagcagtcttacttccatgatttctttaactatgccggaatccatcgcagcgtaatgctctacaccacgccgaacacctgggtggacgatatcaccgtggtgacgcatgtcgcgcaagactgtaaccacgcgtctgttgactggcaggtggtggccaatggtgatgtcagcgttgaactgcgtgatgcggatcaacaggtggttgcaactggacaaggcactagcgggactttgcaagtggtgaatccgcacctctggcaaccgggtgaaggttatctctatgaactgtgcgtcacagccaaaagccagacagagtgtgatatctacccgcttcgcgtcggcatccggtcagtggcagtgaagggcgaacagttcctgattaaccacaaaccgttctactttactggctttggtcgtcatgaagatgcggacttgcgtggcaaaggattcgataacgtgctgatggtgcacgaccacgcattaatggactggattggggccaactcctaccgtacctcgcattacccttacgctgaagagatgctcgactgggcagatgaacatggcatcgtggtgattgatgaaactgctgctgtcggctttaacctctctttaggcattggtttcgaagcgggcaacaagccgaaagaactgtacagcgaagaggcagtcaacggggaaactcagcaagcgcacttacaggcgattaaagagctgatagcgcgtgacaaaaaccacccaagcgtggtgatgtggagtattgccaacgaaccggatacccgtccgcaaggtgcacgggaatatttcgcgccactggcggaagcaacgcgtaaactcgacccgacgcgtccgatcacctgcgtcaatgtaatgttctgcgacgctcacaccgataccatcagcgatctctttgatgtgctgtgcctgaaccgttattacggatggtatgtccaaagcggcgatttggaaacggcagagaaggtactggaaaaagaacttctggcctggcaggagaaactgcatcagccgattatcatcaccgaatacggcgtggatacgttagccgggctgcactcaatgtacaccgacatgtggagtgaagagtatcagtgtgcatggctggatatgtatcaccgcgtctttgatcgcgtcagcgccgtcgtcggtgaacaggtatggaatttcgccgattttgcgacctcgcaaggcatattgcgcgttggcggtaacaagaaagggatcttcactcgcgaccgcaaaccgaagtcggcggcttttctgctgcaaaaacgctggactggcatgaacttcggtgaaaaaccgcagcagggaggcaaacaatgaatcaacaactctcctggcgcaccatcgtcggctacagcctcgggaattgctaccgagctcgaatttccccgatcgttcaaacatttggcaataaagtttcttaagattgaatcctgttgccggtcttgcgatgattatcatataatttctgttgaattacgttaagcatgtaataattaacatgtaatgcatgacgttatttatgagatgggtttttatgattagagtcccgcaattatacatttaatacgcgatagaaaacaaaatatagcgcgcaaactaggataaattatcgcgcgcggtgtcatctatgttactagatcgggaattcactggccgtcgttttacaacgtcgtgactgggaaaaccctggcgttacccaacttaatcgccttgcagcacatccccctttcgccagctggcgtaatagcgaagaggcccgcaccgatcgcccttcccaacagttgcgcagcctgaatggcgcccgctcctttcgctttcttcccttcctttctcgccacgttcgccggctttccccgtcaagctctaaatcgggggctccctttagggttccgatttagtgctttacggcacctcgaccccaaaaaacttgatttgggtgatggttcacgtagtgggccatcgccctgatagacggtttttcgccctttgacgttggagtccacgttctttaatagtggactcttgttccaaactggaacaacactcaaccctatctcgggctattcttttgatttataagggattttgccgatttcggaaccaccatcaaacaggattttcgcctgctggggcaaaccagcgtggaccgcttgctgcaactctctcagggccaggcggtgaagggcaatcagctgttgcccgtctcactggtgaaaagaaaaaccaccccagtacattaaaaacgtccgcaatgtgttattaagttgtctaagcgtcaatttgtttacaccacaatatatcctgccaccagccagccaacagctccccgaccggcagctcggcacaaaatcaccactcgatacaggcagcccatcagtccgggacggcgtcagcgggagagccgttgtaaggcggcagactttgctcatgttaccgatgctattcggaagaacggcaactaagctgccgggtttgaaacacggatgatctcgcggagggtagcatgttgattgtaacgatgacagagcgttgctgcctgtgatcaaatatcatctccctcgcagagatccgaattatcagccttcttattcatttctcgcttaaccgtgacaggctgtcgatcttgagaactatgccgacataataggaaatcgctggataaagccgctgaggaagctgagtggcgctatttctttagaagtgaacgttgacgatatcaactcccctatccattgctcaccgaatggtacaggtcggggacccgaagttccgactgtcggcctgatgcatccccggctgatcgaccccagatctggggctgagaaagcccagtaaggaaacaactgtaggttcgagtcgcgagatcccccggaaccaaaggaagtaggttaaacccgctccgatcaggccgagccacgccaggccgagaacattggttcctgtaggcatcgggattggcggatcaaacactaaagctactggaacgagcagaagtcctccggccgccagttgccaggcggtaaaggtgagcagaggcacgggaggttgccacttgcgggtcagcacggttccgaacgccatggaaaccgcccccgccaggcccgctgcgacgccgacaggatctagcgctgcgtttggtgtcaacaccaacagcgccacgcccgcagttccgcaaatagcccccaggaccgccatcaatcgtatcgggctacctagcagagcggcagagatgaacacgaccatcagcggctgcacagcgcctaccgtcgccgcgaccccgcccggcaggcggtagaccgaaataaacaacaagctccagaatagcgaaatattaagtgcgccgaggatgaagatgcgcatccaccagattcccgttggaatctgtcggacgatcatcacgagcaataaacccgccggcaacgcccgcagcagcataccggcgacccctcggcctcgctgttcgggctccacgaaaacgccggacagatgcgccttgtgagcgtccttggggccgtcctcctgtttgaagaccgacagcccaatgatctcgccgtcgatgtaggcgccgaatgccacggcatctcgcaaccgttcagcgaacgcctccatgggctttttctcctcgtgctcgtaaacggacccgaacatctctggagctttcttcagggccgacaatcggatctcgcggaaatcctgcacgtcggccgctccaagccgtcgaatctgagccttaatcacaattgtcaattttaatcctctgtttatcggcagttcgtagagcgcgccgtgcgtcccgagcgatactgagcgaagcaagtgcgtcgagcagtgcccgcttgttcctgaaatgccagtaaagcgctggctgctgaacccccagccggaactgaccccacaaggccctagcgtttgcaatgcaccaggtcatcattgacccaggcgtgttccaccaggccgctgcctcgcaactcttcgcaggcttcgccgacctgctcgcgccacttcttcacgcgggtggaatccgatccgcacatgaggcggaaggtttccagcttgagcgggtacggctcccggtgcgagctgaaatagtcgaacatccgtcgggccgtcggcgacagcttgcggtacttctcccatatgaatttcgtgtagtggtcgccagcaaacagcacgacgatttcctcgtcgatcaggacctggcaacgggacgttttcttgccacggtccaggacgcggaagcggtgcagcagcgacaccgattccaggtgcccaacgcggtcggacgtgaagcccatcgccgtcgcctgtaggcgcgacaggcattcctcggccttcgtgtaataccggccattgatcgaccagcccaggtcctggcaaagctcgtagaacgtgaaggtgatcggctcgccgataggggtgcgcttcgcgtactccaacacctgctgccacaccagttcgtcatcgtcggcccgcagctcgacgccggtgtaggtgatcttcacgtccttgttgacgtggaaaatgaccttgttttgcagcgcctcgcgcgggattttcttgttgcgcgtggtgaacagggcagagcgggccgtgtcgtttggcatcgctcgcatcgtgtccggccacggcgcaatatcgaacaaggaaagctgcatttccttgatctgctgcttcgtgtgtttcagcaacgcggcctgcttggcctcgctgacctgttttgccaggtcctcgccggcggtttttcgcttcttggtcgtcatagttcctcgcgtgtcgatggtcatcgacttcgccaaacctgccgcctcctgttcgagacgacgcgaacgctccacggcggccgatggcgcgggcagggcagggggagccagttgcacgctgtcgcgctcgatcttggccgtagcttgctggaccatcgagccgacggactggaaggtttcgcggggcgcacgcatgacggtgcggcttgcgatggtttcggcatcctcggcggaaaaccccgcgtcgatcagttcttgcctgtatgccttccggtcaaacgtccgattcattcaccctccttgcgggattgccccgactcacgccggggcaatgtgcccttattcctgatttgacccgcctggtgccttggtgtccagataatccaccttatcggcaatgaagtcggtcccgtagaccgtctggccgtccttctcgtacttggtattccgaatcttgccctgcacgaataccagcgaccccttgcccaaatacttgccgtgggcctcggcctgagagccaaaacacttgatgcggaagaagtcggtgcgctcctgcttgtcgccggcatcgttgcgccacatctaggtactaaaacaattcatccagtaaaatataatattttattttctcccaatcaggcttgatccccagtaagtcaaaaaatagctcgacatactgttcttccccgatatcctccctgatcgaccggacgcagaaggcaatgtcataccacttgtccgccctgccgcttctcccaagatcaataaagccacttactttgccatctttcacaaagatgttgctgtctcccaggtcgccgtgggaaaagacaagttcctcttcgggcttttccgtctttaaaaaatcatacagctcgcgcggatctttaaatggagtgtcttcttcccagttttcgcaatccacatcggccagatcgttattcagtaagtaatccaattcggctaagcggctgtctaagctattcgtatagggacaatccgatatgtcgatggagtgaaagagcctgatgcactccgcatacagctcgataatcttttcagggctttgttcatcttcatactcttccgagcaaaggacgccatcggcctcactcatgagcagattgctccagccatcatgccgttcaaagtgcaggacctttggaacaggcagctttccttccagccatagcatcatgtccttttcccgttccacatcataggtggtccctttataccggctgtccgtcatttttaaatataggttttcattttctcccaccagcttatataccttagcaggagacattccttccgtatcttttacgcagcggtatttttcgatcagttttttcaattccggtgatattctcattttagccatttattatttccttcctcttttctacagtatttaaagataccccaagaagctaattataacaagacgaactccaattcactgttccttgcattctaaaaccttaaataccagaaaacagctttttcaaagttgttttcaaagttggcgtataacatagtatcgacggagccgattttgaaaccacaattatgggtgatgctgccaacttactgatttagtgtatgatggtgtttttgaggtgctccagtggcttctgtgtctatcagctgtccctcctgttcagctactgacggggtggtgcgtaacggcaaaagcaccgccggacatcagcgctatctctgctctcactgccgtaaaacatggcaactgcagttcacttacaccgcttctcaacccggtacgcaccagaaaatcattgatatggccatgaatggcgttggatgccgggcaacagcccgcattatgggcgttggcctcaacacgattttacgtcacttaaaaaactcaggccgcagtcggtaacctcgcgcatacagccgggcagtgacgtcatcgtctgcgcggaaatggacgaacagtggggctatgtcggggctaaatcgcgccagcgctggctgttttacgcgtatgacagtctccggaagacggttgttgcgcacgtattcggtgaacgcactatggcgacgctggggcgtcttatgagcctgctgtcaccctttgacgtggtgatatggatgacggatggctggccgctgtatgaatcccgcctgaagggaaagctgcacgtaatcagcaagcgatatacgcagcgaattgagcggcataacctgaatctgaggcagcacctggcacggctgggacggaagtcgctgtcgttctcaaaatcggtggagctgcatgacaaagtcatcgggcattatctgaacataaaacactatcaataagttggagtcattacccaattatgatagaatttacaagctataaggttattgtcctgggtttcaagcattagtccatgcaagtttttatgctttgcccattctatagatatattgataagcgcgctgcctatgccttgccccctgaaatccttacatacggcgatatcttctatataaaagatatattatcttatcagtattgtcaatatattcaaggcaatctgcctcctcatcctcttcatcctcttcgtcttggtagctttttaaatatggcgcttcatagagtaattctgtaaaggtccaattctcgttttcatacctcggtataatcttacctatcacctcaaatggttcgctgggtttatcgcacccccgaacacgagcacggcacccgcgaccactatgccaagaatgcccaaggtaaaaattgccggccccgccatgaagtccgtgaatgccccgacggccgaagtgaagggcaggccgccacccaggccgccgccctcactgcccggcacctggtcgctgaatgtcgatgccagcacctgcggcacgtcaatgcttccgggcgtcgcgctcgggctgatcgcccatcccgttactgccccgatcccggcaatggcaaggactgccagcgctgccatttttggggtgaggccgttcgcggccgaggggcgcagcccctggggggatgggaggcccgcgttagcgggccgggagggttcgagaagggggggcaccccccttcggcgtgcgcggtcacgcgcacagggcgcagccctggttaaaaacaaggtttataaatattggtttaaaagcaggttaaaagacaggttagcggtggccgaaaaacgggcggaaacccttgcaaatgctggattttctgcctgtggacagcccctcaaatgtcaataggtgcgcccctcatctgtcagcactctgcccctcaagtgtcaaggatcgcgcccctcatctgtcagtagtcgcgcccctcaagtgtcaataccgcagggcacttatccccaggcttgtccacatcatctgtgggaaactcgcgtaaaatcaggcgttttcgccgatttgcgaggctggccagctccacgtcgccggccgaaatcgagcctgcccctcatctgtcaacgccgcgccgggtgagtcggcccctcaagtgtcaacgtccgcccctcatctgtcagtgagggccaagttttccgcgaggtatccacaacgccggcggccgcggtgtctcgcacacggcttcgacggcgtttctggcgcgtttgcagggccatagacggccgccagcccagcggcgagggcaaccagcccgg</GBSeq_sequence>
+</GBSeq>
+
+</GBSet>
\ No newline at end of file
diff --git a/node_modules/xml2js/lib/xml2js.js b/node_modules/xml2js/lib/xml2js.js
new file mode 100644
index 0000000..bec8a21
--- /dev/null
+++ b/node_modules/xml2js/lib/xml2js.js
@@ -0,0 +1,299 @@
+// Generated by CoffeeScript 1.6.3
+(function() {
+  var events, isEmpty, sax,
+    __hasProp = {}.hasOwnProperty,
+    __extends = function(child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; },
+    __bind = function(fn, me){ return function(){ return fn.apply(me, arguments); }; };
+
+  sax = require('sax');
+
+  events = require('events');
+
+  isEmpty = function(thing) {
+    return typeof thing === "object" && (thing != null) && Object.keys(thing).length === 0;
+  };
+
+  exports.defaults = {
+    "0.1": {
+      explicitCharkey: false,
+      trim: true,
+      normalize: true,
+      normalizeTags: false,
+      attrkey: "@",
+      charkey: "#",
+      explicitArray: false,
+      ignoreAttrs: false,
+      mergeAttrs: false,
+      explicitRoot: false,
+      validator: null,
+      xmlns: false,
+      explicitChildren: false,
+      childkey: '@@',
+      charsAsChildren: false,
+      async: false,
+      strict: true
+    },
+    "0.2": {
+      explicitCharkey: false,
+      trim: false,
+      normalize: false,
+      normalizeTags: false,
+      attrkey: "$",
+      charkey: "_",
+      explicitArray: true,
+      ignoreAttrs: false,
+      mergeAttrs: false,
+      explicitRoot: true,
+      validator: null,
+      xmlns: false,
+      explicitChildren: false,
+      childkey: '$$',
+      charsAsChildren: false,
+      async: false,
+      strict: true
+    }
+  };
+
+  exports.ValidationError = (function(_super) {
+    __extends(ValidationError, _super);
+
+    function ValidationError(message) {
+      this.message = message;
+    }
+
+    return ValidationError;
+
+  })(Error);
+
+  exports.Parser = (function(_super) {
+    __extends(Parser, _super);
+
+    function Parser(opts) {
+      this.parseString = __bind(this.parseString, this);
+      this.reset = __bind(this.reset, this);
+      var key, value, _ref;
+      if (!(this instanceof exports.Parser)) {
+        return new exports.Parser(opts);
+      }
+      this.options = {};
+      _ref = exports.defaults["0.2"];
+      for (key in _ref) {
+        if (!__hasProp.call(_ref, key)) continue;
+        value = _ref[key];
+        this.options[key] = value;
+      }
+      for (key in opts) {
+        if (!__hasProp.call(opts, key)) continue;
+        value = opts[key];
+        this.options[key] = value;
+      }
+      if (this.options.xmlns) {
+        this.options.xmlnskey = this.options.attrkey + "ns";
+      }
+      this.reset();
+    }
+
+    Parser.prototype.reset = function() {
+      var attrkey, charkey, err, ontext, stack,
+        _this = this;
+      this.removeAllListeners();
+      this.saxParser = sax.parser(this.options.strict, {
+        trim: false,
+        normalize: false,
+        xmlns: this.options.xmlns
+      });
+      err = false;
+      this.saxParser.onerror = function(error) {
+        if (!err) {
+          err = true;
+          return _this.emit("error", error);
+        }
+      };
+      this.EXPLICIT_CHARKEY = this.options.explicitCharkey;
+      this.resultObject = null;
+      stack = [];
+      attrkey = this.options.attrkey;
+      charkey = this.options.charkey;
+      this.saxParser.onopentag = function(node) {
+        var key, obj, _ref;
+        obj = {};
+        obj[charkey] = "";
+        if (!_this.options.ignoreAttrs) {
+          _ref = node.attributes;
+          for (key in _ref) {
+            if (!__hasProp.call(_ref, key)) continue;
+            if (!(attrkey in obj) && !_this.options.mergeAttrs) {
+              obj[attrkey] = {};
+            }
+            if (_this.options.mergeAttrs) {
+              obj[key] = node.attributes[key];
+            } else {
+              obj[attrkey][key] = node.attributes[key];
+            }
+          }
+        }
+        obj["#name"] = _this.options.normalizeTags ? node.name.toLowerCase() : node.name;
+        if (_this.options.xmlns) {
+          obj[_this.options.xmlnskey] = {
+            uri: node.uri,
+            local: node.local
+          };
+        }
+        return stack.push(obj);
+      };
+      this.saxParser.onclosetag = function() {
+        var cdata, emptyStr, node, nodeName, obj, old, s, xpath;
+        obj = stack.pop();
+        nodeName = obj["#name"];
+        delete obj["#name"];
+        cdata = obj.cdata;
+        delete obj.cdata;
+        s = stack[stack.length - 1];
+        if (obj[charkey].match(/^\s*$/) && !cdata) {
+          emptyStr = obj[charkey];
+          delete obj[charkey];
+        } else {
+          if (_this.options.trim) {
+            obj[charkey] = obj[charkey].trim();
+          }
+          if (_this.options.normalize) {
+            obj[charkey] = obj[charkey].replace(/\s{2,}/g, " ").trim();
+          }
+          if (Object.keys(obj).length === 1 && charkey in obj && !_this.EXPLICIT_CHARKEY) {
+            obj = obj[charkey];
+          }
+        }
+        if (isEmpty(obj)) {
+          obj = _this.options.emptyTag !== void 0 ? _this.options.emptyTag : emptyStr;
+        }
+        if (_this.options.validator != null) {
+          xpath = "/" + ((function() {
+            var _i, _len, _results;
+            _results = [];
+            for (_i = 0, _len = stack.length; _i < _len; _i++) {
+              node = stack[_i];
+              _results.push(node["#name"]);
+            }
+            return _results;
+          })()).concat(nodeName).join("/");
+          try {
+            obj = _this.options.validator(xpath, s && s[nodeName], obj);
+          } catch (_error) {
+            err = _error;
+            _this.emit("error", err);
+          }
+        }
+        if (_this.options.explicitChildren && !_this.options.mergeAttrs && typeof obj === 'object') {
+          node = {};
+          if (_this.options.attrkey in obj) {
+            node[_this.options.attrkey] = obj[_this.options.attrkey];
+            delete obj[_this.options.attrkey];
+          }
+          if (!_this.options.charsAsChildren && _this.options.charkey in obj) {
+            node[_this.options.charkey] = obj[_this.options.charkey];
+            delete obj[_this.options.charkey];
+          }
+          if (Object.getOwnPropertyNames(obj).length > 0) {
+            node[_this.options.childkey] = obj;
+          }
+          obj = node;
+        }
+        if (stack.length > 0) {
+          if (!_this.options.explicitArray) {
+            if (!(nodeName in s)) {
+              return s[nodeName] = obj;
+            } else if (s[nodeName] instanceof Array) {
+              return s[nodeName].push(obj);
+            } else {
+              old = s[nodeName];
+              s[nodeName] = [old];
+              return s[nodeName].push(obj);
+            }
+          } else {
+            if (!(s[nodeName] instanceof Array)) {
+              s[nodeName] = [];
+            }
+            return s[nodeName].push(obj);
+          }
+        } else {
+          if (_this.options.explicitRoot) {
+            old = obj;
+            obj = {};
+            obj[nodeName] = old;
+          }
+          _this.resultObject = obj;
+          return _this.emit("end", _this.resultObject);
+        }
+      };
+      ontext = function(text) {
+        var s;
+        s = stack[stack.length - 1];
+        if (s) {
+          s[charkey] += text;
+          return s;
+        }
+      };
+      this.saxParser.ontext = ontext;
+      return this.saxParser.oncdata = function(text) {
+        var s;
+        s = ontext(text);
+        if (s) {
+          return s.cdata = true;
+        }
+      };
+    };
+
+    Parser.prototype.parseString = function(str, cb) {
+      if ((cb != null) && typeof cb === "function") {
+        this.on("end", function(result) {
+          this.reset();
+          if (this.options.async) {
+            return process.nextTick(function() {
+              return cb(null, result);
+            });
+          } else {
+            return cb(null, result);
+          }
+        });
+        this.on("error", function(err) {
+          this.reset();
+          if (this.options.async) {
+            return process.nextTick(function() {
+              return cb(err);
+            });
+          } else {
+            return cb(err);
+          }
+        });
+      }
+      if (str.toString().trim() === '') {
+        this.emit("end", null);
+        return true;
+      }
+      return this.saxParser.write(str.toString());
+    };
+
+    return Parser;
+
+  })(events.EventEmitter);
+
+  exports.parseString = function(str, a, b) {
+    var cb, options, parser;
+    if (b != null) {
+      if (typeof b === 'function') {
+        cb = b;
+      }
+      if (typeof a === 'object') {
+        options = a;
+      }
+    } else {
+      if (typeof a === 'function') {
+        cb = a;
+      }
+      options = {};
+    }
+    parser = new exports.Parser(options);
+    return parser.parseString(str, cb);
+  };
+
+}).call(this);
diff --git a/node_modules/xml2js/node_modules/sax/AUTHORS b/node_modules/xml2js/node_modules/sax/AUTHORS
new file mode 100644
index 0000000..7145cbc
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/AUTHORS
@@ -0,0 +1,10 @@
+# contributors sorted by whether or not they're me.
+Isaac Z. Schlueter <i@izs.me>
+Stein Martin Hustad <stein@hustad.com>
+Mikeal Rogers <mikeal.rogers@gmail.com>
+Laurie Harper <laurie@holoweb.net>
+Jann Horn <jann@Jann-PC.fritz.box>
+Elijah Insua <tmpvar@gmail.com>
+Henry Rawas <henryr@schakra.com>
+Justin Makeig <jmpublic@makeig.com>
+Mike Schilling <mike@emotive.com>
diff --git a/node_modules/xml2js/node_modules/sax/LICENSE b/node_modules/xml2js/node_modules/sax/LICENSE
new file mode 100644
index 0000000..62e4ccf
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/LICENSE
@@ -0,0 +1,32 @@
+Copyright (c) Isaac Z. Schlueter ("Author")
+All rights reserved.
+
+The BSD License
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS
+BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
+BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
+OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
+IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+The file "examples/strict.dtd" is licensed by the W3C and used according
+to the terms of the W3C SOFTWARE NOTICE AND LICENSE.  See LICENSE-W3C.html
+for details.
diff --git a/node_modules/xml2js/node_modules/sax/LICENSE-W3C.html b/node_modules/xml2js/node_modules/sax/LICENSE-W3C.html
new file mode 100644
index 0000000..a611e3f
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/LICENSE-W3C.html
@@ -0,0 +1,188 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><meta name="generator" content="HTML Tidy for Mac OS X (vers 31 October 2006 - Apple Inc. build 13), see www.w3.org" /><title>W3C Software Notice and License</title><link rel="stylesheet" href="/2008/site/css/minimum" type="text/css" media="handheld, all" /><style type="text/css" media="print, screen and (min-width: 481px)" xml:space="preserve">
+     @import url("/2008/site/css/advanced");
+</style><link href="/2008/site/css/minimum" rel="stylesheet" type="text/css" media="handheld, only screen and (max-device-width: 480px)" /><meta name="viewport" content="width=device-width" /><link rel="stylesheet" href="/2008/site/css/print" type="text/css" media="print" /><link rel="shortcut icon" href="/2008/site/images/favicon.ico" type="image/x-icon" /></head><body id="www-w3-org" class="w3c_public"><div id="w3c_container">
+    
+    
+
+         <div id="w3c_mast">
+            <h1 class="logo">
+               <a tabindex="2" accesskey="1" href="/"><img src="/2008/site/images/logo-w3c-mobile-lg" width="90" height="53" alt="W3C" /></a>
+               <span class="alt-logo">W3C</span>
+            </h1>
+
+            <div id="w3c_nav">
+               
+               
+
+               <form action="/Help/search" method="get" enctype="application/x-www-form-urlencoded"><div class="w3c_sec_nav"><!-- --></div><ul class="main_nav"><li class="first-item">
+                        <a href="/standards/">Standards</a>
+                     </li><li>
+                        <a href="/participate/">Participate</a>
+                     </li><li>
+                        <a href="/Consortium/membership">Membership</a>
+                     </li><li class="last-item">
+                        <a href="/Consortium/">About W3C</a>
+                     </li><li class="search-item">
+                        <div id="search-form">
+                           <input tabindex="3" class="text" name="q" value="" title="Search" type="text" />
+                           <button id="search-submit" name="search-submit" type="submit"><img class="submit" src="/2008/site/images/search-button" alt="Search" width="21" height="17" /></button>
+                        </div>
+                     </li></ul></form>
+            </div>
+            
+         </div>
+         
+
+         <div id="w3c_main">
+            <div id="w3c_logo_shadow" class="w3c_leftCol">
+               <img height="32" alt="" src="/2008/site/images/logo-shadow" />
+            </div>
+            
+            <div class="w3c_leftCol"><h2 class="offscreen">Site Navigation</h2>
+    <h3 class="category"><span class="ribbon"><a href="/Consortium/Legal/ipr-notice.html" title="Up to Policies and Legal Information">Policies and Legal Information <img src="/2008/site/images/header-link" alt="Header link" width="13" height="13" class="header-link" /></a></span></h3>
+       <ul class="theme">
+        <li><a href="/Consortium/Legal/2008/04-testsuite-copyright.html">Licenses for W3C Test Suites</a></li>
+        <li><a href="/2004/10/27-testcases.html">Policies for Contribution of Test Cases to W3C</a></li>
+        <li><a href="/Consortium/Legal/IPR-FAQ-20000620.html">Intellectual Rights FAQ</a></li>
+        <li><a href="/Consortium/Legal/privacy-statement-20000612.html">W3C Privacy Statements</a></li>
+        <li><a href="/Consortium/Legal/2002/copyright-documents-20021231.html">W3C Document License</a></li>
+        <li><a href="/Consortium/Legal/2002/trademarks-20021231.html">W3C Trademarks and Generic Terms</a></li>
+        <li><a href="/Consortium/Legal/2002/trademark-license-20021231.html">W3C&#xAE; Trademark and Service Mark License</a></li>
+        <li><a class="current">W3C Software Notice and License</a></li>
+        <li><a href="/Consortium/Legal/2002/collaborators-agreement-20021231.html">W3C Invited Expert and Collaborators Agreement</a></li>
+        <li><a href="/Consortium/Persistence.html">W3C URI Persistence Policy</a></li>
+        <li><a href="/1999/10/21-mirroring-policy.html">Mirroring the W3C Site</a></li>
+        <li><a href="/Consortium/Legal/2006/08-copyright-translations.html">Translations of the Copyright Notice</a></li>
+       </ul>
+       <br /></div>
+            <div class="w3c_mainCol">
+               <div id="w3c_crumbs">
+       <div id="w3c_crumbs_frame">
+        <ul class="bct"> <!-- .bct / Breadcrumbs -->
+          <li class="skip"><a tabindex="1" accesskey="2" title="Skip to content (e.g., when browsing via audio)" href="#w3c_content_body">Skip</a></li>
+          <li><a href="/">W3C</a>&#xA0;<span class="cr">&#xBB;</span>&#xA0;</li>
+          <li><a href="/Consortium/">About&#xA0;W3C</a>&#xA0;<span class="cr">&#xBB;</span>&#xA0;</li>
+          <li><a href="/Consortium/facts.html">Facts&#xA0;About&#xA0;W3C</a>&#xA0;<span class="cr">&#xBB;</span>&#xA0;</li>
+          <li><a href="/Consortium/Legal/ipr-notice.html">Policies&#xA0;and&#xA0;Legal&#xA0;Information</a>&#xA0;<span class="cr">&#xBB;</span>&#xA0;</li>
+          <li class="current">W3C Software Notice and License</li>
+        </ul>            
+     </div>
+    </div>
+               <h1 class="title">W3C Software Notice and License</h1>
+               <div id="w3c_content_body">
+                  <div class="line">
+                     <p class="intro tPadding">This work (and included software, documentation such as READMEs, or other
+related items) is being provided by the copyright holders under the following
+license.</p>
+<h2>License</h2>
+                     
+                     <p class="tPadding">
+By obtaining, using and/or copying this work, you (the licensee)
+agree that you have read, understood, and will comply with the following
+terms and conditions.</p>
+
+                     <p>Permission to copy, modify, and distribute this software and its
+documentation, with or without modification,&#xA0;for any purpose and without
+fee or royalty is hereby granted, provided that you include the following on
+ALL copies of the software and documentation or portions thereof, including
+modifications:</p>
+
+                     <ul class="show_items"><li>The full text of this NOTICE in a location viewable to users of the
+    redistributed or derivative work.</li><li>Any pre-existing intellectual property disclaimers, notices, or terms
+    and conditions. If none exist, the <a href="copyright-software-short-notice-20021231.html">W3C Software Short
+    Notice</a> should be included (hypertext is preferred, text is permitted)
+    within the body of any redistributed or derivative code.</li><li>Notice of any changes or modifications to the files, including the date
+    changes were made. (We recommend you provide URIs to the location from
+    which the code is derived.)</li></ul>
+
+<h2>Disclaimers</h2>
+
+                     <p>THIS SOFTWARE AND DOCUMENTATION IS PROVIDED "AS IS," AND COPYRIGHT HOLDERS
+MAKE NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT
+LIMITED TO, WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR
+PURPOSE OR THAT THE USE OF THE SOFTWARE OR DOCUMENTATION WILL NOT INFRINGE
+ANY THIRD PARTY PATENTS, COPYRIGHTS, TRADEMARKS OR OTHER RIGHTS.</p>
+
+                     <p>COPYRIGHT HOLDERS WILL NOT BE LIABLE FOR ANY DIRECT, INDIRECT, SPECIAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF ANY USE OF THE SOFTWARE OR
+DOCUMENTATION.</p>
+
+                     <p>The name and trademarks of copyright holders may NOT be used in
+advertising or publicity pertaining to the software without specific, written
+prior permission. Title to copyright in this software and any associated
+documentation will at all times remain with copyright holders.</p>
+
+                     <h2>Notes</h2>
+
+	                    <p>This version: http://www.w3.org/Consortium/Legal/2002/copyright-software-20021231</p>
+
+                     <p>This formulation of W3C's notice and license became active on December 31
+2002. This version removes the copyright ownership notice such that this
+license can be used with materials other than those owned by the W3C,
+reflects that ERCIM is now a host of the W3C, includes references to this
+specific dated version of the license, and removes the ambiguous grant of
+"use". Otherwise, this version is the same as the <a href="http://www.w3.org/Consortium/Legal/copyright-software-19980720">previous
+version</a> and is written so as to preserve the <a href="http://www.gnu.org/philosophy/license-list.html#GPLCompatibleLicenses">Free
+Software Foundation's assessment of GPL compatibility</a> and <a href="http://www.opensource.org/licenses/W3C.php">OSI's certification</a>
+under the <a href="http://www.opensource.org/docs/definition.php">Open Source
+Definition</a>.</p>
+                  </div>
+               </div>
+            </div>
+         </div>
+         
+         
+         
+      </div><div id="w3c_footer">
+         <div id="w3c_footer-inner">
+            <h2 class="offscreen">Footer Navigation</h2>
+            <div class="w3c_footer-nav">
+               <h3>Navigation</h3>
+               <ul class="footer_top_nav"><li>
+                     <a href="/">Home</a>
+                  </li><li>
+                     <a href="/standards/">Standards</a>
+                  </li><li>
+                     <a href="/participate/">Participate</a>
+                  </li><li>
+                     <a href="/Consortium/membership">Membership</a>
+                  </li><li class="last-item">
+                     <a href="/Consortium/">About W3C</a>
+                  </li></ul>
+            </div>
+            <div class="w3c_footer-nav">
+               <h3>Contact W3C</h3>
+               <ul class="footer_bottom_nav"><li>
+                     <a href="/Consortium/contact">Contact</a>
+                  </li><li>
+                     <a accesskey="0" href="/Help/">Help and FAQ</a>
+                  </li><li>
+                     <a href="/Consortium/sponsor/">Sponsor / Donate</a>
+                  </li><li>
+                     <a href="/Consortium/siteindex">Site Map</a>
+                  </li><li>
+                     <address id="w3c_signature">
+                        <a href="http://lists.w3.org/Archives/Public/site-comments/">Feedback</a></address>
+                  </li></ul>
+            </div>
+            <div class="w3c_footer-nav">
+               <h3>W3C Updates</h3>
+               <ul class="footer_follow_nav"><li>
+                     <a href="http://twitter.com/W3C" title="Follow W3C on Twitter">
+                        <img src="/2008/site/images/twitter-bird" alt="Twitter" width="78" height="83" class="social-icon" />
+                     </a>
+                     <a href="http://identi.ca/w3c" title="See W3C on Identica">
+                        <img src="/2008/site/images/identica-logo" alt="Identica" width="91" height="83" class="social-icon" />
+                     </a>
+                  </li></ul>
+            </div>
+            <p class="copyright">Copyright &#xA9; 2012 W3C <sup>&#xAE;</sup> (<a href="http://www.csail.mit.edu/">
+                  <acronym title="Massachusetts Institute of Technology">MIT</acronym>
+               </a>, <a href="http://www.ercim.org/">
+                  <acronym title="European Research Consortium for Informatics and Mathematics"> ERCIM</acronym>
+               </a>, <a href="http://www.keio.ac.jp/">Keio</a>) <a href="/Consortium/Legal/ipr-notice">Usage policies apply</a>.</p>
+         </div>
+      </div><!-- Generated from data/scripts.php, ../../smarty/{scripts.tpl} --><!-- At the bottom for performance reasons --><div id="w3c_scripts">
+         <script type="text/javascript" src="/2008/site/js/main" xml:space="preserve"><!-- --></script>
+      </div></body></html>
diff --git a/node_modules/xml2js/node_modules/sax/README.md b/node_modules/xml2js/node_modules/sax/README.md
new file mode 100644
index 0000000..c965242
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/README.md
@@ -0,0 +1,216 @@
+# sax js
+
+A sax-style parser for XML and HTML.
+
+Designed with [node](http://nodejs.org/) in mind, but should work fine in
+the browser or other CommonJS implementations.
+
+## What This Is
+
+* A very simple tool to parse through an XML string.
+* A stepping stone to a streaming HTML parser.
+* A handy way to deal with RSS and other mostly-ok-but-kinda-broken XML 
+  docs.
+
+## What This Is (probably) Not
+
+* An HTML Parser - That's a fine goal, but this isn't it.  It's just
+  XML.
+* A DOM Builder - You can use it to build an object model out of XML,
+  but it doesn't do that out of the box.
+* XSLT - No DOM = no querying.
+* 100% Compliant with (some other SAX implementation) - Most SAX
+  implementations are in Java and do a lot more than this does.
+* An XML Validator - It does a little validation when in strict mode, but
+  not much.
+* A Schema-Aware XSD Thing - Schemas are an exercise in fetishistic 
+  masochism.
+* A DTD-aware Thing - Fetching DTDs is a much bigger job.
+
+## Regarding `<!DOCTYPE`s and `<!ENTITY`s
+
+The parser will handle the basic XML entities in text nodes and attribute
+values: `&amp; &lt; &gt; &apos; &quot;`. It's possible to define additional
+entities in XML by putting them in the DTD. This parser doesn't do anything
+with that. If you want to listen to the `ondoctype` event, and then fetch
+the doctypes, and read the entities and add them to `parser.ENTITIES`, then
+be my guest.
+
+Unknown entities will fail in strict mode, and in loose mode, will pass
+through unmolested.
+
+## Usage
+
+    var sax = require("./lib/sax"),
+      strict = true, // set to false for html-mode
+      parser = sax.parser(strict);
+
+    parser.onerror = function (e) {
+      // an error happened.
+    };
+    parser.ontext = function (t) {
+      // got some text.  t is the string of text.
+    };
+    parser.onopentag = function (node) {
+      // opened a tag.  node has "name" and "attributes"
+    };
+    parser.onattribute = function (attr) {
+      // an attribute.  attr has "name" and "value"
+    };
+    parser.onend = function () {
+      // parser stream is done, and ready to have more stuff written to it.
+    };
+
+    parser.write('<xml>Hello, <who name="world">world</who>!</xml>').close();
+
+    // stream usage
+    // takes the same options as the parser
+    var saxStream = require("sax").createStream(strict, options)
+    saxStream.on("error", function (e) {
+      // unhandled errors will throw, since this is a proper node
+      // event emitter.
+      console.error("error!", e)
+      // clear the error
+      this._parser.error = null
+      this._parser.resume()
+    })
+    saxStream.on("opentag", function (node) {
+      // same object as above
+    })
+    // pipe is supported, and it's readable/writable
+    // same chunks coming in also go out.
+    fs.createReadStream("file.xml")
+      .pipe(saxStream)
+      .pipe(fs.createWriteStream("file-copy.xml"))
+
+
+
+## Arguments
+
+Pass the following arguments to the parser function.  All are optional.
+
+`strict` - Boolean. Whether or not to be a jerk. Default: `false`.
+
+`opt` - Object bag of settings regarding string formatting.  All default to `false`.
+
+Settings supported:
+
+* `trim` - Boolean. Whether or not to trim text and comment nodes.
+* `normalize` - Boolean. If true, then turn any whitespace into a single
+  space.
+* `lowercase` - Boolean. If true, then lowercase tag names and attribute names
+  in loose mode, rather than uppercasing them.
+* `xmlns` - Boolean. If true, then namespaces are supported.
+* `position` - Boolean. If false, then don't track line/col/position.
+
+## Methods
+
+`write` - Write bytes onto the stream. You don't have to do this all at
+once. You can keep writing as much as you want.
+
+`close` - Close the stream. Once closed, no more data may be written until
+it is done processing the buffer, which is signaled by the `end` event.
+
+`resume` - To gracefully handle errors, assign a listener to the `error`
+event. Then, when the error is taken care of, you can call `resume` to
+continue parsing. Otherwise, the parser will not continue while in an error
+state.
+
+## Members
+
+At all times, the parser object will have the following members:
+
+`line`, `column`, `position` - Indications of the position in the XML
+document where the parser currently is looking.
+
+`startTagPosition` - Indicates the position where the current tag starts.
+
+`closed` - Boolean indicating whether or not the parser can be written to.
+If it's `true`, then wait for the `ready` event to write again.
+
+`strict` - Boolean indicating whether or not the parser is a jerk.
+
+`opt` - Any options passed into the constructor.
+
+`tag` - The current tag being dealt with.
+
+And a bunch of other stuff that you probably shouldn't touch.
+
+## Events
+
+All events emit with a single argument. To listen to an event, assign a
+function to `on<eventname>`. Functions get executed in the this-context of
+the parser object. The list of supported events are also in the exported
+`EVENTS` array.
+
+When using the stream interface, assign handlers using the EventEmitter
+`on` function in the normal fashion.
+
+`error` - Indication that something bad happened. The error will be hanging
+out on `parser.error`, and must be deleted before parsing can continue. By
+listening to this event, you can keep an eye on that kind of stuff. Note:
+this happens *much* more in strict mode. Argument: instance of `Error`.
+
+`text` - Text node. Argument: string of text.
+
+`doctype` - The `<!DOCTYPE` declaration. Argument: doctype string.
+
+`processinginstruction` - Stuff like `<?xml foo="blerg" ?>`. Argument:
+object with `name` and `body` members. Attributes are not parsed, as
+processing instructions have implementation dependent semantics.
+
+`sgmldeclaration` - Random SGML declarations. Stuff like `<!ENTITY p>`
+would trigger this kind of event. This is a weird thing to support, so it
+might go away at some point. SAX isn't intended to be used to parse SGML,
+after all.
+
+`opentag` - An opening tag. Argument: object with `name` and `attributes`.
+In non-strict mode, tag names are uppercased, unless the `lowercase`
+option is set.  If the `xmlns` option is set, then it will contain
+namespace binding information on the `ns` member, and will have a
+`local`, `prefix`, and `uri` member.
+
+`closetag` - A closing tag. In loose mode, tags are auto-closed if their
+parent closes. In strict mode, well-formedness is enforced. Note that
+self-closing tags will have `closeTag` emitted immediately after `openTag`.
+Argument: tag name.
+
+`attribute` - An attribute node.  Argument: object with `name` and `value`.
+In non-strict mode, attribute names are uppercased, unless the `lowercase`
+option is set.  If the `xmlns` option is set, it will also contains namespace
+information.
+
+`comment` - A comment node.  Argument: the string of the comment.
+
+`opencdata` - The opening tag of a `<![CDATA[` block.
+
+`cdata` - The text of a `<![CDATA[` block. Since `<![CDATA[` blocks can get
+quite large, this event may fire multiple times for a single block, if it
+is broken up into multiple `write()`s. Argument: the string of random
+character data.
+
+`closecdata` - The closing tag (`]]>`) of a `<![CDATA[` block.
+
+`opennamespace` - If the `xmlns` option is set, then this event will
+signal the start of a new namespace binding.
+
+`closenamespace` - If the `xmlns` option is set, then this event will
+signal the end of a namespace binding.
+
+`end` - Indication that the closed stream has ended.
+
+`ready` - Indication that the stream has reset, and is ready to be written
+to.
+
+`noscript` - In non-strict mode, `<script>` tags trigger a `"script"`
+event, and their contents are not checked for special xml characters.
+If you pass `noscript: true`, then this behavior is suppressed.
+
+## Reporting Problems
+
+It's best to write a failing test if you find an issue.  I will always
+accept pull requests with failing tests if they demonstrate intended
+behavior, but it is very hard to figure out what issue you're describing
+without a test.  Writing a test is also the best way for you yourself
+to figure out if you really understand the issue you think you have with
+sax-js.
diff --git a/node_modules/xml2js/node_modules/sax/component.json b/node_modules/xml2js/node_modules/sax/component.json
new file mode 100644
index 0000000..96b5d73
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/component.json
@@ -0,0 +1,12 @@
+{
+  "name": "sax",
+  "description": "An evented streaming XML parser in JavaScript",
+  "author": "Isaac Z. Schlueter <i@izs.me> (http://blog.izs.me/)",
+  "version": "0.5.2",
+  "main": "lib/sax.js",
+  "license": "BSD",
+  "scripts": [
+    "lib/sax.js"
+  ],
+  "repository": "git://github.com/isaacs/sax-js.git"
+}
diff --git a/node_modules/xml2js/node_modules/sax/examples/big-not-pretty.xml b/node_modules/xml2js/node_modules/sax/examples/big-not-pretty.xml
new file mode 100644
index 0000000..fb5265d
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/examples/big-not-pretty.xml
@@ -0,0 +1,8002 @@
+<big>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+</big>
diff --git a/node_modules/xml2js/node_modules/sax/examples/example.js b/node_modules/xml2js/node_modules/sax/examples/example.js
new file mode 100644
index 0000000..7b0246e
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/examples/example.js
@@ -0,0 +1,29 @@
+
+var fs = require("fs"),
+  util = require("util"),
+  path = require("path"),
+  xml = fs.readFileSync(path.join(__dirname, "test.xml"), "utf8"),
+  sax = require("../lib/sax"),
+  strict = sax.parser(true),
+  loose = sax.parser(false, {trim:true}),
+  inspector = function (ev) { return function (data) {
+    console.error("%s %s %j", this.line+":"+this.column, ev, data);
+  }};
+
+sax.EVENTS.forEach(function (ev) {
+  loose["on"+ev] = inspector(ev);
+});
+loose.onend = function () {
+  console.error("end");
+  console.error(loose);
+};
+
+// do this in random bits at a time to verify that it works.
+(function () {
+  if (xml) {
+    var c = Math.ceil(Math.random() * 1000)
+    loose.write(xml.substr(0,c));
+    xml = xml.substr(c);
+    process.nextTick(arguments.callee);
+  } else loose.close();
+})();
diff --git a/node_modules/xml2js/node_modules/sax/examples/get-products.js b/node_modules/xml2js/node_modules/sax/examples/get-products.js
new file mode 100644
index 0000000..9e8d74a
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/examples/get-products.js
@@ -0,0 +1,58 @@
+// pull out /GeneralSearchResponse/categories/category/items/product tags
+// the rest we don't care about.
+
+var sax = require("../lib/sax.js")
+var fs = require("fs")
+var path = require("path")
+var xmlFile = path.resolve(__dirname, "shopping.xml")
+var util = require("util")
+var http = require("http")
+
+fs.readFile(xmlFile, function (er, d) {
+  http.createServer(function (req, res) {
+    if (er) throw er
+    var xmlstr = d.toString("utf8")
+
+    var parser = sax.parser(true)
+    var products = []
+    var product = null
+    var currentTag = null
+
+    parser.onclosetag = function (tagName) {
+      if (tagName === "product") {
+        products.push(product)
+        currentTag = product = null
+        return
+      }
+      if (currentTag && currentTag.parent) {
+        var p = currentTag.parent
+        delete currentTag.parent
+        currentTag = p
+      }
+    }
+
+    parser.onopentag = function (tag) {
+      if (tag.name !== "product" && !product) return
+      if (tag.name === "product") {
+        product = tag
+      }
+      tag.parent = currentTag
+      tag.children = []
+      tag.parent && tag.parent.children.push(tag)
+      currentTag = tag
+    }
+
+    parser.ontext = function (text) {
+      if (currentTag) currentTag.children.push(text)
+    }
+
+    parser.onend = function () {
+      var out = util.inspect(products, false, 3, true)
+      res.writeHead(200, {"content-type":"application/json"})
+      res.end("{\"ok\":true}")
+      // res.end(JSON.stringify(products))
+    }
+
+    parser.write(xmlstr).end()
+  }).listen(1337)
+})
diff --git a/node_modules/xml2js/node_modules/sax/examples/hello-world.js b/node_modules/xml2js/node_modules/sax/examples/hello-world.js
new file mode 100644
index 0000000..cbfa518
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/examples/hello-world.js
@@ -0,0 +1,4 @@
+require("http").createServer(function (req, res) {
+  res.writeHead(200, {"content-type":"application/json"})
+  res.end(JSON.stringify({ok: true}))
+}).listen(1337)
diff --git a/node_modules/xml2js/node_modules/sax/examples/not-pretty.xml b/node_modules/xml2js/node_modules/sax/examples/not-pretty.xml
new file mode 100644
index 0000000..9592852
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/examples/not-pretty.xml
@@ -0,0 +1,8 @@
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
diff --git a/node_modules/xml2js/node_modules/sax/examples/pretty-print.js b/node_modules/xml2js/node_modules/sax/examples/pretty-print.js
new file mode 100644
index 0000000..cd6aca9
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/examples/pretty-print.js
@@ -0,0 +1,74 @@
+var sax = require("../lib/sax")
+  , printer = sax.createStream(false, {lowercasetags:true, trim:true})
+  , fs = require("fs")
+
+function entity (str) {
+  return str.replace('"', '&quot;')
+}
+
+printer.tabstop = 2
+printer.level = 0
+printer.indent = function () {
+  print("\n")
+  for (var i = this.level; i > 0; i --) {
+    for (var j = this.tabstop; j > 0; j --) {
+      print(" ")
+    }
+  }
+}
+printer.on("opentag", function (tag) {
+  this.indent()
+  this.level ++
+  print("<"+tag.name)
+  for (var i in tag.attributes) {
+    print(" "+i+"=\""+entity(tag.attributes[i])+"\"")
+  }
+  print(">")
+})
+
+printer.on("text", ontext)
+printer.on("doctype", ontext)
+function ontext (text) {
+  this.indent()
+  print(text)
+}
+
+printer.on("closetag", function (tag) {
+  this.level --
+  this.indent()
+  print("</"+tag+">")
+})
+
+printer.on("cdata", function (data) {
+  this.indent()
+  print("<![CDATA["+data+"]]>")
+})
+
+printer.on("comment", function (comment) {
+  this.indent()
+  print("<!--"+comment+"-->")
+})
+
+printer.on("error", function (error) {
+  console.error(error)
+  throw error
+})
+
+if (!process.argv[2]) {
+  throw new Error("Please provide an xml file to prettify\n"+
+    "TODO: read from stdin or take a file")
+}
+var xmlfile = require("path").join(process.cwd(), process.argv[2])
+var fstr = fs.createReadStream(xmlfile, { encoding: "utf8" })
+
+function print (c) {
+  if (!process.stdout.write(c)) {
+    fstr.pause()
+  }
+}
+
+process.stdout.on("drain", function () {
+  fstr.resume()
+})
+
+fstr.pipe(printer)
diff --git a/node_modules/xml2js/node_modules/sax/examples/shopping.xml b/node_modules/xml2js/node_modules/sax/examples/shopping.xml
new file mode 100644
index 0000000..223c6c6
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/examples/shopping.xml
@@ -0,0 +1,2 @@
+
+<GeneralSearchResponse xmlns="urn:types.partner.api.shopping.com"><serverDetail><apiEnv>sandbox</apiEnv><apiVersion>3.1 r31.Kadu4DC.phase3</apiVersion><buildNumber>5778</buildNumber><buildTimestamp>2011.10.06 15:37:23 PST</buildTimestamp><requestId>p2.a121bc2aaf029435dce6</requestId><timestamp>2011-10-21T18:38:45.982-04:00</timestamp><responseTime>P0Y0M0DT0H0M0.169S</responseTime></serverDetail><exceptions exceptionCount="1"><exception type="warning"><code>1112</code><message>You are currently using the SDC API sandbox environment!  No clicks to merchant URLs from this response will be paid.  Please change the host of your API requests to 'publisher.api.shopping.com' when you have finished development and testing</message></exception></exceptions><clientTracking height="19" type="logo" width="106"><sourceURL>http://statTest.dealtime.com/pixel/noscript?PV_EvnTyp=APPV&amp;APPV_APITSP=10%2F21%2F11_06%3A38%3A45_PM&amp;APPV_DSPRQSID=p2.a121bc2aaf029435dce6&amp;APPV_IMGURL=http://img.shopping.com/sc/glb/sdc_logo_106x19.gif&amp;APPV_LI_LNKINID=7000610&amp;APPV_LI_SBMKYW=nikon&amp;APPV_MTCTYP=1000&amp;APPV_PRTID=2002&amp;APPV_BrnID=14804</sourceURL><hrefURL>http://www.shopping.com/digital-cameras/products</hrefURL><titleText>Digital Cameras</titleText><altText>Digital Cameras</altText></clientTracking><searchHistory><categorySelection id="3"><name>Electronics</name><categoryURL>http://www.shopping.com/xCH-electronics-nikon~linkin_id-7000610?oq=nikon</categoryURL></categorySelection><categorySelection id="449"><name>Cameras and Photography</name><categoryURL>http://www.shopping.com/xCH-cameras_and_photography-nikon~linkin_id-7000610?oq=nikon</categoryURL></categorySelection><categorySelection id="7185"><name>Digital Cameras</name><categoryURL>http://www.shopping.com/digital-cameras/nikon/products?oq=nikon&amp;linkin_id=7000610</categoryURL></categorySelection><dynamicNavigationHistory><keywordSearch dropped="false" modified="false"><originalKeyword>nikon</originalKeyword><resultKeyword>nikon</resultKeyword></keywordSearch></dynamicNavigationHistory></searchHistory><categories matchedCategoryCount="1" returnedCategoryCount="1"><category id="7185"><name>Digital Cameras</name><categoryURL>http://www.shopping.com/digital-cameras/nikon/products?oq=nikon&amp;linkin_id=7000610</categoryURL><items matchedItemCount="322" pageNumber="1" returnedItemCount="5"><product id="101677489"><name>Nikon D3100 Digital Camera</name><shortDescription>14.2 Megapixel, SLR Camera, 3 in. LCD Screen, With High Definition Video, Weight: 1 lb.</shortDescription><fullDescription>The Nikon D3100 digital SLR camera speaks to the growing ranks of enthusiastic D-SLR users and aspiring photographers by providing an easy-to-use and affordable entrance to the world of Nikon D-SLR’s. The 14.2-megapixel D3100 has powerful features, such as the enhanced Guide Mode that makes it easy to unleash creative potential and capture memories with still images and full HD video. Like having a personal photo tutor at your fingertips, this unique feature provides a simple graphical interface on the camera’s LCD that guides users by suggesting and/or adjusting camera settings to achieve the desired end result images. The D3100 is also the world’s first D-SLR to introduce full time auto focus (AF) in Live View and D-Movie mode to effortlessly achieve the critical focus needed when shooting Full HD 1080p video.</fullDescription><images><image available="true" height="100" width="100"><sourceURL>http://di1.shopping.com/images/pi/93/bc/04/101677489-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di1.shopping.com/images/pi/93/bc/04/101677489-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di1.shopping.com/images/pi/93/bc/04/101677489-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di1.shopping.com/images/pi/93/bc/04/101677489-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="500" width="606"><sourceURL>http://di1.shopping.com/images/pi/93/bc/04/101677489-606x500-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></images><rating><reviewCount>9</reviewCount><rating>4.56</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/pr/sdc_stars_sm_4.5.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/Nikon-D3100/reviews~linkin_id-7000610</reviewURL></rating><minPrice>429.00</minPrice><maxPrice>1360.00</maxPrice><productOffersURL>http://www.shopping.com/Nikon-D3100/prices~linkin_id-7000610</productOffersURL><productSpecsURL>http://www.shopping.com/Nikon-D3100/info~linkin_id-7000610</productSpecsURL><offers matchedOfferCount="64" pageNumber="1" returnedOfferCount="5"><offer featured="false" id="-ZW6BMZqz6fbS-aULwga_g==" smartBuy="false" used="false"><name>Nikon D3100 Digital SLR Camera with 18-55mm NIKKOR VR Lens</name><description>The Nikon D3100 Digital SLR Camera is an affordable  compact  and lightweight photographic power-house. It features the all-purpose 18-55mm VR lens  a high-resolution 14.2 MP CMOS sensor along with a feature set that's comprehensive yet easy to navigate - the intuitive onboard learn-as-you grow guide mode allows the photographer to understand what the 3100 can do quickly and easily. Capture beautiful pictures and amazing Full HD 1080p movies with sound and full-time autofocus.  Availabilty: In Stock!</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di102.shopping.com/images/di/2d/5a/57/36424d5a717a366662532d61554c7767615f67-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di102.shopping.com/images/di/2d/5a/57/36424d5a717a366662532d61554c7767615f67-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di102.shopping.com/images/di/2d/5a/57/36424d5a717a366662532d61554c7767615f67-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="350" width="350"><sourceURL>http://di102.shopping.com/images/di/2d/5a/57/36424d5a717a366662532d61554c7767615f67-350x350-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Free Shipping with Any Purchase!</storeNotes><basePrice currency="USD">529.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">799.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=647&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=475674&amp;crawler_id=475674&amp;dealId=-ZW6BMZqz6fbS-aULwga_g%3D%3D&amp;url=http%3A%2F%2Fwww.fumfie.com%2Fproduct%2F343.5%2Fshopping-com%3F&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D3100+Digital+SLR+Camera+with+18-55mm+NIKKOR+VR+Lens&amp;dlprc=529.0&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=1&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=101677489&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=1&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=1&amp;SL=1&amp;FS=1&amp;code=&amp;acode=658&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="475674" trusted="true"><name>FumFie</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/475674.gif</sourceURL></logo><phoneNumber>866 666 9198</phoneNumber><ratingInfo><reviewCount>560</reviewCount><rating>4.27</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_45.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_fumfie~MRD-475674~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>F343C5</sku></offer><offer featured="false" id="md1e9lD8vdOu4FHQfJqKng==" smartBuy="false" used="false"><name>Nikon Nikon D3100 14.2MP Digital SLR Camera with 18-55mm f/3.5-5.6 AF-S DX VR, Cameras</name><description>Nikon D3100 14.2MP Digital SLR Camera with 18-55mm f/3.5-5.6 AF-S DX VR</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di109.shopping.com/images/di/6d/64/31/65396c443876644f7534464851664a714b6e67-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di109.shopping.com/images/di/6d/64/31/65396c443876644f7534464851664a714b6e67-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di109.shopping.com/images/di/6d/64/31/65396c443876644f7534464851664a714b6e67-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="352" width="385"><sourceURL>http://di109.shopping.com/images/di/6d/64/31/65396c443876644f7534464851664a714b6e67-385x352-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">549.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">549.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=779&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=305814&amp;crawler_id=305814&amp;dealId=md1e9lD8vdOu4FHQfJqKng%3D%3D&amp;url=http%3A%2F%2Fwww.electronics-expo.com%2Findex.php%3Fpage%3Ditem%26id%3DNIKD3100%26source%3DSideCar%26scpid%3D8%26scid%3Dscsho318727%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+Nikon+D3100+14.2MP+Digital+SLR+Camera+with+18-55mm+f%2F3.5-5.6+AF-S+DX+VR%2C+Cameras&amp;dlprc=549.0&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=9&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=101677489&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=9&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=771&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="305814" trusted="true"><name>Electronics Expo</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/305814.gif</sourceURL></logo><phoneNumber>1-888-707-EXPO</phoneNumber><ratingInfo><reviewCount>371</reviewCount><rating>3.90</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_4.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_electronics_expo~MRD-305814~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>NIKD3100</sku></offer><offer featured="false" id="yYuaXnDFtCY7rDUjkY2aaw==" smartBuy="false" used="false"><name>Nikon D3100 14.2-Megapixel Digital SLR Camera With 18-55mm Zoom-Nikkor Lens, Black</name><description>Split-second shutter response captures shots other cameras may have missed Helps eliminate the frustration of shutter delay! 14.2-megapixels for enlargements worth framing and hanging. Takes breathtaking 1080p HD movies. ISO sensitivity from 100-1600 for bright or dimly lit settings. 3.0in. color LCD for beautiful, wide-angle framing and viewing. In-camera image editing lets you retouch with no PC. Automatic scene modes include Child, Sports, Night Portrait and more. Accepts SDHC memory cards. Nikon D3100 14.2-Megapixel Digital SLR Camera With 18-55mm Zoom-Nikkor Lens, Black is one of many Digital SLR Cameras available through Office Depot. Made by Nikon.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di109.shopping.com/images/di/79/59/75/61586e4446744359377244556a6b5932616177-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di109.shopping.com/images/di/79/59/75/61586e4446744359377244556a6b5932616177-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="250" width="250"><sourceURL>http://di109.shopping.com/images/di/79/59/75/61586e4446744359377244556a6b5932616177-250x250-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">549.99</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">699.99</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=698&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=467671&amp;crawler_id=467671&amp;dealId=yYuaXnDFtCY7rDUjkY2aaw%3D%3D&amp;url=http%3A%2F%2Flink.mercent.com%2Fredirect.ashx%3Fmr%3AmerchantID%3DOfficeDepot%26mr%3AtrackingCode%3DCEC9669E-6ABC-E011-9F24-0019B9C043EB%26mr%3AtargetUrl%3Dhttp%3A%2F%2Fwww.officedepot.com%2Fa%2Fproducts%2F486292%2FNikon-D3100-142-Megapixel-Digital-SLR%2F%253fcm_mmc%253dMercent-_-Shopping-_-Cameras_and_Camcorders-_-486292&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D3100+14.2-Megapixel+Digital+SLR+Camera+With+18-55mm+Zoom-Nikkor+Lens%2C+Black&amp;dlprc=549.99&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=10&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=101677489&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=10&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=1&amp;SL=1&amp;FS=1&amp;code=&amp;acode=690&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="467671" trusted="true"><name>Office Depot</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/467671.gif</sourceURL></logo><phoneNumber>1-800-GO-DEPOT</phoneNumber><ratingInfo><reviewCount>135</reviewCount><rating>2.37</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_office_depot_4158555~MRD-467671~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>486292</sku></offer><offer featured="false" id="Rl56U7CuiTYsH4MGZ02lxQ==" smartBuy="false" used="false"><name>Nikon® D3100™ 14.2MP Digital SLR with 18-55mm Lens</name><description>The Nikon D3100 DSLR will surprise you with its simplicity and impress you with superb results.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di103.shopping.com/images/di/52/6c/35/36553743756954597348344d475a30326c7851-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di103.shopping.com/images/di/52/6c/35/36553743756954597348344d475a30326c7851-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="220" width="220"><sourceURL>http://di103.shopping.com/images/di/52/6c/35/36553743756954597348344d475a30326c7851-220x220-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">549.99</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.05</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">549.99</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=504&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=332477&amp;crawler_id=332477&amp;dealId=Rl56U7CuiTYsH4MGZ02lxQ%3D%3D&amp;url=http%3A%2F%2Ftracking.searchmarketing.com%2Fgsic.asp%3Faid%3D903483107%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon%C2%AE+D3100%E2%84%A2+14.2MP+Digital+SLR+with+18-55mm+Lens&amp;dlprc=549.99&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=11&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=101677489&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=11&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=496&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="332477" trusted="false"><name>RadioShack</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/332477.gif</sourceURL></logo><ratingInfo><reviewCount>24</reviewCount><rating>2.25</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_radioshack_9689~MRD-332477~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>9614867</sku></offer><offer featured="false" id="huS6xZKDKaKMTMP71eI6DA==" smartBuy="false" used="false"><name>Nikon D3100 SLR w/Nikon 18-55mm VR &amp; 55-200mm VR Lenses</name><description>14.2 Megapixels3" LCDLive ViewHD 1080p Video w/ Sound &amp; Autofocus11-point Autofocus3 Frames per Second ShootingISO 100 to 3200 (Expand to 12800-Hi2)Self Cleaning SensorEXPEED 2, Image Processing EngineScene Recognition System</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di105.shopping.com/images/di/68/75/53/36785a4b444b614b4d544d5037316549364441-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di105.shopping.com/images/di/68/75/53/36785a4b444b614b4d544d5037316549364441-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di105.shopping.com/images/di/68/75/53/36785a4b444b614b4d544d5037316549364441-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="345" width="345"><sourceURL>http://di105.shopping.com/images/di/68/75/53/36785a4b444b614b4d544d5037316549364441-345x345-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">695.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">695.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=371&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=487342&amp;crawler_id=487342&amp;dealId=huS6xZKDKaKMTMP71eI6DA%3D%3D&amp;url=http%3A%2F%2Fwww.rythercamera.com%2Fcatalog%2Fproduct_info.php%3Fcsv%3Dsh%26products_id%3D32983%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D3100+SLR+w%2FNikon+18-55mm+VR+%26+55-200mm+VR+Lenses&amp;dlprc=695.0&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=15&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=101677489&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=15&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=379&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="487342" trusted="false"><name>RytherCamera.com</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/487342.gif</sourceURL></logo><phoneNumber>1-877-644-7593</phoneNumber><ratingInfo><reviewCount>0</reviewCount></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>32983</sku></offer></offers></product><product id="95397883"><name>Nikon COOLPIX S203 Digital Camera</name><shortDescription>10 Megapixel, Ultra-Compact Camera, 2.5 in. LCD Screen, 3x Optical Zoom, With Video Capability, Weight: 0.23 lb.</shortDescription><fullDescription>With 10.34 mega pixel, electronic VR vibration reduction, 5-level brightness adjustment, 3x optical zoom, and TFT LCD, Nikon Coolpix s203 fulfills all the demands of any photographer. The digital camera has an inbuilt memory of 44MB and an external memory slot made for all kinds of SD (Secure Digital) cards.</fullDescription><images><image available="true" height="100" width="100"><sourceURL>http://di1.shopping.com/images/pi/c4/ef/1b/95397883-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di1.shopping.com/images/pi/c4/ef/1b/95397883-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di1.shopping.com/images/pi/c4/ef/1b/95397883-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di1.shopping.com/images/pi/c4/ef/1b/95397883-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="499" width="500"><sourceURL>http://di1.shopping.com/images/pi/c4/ef/1b/95397883-500x499-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image></images><rating><reviewCount>0</reviewCount></rating><minPrice>139.00</minPrice><maxPrice>139.00</maxPrice><productOffersURL>http://www.shopping.com/Nikon-Coolpix-S203/prices~linkin_id-7000610</productOffersURL><productSpecsURL>http://www.shopping.com/Nikon-Coolpix-S203/info~linkin_id-7000610</productSpecsURL><offers matchedOfferCount="1" pageNumber="1" returnedOfferCount="1"><offer featured="false" id="sBd2JnIEPM-A_lBAM1RZgQ==" smartBuy="false" used="false"><name>Nikon Coolpix S203 Digital Camera (Red)</name><description>With 10.34 mega pixel, electronic VR vibration reduction, 5-level brightness adjustment, 3x optical zoom, and TFT LCD, Nikon Coolpix s203 fulfills all the demands of any photographer. The digital camera has an inbuilt memory of 44MB and an external memory slot made for all kinds of SD (Secure Digital) cards.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di108.shopping.com/images/di/73/42/64/324a6e4945504d2d415f6c42414d31525a6751-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di108.shopping.com/images/di/73/42/64/324a6e4945504d2d415f6c42414d31525a6751-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di108.shopping.com/images/di/73/42/64/324a6e4945504d2d415f6c42414d31525a6751-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di108.shopping.com/images/di/73/42/64/324a6e4945504d2d415f6c42414d31525a6751-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="500" width="500"><sourceURL>http://di108.shopping.com/images/di/73/42/64/324a6e4945504d2d415f6c42414d31525a6751-500x500-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Fantastic prices with ease &amp; comfort of Amazon.com!</storeNotes><basePrice currency="USD">139.00</basePrice><shippingCost currency="USD">9.50</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">139.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=566&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=301531&amp;crawler_id=1903313&amp;dealId=sBd2JnIEPM-A_lBAM1RZgQ%3D%3D&amp;url=http%3A%2F%2Fwww.amazon.com%2Fdp%2FB002T964IM%2Fref%3Dasc_df_B002T964IM1751618%3Fsmid%3DA22UHVNXG98FAT%26tag%3Ddealtime-ce-mp01feed-20%26linkCode%3Dasn%26creative%3D395105%26creativeASIN%3DB002T964IM&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+Coolpix+S203+Digital+Camera+%28Red%29&amp;dlprc=139.0&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=63&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=95397883&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=63&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=518&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="301531" trusted="false"><name>Amazon Marketplace</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/301531.gif</sourceURL></logo><ratingInfo><reviewCount>213</reviewCount><rating>2.73</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_amazon_marketplace_9689~MRD-301531~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>B002T964IM</sku></offer></offers></product><product id="106834268"><name>Nikon S3100 Digital Camera</name><shortDescription>14.5 Megapixel, Compact Camera, 2.7 in. LCD Screen, 5x Optical Zoom, With High Definition Video, Weight: 0.23 lb.</shortDescription><fullDescription>This digital camera features a wide-angle optical Zoom-NIKKOR glass lens that allows you to capture anything from landscapes to portraits to action shots. The high-definition movie mode with one-touch recording makes it easy to capture video clips.</fullDescription><images><image available="true" height="100" width="100"><sourceURL>http://di1.shopping.com/images/pi/66/2d/33/106834268-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di1.shopping.com/images/pi/66/2d/33/106834268-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di1.shopping.com/images/pi/66/2d/33/106834268-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di1.shopping.com/images/pi/66/2d/33/106834268-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="387" width="507"><sourceURL>http://di1.shopping.com/images/pi/66/2d/33/106834268-507x387-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image></images><rating><reviewCount>1</reviewCount><rating>2.00</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/pr/sdc_stars_sm_2.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/nikon-s3100/reviews~linkin_id-7000610</reviewURL></rating><minPrice>99.95</minPrice><maxPrice>134.95</maxPrice><productOffersURL>http://www.shopping.com/nikon-s3100/prices~linkin_id-7000610</productOffersURL><productSpecsURL>http://www.shopping.com/nikon-s3100/info~linkin_id-7000610</productSpecsURL><offers matchedOfferCount="67" pageNumber="1" returnedOfferCount="5"><offer featured="false" id="UUyGoqV8r0-xrkn-rnGNbg==" smartBuy="false" used="false"><name>CoolPix S3100 14 Megapixel Compact Digital Camera- Red</name><description>Nikon Coolpix S3100 - Digital camera - compact - 14.0 Mpix - optical zoom: 5 x - supported memory: SD, SDXC, SDHC - red</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di111.shopping.com/images/di/55/55/79/476f71563872302d78726b6e2d726e474e6267-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di111.shopping.com/images/di/55/55/79/476f71563872302d78726b6e2d726e474e6267-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di111.shopping.com/images/di/55/55/79/476f71563872302d78726b6e2d726e474e6267-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di111.shopping.com/images/di/55/55/79/476f71563872302d78726b6e2d726e474e6267-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Get 30 days FREE SHIPPING w/ ShipVantage</storeNotes><basePrice currency="USD">119.95</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.95</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">139.95</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=578&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=485615&amp;crawler_id=485615&amp;dealId=UUyGoqV8r0-xrkn-rnGNbg%3D%3D&amp;url=http%3A%2F%2Fsears.rdr.channelintelligence.com%2Fgo.asp%3FfVhzOGNRAAQIASNiE1NbQBJpFHJ3Yx0CTAICI2BbH1lEFmgKP3QvUVpEREdlfUAUHAQPLVpFTVdtJzxAHUNYW3AhQBM0QhFvEXAbYh8EAAVmDAJeU1oyGG0GcBdhGwUGCAVqYF9SO0xSN1sZdmA7dmMdBQAJB24qX1NbQxI6AjA2ME5dVFULPDsGPFcQTTdaLTA6SR0OFlQvPAwMDxYcYlxIVkcoLTcCDA%3D%3D%26nAID%3D13736960%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=CoolPix+S3100+14+Megapixel+Compact+Digital+Camera-+Red&amp;dlprc=119.95&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=28&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=106834268&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=28&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=1&amp;FS=0&amp;code=&amp;acode=583&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="485615" trusted="true"><name>Sears</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/485615.gif</sourceURL></logo><phoneNumber>1-800-349-4358</phoneNumber><ratingInfo><reviewCount>888</reviewCount><rating>2.85</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_3.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_sears_4189479~MRD-485615~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>00337013000</sku></offer><offer featured="false" id="X87AwXlW1dXoMXk4QQDToQ==" smartBuy="false" used="false"><name>COOLPIX S3100 Pink</name><description>Nikon Coolpix S3100 - Digital camera - compact - 14.0 Mpix - optical zoom: 5 x - supported memory: SD, SDXC, SDHC - pink</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di111.shopping.com/images/di/58/38/37/4177586c573164586f4d586b34515144546f51-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di111.shopping.com/images/di/58/38/37/4177586c573164586f4d586b34515144546f51-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di111.shopping.com/images/di/58/38/37/4177586c573164586f4d586b34515144546f51-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di111.shopping.com/images/di/58/38/37/4177586c573164586f4d586b34515144546f51-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Get 30 days FREE SHIPPING w/ ShipVantage</storeNotes><basePrice currency="USD">119.95</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.95</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">139.95</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=578&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=485615&amp;crawler_id=485615&amp;dealId=X87AwXlW1dXoMXk4QQDToQ%3D%3D&amp;url=http%3A%2F%2Fsears.rdr.channelintelligence.com%2Fgo.asp%3FfVhzOGNRAAQIASNiE1NbQBJpFHJxYx0CTAICI2BbH1lEFmgKP3QvUVpEREdlfUAUHAQPLVpFTVdtJzxAHUNYW3AhQBM0QhFvEXAbYh8EAAVmb2JcUFxDEGsPc3QDEkFZVQ0WFhdRW0MWbgYWDlxzdGMdAVQWRi0xDAwPFhw9TSobb05eWVVYKzsLTFVVQi5RICs3SA8MU1s2MQQKD1wf%26nAID%3D13736960%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=COOLPIX+S3100+Pink&amp;dlprc=119.95&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=31&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=106834268&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=31&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=1&amp;FS=0&amp;code=&amp;acode=583&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="485615" trusted="true"><name>Sears</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/485615.gif</sourceURL></logo><phoneNumber>1-800-349-4358</phoneNumber><ratingInfo><reviewCount>888</reviewCount><rating>2.85</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_3.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_sears_4189479~MRD-485615~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>00337015000</sku></offer><offer featured="false" id="nvFwnpfA4rlA1Dbksdsa0w==" smartBuy="false" used="false"><name>Nikon Coolpix S3100 14.0 MP Digital Camera - Silver</name><description>Nikon Coolpix S3100 14.0 MP Digital Camera - Silver</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di109.shopping.com/images/di/6e/76/46/776e70664134726c413144626b736473613077-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di109.shopping.com/images/di/6e/76/46/776e70664134726c413144626b736473613077-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="270" width="270"><sourceURL>http://di109.shopping.com/images/di/6e/76/46/776e70664134726c413144626b736473613077-270x270-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">109.97</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">109.97</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=803&amp;BEFID=7185&amp;aon=%5E&amp;MerchantID=475774&amp;crawler_id=475774&amp;dealId=nvFwnpfA4rlA1Dbksdsa0w%3D%3D&amp;url=http%3A%2F%2Fwww.thewiz.com%2Fcatalog%2Fproduct.jsp%3FmodelNo%3DS3100SILVER%26gdftrk%3DgdfV2677_a_7c996_a_7c4049_a_7c26262&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+Coolpix+S3100+14.0+MP+Digital+Camera+-+Silver&amp;dlprc=109.97&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=33&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=106834268&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=33&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=797&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="475774" trusted="false"><name>TheWiz.com</name><logo available="false" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/475774.gif</sourceURL></logo><phoneNumber>877-542-6988</phoneNumber><ratingInfo><reviewCount>0</reviewCount></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>26262</sku></offer><offer featured="false" id="5GtaN2NeryKwps-Se2l-4g==" smartBuy="false" used="false"><name>Nikon� COOLPIX� S3100 14MP Digital Camera (Silver)</name><description>The Nikon COOLPIX S3100 is the easy way to share your life and stay connected.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di102.shopping.com/images/di/35/47/74/614e324e6572794b7770732d5365326c2d3467-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di102.shopping.com/images/di/35/47/74/614e324e6572794b7770732d5365326c2d3467-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="220" width="220"><sourceURL>http://di102.shopping.com/images/di/35/47/74/614e324e6572794b7770732d5365326c2d3467-220x220-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">119.99</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.05</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">119.99</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=504&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=332477&amp;crawler_id=332477&amp;dealId=5GtaN2NeryKwps-Se2l-4g%3D%3D&amp;url=http%3A%2F%2Ftracking.searchmarketing.com%2Fgsic.asp%3Faid%3D848064082%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon%C3%AF%C2%BF%C2%BD+COOLPIX%C3%AF%C2%BF%C2%BD+S3100+14MP+Digital+Camera+%28Silver%29&amp;dlprc=119.99&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=37&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=106834268&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=37&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=509&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="332477" trusted="false"><name>RadioShack</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/332477.gif</sourceURL></logo><ratingInfo><reviewCount>24</reviewCount><rating>2.25</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_radioshack_9689~MRD-332477~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>10101095</sku></offer><offer featured="false" id="a43m0RXulX38zCnQjU59jw==" smartBuy="false" used="false"><name>COOLPIX S3100 Yellow</name><description>Nikon Coolpix S3100 - Digital camera - compact - 14.0 Mpix - optical zoom: 5 x - supported memory: SD, SDXC, SDHC - yellow</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di107.shopping.com/images/di/61/34/33/6d305258756c5833387a436e516a5535396a77-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di107.shopping.com/images/di/61/34/33/6d305258756c5833387a436e516a5535396a77-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di107.shopping.com/images/di/61/34/33/6d305258756c5833387a436e516a5535396a77-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di107.shopping.com/images/di/61/34/33/6d305258756c5833387a436e516a5535396a77-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Get 30 days FREE SHIPPING w/ ShipVantage</storeNotes><basePrice currency="USD">119.95</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.95</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">139.95</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=578&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=485615&amp;crawler_id=485615&amp;dealId=a43m0RXulX38zCnQjU59jw%3D%3D&amp;url=http%3A%2F%2Fsears.rdr.channelintelligence.com%2Fgo.asp%3FfVhzOGNRAAQIASNiE1NbQBJpFHJwYx0CTAICI2BbH1lEFmgKP3QvUVpEREdlfUAUHAQPLVpFTVdtJzxAHUNYW3AhQBM0QhFvEXAbYh8EAAVmb2JcUFxDEGoPc3QDEkFZVQ0WFhdRW0MWbgYWDlxzdGMdAVQWRi0xDAwPFhw9TSobb05eWVVYKzsLTFVVQi5RICs3SA8MU1s2MQQKD1wf%26nAID%3D13736960%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=COOLPIX+S3100+Yellow&amp;dlprc=119.95&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=38&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=106834268&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=38&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=1&amp;FS=0&amp;code=&amp;acode=583&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="485615" trusted="true"><name>Sears</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/485615.gif</sourceURL></logo><phoneNumber>1-800-349-4358</phoneNumber><ratingInfo><reviewCount>888</reviewCount><rating>2.85</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_3.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_sears_4189479~MRD-485615~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>00337014000</sku></offer></offers></product><product id="99671132"><name>Nikon D90 Digital Camera</name><shortDescription>12.3 Megapixel, Point and Shoot Camera, 3 in. LCD Screen, With Video Capability, Weight: 1.36 lb.</shortDescription><fullDescription>Untitled Document Nikon D90 SLR Digital Camera With 28-80mm 75-300mm Lens Kit The Nikon D90 SLR Digital Camera, with its 12.3-megapixel DX-format CMOS, 3" High resolution LCD display, Scene Recognition System, Picture Control, Active D-Lighting, and one-button Live View, provides photo enthusiasts with the image quality and performance they need to pursue their own vision while still being intuitive enough for use as an everyday camera.</fullDescription><images><image available="true" height="100" width="100"><sourceURL>http://di1.shopping.com/images/pi/52/fb/d3/99671132-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di1.shopping.com/images/pi/52/fb/d3/99671132-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di1.shopping.com/images/pi/52/fb/d3/99671132-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di1.shopping.com/images/pi/52/fb/d3/99671132-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="255" width="499"><sourceURL>http://di1.shopping.com/images/pi/52/fb/d3/99671132-499x255-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image></images><rating><reviewCount>7</reviewCount><rating>5.00</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/pr/sdc_stars_sm_5.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/Nikon-D90-with-18-270mm-Lens/reviews~linkin_id-7000610</reviewURL></rating><minPrice>689.00</minPrice><maxPrice>2299.00</maxPrice><productOffersURL>http://www.shopping.com/Nikon-D90-with-18-270mm-Lens/prices~linkin_id-7000610</productOffersURL><productSpecsURL>http://www.shopping.com/Nikon-D90-with-18-270mm-Lens/info~linkin_id-7000610</productSpecsURL><offers matchedOfferCount="43" pageNumber="1" returnedOfferCount="5"><offer featured="false" id="GU5JJkpUAxe5HujB7fkwAA==" smartBuy="false" used="false"><name>Nikon® D90 12.3MP Digital SLR Camera (Body Only)</name><description>The Nikon D90 will make you rethink what a digital SLR camera can achieve.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di106.shopping.com/images/di/47/55/35/4a4a6b70554178653548756a4237666b774141-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di106.shopping.com/images/di/47/55/35/4a4a6b70554178653548756a4237666b774141-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="220" width="220"><sourceURL>http://di106.shopping.com/images/di/47/55/35/4a4a6b70554178653548756a4237666b774141-220x220-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">1015.99</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.05</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">1015.99</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=504&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=332477&amp;crawler_id=332477&amp;dealId=GU5JJkpUAxe5HujB7fkwAA%3D%3D&amp;url=http%3A%2F%2Ftracking.searchmarketing.com%2Fgsic.asp%3Faid%3D851830266%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon%C2%AE+D90+12.3MP+Digital+SLR+Camera+%28Body+Only%29&amp;dlprc=1015.99&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=14&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=99671132&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=14&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=496&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="332477" trusted="false"><name>RadioShack</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/332477.gif</sourceURL></logo><ratingInfo><reviewCount>24</reviewCount><rating>2.25</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_radioshack_9689~MRD-332477~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>10148659</sku></offer><offer featured="false" id="XhURuSC-spBbTIDfo4qfzQ==" smartBuy="false" used="false"><name>Nikon D90 SLR Digital Camera (Camera Body)</name><description>The Nikon D90 SLR Digital Camera  with its 12.3-megapixel DX-format CCD  3" High resolution LCD display  Scene Recognition System  Picture Control  Active D-Lighting  and one-button Live View  provides photo enthusiasts with the image quality and performance they need to pursue their own vision while still being intuitive enough for use as an everyday camera. In addition  the D90 introduces the D-Movie mode  allowing for the first time  an interchangeable lens SLR camera that is capable of recording 720p HD movie clips.  Availabilty: In Stock</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di109.shopping.com/images/di/58/68/55/527553432d73704262544944666f3471667a51-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di109.shopping.com/images/di/58/68/55/527553432d73704262544944666f3471667a51-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di109.shopping.com/images/di/58/68/55/527553432d73704262544944666f3471667a51-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="350" width="350"><sourceURL>http://di109.shopping.com/images/di/58/68/55/527553432d73704262544944666f3471667a51-350x350-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Free Shipping with Any Purchase!</storeNotes><basePrice currency="USD">689.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">900.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=647&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=475674&amp;crawler_id=475674&amp;dealId=XhURuSC-spBbTIDfo4qfzQ%3D%3D&amp;url=http%3A%2F%2Fwww.fumfie.com%2Fproduct%2F169.5%2Fshopping-com%3F&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+SLR+Digital+Camera+%28Camera+Body%29&amp;dlprc=689.0&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=16&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=99671132&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=16&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=1&amp;SL=1&amp;FS=1&amp;code=&amp;acode=658&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="475674" trusted="true"><name>FumFie</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/475674.gif</sourceURL></logo><phoneNumber>866 666 9198</phoneNumber><ratingInfo><reviewCount>560</reviewCount><rating>4.27</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_45.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_fumfie~MRD-475674~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>F169C5</sku></offer><offer featured="false" id="o0Px_XLWDbrxAYRy3rCmyQ==" smartBuy="false" used="false"><name>Nikon D90 SLR w/Nikon 18-105mm VR &amp; 55-200mm VR Lenses</name><description>12.3 MegapixelDX Format CMOS Sensor3" VGA LCD DisplayLive ViewSelf Cleaning SensorD-Movie ModeHigh Sensitivity (ISO 3200)4.5 fps BurstIn-Camera Image Editing</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di101.shopping.com/images/di/6f/30/50/785f584c5744627278415952793372436d7951-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di101.shopping.com/images/di/6f/30/50/785f584c5744627278415952793372436d7951-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di101.shopping.com/images/di/6f/30/50/785f584c5744627278415952793372436d7951-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di101.shopping.com/images/di/6f/30/50/785f584c5744627278415952793372436d7951-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="500" width="500"><sourceURL>http://di101.shopping.com/images/di/6f/30/50/785f584c5744627278415952793372436d7951-500x500-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">1189.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">1189.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=371&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=487342&amp;crawler_id=487342&amp;dealId=o0Px_XLWDbrxAYRy3rCmyQ%3D%3D&amp;url=http%3A%2F%2Fwww.rythercamera.com%2Fcatalog%2Fproduct_info.php%3Fcsv%3Dsh%26products_id%3D30619%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+SLR+w%2FNikon+18-105mm+VR+%26+55-200mm+VR+Lenses&amp;dlprc=1189.0&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=20&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=99671132&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=20&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=379&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="487342" trusted="false"><name>RytherCamera.com</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/487342.gif</sourceURL></logo><phoneNumber>1-877-644-7593</phoneNumber><ratingInfo><reviewCount>0</reviewCount></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>30619</sku></offer><offer featured="false" id="4HgbWJSJ8ssgIf8B0MXIwA==" smartBuy="false" used="false"><name>Nikon D90 12.3 Megapixel Digital SLR Camera (Body Only)</name><description>Fusing 12.3 megapixel image quality and a cinematic 24fps D-Movie Mode, the Nikon D90 exceeds the demands of passionate photographers. Coupled with Nikon's EXPEED image processing technologies and NIKKOR optics, breathtaking image fidelity is assured. Combined with fast 0.15ms power-up and split-second 65ms shooting lag, dramatic action and decisive moments are captured easily. Effective 4-frequency, ultrasonic sensor cleaning frees image degrading dust particles from the sensor's optical low pass filter.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di110.shopping.com/images/di/34/48/67/62574a534a3873736749663842304d58497741-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di110.shopping.com/images/di/34/48/67/62574a534a3873736749663842304d58497741-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di110.shopping.com/images/di/34/48/67/62574a534a3873736749663842304d58497741-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>FREE FEDEX 2-3 DAY DELIVERY</storeNotes><basePrice currency="USD">899.95</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">899.95</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=269&amp;BEFID=7185&amp;aon=%5E&amp;MerchantID=9296&amp;crawler_id=811558&amp;dealId=4HgbWJSJ8ssgIf8B0MXIwA%3D%3D&amp;url=http%3A%2F%2Fwww.pcnation.com%2Foptics-gallery%2Fdetails.asp%3Faffid%3D305%26item%3D2N145P&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+12.3+Megapixel+Digital+SLR+Camera+%28Body+Only%29&amp;dlprc=899.95&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=21&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=99671132&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=21&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=257&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="9296" trusted="true"><name>PCNation</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/9296.gif</sourceURL></logo><phoneNumber>800-470-7079</phoneNumber><ratingInfo><reviewCount>1622</reviewCount><rating>4.43</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_45.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_pcnation_9689~MRD-9296~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>2N145P</sku></offer><offer featured="false" id="UNDa3uMDZXOnvD_7sTILYg==" smartBuy="false" used="false"><name>Nikon D90 12.3MP Digital SLR Camera (Body Only)</name><description>Fusing 12.3-megapixel image quality inherited from the award-winning D300 with groundbreaking features, the D90's breathtaking, low-noise image quality is further advanced with EXPEED image processing. Split-second shutter response and continuous shooting at up to 4.5 frames-per-second provide the power to capture fast action and precise moments perfectly, while Nikon's exclusive Scene Recognition System contributes to faster 11-area autofocus performance, finer white balance detection and more. The D90 delivers the control passionate photographers demand, utilizing comprehensive exposure functions and the intelligence of 3D Color Matrix Metering II. Stunning results come to life on a 3-inch 920,000-dot color LCD monitor, providing accurate image review, Live View composition and brilliant playback of the D90's cinematic-quality 24-fps HD D-Movie mode.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di102.shopping.com/images/di/55/4e/44/6133754d445a584f6e76445f377354494c5967-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di102.shopping.com/images/di/55/4e/44/6133754d445a584f6e76445f377354494c5967-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di102.shopping.com/images/di/55/4e/44/6133754d445a584f6e76445f377354494c5967-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di102.shopping.com/images/di/55/4e/44/6133754d445a584f6e76445f377354494c5967-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="500" width="500"><sourceURL>http://di102.shopping.com/images/di/55/4e/44/6133754d445a584f6e76445f377354494c5967-500x500-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Fantastic prices with ease &amp; comfort of Amazon.com!</storeNotes><basePrice currency="USD">780.00</basePrice><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">780.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=566&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=301531&amp;crawler_id=1903313&amp;dealId=UNDa3uMDZXOnvD_7sTILYg%3D%3D&amp;url=http%3A%2F%2Fwww.amazon.com%2Fdp%2FB001ET5U92%2Fref%3Dasc_df_B001ET5U921751618%3Fsmid%3DAHF4SYKP09WBH%26tag%3Ddealtime-ce-mp01feed-20%26linkCode%3Dasn%26creative%3D395105%26creativeASIN%3DB001ET5U92&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+12.3MP+Digital+SLR+Camera+%28Body+Only%29&amp;dlprc=780.0&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=29&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=99671132&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=29&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=520&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="301531" trusted="false"><name>Amazon Marketplace</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/301531.gif</sourceURL></logo><ratingInfo><reviewCount>213</reviewCount><rating>2.73</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_amazon_marketplace_9689~MRD-301531~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>B001ET5U92</sku></offer></offers></product><product id="70621646"><name>Nikon D90 Digital Camera with 18-105mm lens</name><shortDescription>12.9 Megapixel, SLR Camera, 3 in. LCD Screen, 5.8x Optical Zoom, With Video Capability, Weight: 2.3 lb.</shortDescription><fullDescription>Its 12.3 megapixel DX-format CMOS image sensor and EXPEED image processing system offer outstanding image quality across a wide ISO light sensitivity range. Live View mode lets you compose and shoot via the high-resolution 3-inch LCD monitor, and an advanced Scene Recognition System and autofocus performance help capture images with astounding accuracy. Movies can be shot in Motion JPEG format using the D-Movie function. The camera’s large image sensor ensures exceptional movie image quality and you can create dramatic effects by shooting with a wide range of interchangeable NIKKOR lenses, from wide-angle to macro to fisheye, or by adjusting the lens aperture and experimenting with depth-of-field. The D90 – designed to fuel your passion for photography.</fullDescription><images><image available="true" height="100" width="100"><sourceURL>http://di1.shopping.com/images/pi/57/6a/4f/70621646-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di1.shopping.com/images/pi/57/6a/4f/70621646-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di1.shopping.com/images/pi/57/6a/4f/70621646-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di1.shopping.com/images/pi/57/6a/4f/70621646-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="489" width="490"><sourceURL>http://di1.shopping.com/images/pi/57/6a/4f/70621646-490x489-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image></images><rating><reviewCount>32</reviewCount><rating>4.81</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/pr/sdc_stars_sm_5.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/Nikon-D90-with-18-105mm-lens/reviews~linkin_id-7000610</reviewURL></rating><minPrice>849.95</minPrice><maxPrice>1599.95</maxPrice><productOffersURL>http://www.shopping.com/Nikon-D90-with-18-105mm-lens/prices~linkin_id-7000610</productOffersURL><productSpecsURL>http://www.shopping.com/Nikon-D90-with-18-105mm-lens/info~linkin_id-7000610</productSpecsURL><offers matchedOfferCount="25" pageNumber="1" returnedOfferCount="5"><offer featured="false" id="3o5e1VghgJPfhLvT1JFKTA==" smartBuy="false" used="false"><name>Nikon D90 18-105mm VR Lens</name><description>The Nikon D90 SLR Digital Camera  with its 12.3-megapixel DX-format CMOS  3" High resolution LCD display  Scene Recognition System  Picture Control  Active D-Lighting  and one-button Live View  prov</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di111.shopping.com/images/di/33/6f/35/6531566768674a5066684c7654314a464b5441-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di111.shopping.com/images/di/33/6f/35/6531566768674a5066684c7654314a464b5441-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="260" width="260"><sourceURL>http://di111.shopping.com/images/di/33/6f/35/6531566768674a5066684c7654314a464b5441-260x260-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">849.95</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">849.95</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=419&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=9390&amp;crawler_id=1905054&amp;dealId=3o5e1VghgJPfhLvT1JFKTA%3D%3D&amp;url=http%3A%2F%2Fwww.ajrichard.com%2FNikon-D90-18-105mm-VR-Lens%2Fp-292%3Frefid%3DShopping%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+18-105mm+VR+Lens&amp;dlprc=849.95&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=2&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=70621646&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=2&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=425&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="9390" trusted="false"><name>AJRichard</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/9390.gif</sourceURL></logo><phoneNumber>1-888-871-1256</phoneNumber><ratingInfo><reviewCount>3124</reviewCount><rating>4.48</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_45.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_ajrichard~MRD-9390~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>292</sku></offer><offer featured="false" id="_lYWj_jbwfsSkfcwUcDuww==" smartBuy="false" used="false"><name>Nikon D90 SLR w/Nikon 18-105mm VR Lens</name><description>12.3 MegapixelDX Format CMOS Sensor3" VGA LCD DisplayLive ViewSelf Cleaning SensorD-Movie ModeHigh Sensitivity (ISO 3200)4.5 fps BurstIn-Camera Image Editing</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di108.shopping.com/images/di/5f/6c/59/576a5f6a62776673536b666377556344757777-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di108.shopping.com/images/di/5f/6c/59/576a5f6a62776673536b666377556344757777-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di108.shopping.com/images/di/5f/6c/59/576a5f6a62776673536b666377556344757777-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di108.shopping.com/images/di/5f/6c/59/576a5f6a62776673536b666377556344757777-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="500" width="500"><sourceURL>http://di108.shopping.com/images/di/5f/6c/59/576a5f6a62776673536b666377556344757777-500x500-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">909.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">909.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=371&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=487342&amp;crawler_id=487342&amp;dealId=_lYWj_jbwfsSkfcwUcDuww%3D%3D&amp;url=http%3A%2F%2Fwww.rythercamera.com%2Fcatalog%2Fproduct_info.php%3Fcsv%3Dsh%26products_id%3D30971%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+SLR+w%2FNikon+18-105mm+VR+Lens&amp;dlprc=909.0&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=3&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=70621646&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=3&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=379&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="487342" trusted="false"><name>RytherCamera.com</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/487342.gif</sourceURL></logo><phoneNumber>1-877-644-7593</phoneNumber><ratingInfo><reviewCount>0</reviewCount></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>30971</sku></offer><offer featured="false" id="1KCclCGuWvty2XKU9skadg==" smartBuy="false" used="false"><name>25448/D90 12.3 Megapixel Digital Camera 18-105mm Zoom Lens w/ 3" Screen - Black</name><description>Nikon D90 - Digital camera - SLR - 12.3 Mpix - Nikon AF-S DX 18-105mm lens - optical zoom: 5.8 x - supported memory: SD, SDHC</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di110.shopping.com/images/di/31/4b/43/636c4347755776747932584b5539736b616467-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di110.shopping.com/images/di/31/4b/43/636c4347755776747932584b5539736b616467-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di110.shopping.com/images/di/31/4b/43/636c4347755776747932584b5539736b616467-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di110.shopping.com/images/di/31/4b/43/636c4347755776747932584b5539736b616467-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Get 30 days FREE SHIPPING w/ ShipVantage</storeNotes><basePrice currency="USD">1199.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">8.20</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">1199.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=578&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=485615&amp;crawler_id=485615&amp;dealId=1KCclCGuWvty2XKU9skadg%3D%3D&amp;url=http%3A%2F%2Fsears.rdr.channelintelligence.com%2Fgo.asp%3FfVhzOGNRAAQIASNiE1NbQBRtFXpzYx0CTAICI2BbH1lEFmgKP3QvUVpEREdlfUAUHAQPLVpFTVdtJzxAHUNYW3AhQBM0QhFvEXAbYh8EAAVmb2JcVlhCGGkPc3QDEkFZVQ0WFhdRW0MWbgYWDlxzdGMdAVQWRi0xDAwPFhw9TSobb05eWVVYKzsLTFVVQi5RICs3SA8MU1s2MQQKD1wf%26nAID%3D13736960%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=25448%2FD90+12.3+Megapixel+Digital+Camera+18-105mm+Zoom+Lens+w%2F+3%22+Screen+-+Black&amp;dlprc=1199.0&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=4&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=70621646&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=4&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=586&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="485615" trusted="true"><name>Sears</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/485615.gif</sourceURL></logo><phoneNumber>1-800-349-4358</phoneNumber><ratingInfo><reviewCount>888</reviewCount><rating>2.85</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_3.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_sears_4189479~MRD-485615~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>00353197000</sku></offer><offer featured="false" id="3-VOSfVV5Jo7HlA4kJtanA==" smartBuy="false" used="false"><name>Nikon® D90 12.3MP Digital SLR with 18-105mm Lens</name><description>The Nikon D90 will make you rethink what a digital SLR camera can achieve.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di101.shopping.com/images/di/33/2d/56/4f53665656354a6f37486c41346b4a74616e41-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di101.shopping.com/images/di/33/2d/56/4f53665656354a6f37486c41346b4a74616e41-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="220" width="220"><sourceURL>http://di101.shopping.com/images/di/33/2d/56/4f53665656354a6f37486c41346b4a74616e41-220x220-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">1350.99</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.05</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">1350.99</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=504&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=332477&amp;crawler_id=332477&amp;dealId=3-VOSfVV5Jo7HlA4kJtanA%3D%3D&amp;url=http%3A%2F%2Ftracking.searchmarketing.com%2Fgsic.asp%3Faid%3D982673361%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon%C2%AE+D90+12.3MP+Digital+SLR+with+18-105mm+Lens&amp;dlprc=1350.99&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=5&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=70621646&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=5&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=496&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="332477" trusted="false"><name>RadioShack</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/332477.gif</sourceURL></logo><ratingInfo><reviewCount>24</reviewCount><rating>2.25</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_radioshack_9689~MRD-332477~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>11148905</sku></offer><offer featured="false" id="kQnB6rS4AjN5dx5h2_631g==" smartBuy="false" used="false"><name>Nikon D90 Kit 12.3-megapixel Digital SLR with 18-105mm VR Lens</name><description>Photographers, take your passion further!Now is the time for new creativity, and to rethink what a digital SLR camera can achieve. It's time for the D90, a camera with everything you would expect from Nikon's next-generation D-SLRs, and some unexpected surprises, as well. The stunning image quality is inherited from the D300, Nikon's DX-format flagship. The D90 also has Nikon's unmatched ergonomics and high performance, and now takes high-quality movies with beautifully cinematic results. The world of photography has changed, and with the D90 in your hands, it's time to make your own rules.AF-S DX NIKKOR 18-105mm f/3.5-5.6G ED VR LensWide-ratio 5.8x zoom Compact, versatile and ideal for a broad range of shooting situations, ranging from interiors and landscapes to beautiful portraits� a perfect everyday zoom. Nikon VR (Vibration Reduction) image stabilization Vibration Reduction is engineered specifically for each VR NIKKOR lens and enables handheld shooting at up to 3 shutter speeds slower than would</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di110.shopping.com/images/di/6b/51/6e/4236725334416a4e3564783568325f36333167-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di110.shopping.com/images/di/6b/51/6e/4236725334416a4e3564783568325f36333167-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di110.shopping.com/images/di/6b/51/6e/4236725334416a4e3564783568325f36333167-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="232" width="300"><sourceURL>http://di110.shopping.com/images/di/6b/51/6e/4236725334416a4e3564783568325f36333167-300x232-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Shipping Included!</storeNotes><basePrice currency="USD">1050.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">1199.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=135&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=313162&amp;crawler_id=313162&amp;dealId=kQnB6rS4AjN5dx5h2_631g%3D%3D&amp;url=http%3A%2F%2Fonecall.rdr.channelintelligence.com%2Fgo.asp%3FfVhzOGNRAAQIASNiE1pZSxNoWHFwLx8GTAICa2ZeH1sPXTZLNzRpAh1HR0BxPQEGCBJNMhFHUElsFCFCVkVTTHAcBggEHQ4aHXNpGERGH3RQODsbAgdechJtbBt8fx8JAwhtZFAzJj1oGgIWCxRlNyFOUV9UUGIxBgo0T0IyTSYqJ0RWHw4QPCIBAAQXRGMDICg6TllZVBhh%26nAID%3D13736960&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+Kit+12.3-megapixel+Digital+SLR+with+18-105mm+VR+Lens&amp;dlprc=1050.0&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=6&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=70621646&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=6&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=1&amp;FS=1&amp;code=&amp;acode=143&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="313162" trusted="true"><name>OneCall</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/313162.gif</sourceURL></logo><phoneNumber>1.800.398.0766</phoneNumber><ratingInfo><reviewCount>180</reviewCount><rating>4.44</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_45.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_onecall_9689~MRD-313162~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>92826</sku></offer></offers></product></items><attributes matchedAttributeCount="5" returnedAttributeCount="5"><attribute id="Dynamic_Price_Range"><name>Price range</name><attributeURL>http://www.shopping.com/digital-cameras/nikon/products?oq=nikon&amp;linkin_id=7000610</attributeURL><attributeValues matchedValueCount="2" returnedValueCount="2"><attributeValue id="price_range_24_4012" matchingItemsCount="1"><name>$24 - $4012</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon/products?minPrice=24&amp;maxPrice=4012&amp;linkin_id=7000610</attributeValueURL></attributeValue><attributeValue id="price_range_4012_7999" matchingItemsCount="1"><name>$4012 - $7999</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon/products?minPrice=4012&amp;maxPrice=7999&amp;linkin_id=7000610</attributeValueURL></attributeValue></attributeValues></attribute><attribute id="9688_brand"><name>Brand</name><attributeURL>http://www.shopping.com/digital-cameras/nikon/products~all-9688-brand~MS-1?oq=nikon&amp;linkin_id=7000610</attributeURL><attributeValues matchedValueCount="7" returnedValueCount="5"><attributeValue id="brand_nikon" matchingItemsCount="2261"><name>Nikon</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+brand-nikon/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="9688_brand_crane" matchingItemsCount="17"><name>Crane</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+9688-brand-crane/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="ikelite" matchingItemsCount="2"><name>Ikelite</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+ikelite/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="bower" matchingItemsCount="1"><name>Bower</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+bower/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="brand_fuji" matchingItemsCount="2"><name>FUJIFILM</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+brand-fuji/products~linkin_id-7000610</attributeValueURL></attributeValue></attributeValues></attribute><attribute id="store"><name>Store</name><attributeURL>http://www.shopping.com/digital-cameras/nikon/products~all-store~MS-1?oq=nikon&amp;linkin_id=7000610</attributeURL><attributeValues matchedValueCount="35" returnedValueCount="5"><attributeValue id="store_amazon_marketplace_9689" matchingItemsCount="808"><name>Amazon Marketplace</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+store-amazon-marketplace-9689/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="store_amazon" matchingItemsCount="83"><name>Amazon</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+store-amazon/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="store_adorama" matchingItemsCount="81"><name>Adorama</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+store-adorama/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="store_j_r_music_and_computer_world" matchingItemsCount="78"><name>J&amp;R Music and Computer World</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+store-j-r-music-and-computer-world/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="store_rythercamera_com" matchingItemsCount="78"><name>RytherCamera.com</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+store-rythercamera-com/products~linkin_id-7000610</attributeValueURL></attributeValue></attributeValues></attribute><attribute id="21885_resolution"><name>Resolution</name><attributeURL>http://www.shopping.com/digital-cameras/nikon/products~all-21885-resolution~MS-1?oq=nikon&amp;linkin_id=7000610</attributeURL><attributeValues matchedValueCount="13" returnedValueCount="5"><attributeValue id="under_4_megapixel" matchingItemsCount="3"><name>Under 4 Megapixel</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+under-4-megapixel/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="5_megapixel_digital_cameras" matchingItemsCount="1085"><name>At least 5 Megapixel</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+5-megapixel-digital-cameras/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="6_megapixel_digital_cameras" matchingItemsCount="1080"><name>At least 6 Megapixel</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+6-megapixel-digital-cameras/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="7_megapixel_digital_cameras" matchingItemsCount="1066"><name>At least 7 Megapixel</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+7-megapixel-digital-cameras/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="8_megapixel_digital_cameras" matchingItemsCount="1056"><name>At least 8 Megapixel</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+8-megapixel-digital-cameras/products~linkin_id-7000610</attributeValueURL></attributeValue></attributeValues></attribute><attribute id="32804-features"><name>Features</name><attributeURL>http://www.shopping.com/digital-cameras/nikon/products~all-32804-features~MS-1?oq=nikon&amp;linkin_id=7000610</attributeURL><attributeValues matchedValueCount="12" returnedValueCount="5"><attributeValue id="32804_features_shockproof" matchingItemsCount="7"><name>Shockproof</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+32804-features-shockproof/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="32804_features_waterproof" matchingItemsCount="32"><name>Waterproof</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+32804-features-waterproof/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="32804_features_freezeproof" matchingItemsCount="7"><name>Freezeproof</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+32804-features-freezeproof/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="32804_features_dust_proof" matchingItemsCount="23"><name>Dust proof</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+32804-features-dust-proof/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="32804_features_image_stabilization" matchingItemsCount="797"><name>Image Stabilization</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+32804-features-image-stabilization/products~linkin_id-7000610</attributeValueURL></attributeValue></attributeValues></attribute></attributes><contentType>hybrid</contentType></category></categories><relatedTerms><term>digital camera</term><term>g1</term><term>sony</term><term>camera</term><term>canon</term><term>nikon</term><term>kodak digital camera</term><term>kodak</term><term>sony cybershot</term><term>kodak easyshare digital camera</term><term>nikon coolpix</term><term>olympus</term><term>pink digital camera</term><term>canon powershot</term></relatedTerms></GeneralSearchResponse>
\ No newline at end of file
diff --git a/node_modules/xml2js/node_modules/sax/examples/strict.dtd b/node_modules/xml2js/node_modules/sax/examples/strict.dtd
new file mode 100644
index 0000000..b274559
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/examples/strict.dtd
@@ -0,0 +1,870 @@
+<!--
+    This is HTML 4.01 Strict DTD, which excludes the presentation 
+    attributes and elements that W3C expects to phase out as 
+    support for style sheets matures. Authors should use the Strict
+    DTD when possible, but may use the Transitional DTD when support
+    for presentation attribute and elements is required.
+    
+    HTML 4 includes mechanisms for style sheets, scripting,
+    embedding objects, improved support for right to left and mixed
+    direction text, and enhancements to forms for improved
+    accessibility for people with disabilities.
+
+          Draft: $Date: 1999/12/24 23:37:48 $
+
+          Authors:
+              Dave Raggett <dsr@w3.org>
+              Arnaud Le Hors <lehors@w3.org>
+              Ian Jacobs <ij@w3.org>
+
+    Further information about HTML 4.01 is available at:
+
+        http://www.w3.org/TR/1999/REC-html401-19991224
+
+
+    The HTML 4.01 specification includes additional
+    syntactic constraints that cannot be expressed within
+    the DTDs.
+
+-->
+<!--
+    Typical usage:
+
+    <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+            "http://www.w3.org/TR/html4/strict.dtd">
+    <html>
+    <head>
+    ...
+    </head>
+    <body>
+    ...
+    </body>
+    </html>
+
+    The URI used as a system identifier with the public identifier allows
+    the user agent to download the DTD and entity sets as needed.
+
+    The FPI for the Transitional HTML 4.01 DTD is:
+
+        "-//W3C//DTD HTML 4.01 Transitional//EN"
+
+    This version of the transitional DTD is:
+
+        http://www.w3.org/TR/1999/REC-html401-19991224/loose.dtd
+
+    If you are writing a document that includes frames, use 
+    the following FPI:
+
+        "-//W3C//DTD HTML 4.01 Frameset//EN"
+
+    This version of the frameset DTD is:
+
+        http://www.w3.org/TR/1999/REC-html401-19991224/frameset.dtd
+
+    Use the following (relative) URIs to refer to 
+    the DTDs and entity definitions of this specification:
+
+    "strict.dtd"
+    "loose.dtd"
+    "frameset.dtd"
+    "HTMLlat1.ent"
+    "HTMLsymbol.ent"
+    "HTMLspecial.ent"
+
+-->
+
+<!--================== Imported Names ====================================-->
+<!-- Feature Switch for frameset documents -->
+<!ENTITY % HTML.Frameset "IGNORE">
+
+<!ENTITY % ContentType "CDATA"
+    -- media type, as per [RFC2045]
+    -->
+
+<!ENTITY % ContentTypes "CDATA"
+    -- comma-separated list of media types, as per [RFC2045]
+    -->
+
+<!ENTITY % Charset "CDATA"
+    -- a character encoding, as per [RFC2045]
+    -->
+
+<!ENTITY % Charsets "CDATA"
+    -- a space-separated list of character encodings, as per [RFC2045]
+    -->
+
+<!ENTITY % LanguageCode "NAME"
+    -- a language code, as per [RFC1766]
+    -->
+
+<!ENTITY % Character "CDATA"
+    -- a single character from [ISO10646] 
+    -->
+
+<!ENTITY % LinkTypes "CDATA"
+    -- space-separated list of link types
+    -->
+
+<!ENTITY % MediaDesc "CDATA"
+    -- single or comma-separated list of media descriptors
+    -->
+
+<!ENTITY % URI "CDATA"
+    -- a Uniform Resource Identifier,
+       see [URI]
+    -->
+
+<!ENTITY % Datetime "CDATA" -- date and time information. ISO date format -->
+
+
+<!ENTITY % Script "CDATA" -- script expression -->
+
+<!ENTITY % StyleSheet "CDATA" -- style sheet data -->
+
+
+
+<!ENTITY % Text "CDATA">
+
+
+<!-- Parameter Entities -->
+
+<!ENTITY % head.misc "SCRIPT|STYLE|META|LINK|OBJECT" -- repeatable head elements -->
+
+<!ENTITY % heading "H1|H2|H3|H4|H5|H6">
+
+<!ENTITY % list "UL | OL">
+
+<!ENTITY % preformatted "PRE">
+
+
+<!--================ Character mnemonic entities =========================-->
+
+<!ENTITY % HTMLlat1 PUBLIC
+   "-//W3C//ENTITIES Latin1//EN//HTML"
+   "HTMLlat1.ent">
+%HTMLlat1;
+
+<!ENTITY % HTMLsymbol PUBLIC
+   "-//W3C//ENTITIES Symbols//EN//HTML"
+   "HTMLsymbol.ent">
+%HTMLsymbol;
+
+<!ENTITY % HTMLspecial PUBLIC
+   "-//W3C//ENTITIES Special//EN//HTML"
+   "HTMLspecial.ent">
+%HTMLspecial;
+<!--=================== Generic Attributes ===============================-->
+
+<!ENTITY % coreattrs
+ "id          ID             #IMPLIED  -- document-wide unique id --
+  class       CDATA          #IMPLIED  -- space-separated list of classes --
+  style       %StyleSheet;   #IMPLIED  -- associated style info --
+  title       %Text;         #IMPLIED  -- advisory title --"
+  >
+
+<!ENTITY % i18n
+ "lang        %LanguageCode; #IMPLIED  -- language code --
+  dir         (ltr|rtl)      #IMPLIED  -- direction for weak/neutral text --"
+  >
+
+<!ENTITY % events
+ "onclick     %Script;       #IMPLIED  -- a pointer button was clicked --
+  ondblclick  %Script;       #IMPLIED  -- a pointer button was double clicked--
+  onmousedown %Script;       #IMPLIED  -- a pointer button was pressed down --
+  onmouseup   %Script;       #IMPLIED  -- a pointer button was released --
+  onmouseover %Script;       #IMPLIED  -- a pointer was moved onto --
+  onmousemove %Script;       #IMPLIED  -- a pointer was moved within --
+  onmouseout  %Script;       #IMPLIED  -- a pointer was moved away --
+  onkeypress  %Script;       #IMPLIED  -- a key was pressed and released --
+  onkeydown   %Script;       #IMPLIED  -- a key was pressed down --
+  onkeyup     %Script;       #IMPLIED  -- a key was released --"
+  >
+
+<!-- Reserved Feature Switch -->
+<!ENTITY % HTML.Reserved "IGNORE">
+
+<!-- The following attributes are reserved for possible future use -->
+<![ %HTML.Reserved; [
+<!ENTITY % reserved
+ "datasrc     %URI;          #IMPLIED  -- a single or tabular Data Source --
+  datafld     CDATA          #IMPLIED  -- the property or column name --
+  dataformatas (plaintext|html) plaintext -- text or html --"
+  >
+]]>
+
+<!ENTITY % reserved "">
+
+<!ENTITY % attrs "%coreattrs; %i18n; %events;">
+
+
+<!--=================== Text Markup ======================================-->
+
+<!ENTITY % fontstyle
+ "TT | I | B | BIG | SMALL">
+
+<!ENTITY % phrase "EM | STRONG | DFN | CODE |
+                   SAMP | KBD | VAR | CITE | ABBR | ACRONYM" >
+
+<!ENTITY % special
+   "A | IMG | OBJECT | BR | SCRIPT | MAP | Q | SUB | SUP | SPAN | BDO">
+
+<!ENTITY % formctrl "INPUT | SELECT | TEXTAREA | LABEL | BUTTON">
+
+<!-- %inline; covers inline or "text-level" elements -->
+<!ENTITY % inline "#PCDATA | %fontstyle; | %phrase; | %special; | %formctrl;">
+
+<!ELEMENT (%fontstyle;|%phrase;) - - (%inline;)*>
+<!ATTLIST (%fontstyle;|%phrase;)
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!ELEMENT (SUB|SUP) - - (%inline;)*    -- subscript, superscript -->
+<!ATTLIST (SUB|SUP)
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!ELEMENT SPAN - - (%inline;)*         -- generic language/style container -->
+<!ATTLIST SPAN
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  %reserved;			       -- reserved for possible future use --
+  >
+
+<!ELEMENT BDO - - (%inline;)*          -- I18N BiDi over-ride -->
+<!ATTLIST BDO
+  %coreattrs;                          -- id, class, style, title --
+  lang        %LanguageCode; #IMPLIED  -- language code --
+  dir         (ltr|rtl)      #REQUIRED -- directionality --
+  >
+
+
+<!ELEMENT BR - O EMPTY                 -- forced line break -->
+<!ATTLIST BR
+  %coreattrs;                          -- id, class, style, title --
+  >
+
+<!--================== HTML content models ===============================-->
+
+<!--
+    HTML has two basic content models:
+
+        %inline;     character level elements and text strings
+        %block;      block-like elements e.g. paragraphs and lists
+-->
+
+<!ENTITY % block
+     "P | %heading; | %list; | %preformatted; | DL | DIV | NOSCRIPT |
+      BLOCKQUOTE | FORM | HR | TABLE | FIELDSET | ADDRESS">
+
+<!ENTITY % flow "%block; | %inline;">
+
+<!--=================== Document Body ====================================-->
+
+<!ELEMENT BODY O O (%block;|SCRIPT)+ +(INS|DEL) -- document body -->
+<!ATTLIST BODY
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  onload          %Script;   #IMPLIED  -- the document has been loaded --
+  onunload        %Script;   #IMPLIED  -- the document has been removed --
+  >
+
+<!ELEMENT ADDRESS - - (%inline;)* -- information on author -->
+<!ATTLIST ADDRESS
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!ELEMENT DIV - - (%flow;)*            -- generic language/style container -->
+<!ATTLIST DIV
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+
+<!--================== The Anchor Element ================================-->
+
+<!ENTITY % Shape "(rect|circle|poly|default)">
+<!ENTITY % Coords "CDATA" -- comma-separated list of lengths -->
+
+<!ELEMENT A - - (%inline;)* -(A)       -- anchor -->
+<!ATTLIST A
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  charset     %Charset;      #IMPLIED  -- char encoding of linked resource --
+  type        %ContentType;  #IMPLIED  -- advisory content type --
+  name        CDATA          #IMPLIED  -- named link end --
+  href        %URI;          #IMPLIED  -- URI for linked resource --
+  hreflang    %LanguageCode; #IMPLIED  -- language code --
+  rel         %LinkTypes;    #IMPLIED  -- forward link types --
+  rev         %LinkTypes;    #IMPLIED  -- reverse link types --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  shape       %Shape;        rect      -- for use with client-side image maps --
+  coords      %Coords;       #IMPLIED  -- for use with client-side image maps --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  >
+
+<!--================== Client-side image maps ============================-->
+
+<!-- These can be placed in the same document or grouped in a
+     separate document although this isn't yet widely supported -->
+
+<!ELEMENT MAP - - ((%block;) | AREA)+ -- client-side image map -->
+<!ATTLIST MAP
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  name        CDATA          #REQUIRED -- for reference by usemap --
+  >
+
+<!ELEMENT AREA - O EMPTY               -- client-side image map area -->
+<!ATTLIST AREA
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  shape       %Shape;        rect      -- controls interpretation of coords --
+  coords      %Coords;       #IMPLIED  -- comma-separated list of lengths --
+  href        %URI;          #IMPLIED  -- URI for linked resource --
+  nohref      (nohref)       #IMPLIED  -- this region has no action --
+  alt         %Text;         #REQUIRED -- short description --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  >
+
+<!--================== The LINK Element ==================================-->
+
+<!--
+  Relationship values can be used in principle:
+
+   a) for document specific toolbars/menus when used
+      with the LINK element in document head e.g.
+        start, contents, previous, next, index, end, help
+   b) to link to a separate style sheet (rel=stylesheet)
+   c) to make a link to a script (rel=script)
+   d) by stylesheets to control how collections of
+      html nodes are rendered into printed documents
+   e) to make a link to a printable version of this document
+      e.g. a postscript or pdf version (rel=alternate media=print)
+-->
+
+<!ELEMENT LINK - O EMPTY               -- a media-independent link -->
+<!ATTLIST LINK
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  charset     %Charset;      #IMPLIED  -- char encoding of linked resource --
+  href        %URI;          #IMPLIED  -- URI for linked resource --
+  hreflang    %LanguageCode; #IMPLIED  -- language code --
+  type        %ContentType;  #IMPLIED  -- advisory content type --
+  rel         %LinkTypes;    #IMPLIED  -- forward link types --
+  rev         %LinkTypes;    #IMPLIED  -- reverse link types --
+  media       %MediaDesc;    #IMPLIED  -- for rendering on these media --
+  >
+
+<!--=================== Images ===========================================-->
+
+<!-- Length defined in strict DTD for cellpadding/cellspacing -->
+<!ENTITY % Length "CDATA" -- nn for pixels or nn% for percentage length -->
+<!ENTITY % MultiLength "CDATA" -- pixel, percentage, or relative -->
+
+<![ %HTML.Frameset; [
+<!ENTITY % MultiLengths "CDATA" -- comma-separated list of MultiLength -->
+]]>
+
+<!ENTITY % Pixels "CDATA" -- integer representing length in pixels -->
+
+
+<!-- To avoid problems with text-only UAs as well as 
+   to make image content understandable and navigable 
+   to users of non-visual UAs, you need to provide
+   a description with ALT, and avoid server-side image maps -->
+<!ELEMENT IMG - O EMPTY                -- Embedded image -->
+<!ATTLIST IMG
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  src         %URI;          #REQUIRED -- URI of image to embed --
+  alt         %Text;         #REQUIRED -- short description --
+  longdesc    %URI;          #IMPLIED  -- link to long description
+                                          (complements alt) --
+  name        CDATA          #IMPLIED  -- name of image for scripting --
+  height      %Length;       #IMPLIED  -- override height --
+  width       %Length;       #IMPLIED  -- override width --
+  usemap      %URI;          #IMPLIED  -- use client-side image map --
+  ismap       (ismap)        #IMPLIED  -- use server-side image map --
+  >
+
+<!-- USEMAP points to a MAP element which may be in this document
+  or an external document, although the latter is not widely supported -->
+
+<!--==================== OBJECT ======================================-->
+<!--
+  OBJECT is used to embed objects as part of HTML pages 
+  PARAM elements should precede other content. SGML mixed content
+  model technicality precludes specifying this formally ...
+-->
+
+<!ELEMENT OBJECT - - (PARAM | %flow;)*
+ -- generic embedded object -->
+<!ATTLIST OBJECT
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  declare     (declare)      #IMPLIED  -- declare but don't instantiate flag --
+  classid     %URI;          #IMPLIED  -- identifies an implementation --
+  codebase    %URI;          #IMPLIED  -- base URI for classid, data, archive--
+  data        %URI;          #IMPLIED  -- reference to object's data --
+  type        %ContentType;  #IMPLIED  -- content type for data --
+  codetype    %ContentType;  #IMPLIED  -- content type for code --
+  archive     CDATA          #IMPLIED  -- space-separated list of URIs --
+  standby     %Text;         #IMPLIED  -- message to show while loading --
+  height      %Length;       #IMPLIED  -- override height --
+  width       %Length;       #IMPLIED  -- override width --
+  usemap      %URI;          #IMPLIED  -- use client-side image map --
+  name        CDATA          #IMPLIED  -- submit as part of form --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+<!ELEMENT PARAM - O EMPTY              -- named property value -->
+<!ATTLIST PARAM
+  id          ID             #IMPLIED  -- document-wide unique id --
+  name        CDATA          #REQUIRED -- property name --
+  value       CDATA          #IMPLIED  -- property value --
+  valuetype   (DATA|REF|OBJECT) DATA   -- How to interpret value --
+  type        %ContentType;  #IMPLIED  -- content type for value
+                                          when valuetype=ref --
+  >
+
+
+<!--=================== Horizontal Rule ==================================-->
+
+<!ELEMENT HR - O EMPTY -- horizontal rule -->
+<!ATTLIST HR
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--=================== Paragraphs =======================================-->
+
+<!ELEMENT P - O (%inline;)*            -- paragraph -->
+<!ATTLIST P
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--=================== Headings =========================================-->
+
+<!--
+  There are six levels of headings from H1 (the most important)
+  to H6 (the least important).
+-->
+
+<!ELEMENT (%heading;)  - - (%inline;)* -- heading -->
+<!ATTLIST (%heading;)
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--=================== Preformatted Text ================================-->
+
+<!-- excludes markup for images and changes in font size -->
+<!ENTITY % pre.exclusion "IMG|OBJECT|BIG|SMALL|SUB|SUP">
+
+<!ELEMENT PRE - - (%inline;)* -(%pre.exclusion;) -- preformatted text -->
+<!ATTLIST PRE
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--===================== Inline Quotes ==================================-->
+
+<!ELEMENT Q - - (%inline;)*            -- short inline quotation -->
+<!ATTLIST Q
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  cite        %URI;          #IMPLIED  -- URI for source document or msg --
+  >
+
+<!--=================== Block-like Quotes ================================-->
+
+<!ELEMENT BLOCKQUOTE - - (%block;|SCRIPT)+ -- long quotation -->
+<!ATTLIST BLOCKQUOTE
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  cite        %URI;          #IMPLIED  -- URI for source document or msg --
+  >
+
+<!--=================== Inserted/Deleted Text ============================-->
+
+
+<!-- INS/DEL are handled by inclusion on BODY -->
+<!ELEMENT (INS|DEL) - - (%flow;)*      -- inserted text, deleted text -->
+<!ATTLIST (INS|DEL)
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  cite        %URI;          #IMPLIED  -- info on reason for change --
+  datetime    %Datetime;     #IMPLIED  -- date and time of change --
+  >
+
+<!--=================== Lists ============================================-->
+
+<!-- definition lists - DT for term, DD for its definition -->
+
+<!ELEMENT DL - - (DT|DD)+              -- definition list -->
+<!ATTLIST DL
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!ELEMENT DT - O (%inline;)*           -- definition term -->
+<!ELEMENT DD - O (%flow;)*             -- definition description -->
+<!ATTLIST (DT|DD)
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+
+<!ELEMENT OL - - (LI)+                 -- ordered list -->
+<!ATTLIST OL
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!-- Unordered Lists (UL) bullet styles -->
+<!ELEMENT UL - - (LI)+                 -- unordered list -->
+<!ATTLIST UL
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+
+
+<!ELEMENT LI - O (%flow;)*             -- list item -->
+<!ATTLIST LI
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--================ Forms ===============================================-->
+<!ELEMENT FORM - - (%block;|SCRIPT)+ -(FORM) -- interactive form -->
+<!ATTLIST FORM
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  action      %URI;          #REQUIRED -- server-side form handler --
+  method      (GET|POST)     GET       -- HTTP method used to submit the form--
+  enctype     %ContentType;  "application/x-www-form-urlencoded"
+  accept      %ContentTypes; #IMPLIED  -- list of MIME types for file upload --
+  name        CDATA          #IMPLIED  -- name of form for scripting --
+  onsubmit    %Script;       #IMPLIED  -- the form was submitted --
+  onreset     %Script;       #IMPLIED  -- the form was reset --
+  accept-charset %Charsets;  #IMPLIED  -- list of supported charsets --
+  >
+
+<!-- Each label must not contain more than ONE field -->
+<!ELEMENT LABEL - - (%inline;)* -(LABEL) -- form field label text -->
+<!ATTLIST LABEL
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  for         IDREF          #IMPLIED  -- matches field ID value --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  >
+
+<!ENTITY % InputType
+  "(TEXT | PASSWORD | CHECKBOX |
+    RADIO | SUBMIT | RESET |
+    FILE | HIDDEN | IMAGE | BUTTON)"
+   >
+
+<!-- attribute name required for all but submit and reset -->
+<!ELEMENT INPUT - O EMPTY              -- form control -->
+<!ATTLIST INPUT
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  type        %InputType;    TEXT      -- what kind of widget is needed --
+  name        CDATA          #IMPLIED  -- submit as part of form --
+  value       CDATA          #IMPLIED  -- Specify for radio buttons and checkboxes --
+  checked     (checked)      #IMPLIED  -- for radio buttons and check boxes --
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  readonly    (readonly)     #IMPLIED  -- for text and passwd --
+  size        CDATA          #IMPLIED  -- specific to each type of field --
+  maxlength   NUMBER         #IMPLIED  -- max chars for text fields --
+  src         %URI;          #IMPLIED  -- for fields with images --
+  alt         CDATA          #IMPLIED  -- short description --
+  usemap      %URI;          #IMPLIED  -- use client-side image map --
+  ismap       (ismap)        #IMPLIED  -- use server-side image map --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  onselect    %Script;       #IMPLIED  -- some text was selected --
+  onchange    %Script;       #IMPLIED  -- the element value was changed --
+  accept      %ContentTypes; #IMPLIED  -- list of MIME types for file upload --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+<!ELEMENT SELECT - - (OPTGROUP|OPTION)+ -- option selector -->
+<!ATTLIST SELECT
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  name        CDATA          #IMPLIED  -- field name --
+  size        NUMBER         #IMPLIED  -- rows visible --
+  multiple    (multiple)     #IMPLIED  -- default is single selection --
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  onchange    %Script;       #IMPLIED  -- the element value was changed --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+<!ELEMENT OPTGROUP - - (OPTION)+ -- option group -->
+<!ATTLIST OPTGROUP
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  label       %Text;         #REQUIRED -- for use in hierarchical menus --
+  >
+
+<!ELEMENT OPTION - O (#PCDATA)         -- selectable choice -->
+<!ATTLIST OPTION
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  selected    (selected)     #IMPLIED
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  label       %Text;         #IMPLIED  -- for use in hierarchical menus --
+  value       CDATA          #IMPLIED  -- defaults to element content --
+  >
+
+<!ELEMENT TEXTAREA - - (#PCDATA)       -- multi-line text field -->
+<!ATTLIST TEXTAREA
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  name        CDATA          #IMPLIED
+  rows        NUMBER         #REQUIRED
+  cols        NUMBER         #REQUIRED
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  readonly    (readonly)     #IMPLIED
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  onselect    %Script;       #IMPLIED  -- some text was selected --
+  onchange    %Script;       #IMPLIED  -- the element value was changed --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+<!--
+  #PCDATA is to solve the mixed content problem,
+  per specification only whitespace is allowed there!
+ -->
+<!ELEMENT FIELDSET - - (#PCDATA,LEGEND,(%flow;)*) -- form control group -->
+<!ATTLIST FIELDSET
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!ELEMENT LEGEND - - (%inline;)*       -- fieldset legend -->
+
+<!ATTLIST LEGEND
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  >
+
+<!ELEMENT BUTTON - -
+     (%flow;)* -(A|%formctrl;|FORM|FIELDSET)
+     -- push button -->
+<!ATTLIST BUTTON
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  name        CDATA          #IMPLIED
+  value       CDATA          #IMPLIED  -- sent to server when submitted --
+  type        (button|submit|reset) submit -- for use as form button --
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+<!--======================= Tables =======================================-->
+
+<!-- IETF HTML table standard, see [RFC1942] -->
+
+<!--
+ The BORDER attribute sets the thickness of the frame around the
+ table. The default units are screen pixels.
+
+ The FRAME attribute specifies which parts of the frame around
+ the table should be rendered. The values are not the same as
+ CALS to avoid a name clash with the VALIGN attribute.
+
+ The value "border" is included for backwards compatibility with
+ <TABLE BORDER> which yields frame=border and border=implied
+ For <TABLE BORDER=1> you get border=1 and frame=implied. In this
+ case, it is appropriate to treat this as frame=border for backwards
+ compatibility with deployed browsers.
+-->
+<!ENTITY % TFrame "(void|above|below|hsides|lhs|rhs|vsides|box|border)">
+
+<!--
+ The RULES attribute defines which rules to draw between cells:
+
+ If RULES is absent then assume:
+     "none" if BORDER is absent or BORDER=0 otherwise "all"
+-->
+
+<!ENTITY % TRules "(none | groups | rows | cols | all)">
+  
+<!-- horizontal placement of table relative to document -->
+<!ENTITY % TAlign "(left|center|right)">
+
+<!-- horizontal alignment attributes for cell contents -->
+<!ENTITY % cellhalign
+  "align      (left|center|right|justify|char) #IMPLIED
+   char       %Character;    #IMPLIED  -- alignment char, e.g. char=':' --
+   charoff    %Length;       #IMPLIED  -- offset for alignment char --"
+  >
+
+<!-- vertical alignment attributes for cell contents -->
+<!ENTITY % cellvalign
+  "valign     (top|middle|bottom|baseline) #IMPLIED"
+  >
+
+<!ELEMENT TABLE - -
+     (CAPTION?, (COL*|COLGROUP*), THEAD?, TFOOT?, TBODY+)>
+<!ELEMENT CAPTION  - - (%inline;)*     -- table caption -->
+<!ELEMENT THEAD    - O (TR)+           -- table header -->
+<!ELEMENT TFOOT    - O (TR)+           -- table footer -->
+<!ELEMENT TBODY    O O (TR)+           -- table body -->
+<!ELEMENT COLGROUP - O (COL)*          -- table column group -->
+<!ELEMENT COL      - O EMPTY           -- table column -->
+<!ELEMENT TR       - O (TH|TD)+        -- table row -->
+<!ELEMENT (TH|TD)  - O (%flow;)*       -- table header cell, table data cell-->
+
+<!ATTLIST TABLE                        -- table element --
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  summary     %Text;         #IMPLIED  -- purpose/structure for speech output--
+  width       %Length;       #IMPLIED  -- table width --
+  border      %Pixels;       #IMPLIED  -- controls frame width around table --
+  frame       %TFrame;       #IMPLIED  -- which parts of frame to render --
+  rules       %TRules;       #IMPLIED  -- rulings between rows and cols --
+  cellspacing %Length;       #IMPLIED  -- spacing between cells --
+  cellpadding %Length;       #IMPLIED  -- spacing within cells --
+  %reserved;                           -- reserved for possible future use --
+  datapagesize CDATA         #IMPLIED  -- reserved for possible future use --
+  >
+
+
+<!ATTLIST CAPTION
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--
+COLGROUP groups a set of COL elements. It allows you to group
+several semantically related columns together.
+-->
+<!ATTLIST COLGROUP
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  span        NUMBER         1         -- default number of columns in group --
+  width       %MultiLength;  #IMPLIED  -- default width for enclosed COLs --
+  %cellhalign;                         -- horizontal alignment in cells --
+  %cellvalign;                         -- vertical alignment in cells --
+  >
+
+<!--
+ COL elements define the alignment properties for cells in
+ one or more columns.
+
+ The WIDTH attribute specifies the width of the columns, e.g.
+
+     width=64        width in screen pixels
+     width=0.5*      relative width of 0.5
+
+ The SPAN attribute causes the attributes of one
+ COL element to apply to more than one column.
+-->
+<!ATTLIST COL                          -- column groups and properties --
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  span        NUMBER         1         -- COL attributes affect N columns --
+  width       %MultiLength;  #IMPLIED  -- column width specification --
+  %cellhalign;                         -- horizontal alignment in cells --
+  %cellvalign;                         -- vertical alignment in cells --
+  >
+
+<!--
+    Use THEAD to duplicate headers when breaking table
+    across page boundaries, or for static headers when
+    TBODY sections are rendered in scrolling panel.
+
+    Use TFOOT to duplicate footers when breaking table
+    across page boundaries, or for static footers when
+    TBODY sections are rendered in scrolling panel.
+
+    Use multiple TBODY sections when rules are needed
+    between groups of table rows.
+-->
+<!ATTLIST (THEAD|TBODY|TFOOT)          -- table section --
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  %cellhalign;                         -- horizontal alignment in cells --
+  %cellvalign;                         -- vertical alignment in cells --
+  >
+
+<!ATTLIST TR                           -- table row --
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  %cellhalign;                         -- horizontal alignment in cells --
+  %cellvalign;                         -- vertical alignment in cells --
+  >
+
+
+<!-- Scope is simpler than headers attribute for common tables -->
+<!ENTITY % Scope "(row|col|rowgroup|colgroup)">
+
+<!-- TH is for headers, TD for data, but for cells acting as both use TD -->
+<!ATTLIST (TH|TD)                      -- header or data cell --
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  abbr        %Text;         #IMPLIED  -- abbreviation for header cell --
+  axis        CDATA          #IMPLIED  -- comma-separated list of related headers--
+  headers     IDREFS         #IMPLIED  -- list of id's for header cells --
+  scope       %Scope;        #IMPLIED  -- scope covered by header cells --
+  rowspan     NUMBER         1         -- number of rows spanned by cell --
+  colspan     NUMBER         1         -- number of cols spanned by cell --
+  %cellhalign;                         -- horizontal alignment in cells --
+  %cellvalign;                         -- vertical alignment in cells --
+  >
+
+
+<!--================ Document Head =======================================-->
+<!-- %head.misc; defined earlier on as "SCRIPT|STYLE|META|LINK|OBJECT" -->
+<!ENTITY % head.content "TITLE & BASE?">
+
+<!ELEMENT HEAD O O (%head.content;) +(%head.misc;) -- document head -->
+<!ATTLIST HEAD
+  %i18n;                               -- lang, dir --
+  profile     %URI;          #IMPLIED  -- named dictionary of meta info --
+  >
+
+<!-- The TITLE element is not considered part of the flow of text.
+       It should be displayed, for example as the page header or
+       window title. Exactly one title is required per document.
+    -->
+<!ELEMENT TITLE - - (#PCDATA) -(%head.misc;) -- document title -->
+<!ATTLIST TITLE %i18n>
+
+
+<!ELEMENT BASE - O EMPTY               -- document base URI -->
+<!ATTLIST BASE
+  href        %URI;          #REQUIRED -- URI that acts as base URI --
+  >
+
+<!ELEMENT META - O EMPTY               -- generic metainformation -->
+<!ATTLIST META
+  %i18n;                               -- lang, dir, for use with content --
+  http-equiv  NAME           #IMPLIED  -- HTTP response header name  --
+  name        NAME           #IMPLIED  -- metainformation name --
+  content     CDATA          #REQUIRED -- associated information --
+  scheme      CDATA          #IMPLIED  -- select form of content --
+  >
+
+<!ELEMENT STYLE - - %StyleSheet        -- style info -->
+<!ATTLIST STYLE
+  %i18n;                               -- lang, dir, for use with title --
+  type        %ContentType;  #REQUIRED -- content type of style language --
+  media       %MediaDesc;    #IMPLIED  -- designed for use with these media --
+  title       %Text;         #IMPLIED  -- advisory title --
+  >
+
+<!ELEMENT SCRIPT - - %Script;          -- script statements -->
+<!ATTLIST SCRIPT
+  charset     %Charset;      #IMPLIED  -- char encoding of linked resource --
+  type        %ContentType;  #REQUIRED -- content type of script language --
+  src         %URI;          #IMPLIED  -- URI for an external script --
+  defer       (defer)        #IMPLIED  -- UA may defer execution of script --
+  event       CDATA          #IMPLIED  -- reserved for possible future use --
+  for         %URI;          #IMPLIED  -- reserved for possible future use --
+  >
+
+<!ELEMENT NOSCRIPT - - (%block;)+
+  -- alternate content container for non script-based rendering -->
+<!ATTLIST NOSCRIPT
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--================ Document Structure ==================================-->
+<!ENTITY % html.content "HEAD, BODY">
+
+<!ELEMENT HTML O O (%html.content;)    -- document root element -->
+<!ATTLIST HTML
+  %i18n;                               -- lang, dir --
+  >
diff --git a/node_modules/xml2js/node_modules/sax/examples/test.html b/node_modules/xml2js/node_modules/sax/examples/test.html
new file mode 100644
index 0000000..61f8f1a
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/examples/test.html
@@ -0,0 +1,15 @@
+<!doctype html>
+
+<html lang="en">
+<head>
+	<title>testing the parser</title>
+</head>
+<body>
+
+<p>hello
+
+<script>
+
+</script>
+</body>
+</html>
diff --git a/node_modules/xml2js/node_modules/sax/examples/test.xml b/node_modules/xml2js/node_modules/sax/examples/test.xml
new file mode 100644
index 0000000..801292d
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/examples/test.xml
@@ -0,0 +1,1254 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE RootElement [
+	<!ENTITY e SYSTEM "001.ent">
+]>
+<RootElement param="value">
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+</RootElement>
\ No newline at end of file
diff --git a/node_modules/xml2js/node_modules/sax/lib/sax.js b/node_modules/xml2js/node_modules/sax/lib/sax.js
new file mode 100644
index 0000000..2edf57b
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/lib/sax.js
@@ -0,0 +1,1316 @@
+// wrapper for non-node envs
+;(function (sax) {
+
+sax.parser = function (strict, opt) { return new SAXParser(strict, opt) }
+sax.SAXParser = SAXParser
+sax.SAXStream = SAXStream
+sax.createStream = createStream
+
+// When we pass the MAX_BUFFER_LENGTH position, start checking for buffer overruns.
+// When we check, schedule the next check for MAX_BUFFER_LENGTH - (max(buffer lengths)),
+// since that's the earliest that a buffer overrun could occur.  This way, checks are
+// as rare as required, but as often as necessary to ensure never crossing this bound.
+// Furthermore, buffers are only tested at most once per write(), so passing a very
+// large string into write() might have undesirable effects, but this is manageable by
+// the caller, so it is assumed to be safe.  Thus, a call to write() may, in the extreme
+// edge case, result in creating at most one complete copy of the string passed in.
+// Set to Infinity to have unlimited buffers.
+sax.MAX_BUFFER_LENGTH = 64 * 1024
+
+var buffers = [
+  "comment", "sgmlDecl", "textNode", "tagName", "doctype",
+  "procInstName", "procInstBody", "entity", "attribName",
+  "attribValue", "cdata", "script"
+]
+
+sax.EVENTS = // for discoverability.
+  [ "text"
+  , "processinginstruction"
+  , "sgmldeclaration"
+  , "doctype"
+  , "comment"
+  , "attribute"
+  , "opentag"
+  , "closetag"
+  , "opencdata"
+  , "cdata"
+  , "closecdata"
+  , "error"
+  , "end"
+  , "ready"
+  , "script"
+  , "opennamespace"
+  , "closenamespace"
+  ]
+
+function SAXParser (strict, opt) {
+  if (!(this instanceof SAXParser)) return new SAXParser(strict, opt)
+
+  var parser = this
+  clearBuffers(parser)
+  parser.q = parser.c = ""
+  parser.bufferCheckPosition = sax.MAX_BUFFER_LENGTH
+  parser.opt = opt || {}
+  parser.opt.lowercase = parser.opt.lowercase || parser.opt.lowercasetags
+  parser.looseCase = parser.opt.lowercase ? "toLowerCase" : "toUpperCase"
+  parser.tags = []
+  parser.closed = parser.closedRoot = parser.sawRoot = false
+  parser.tag = parser.error = null
+  parser.strict = !!strict
+  parser.noscript = !!(strict || parser.opt.noscript)
+  parser.state = S.BEGIN
+  parser.ENTITIES = Object.create(sax.ENTITIES)
+  parser.attribList = []
+
+  // namespaces form a prototype chain.
+  // it always points at the current tag,
+  // which protos to its parent tag.
+  if (parser.opt.xmlns) parser.ns = Object.create(rootNS)
+
+  // mostly just for error reporting
+  parser.trackPosition = parser.opt.position !== false
+  if (parser.trackPosition) {
+    parser.position = parser.line = parser.column = 0
+  }
+  emit(parser, "onready")
+}
+
+if (!Object.create) Object.create = function (o) {
+  function f () { this.__proto__ = o }
+  f.prototype = o
+  return new f
+}
+
+if (!Object.getPrototypeOf) Object.getPrototypeOf = function (o) {
+  return o.__proto__
+}
+
+if (!Object.keys) Object.keys = function (o) {
+  var a = []
+  for (var i in o) if (o.hasOwnProperty(i)) a.push(i)
+  return a
+}
+
+function checkBufferLength (parser) {
+  var maxAllowed = Math.max(sax.MAX_BUFFER_LENGTH, 10)
+    , maxActual = 0
+  for (var i = 0, l = buffers.length; i < l; i ++) {
+    var len = parser[buffers[i]].length
+    if (len > maxAllowed) {
+      // Text/cdata nodes can get big, and since they're buffered,
+      // we can get here under normal conditions.
+      // Avoid issues by emitting the text node now,
+      // so at least it won't get any bigger.
+      switch (buffers[i]) {
+        case "textNode":
+          closeText(parser)
+        break
+
+        case "cdata":
+          emitNode(parser, "oncdata", parser.cdata)
+          parser.cdata = ""
+        break
+
+        case "script":
+          emitNode(parser, "onscript", parser.script)
+          parser.script = ""
+        break
+
+        default:
+          error(parser, "Max buffer length exceeded: "+buffers[i])
+      }
+    }
+    maxActual = Math.max(maxActual, len)
+  }
+  // schedule the next check for the earliest possible buffer overrun.
+  parser.bufferCheckPosition = (sax.MAX_BUFFER_LENGTH - maxActual)
+                             + parser.position
+}
+
+function clearBuffers (parser) {
+  for (var i = 0, l = buffers.length; i < l; i ++) {
+    parser[buffers[i]] = ""
+  }
+}
+
+SAXParser.prototype =
+  { end: function () { end(this) }
+  , write: write
+  , resume: function () { this.error = null; return this }
+  , close: function () { return this.write(null) }
+  }
+
+try {
+  var Stream = require("stream").Stream
+} catch (ex) {
+  var Stream = function () {}
+}
+
+
+var streamWraps = sax.EVENTS.filter(function (ev) {
+  return ev !== "error" && ev !== "end"
+})
+
+function createStream (strict, opt) {
+  return new SAXStream(strict, opt)
+}
+
+function SAXStream (strict, opt) {
+  if (!(this instanceof SAXStream)) return new SAXStream(strict, opt)
+
+  Stream.apply(this)
+
+  this._parser = new SAXParser(strict, opt)
+  this.writable = true
+  this.readable = true
+
+
+  var me = this
+
+  this._parser.onend = function () {
+    me.emit("end")
+  }
+
+  this._parser.onerror = function (er) {
+    me.emit("error", er)
+
+    // if didn't throw, then means error was handled.
+    // go ahead and clear error, so we can write again.
+    me._parser.error = null
+  }
+
+  streamWraps.forEach(function (ev) {
+    Object.defineProperty(me, "on" + ev, {
+      get: function () { return me._parser["on" + ev] },
+      set: function (h) {
+        if (!h) {
+          me.removeAllListeners(ev)
+          return me._parser["on"+ev] = h
+        }
+        me.on(ev, h)
+      },
+      enumerable: true,
+      configurable: false
+    })
+  })
+}
+
+SAXStream.prototype = Object.create(Stream.prototype,
+  { constructor: { value: SAXStream } })
+
+SAXStream.prototype.write = function (data) {
+  this._parser.write(data.toString())
+  this.emit("data", data)
+  return true
+}
+
+SAXStream.prototype.end = function (chunk) {
+  if (chunk && chunk.length) this._parser.write(chunk.toString())
+  this._parser.end()
+  return true
+}
+
+SAXStream.prototype.on = function (ev, handler) {
+  var me = this
+  if (!me._parser["on"+ev] && streamWraps.indexOf(ev) !== -1) {
+    me._parser["on"+ev] = function () {
+      var args = arguments.length === 1 ? [arguments[0]]
+               : Array.apply(null, arguments)
+      args.splice(0, 0, ev)
+      me.emit.apply(me, args)
+    }
+  }
+
+  return Stream.prototype.on.call(me, ev, handler)
+}
+
+
+
+// character classes and tokens
+var whitespace = "\r\n\t "
+  // this really needs to be replaced with character classes.
+  // XML allows all manner of ridiculous numbers and digits.
+  , number = "0124356789"
+  , letter = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
+  // (Letter | "_" | ":")
+  , quote = "'\""
+  , entity = number+letter+"#"
+  , attribEnd = whitespace + ">"
+  , CDATA = "[CDATA["
+  , DOCTYPE = "DOCTYPE"
+  , XML_NAMESPACE = "http://www.w3.org/XML/1998/namespace"
+  , XMLNS_NAMESPACE = "http://www.w3.org/2000/xmlns/"
+  , rootNS = { xml: XML_NAMESPACE, xmlns: XMLNS_NAMESPACE }
+
+// turn all the string character sets into character class objects.
+whitespace = charClass(whitespace)
+number = charClass(number)
+letter = charClass(letter)
+
+// http://www.w3.org/TR/REC-xml/#NT-NameStartChar
+// This implementation works on strings, a single character at a time
+// as such, it cannot ever support astral-plane characters (10000-EFFFF)
+// without a significant breaking change to either this  parser, or the
+// JavaScript language.  Implementation of an emoji-capable xml parser
+// is left as an exercise for the reader.
+var nameStart = /[:_A-Za-z\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u02FF\u0370-\u037D\u037F-\u1FFF\u200C-\u200D\u2070-\u218F\u2C00-\u2FEF\u3001-\uD7FF\uF900-\uFDCF\uFDF0-\uFFFD]/
+
+var nameBody = /[:_A-Za-z\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u02FF\u0370-\u037D\u037F-\u1FFF\u200C-\u200D\u2070-\u218F\u2C00-\u2FEF\u3001-\uD7FF\uF900-\uFDCF\uFDF0-\uFFFD\u00B7\u0300-\u036F\u203F-\u2040\.\d-]/
+
+quote = charClass(quote)
+entity = charClass(entity)
+attribEnd = charClass(attribEnd)
+
+function charClass (str) {
+  return str.split("").reduce(function (s, c) {
+    s[c] = true
+    return s
+  }, {})
+}
+
+function isRegExp (c) {
+  return Object.prototype.toString.call(c) === '[object RegExp]'
+}
+
+function is (charclass, c) {
+  return isRegExp(charclass) ? !!c.match(charclass) : charclass[c]
+}
+
+function not (charclass, c) {
+  return !is(charclass, c)
+}
+
+var S = 0
+sax.STATE =
+{ BEGIN                     : S++
+, TEXT                      : S++ // general stuff
+, TEXT_ENTITY               : S++ // &amp and such.
+, OPEN_WAKA                 : S++ // <
+, SGML_DECL                 : S++ // <!BLARG
+, SGML_DECL_QUOTED          : S++ // <!BLARG foo "bar
+, DOCTYPE                   : S++ // <!DOCTYPE
+, DOCTYPE_QUOTED            : S++ // <!DOCTYPE "//blah
+, DOCTYPE_DTD               : S++ // <!DOCTYPE "//blah" [ ...
+, DOCTYPE_DTD_QUOTED        : S++ // <!DOCTYPE "//blah" [ "foo
+, COMMENT_STARTING          : S++ // <!-
+, COMMENT                   : S++ // <!--
+, COMMENT_ENDING            : S++ // <!-- blah -
+, COMMENT_ENDED             : S++ // <!-- blah --
+, CDATA                     : S++ // <![CDATA[ something
+, CDATA_ENDING              : S++ // ]
+, CDATA_ENDING_2            : S++ // ]]
+, PROC_INST                 : S++ // <?hi
+, PROC_INST_BODY            : S++ // <?hi there
+, PROC_INST_ENDING          : S++ // <?hi "there" ?
+, OPEN_TAG                  : S++ // <strong
+, OPEN_TAG_SLASH            : S++ // <strong /
+, ATTRIB                    : S++ // <a
+, ATTRIB_NAME               : S++ // <a foo
+, ATTRIB_NAME_SAW_WHITE     : S++ // <a foo _
+, ATTRIB_VALUE              : S++ // <a foo=
+, ATTRIB_VALUE_QUOTED       : S++ // <a foo="bar
+, ATTRIB_VALUE_UNQUOTED     : S++ // <a foo=bar
+, ATTRIB_VALUE_ENTITY_Q     : S++ // <foo bar="&quot;"
+, ATTRIB_VALUE_ENTITY_U     : S++ // <foo bar=&quot;
+, CLOSE_TAG                 : S++ // </a
+, CLOSE_TAG_SAW_WHITE       : S++ // </a   >
+, SCRIPT                    : S++ // <script> ...
+, SCRIPT_ENDING             : S++ // <script> ... <
+}
+
+sax.ENTITIES =
+{ "amp" : "&"
+, "gt" : ">"
+, "lt" : "<"
+, "quot" : "\""
+, "apos" : "'"
+, "AElig" : 198
+, "Aacute" : 193
+, "Acirc" : 194
+, "Agrave" : 192
+, "Aring" : 197
+, "Atilde" : 195
+, "Auml" : 196
+, "Ccedil" : 199
+, "ETH" : 208
+, "Eacute" : 201
+, "Ecirc" : 202
+, "Egrave" : 200
+, "Euml" : 203
+, "Iacute" : 205
+, "Icirc" : 206
+, "Igrave" : 204
+, "Iuml" : 207
+, "Ntilde" : 209
+, "Oacute" : 211
+, "Ocirc" : 212
+, "Ograve" : 210
+, "Oslash" : 216
+, "Otilde" : 213
+, "Ouml" : 214
+, "THORN" : 222
+, "Uacute" : 218
+, "Ucirc" : 219
+, "Ugrave" : 217
+, "Uuml" : 220
+, "Yacute" : 221
+, "aacute" : 225
+, "acirc" : 226
+, "aelig" : 230
+, "agrave" : 224
+, "aring" : 229
+, "atilde" : 227
+, "auml" : 228
+, "ccedil" : 231
+, "eacute" : 233
+, "ecirc" : 234
+, "egrave" : 232
+, "eth" : 240
+, "euml" : 235
+, "iacute" : 237
+, "icirc" : 238
+, "igrave" : 236
+, "iuml" : 239
+, "ntilde" : 241
+, "oacute" : 243
+, "ocirc" : 244
+, "ograve" : 242
+, "oslash" : 248
+, "otilde" : 245
+, "ouml" : 246
+, "szlig" : 223
+, "thorn" : 254
+, "uacute" : 250
+, "ucirc" : 251
+, "ugrave" : 249
+, "uuml" : 252
+, "yacute" : 253
+, "yuml" : 255
+, "copy" : 169
+, "reg" : 174
+, "nbsp" : 160
+, "iexcl" : 161
+, "cent" : 162
+, "pound" : 163
+, "curren" : 164
+, "yen" : 165
+, "brvbar" : 166
+, "sect" : 167
+, "uml" : 168
+, "ordf" : 170
+, "laquo" : 171
+, "not" : 172
+, "shy" : 173
+, "macr" : 175
+, "deg" : 176
+, "plusmn" : 177
+, "sup1" : 185
+, "sup2" : 178
+, "sup3" : 179
+, "acute" : 180
+, "micro" : 181
+, "para" : 182
+, "middot" : 183
+, "cedil" : 184
+, "ordm" : 186
+, "raquo" : 187
+, "frac14" : 188
+, "frac12" : 189
+, "frac34" : 190
+, "iquest" : 191
+, "times" : 215
+, "divide" : 247
+, "OElig" : 338
+, "oelig" : 339
+, "Scaron" : 352
+, "scaron" : 353
+, "Yuml" : 376
+, "fnof" : 402
+, "circ" : 710
+, "tilde" : 732
+, "Alpha" : 913
+, "Beta" : 914
+, "Gamma" : 915
+, "Delta" : 916
+, "Epsilon" : 917
+, "Zeta" : 918
+, "Eta" : 919
+, "Theta" : 920
+, "Iota" : 921
+, "Kappa" : 922
+, "Lambda" : 923
+, "Mu" : 924
+, "Nu" : 925
+, "Xi" : 926
+, "Omicron" : 927
+, "Pi" : 928
+, "Rho" : 929
+, "Sigma" : 931
+, "Tau" : 932
+, "Upsilon" : 933
+, "Phi" : 934
+, "Chi" : 935
+, "Psi" : 936
+, "Omega" : 937
+, "alpha" : 945
+, "beta" : 946
+, "gamma" : 947
+, "delta" : 948
+, "epsilon" : 949
+, "zeta" : 950
+, "eta" : 951
+, "theta" : 952
+, "iota" : 953
+, "kappa" : 954
+, "lambda" : 955
+, "mu" : 956
+, "nu" : 957
+, "xi" : 958
+, "omicron" : 959
+, "pi" : 960
+, "rho" : 961
+, "sigmaf" : 962
+, "sigma" : 963
+, "tau" : 964
+, "upsilon" : 965
+, "phi" : 966
+, "chi" : 967
+, "psi" : 968
+, "omega" : 969
+, "thetasym" : 977
+, "upsih" : 978
+, "piv" : 982
+, "ensp" : 8194
+, "emsp" : 8195
+, "thinsp" : 8201
+, "zwnj" : 8204
+, "zwj" : 8205
+, "lrm" : 8206
+, "rlm" : 8207
+, "ndash" : 8211
+, "mdash" : 8212
+, "lsquo" : 8216
+, "rsquo" : 8217
+, "sbquo" : 8218
+, "ldquo" : 8220
+, "rdquo" : 8221
+, "bdquo" : 8222
+, "dagger" : 8224
+, "Dagger" : 8225
+, "bull" : 8226
+, "hellip" : 8230
+, "permil" : 8240
+, "prime" : 8242
+, "Prime" : 8243
+, "lsaquo" : 8249
+, "rsaquo" : 8250
+, "oline" : 8254
+, "frasl" : 8260
+, "euro" : 8364
+, "image" : 8465
+, "weierp" : 8472
+, "real" : 8476
+, "trade" : 8482
+, "alefsym" : 8501
+, "larr" : 8592
+, "uarr" : 8593
+, "rarr" : 8594
+, "darr" : 8595
+, "harr" : 8596
+, "crarr" : 8629
+, "lArr" : 8656
+, "uArr" : 8657
+, "rArr" : 8658
+, "dArr" : 8659
+, "hArr" : 8660
+, "forall" : 8704
+, "part" : 8706
+, "exist" : 8707
+, "empty" : 8709
+, "nabla" : 8711
+, "isin" : 8712
+, "notin" : 8713
+, "ni" : 8715
+, "prod" : 8719
+, "sum" : 8721
+, "minus" : 8722
+, "lowast" : 8727
+, "radic" : 8730
+, "prop" : 8733
+, "infin" : 8734
+, "ang" : 8736
+, "and" : 8743
+, "or" : 8744
+, "cap" : 8745
+, "cup" : 8746
+, "int" : 8747
+, "there4" : 8756
+, "sim" : 8764
+, "cong" : 8773
+, "asymp" : 8776
+, "ne" : 8800
+, "equiv" : 8801
+, "le" : 8804
+, "ge" : 8805
+, "sub" : 8834
+, "sup" : 8835
+, "nsub" : 8836
+, "sube" : 8838
+, "supe" : 8839
+, "oplus" : 8853
+, "otimes" : 8855
+, "perp" : 8869
+, "sdot" : 8901
+, "lceil" : 8968
+, "rceil" : 8969
+, "lfloor" : 8970
+, "rfloor" : 8971
+, "lang" : 9001
+, "rang" : 9002
+, "loz" : 9674
+, "spades" : 9824
+, "clubs" : 9827
+, "hearts" : 9829
+, "diams" : 9830
+}
+
+Object.keys(sax.ENTITIES).forEach(function (key) {
+    var e = sax.ENTITIES[key]
+    var s = typeof e === 'number' ? String.fromCharCode(e) : e
+    sax.ENTITIES[key] = s
+})
+
+for (var S in sax.STATE) sax.STATE[sax.STATE[S]] = S
+
+// shorthand
+S = sax.STATE
+
+function emit (parser, event, data) {
+  parser[event] && parser[event](data)
+}
+
+function emitNode (parser, nodeType, data) {
+  if (parser.textNode) closeText(parser)
+  emit(parser, nodeType, data)
+}
+
+function closeText (parser) {
+  parser.textNode = textopts(parser.opt, parser.textNode)
+  if (parser.textNode) emit(parser, "ontext", parser.textNode)
+  parser.textNode = ""
+}
+
+function textopts (opt, text) {
+  if (opt.trim) text = text.trim()
+  if (opt.normalize) text = text.replace(/\s+/g, " ")
+  return text
+}
+
+function error (parser, er) {
+  closeText(parser)
+  if (parser.trackPosition) {
+    er += "\nLine: "+parser.line+
+          "\nColumn: "+parser.column+
+          "\nChar: "+parser.c
+  }
+  er = new Error(er)
+  parser.error = er
+  emit(parser, "onerror", er)
+  return parser
+}
+
+function end (parser) {
+  if (!parser.closedRoot) strictFail(parser, "Unclosed root tag")
+  if (parser.state !== S.TEXT) error(parser, "Unexpected end")
+  closeText(parser)
+  parser.c = ""
+  parser.closed = true
+  emit(parser, "onend")
+  SAXParser.call(parser, parser.strict, parser.opt)
+  return parser
+}
+
+function strictFail (parser, message) {
+  if (typeof parser !== 'object' || !(parser instanceof SAXParser))
+    throw new Error('bad call to strictFail');
+  if (parser.strict) error(parser, message)
+}
+
+function newTag (parser) {
+  if (!parser.strict) parser.tagName = parser.tagName[parser.looseCase]()
+  var parent = parser.tags[parser.tags.length - 1] || parser
+    , tag = parser.tag = { name : parser.tagName, attributes : {} }
+
+  // will be overridden if tag contails an xmlns="foo" or xmlns:foo="bar"
+  if (parser.opt.xmlns) tag.ns = parent.ns
+  parser.attribList.length = 0
+}
+
+function qname (name) {
+  var i = name.indexOf(":")
+    , qualName = i < 0 ? [ "", name ] : name.split(":")
+    , prefix = qualName[0]
+    , local = qualName[1]
+
+  // <x "xmlns"="http://foo">
+  if (name === "xmlns") {
+    prefix = "xmlns"
+    local = ""
+  }
+
+  return { prefix: prefix, local: local }
+}
+
+function attrib (parser) {
+  if (!parser.strict) parser.attribName = parser.attribName[parser.looseCase]()
+
+  if (parser.attribList.indexOf(parser.attribName) !== -1 ||
+      parser.tag.attributes.hasOwnProperty(parser.attribName)) {
+    return parser.attribName = parser.attribValue = ""
+  }
+
+  if (parser.opt.xmlns) {
+    var qn = qname(parser.attribName)
+      , prefix = qn.prefix
+      , local = qn.local
+
+    if (prefix === "xmlns") {
+      // namespace binding attribute; push the binding into scope
+      if (local === "xml" && parser.attribValue !== XML_NAMESPACE) {
+        strictFail( parser
+                  , "xml: prefix must be bound to " + XML_NAMESPACE + "\n"
+                  + "Actual: " + parser.attribValue )
+      } else if (local === "xmlns" && parser.attribValue !== XMLNS_NAMESPACE) {
+        strictFail( parser
+                  , "xmlns: prefix must be bound to " + XMLNS_NAMESPACE + "\n"
+                  + "Actual: " + parser.attribValue )
+      } else {
+        var tag = parser.tag
+          , parent = parser.tags[parser.tags.length - 1] || parser
+        if (tag.ns === parent.ns) {
+          tag.ns = Object.create(parent.ns)
+        }
+        tag.ns[local] = parser.attribValue
+      }
+    }
+
+    // defer onattribute events until all attributes have been seen
+    // so any new bindings can take effect; preserve attribute order
+    // so deferred events can be emitted in document order
+    parser.attribList.push([parser.attribName, parser.attribValue])
+  } else {
+    // in non-xmlns mode, we can emit the event right away
+    parser.tag.attributes[parser.attribName] = parser.attribValue
+    emitNode( parser
+            , "onattribute"
+            , { name: parser.attribName
+              , value: parser.attribValue } )
+  }
+
+  parser.attribName = parser.attribValue = ""
+}
+
+function openTag (parser, selfClosing) {
+  if (parser.opt.xmlns) {
+    // emit namespace binding events
+    var tag = parser.tag
+
+    // add namespace info to tag
+    var qn = qname(parser.tagName)
+    tag.prefix = qn.prefix
+    tag.local = qn.local
+    tag.uri = tag.ns[qn.prefix] || ""
+
+    if (tag.prefix && !tag.uri) {
+      strictFail(parser, "Unbound namespace prefix: "
+                       + JSON.stringify(parser.tagName))
+      tag.uri = qn.prefix
+    }
+
+    var parent = parser.tags[parser.tags.length - 1] || parser
+    if (tag.ns && parent.ns !== tag.ns) {
+      Object.keys(tag.ns).forEach(function (p) {
+        emitNode( parser
+                , "onopennamespace"
+                , { prefix: p , uri: tag.ns[p] } )
+      })
+    }
+
+    // handle deferred onattribute events
+    // Note: do not apply default ns to attributes:
+    //   http://www.w3.org/TR/REC-xml-names/#defaulting
+    for (var i = 0, l = parser.attribList.length; i < l; i ++) {
+      var nv = parser.attribList[i]
+      var name = nv[0]
+        , value = nv[1]
+        , qualName = qname(name)
+        , prefix = qualName.prefix
+        , local = qualName.local
+        , uri = prefix == "" ? "" : (tag.ns[prefix] || "")
+        , a = { name: name
+              , value: value
+              , prefix: prefix
+              , local: local
+              , uri: uri
+              }
+
+      // if there's any attributes with an undefined namespace,
+      // then fail on them now.
+      if (prefix && prefix != "xmlns" && !uri) {
+        strictFail(parser, "Unbound namespace prefix: "
+                         + JSON.stringify(prefix))
+        a.uri = prefix
+      }
+      parser.tag.attributes[name] = a
+      emitNode(parser, "onattribute", a)
+    }
+    parser.attribList.length = 0
+  }
+
+  parser.tag.isSelfClosing = !!selfClosing
+
+  // process the tag
+  parser.sawRoot = true
+  parser.tags.push(parser.tag)
+  emitNode(parser, "onopentag", parser.tag)
+  if (!selfClosing) {
+    // special case for <script> in non-strict mode.
+    if (!parser.noscript && parser.tagName.toLowerCase() === "script") {
+      parser.state = S.SCRIPT
+    } else {
+      parser.state = S.TEXT
+    }
+    parser.tag = null
+    parser.tagName = ""
+  }
+  parser.attribName = parser.attribValue = ""
+  parser.attribList.length = 0
+}
+
+function closeTag (parser) {
+  if (!parser.tagName) {
+    strictFail(parser, "Weird empty close tag.")
+    parser.textNode += "</>"
+    parser.state = S.TEXT
+    return
+  }
+
+  if (parser.script) {
+    if (parser.tagName !== "script") {
+      parser.script += "</" + parser.tagName + ">"
+      parser.tagName = ""
+      parser.state = S.SCRIPT
+      return
+    }
+    emitNode(parser, "onscript", parser.script)
+    parser.script = ""
+  }
+
+  // first make sure that the closing tag actually exists.
+  // <a><b></c></b></a> will close everything, otherwise.
+  var t = parser.tags.length
+  var tagName = parser.tagName
+  if (!parser.strict) tagName = tagName[parser.looseCase]()
+  var closeTo = tagName
+  while (t --) {
+    var close = parser.tags[t]
+    if (close.name !== closeTo) {
+      // fail the first time in strict mode
+      strictFail(parser, "Unexpected close tag")
+    } else break
+  }
+
+  // didn't find it.  we already failed for strict, so just abort.
+  if (t < 0) {
+    strictFail(parser, "Unmatched closing tag: "+parser.tagName)
+    parser.textNode += "</" + parser.tagName + ">"
+    parser.state = S.TEXT
+    return
+  }
+  parser.tagName = tagName
+  var s = parser.tags.length
+  while (s --> t) {
+    var tag = parser.tag = parser.tags.pop()
+    parser.tagName = parser.tag.name
+    emitNode(parser, "onclosetag", parser.tagName)
+
+    var x = {}
+    for (var i in tag.ns) x[i] = tag.ns[i]
+
+    var parent = parser.tags[parser.tags.length - 1] || parser
+    if (parser.opt.xmlns && tag.ns !== parent.ns) {
+      // remove namespace bindings introduced by tag
+      Object.keys(tag.ns).forEach(function (p) {
+        var n = tag.ns[p]
+        emitNode(parser, "onclosenamespace", { prefix: p, uri: n })
+      })
+    }
+  }
+  if (t === 0) parser.closedRoot = true
+  parser.tagName = parser.attribValue = parser.attribName = ""
+  parser.attribList.length = 0
+  parser.state = S.TEXT
+}
+
+function parseEntity (parser) {
+  var entity = parser.entity
+    , entityLC = entity.toLowerCase()
+    , num
+    , numStr = ""
+  if (parser.ENTITIES[entity])
+    return parser.ENTITIES[entity]
+  if (parser.ENTITIES[entityLC])
+    return parser.ENTITIES[entityLC]
+  entity = entityLC
+  if (entity.charAt(0) === "#") {
+    if (entity.charAt(1) === "x") {
+      entity = entity.slice(2)
+      num = parseInt(entity, 16)
+      numStr = num.toString(16)
+    } else {
+      entity = entity.slice(1)
+      num = parseInt(entity, 10)
+      numStr = num.toString(10)
+    }
+  }
+  entity = entity.replace(/^0+/, "")
+  if (numStr.toLowerCase() !== entity) {
+    strictFail(parser, "Invalid character entity")
+    return "&"+parser.entity + ";"
+  }
+  return String.fromCharCode(num)
+}
+
+function write (chunk) {
+  var parser = this
+  if (this.error) throw this.error
+  if (parser.closed) return error(parser,
+    "Cannot write after close. Assign an onready handler.")
+  if (chunk === null) return end(parser)
+  var i = 0, c = ""
+  while (parser.c = c = chunk.charAt(i++)) {
+    if (parser.trackPosition) {
+      parser.position ++
+      if (c === "\n") {
+        parser.line ++
+        parser.column = 0
+      } else parser.column ++
+    }
+    switch (parser.state) {
+
+      case S.BEGIN:
+        if (c === "<") {
+          parser.state = S.OPEN_WAKA
+          parser.startTagPosition = parser.position
+        } else if (not(whitespace,c)) {
+          // have to process this as a text node.
+          // weird, but happens.
+          strictFail(parser, "Non-whitespace before first tag.")
+          parser.textNode = c
+          parser.state = S.TEXT
+        }
+      continue
+
+      case S.TEXT:
+        if (parser.sawRoot && !parser.closedRoot) {
+          var starti = i-1
+          while (c && c!=="<" && c!=="&") {
+            c = chunk.charAt(i++)
+            if (c && parser.trackPosition) {
+              parser.position ++
+              if (c === "\n") {
+                parser.line ++
+                parser.column = 0
+              } else parser.column ++
+            }
+          }
+          parser.textNode += chunk.substring(starti, i-1)
+        }
+        if (c === "<") {
+          parser.state = S.OPEN_WAKA
+          parser.startTagPosition = parser.position
+        } else {
+          if (not(whitespace, c) && (!parser.sawRoot || parser.closedRoot))
+            strictFail(parser, "Text data outside of root node.")
+          if (c === "&") parser.state = S.TEXT_ENTITY
+          else parser.textNode += c
+        }
+      continue
+
+      case S.SCRIPT:
+        // only non-strict
+        if (c === "<") {
+          parser.state = S.SCRIPT_ENDING
+        } else parser.script += c
+      continue
+
+      case S.SCRIPT_ENDING:
+        if (c === "/") {
+          parser.state = S.CLOSE_TAG
+        } else {
+          parser.script += "<" + c
+          parser.state = S.SCRIPT
+        }
+      continue
+
+      case S.OPEN_WAKA:
+        // either a /, ?, !, or text is coming next.
+        if (c === "!") {
+          parser.state = S.SGML_DECL
+          parser.sgmlDecl = ""
+        } else if (is(whitespace, c)) {
+          // wait for it...
+        } else if (is(nameStart,c)) {
+          parser.state = S.OPEN_TAG
+          parser.tagName = c
+        } else if (c === "/") {
+          parser.state = S.CLOSE_TAG
+          parser.tagName = ""
+        } else if (c === "?") {
+          parser.state = S.PROC_INST
+          parser.procInstName = parser.procInstBody = ""
+        } else {
+          strictFail(parser, "Unencoded <")
+          // if there was some whitespace, then add that in.
+          if (parser.startTagPosition + 1 < parser.position) {
+            var pad = parser.position - parser.startTagPosition
+            c = new Array(pad).join(" ") + c
+          }
+          parser.textNode += "<" + c
+          parser.state = S.TEXT
+        }
+      continue
+
+      case S.SGML_DECL:
+        if ((parser.sgmlDecl+c).toUpperCase() === CDATA) {
+          emitNode(parser, "onopencdata")
+          parser.state = S.CDATA
+          parser.sgmlDecl = ""
+          parser.cdata = ""
+        } else if (parser.sgmlDecl+c === "--") {
+          parser.state = S.COMMENT
+          parser.comment = ""
+          parser.sgmlDecl = ""
+        } else if ((parser.sgmlDecl+c).toUpperCase() === DOCTYPE) {
+          parser.state = S.DOCTYPE
+          if (parser.doctype || parser.sawRoot) strictFail(parser,
+            "Inappropriately located doctype declaration")
+          parser.doctype = ""
+          parser.sgmlDecl = ""
+        } else if (c === ">") {
+          emitNode(parser, "onsgmldeclaration", parser.sgmlDecl)
+          parser.sgmlDecl = ""
+          parser.state = S.TEXT
+        } else if (is(quote, c)) {
+          parser.state = S.SGML_DECL_QUOTED
+          parser.sgmlDecl += c
+        } else parser.sgmlDecl += c
+      continue
+
+      case S.SGML_DECL_QUOTED:
+        if (c === parser.q) {
+          parser.state = S.SGML_DECL
+          parser.q = ""
+        }
+        parser.sgmlDecl += c
+      continue
+
+      case S.DOCTYPE:
+        if (c === ">") {
+          parser.state = S.TEXT
+          emitNode(parser, "ondoctype", parser.doctype)
+          parser.doctype = true // just remember that we saw it.
+        } else {
+          parser.doctype += c
+          if (c === "[") parser.state = S.DOCTYPE_DTD
+          else if (is(quote, c)) {
+            parser.state = S.DOCTYPE_QUOTED
+            parser.q = c
+          }
+        }
+      continue
+
+      case S.DOCTYPE_QUOTED:
+        parser.doctype += c
+        if (c === parser.q) {
+          parser.q = ""
+          parser.state = S.DOCTYPE
+        }
+      continue
+
+      case S.DOCTYPE_DTD:
+        parser.doctype += c
+        if (c === "]") parser.state = S.DOCTYPE
+        else if (is(quote,c)) {
+          parser.state = S.DOCTYPE_DTD_QUOTED
+          parser.q = c
+        }
+      continue
+
+      case S.DOCTYPE_DTD_QUOTED:
+        parser.doctype += c
+        if (c === parser.q) {
+          parser.state = S.DOCTYPE_DTD
+          parser.q = ""
+        }
+      continue
+
+      case S.COMMENT:
+        if (c === "-") parser.state = S.COMMENT_ENDING
+        else parser.comment += c
+      continue
+
+      case S.COMMENT_ENDING:
+        if (c === "-") {
+          parser.state = S.COMMENT_ENDED
+          parser.comment = textopts(parser.opt, parser.comment)
+          if (parser.comment) emitNode(parser, "oncomment", parser.comment)
+          parser.comment = ""
+        } else {
+          parser.comment += "-" + c
+          parser.state = S.COMMENT
+        }
+      continue
+
+      case S.COMMENT_ENDED:
+        if (c !== ">") {
+          strictFail(parser, "Malformed comment")
+          // allow <!-- blah -- bloo --> in non-strict mode,
+          // which is a comment of " blah -- bloo "
+          parser.comment += "--" + c
+          parser.state = S.COMMENT
+        } else parser.state = S.TEXT
+      continue
+
+      case S.CDATA:
+        if (c === "]") parser.state = S.CDATA_ENDING
+        else parser.cdata += c
+      continue
+
+      case S.CDATA_ENDING:
+        if (c === "]") parser.state = S.CDATA_ENDING_2
+        else {
+          parser.cdata += "]" + c
+          parser.state = S.CDATA
+        }
+      continue
+
+      case S.CDATA_ENDING_2:
+        if (c === ">") {
+          if (parser.cdata) emitNode(parser, "oncdata", parser.cdata)
+          emitNode(parser, "onclosecdata")
+          parser.cdata = ""
+          parser.state = S.TEXT
+        } else if (c === "]") {
+          parser.cdata += "]"
+        } else {
+          parser.cdata += "]]" + c
+          parser.state = S.CDATA
+        }
+      continue
+
+      case S.PROC_INST:
+        if (c === "?") parser.state = S.PROC_INST_ENDING
+        else if (is(whitespace, c)) parser.state = S.PROC_INST_BODY
+        else parser.procInstName += c
+      continue
+
+      case S.PROC_INST_BODY:
+        if (!parser.procInstBody && is(whitespace, c)) continue
+        else if (c === "?") parser.state = S.PROC_INST_ENDING
+        else parser.procInstBody += c
+      continue
+
+      case S.PROC_INST_ENDING:
+        if (c === ">") {
+          emitNode(parser, "onprocessinginstruction", {
+            name : parser.procInstName,
+            body : parser.procInstBody
+          })
+          parser.procInstName = parser.procInstBody = ""
+          parser.state = S.TEXT
+        } else {
+          parser.procInstBody += "?" + c
+          parser.state = S.PROC_INST_BODY
+        }
+      continue
+
+      case S.OPEN_TAG:
+        if (is(nameBody, c)) parser.tagName += c
+        else {
+          newTag(parser)
+          if (c === ">") openTag(parser)
+          else if (c === "/") parser.state = S.OPEN_TAG_SLASH
+          else {
+            if (not(whitespace, c)) strictFail(
+              parser, "Invalid character in tag name")
+            parser.state = S.ATTRIB
+          }
+        }
+      continue
+
+      case S.OPEN_TAG_SLASH:
+        if (c === ">") {
+          openTag(parser, true)
+          closeTag(parser)
+        } else {
+          strictFail(parser, "Forward-slash in opening tag not followed by >")
+          parser.state = S.ATTRIB
+        }
+      continue
+
+      case S.ATTRIB:
+        // haven't read the attribute name yet.
+        if (is(whitespace, c)) continue
+        else if (c === ">") openTag(parser)
+        else if (c === "/") parser.state = S.OPEN_TAG_SLASH
+        else if (is(nameStart, c)) {
+          parser.attribName = c
+          parser.attribValue = ""
+          parser.state = S.ATTRIB_NAME
+        } else strictFail(parser, "Invalid attribute name")
+      continue
+
+      case S.ATTRIB_NAME:
+        if (c === "=") parser.state = S.ATTRIB_VALUE
+        else if (c === ">") {
+          strictFail(parser, "Attribute without value")
+          parser.attribValue = parser.attribName
+          attrib(parser)
+          openTag(parser)
+        }
+        else if (is(whitespace, c)) parser.state = S.ATTRIB_NAME_SAW_WHITE
+        else if (is(nameBody, c)) parser.attribName += c
+        else strictFail(parser, "Invalid attribute name")
+      continue
+
+      case S.ATTRIB_NAME_SAW_WHITE:
+        if (c === "=") parser.state = S.ATTRIB_VALUE
+        else if (is(whitespace, c)) continue
+        else {
+          strictFail(parser, "Attribute without value")
+          parser.tag.attributes[parser.attribName] = ""
+          parser.attribValue = ""
+          emitNode(parser, "onattribute",
+                   { name : parser.attribName, value : "" })
+          parser.attribName = ""
+          if (c === ">") openTag(parser)
+          else if (is(nameStart, c)) {
+            parser.attribName = c
+            parser.state = S.ATTRIB_NAME
+          } else {
+            strictFail(parser, "Invalid attribute name")
+            parser.state = S.ATTRIB
+          }
+        }
+      continue
+
+      case S.ATTRIB_VALUE:
+        if (is(whitespace, c)) continue
+        else if (is(quote, c)) {
+          parser.q = c
+          parser.state = S.ATTRIB_VALUE_QUOTED
+        } else {
+          strictFail(parser, "Unquoted attribute value")
+          parser.state = S.ATTRIB_VALUE_UNQUOTED
+          parser.attribValue = c
+        }
+      continue
+
+      case S.ATTRIB_VALUE_QUOTED:
+        if (c !== parser.q) {
+          if (c === "&") parser.state = S.ATTRIB_VALUE_ENTITY_Q
+          else parser.attribValue += c
+          continue
+        }
+        attrib(parser)
+        parser.q = ""
+        parser.state = S.ATTRIB
+      continue
+
+      case S.ATTRIB_VALUE_UNQUOTED:
+        if (not(attribEnd,c)) {
+          if (c === "&") parser.state = S.ATTRIB_VALUE_ENTITY_U
+          else parser.attribValue += c
+          continue
+        }
+        attrib(parser)
+        if (c === ">") openTag(parser)
+        else parser.state = S.ATTRIB
+      continue
+
+      case S.CLOSE_TAG:
+        if (!parser.tagName) {
+          if (is(whitespace, c)) continue
+          else if (not(nameStart, c)) {
+            if (parser.script) {
+              parser.script += "</" + c
+              parser.state = S.SCRIPT
+            } else {
+              strictFail(parser, "Invalid tagname in closing tag.")
+            }
+          } else parser.tagName = c
+        }
+        else if (c === ">") closeTag(parser)
+        else if (is(nameBody, c)) parser.tagName += c
+        else if (parser.script) {
+          parser.script += "</" + parser.tagName
+          parser.tagName = ""
+          parser.state = S.SCRIPT
+        } else {
+          if (not(whitespace, c)) strictFail(parser,
+            "Invalid tagname in closing tag")
+          parser.state = S.CLOSE_TAG_SAW_WHITE
+        }
+      continue
+
+      case S.CLOSE_TAG_SAW_WHITE:
+        if (is(whitespace, c)) continue
+        if (c === ">") closeTag(parser)
+        else strictFail(parser, "Invalid characters in closing tag")
+      continue
+
+      case S.TEXT_ENTITY:
+      case S.ATTRIB_VALUE_ENTITY_Q:
+      case S.ATTRIB_VALUE_ENTITY_U:
+        switch(parser.state) {
+          case S.TEXT_ENTITY:
+            var returnState = S.TEXT, buffer = "textNode"
+          break
+
+          case S.ATTRIB_VALUE_ENTITY_Q:
+            var returnState = S.ATTRIB_VALUE_QUOTED, buffer = "attribValue"
+          break
+
+          case S.ATTRIB_VALUE_ENTITY_U:
+            var returnState = S.ATTRIB_VALUE_UNQUOTED, buffer = "attribValue"
+          break
+        }
+        if (c === ";") {
+          parser[buffer] += parseEntity(parser)
+          parser.entity = ""
+          parser.state = returnState
+        }
+        else if (is(entity, c)) parser.entity += c
+        else {
+          strictFail(parser, "Invalid character entity")
+          parser[buffer] += "&" + parser.entity + c
+          parser.entity = ""
+          parser.state = returnState
+        }
+      continue
+
+      default:
+        throw new Error(parser, "Unknown state: " + parser.state)
+    }
+  } // while
+  // cdata blocks can get very big under normal conditions. emit and move on.
+  // if (parser.state === S.CDATA && parser.cdata) {
+  //   emitNode(parser, "oncdata", parser.cdata)
+  //   parser.cdata = ""
+  // }
+  if (parser.position >= parser.bufferCheckPosition) checkBufferLength(parser)
+  return parser
+}
+
+})(typeof exports === "undefined" ? sax = {} : exports)
diff --git a/node_modules/xml2js/node_modules/sax/package.json b/node_modules/xml2js/node_modules/sax/package.json
new file mode 100644
index 0000000..28fb639
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/package.json
@@ -0,0 +1,68 @@
+{
+  "name": "sax",
+  "description": "An evented streaming XML parser in JavaScript",
+  "author": {
+    "name": "Isaac Z. Schlueter",
+    "email": "i@izs.me",
+    "url": "http://blog.izs.me/"
+  },
+  "version": "0.5.4",
+  "main": "lib/sax.js",
+  "license": "BSD",
+  "scripts": {
+    "test": "node test/index.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/isaacs/sax-js.git"
+  },
+  "contributors": [
+    {
+      "name": "Isaac Z. Schlueter",
+      "email": "i@izs.me"
+    },
+    {
+      "name": "Stein Martin Hustad",
+      "email": "stein@hustad.com"
+    },
+    {
+      "name": "Mikeal Rogers",
+      "email": "mikeal.rogers@gmail.com"
+    },
+    {
+      "name": "Laurie Harper",
+      "email": "laurie@holoweb.net"
+    },
+    {
+      "name": "Jann Horn",
+      "email": "jann@Jann-PC.fritz.box"
+    },
+    {
+      "name": "Elijah Insua",
+      "email": "tmpvar@gmail.com"
+    },
+    {
+      "name": "Henry Rawas",
+      "email": "henryr@schakra.com"
+    },
+    {
+      "name": "Justin Makeig",
+      "email": "jmpublic@makeig.com"
+    },
+    {
+      "name": "Mike Schilling",
+      "email": "mike@emotive.com"
+    }
+  ],
+  "readme": "# sax js\n\nA sax-style parser for XML and HTML.\n\nDesigned with [node](http://nodejs.org/) in mind, but should work fine in\nthe browser or other CommonJS implementations.\n\n## What This Is\n\n* A very simple tool to parse through an XML string.\n* A stepping stone to a streaming HTML parser.\n* A handy way to deal with RSS and other mostly-ok-but-kinda-broken XML \n  docs.\n\n## What This Is (probably) Not\n\n* An HTML Parser - That's a fine goal, but this isn't it.  It's just\n  XML.\n* A DOM Builder - You can use it to build an object model out of XML,\n  but it doesn't do that out of the box.\n* XSLT - No DOM = no querying.\n* 100% Compliant with (some other SAX implementation) - Most SAX\n  implementations are in Java and do a lot more than this does.\n* An XML Validator - It does a little validation when in strict mode, but\n  not much.\n* A Schema-Aware XSD Thing - Schemas are an exercise in fetishistic \n  masochism.\n* A DTD-aware Thing - Fetching DTDs is a much bigger job.\n\n## Regarding `<!DOCTYPE`s and `<!ENTITY`s\n\nThe parser will handle the basic XML entities in text nodes and attribute\nvalues: `&amp; &lt; &gt; &apos; &quot;`. It's possible to define additional\nentities in XML by putting them in the DTD. This parser doesn't do anything\nwith that. If you want to listen to the `ondoctype` event, and then fetch\nthe doctypes, and read the entities and add them to `parser.ENTITIES`, then\nbe my guest.\n\nUnknown entities will fail in strict mode, and in loose mode, will pass\nthrough unmolested.\n\n## Usage\n\n    var sax = require(\"./lib/sax\"),\n      strict = true, // set to false for html-mode\n      parser = sax.parser(strict);\n\n    parser.onerror = function (e) {\n      // an error happened.\n    };\n    parser.ontext = function (t) {\n      // got some text.  t is the string of text.\n    };\n    parser.onopentag = function (node) {\n      // opened a tag.  node has \"name\" and \"attributes\"\n    };\n    parser.onattribute = function (attr) {\n      // an attribute.  attr has \"name\" and \"value\"\n    };\n    parser.onend = function () {\n      // parser stream is done, and ready to have more stuff written to it.\n    };\n\n    parser.write('<xml>Hello, <who name=\"world\">world</who>!</xml>').close();\n\n    // stream usage\n    // takes the same options as the parser\n    var saxStream = require(\"sax\").createStream(strict, options)\n    saxStream.on(\"error\", function (e) {\n      // unhandled errors will throw, since this is a proper node\n      // event emitter.\n      console.error(\"error!\", e)\n      // clear the error\n      this._parser.error = null\n      this._parser.resume()\n    })\n    saxStream.on(\"opentag\", function (node) {\n      // same object as above\n    })\n    // pipe is supported, and it's readable/writable\n    // same chunks coming in also go out.\n    fs.createReadStream(\"file.xml\")\n      .pipe(saxStream)\n      .pipe(fs.createWriteStream(\"file-copy.xml\"))\n\n\n\n## Arguments\n\nPass the following arguments to the parser function.  All are optional.\n\n`strict` - Boolean. Whether or not to be a jerk. Default: `false`.\n\n`opt` - Object bag of settings regarding string formatting.  All default to `false`.\n\nSettings supported:\n\n* `trim` - Boolean. Whether or not to trim text and comment nodes.\n* `normalize` - Boolean. If true, then turn any whitespace into a single\n  space.\n* `lowercase` - Boolean. If true, then lowercase tag names and attribute names\n  in loose mode, rather than uppercasing them.\n* `xmlns` - Boolean. If true, then namespaces are supported.\n* `position` - Boolean. If false, then don't track line/col/position.\n\n## Methods\n\n`write` - Write bytes onto the stream. You don't have to do this all at\nonce. You can keep writing as much as you want.\n\n`close` - Close the stream. Once closed, no more data may be written until\nit is done processing the buffer, which is signaled by the `end` event.\n\n`resume` - To gracefully handle errors, assign a listener to the `error`\nevent. Then, when the error is taken care of, you can call `resume` to\ncontinue parsing. Otherwise, the parser will not continue while in an error\nstate.\n\n## Members\n\nAt all times, the parser object will have the following members:\n\n`line`, `column`, `position` - Indications of the position in the XML\ndocument where the parser currently is looking.\n\n`startTagPosition` - Indicates the position where the current tag starts.\n\n`closed` - Boolean indicating whether or not the parser can be written to.\nIf it's `true`, then wait for the `ready` event to write again.\n\n`strict` - Boolean indicating whether or not the parser is a jerk.\n\n`opt` - Any options passed into the constructor.\n\n`tag` - The current tag being dealt with.\n\nAnd a bunch of other stuff that you probably shouldn't touch.\n\n## Events\n\nAll events emit with a single argument. To listen to an event, assign a\nfunction to `on<eventname>`. Functions get executed in the this-context of\nthe parser object. The list of supported events are also in the exported\n`EVENTS` array.\n\nWhen using the stream interface, assign handlers using the EventEmitter\n`on` function in the normal fashion.\n\n`error` - Indication that something bad happened. The error will be hanging\nout on `parser.error`, and must be deleted before parsing can continue. By\nlistening to this event, you can keep an eye on that kind of stuff. Note:\nthis happens *much* more in strict mode. Argument: instance of `Error`.\n\n`text` - Text node. Argument: string of text.\n\n`doctype` - The `<!DOCTYPE` declaration. Argument: doctype string.\n\n`processinginstruction` - Stuff like `<?xml foo=\"blerg\" ?>`. Argument:\nobject with `name` and `body` members. Attributes are not parsed, as\nprocessing instructions have implementation dependent semantics.\n\n`sgmldeclaration` - Random SGML declarations. Stuff like `<!ENTITY p>`\nwould trigger this kind of event. This is a weird thing to support, so it\nmight go away at some point. SAX isn't intended to be used to parse SGML,\nafter all.\n\n`opentag` - An opening tag. Argument: object with `name` and `attributes`.\nIn non-strict mode, tag names are uppercased, unless the `lowercase`\noption is set.  If the `xmlns` option is set, then it will contain\nnamespace binding information on the `ns` member, and will have a\n`local`, `prefix`, and `uri` member.\n\n`closetag` - A closing tag. In loose mode, tags are auto-closed if their\nparent closes. In strict mode, well-formedness is enforced. Note that\nself-closing tags will have `closeTag` emitted immediately after `openTag`.\nArgument: tag name.\n\n`attribute` - An attribute node.  Argument: object with `name` and `value`.\nIn non-strict mode, attribute names are uppercased, unless the `lowercase`\noption is set.  If the `xmlns` option is set, it will also contains namespace\ninformation.\n\n`comment` - A comment node.  Argument: the string of the comment.\n\n`opencdata` - The opening tag of a `<![CDATA[` block.\n\n`cdata` - The text of a `<![CDATA[` block. Since `<![CDATA[` blocks can get\nquite large, this event may fire multiple times for a single block, if it\nis broken up into multiple `write()`s. Argument: the string of random\ncharacter data.\n\n`closecdata` - The closing tag (`]]>`) of a `<![CDATA[` block.\n\n`opennamespace` - If the `xmlns` option is set, then this event will\nsignal the start of a new namespace binding.\n\n`closenamespace` - If the `xmlns` option is set, then this event will\nsignal the end of a namespace binding.\n\n`end` - Indication that the closed stream has ended.\n\n`ready` - Indication that the stream has reset, and is ready to be written\nto.\n\n`noscript` - In non-strict mode, `<script>` tags trigger a `\"script\"`\nevent, and their contents are not checked for special xml characters.\nIf you pass `noscript: true`, then this behavior is suppressed.\n\n## Reporting Problems\n\nIt's best to write a failing test if you find an issue.  I will always\naccept pull requests with failing tests if they demonstrate intended\nbehavior, but it is very hard to figure out what issue you're describing\nwithout a test.  Writing a test is also the best way for you yourself\nto figure out if you really understand the issue you think you have with\nsax-js.\n",
+  "readmeFilename": "README.md",
+  "bugs": {
+    "url": "https://github.com/isaacs/sax-js/issues"
+  },
+  "_id": "sax@0.5.4",
+  "dist": {
+    "shasum": "d56bc84b3d708726c8c66369022759d4781aafce"
+  },
+  "_from": "sax@0.5.x",
+  "_resolved": "https://registry.npmjs.org/sax/-/sax-0.5.4.tgz"
+}
diff --git a/node_modules/xml2js/node_modules/sax/test/attribute-name.js b/node_modules/xml2js/node_modules/sax/test/attribute-name.js
new file mode 100644
index 0000000..9ebbe58
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/attribute-name.js
@@ -0,0 +1,33 @@
+require(__dirname).test(
+  { xml: "<root length='12345'></root>"
+  , expect: [
+    ["attribute", {
+      name: "length"
+    , value: "12345"
+    , prefix: ""
+    , local: "length"
+    , uri: ""
+    }]
+  , ["opentag", {
+      name: "root"
+    , prefix: ""
+    , local: "root"
+    , uri: ""
+    , attributes: {
+      length: {
+        name: "length"
+      , value: "12345"
+      , prefix: ""
+      , local: "length"
+      , uri: ""
+      }
+    }
+    , ns: {}
+    , isSelfClosing: false
+    }]
+  , ["closetag", "root"]
+  ]
+  , strict: true
+  , opt: { xmlns: true }
+  }
+)
diff --git a/node_modules/xml2js/node_modules/sax/test/buffer-overrun.js b/node_modules/xml2js/node_modules/sax/test/buffer-overrun.js
new file mode 100644
index 0000000..57d3c41
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/buffer-overrun.js
@@ -0,0 +1,26 @@
+// set this really low so that I don't have to put 64 MB of xml in here.
+var sax = require("../lib/sax")
+var bl = sax.MAX_BUFFER_LENGTH
+sax.MAX_BUFFER_LENGTH = 5;
+
+require(__dirname).test({
+  expect : [
+    ["error", "Max buffer length exceeded: tagName\nLine: 0\nColumn: 15\nChar: "],
+    ["error", "Max buffer length exceeded: tagName\nLine: 0\nColumn: 30\nChar: "],
+    ["error", "Max buffer length exceeded: tagName\nLine: 0\nColumn: 45\nChar: "],
+    ["opentag", {
+     "name": "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ",
+     "attributes": {},
+     "isSelfClosing": false
+    }],
+    ["text", "yo"],
+    ["closetag", "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ"]
+  ]
+}).write("<abcdefghijklmn")
+  .write("opqrstuvwxyzABC")
+  .write("DEFGHIJKLMNOPQR")
+  .write("STUVWXYZ>")
+  .write("yo")
+  .write("</abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ>")
+  .close();
+sax.MAX_BUFFER_LENGTH = bl
diff --git a/node_modules/xml2js/node_modules/sax/test/case.js b/node_modules/xml2js/node_modules/sax/test/case.js
new file mode 100644
index 0000000..9da78ab
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/case.js
@@ -0,0 +1,50 @@
+// default to uppercase
+require(__dirname).test
+  ( { xml :
+      "<span class=\"test\" hello=\"world\"></span>"
+    , expect :
+      [ [ "attribute", { name: "CLASS", value: "test" } ]
+      , [ "attribute", { name: "HELLO", value: "world" } ]
+      , [ "opentag", { name: "SPAN",
+                       attributes: { CLASS: "test", HELLO: "world" },
+                       isSelfClosing: false } ]
+      , [ "closetag", "SPAN" ]
+      ]
+    , strict : false
+    , opt : {}
+    }
+  )
+
+// lowercase option : lowercase tag/attribute names
+require(__dirname).test
+  ( { xml :
+      "<span class=\"test\" hello=\"world\"></span>"
+    , expect :
+      [ [ "attribute", { name: "class", value: "test" } ]
+      , [ "attribute", { name: "hello", value: "world" } ]
+      , [ "opentag", { name: "span",
+                       attributes: { class: "test", hello: "world" },
+                       isSelfClosing: false } ]
+      , [ "closetag", "span" ]
+      ]
+    , strict : false
+    , opt : {lowercase:true}
+    }
+  )
+
+// backward compatibility with old lowercasetags opt
+require(__dirname).test
+  ( { xml :
+      "<span class=\"test\" hello=\"world\"></span>"
+    , expect :
+      [ [ "attribute", { name: "class", value: "test" } ]
+      , [ "attribute", { name: "hello", value: "world" } ]
+      , [ "opentag", { name: "span",
+                       attributes: { class: "test", hello: "world" },
+                       isSelfClosing: false } ]
+      , [ "closetag", "span" ]
+      ]
+    , strict : false
+    , opt : {lowercasetags:true}
+    }
+  )
diff --git a/node_modules/xml2js/node_modules/sax/test/cdata-chunked.js b/node_modules/xml2js/node_modules/sax/test/cdata-chunked.js
new file mode 100644
index 0000000..e3362bc
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/cdata-chunked.js
@@ -0,0 +1,11 @@
+
+require(__dirname).test({
+  expect : [
+    ["opentag", {"name": "R","attributes": {}, "isSelfClosing": false}],
+    ["opencdata", undefined],
+    ["cdata", " this is character data  "],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+}).write("<r><![CDATA[ this is ").write("character data  ").write("]]></r>").close();
+
diff --git a/node_modules/xml2js/node_modules/sax/test/cdata-end-split.js b/node_modules/xml2js/node_modules/sax/test/cdata-end-split.js
new file mode 100644
index 0000000..34f3450
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/cdata-end-split.js
@@ -0,0 +1,15 @@
+
+require(__dirname).test({
+  expect : [
+    ["opentag", {"name": "R","attributes": {}, "isSelfClosing": false}],
+    ["opencdata", undefined],
+    ["cdata", " this is "],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+})
+  .write("<r><![CDATA[ this is ]")
+  .write("]>")
+  .write("</r>")
+  .close();
+
diff --git a/node_modules/xml2js/node_modules/sax/test/cdata-fake-end.js b/node_modules/xml2js/node_modules/sax/test/cdata-fake-end.js
new file mode 100644
index 0000000..ccafa1b
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/cdata-fake-end.js
@@ -0,0 +1,28 @@
+
+var p = require(__dirname).test({
+  expect : [
+    ["opentag", {"name": "R","attributes": {}, "isSelfClosing": false}],
+    ["opencdata", undefined],
+    ["cdata", "[[[[[[[[]]]]]]]]"],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+})
+var x = "<r><![CDATA[[[[[[[[[]]]]]]]]]]></r>"
+for (var i = 0; i < x.length ; i ++) {
+  p.write(x.charAt(i))
+}
+p.close();
+
+
+var p2 = require(__dirname).test({
+  expect : [
+    ["opentag", {"name": "R","attributes": {}, "isSelfClosing": false}],
+    ["opencdata", undefined],
+    ["cdata", "[[[[[[[[]]]]]]]]"],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+})
+var x = "<r><![CDATA[[[[[[[[[]]]]]]]]]]></r>"
+p2.write(x).close();
diff --git a/node_modules/xml2js/node_modules/sax/test/cdata-multiple.js b/node_modules/xml2js/node_modules/sax/test/cdata-multiple.js
new file mode 100644
index 0000000..8e2f911
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/cdata-multiple.js
@@ -0,0 +1,15 @@
+
+require(__dirname).test({
+  expect : [
+    ["opentag", {"name": "R","attributes": {}, "isSelfClosing": false}],
+    ["opencdata", undefined],
+    ["cdata", " this is "],
+    ["closecdata", undefined],
+    ["opencdata", undefined],
+    ["cdata", "character data  "],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+}).write("<r><![CDATA[ this is ]]>").write("<![CDA").write("T").write("A[")
+  .write("character data  ").write("]]></r>").close();
+
diff --git a/node_modules/xml2js/node_modules/sax/test/cdata.js b/node_modules/xml2js/node_modules/sax/test/cdata.js
new file mode 100644
index 0000000..31a8a30
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/cdata.js
@@ -0,0 +1,10 @@
+require(__dirname).test({
+  xml : "<r><![CDATA[ this is character data  ]]></r>",
+  expect : [
+    ["opentag", {"name": "R","attributes": {}, "isSelfClosing": false}],
+    ["opencdata", undefined],
+    ["cdata", " this is character data  "],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+});
diff --git a/node_modules/xml2js/node_modules/sax/test/cyrillic.js b/node_modules/xml2js/node_modules/sax/test/cyrillic.js
new file mode 100644
index 0000000..f05dd1b
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/cyrillic.js
@@ -0,0 +1,8 @@
+require(__dirname).test({
+  xml: '<Р>тест</Р>',
+  expect: [
+    ['opentag', {'name':'Р', attributes:{}, isSelfClosing: false}],
+    ['text', 'тест'],
+    ['closetag', 'Р']
+  ]
+});
diff --git a/node_modules/xml2js/node_modules/sax/test/duplicate-attribute.js b/node_modules/xml2js/node_modules/sax/test/duplicate-attribute.js
new file mode 100644
index 0000000..a21eb41
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/duplicate-attribute.js
@@ -0,0 +1,13 @@
+require(__dirname).test
+  ( { xml :
+      "<span id=\"hello\" id=\"there\"></span>"
+    , expect :
+      [ [ "attribute", { name: "ID", value: "hello" } ]
+      , [ "opentag", { name: "SPAN",
+                       attributes: { ID: "hello" }, isSelfClosing: false } ]
+      , [ "closetag", "SPAN" ]
+      ]
+    , strict : false
+    , opt : {}
+    }
+  )
diff --git a/node_modules/xml2js/node_modules/sax/test/entities.js b/node_modules/xml2js/node_modules/sax/test/entities.js
new file mode 100644
index 0000000..4901667
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/entities.js
@@ -0,0 +1,10 @@
+require(__dirname).test({
+  xml: '<r>&rfloor; ' +
+       '&spades; &copy; &rarr; &amp; ' +
+        '&lt; < <  <   < &gt; &real; &weierp; &euro;</r>',
+  expect: [
+    ['opentag', {'name':'R', attributes:{}, isSelfClosing: false}],
+    ['text', '⌋ ♠ © → & < < <  <   < > ℜ ℘ €'],
+    ['closetag', 'R']
+  ]
+});
diff --git a/node_modules/xml2js/node_modules/sax/test/entity-mega.js b/node_modules/xml2js/node_modules/sax/test/entity-mega.js
new file mode 100644
index 0000000..4759a02
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/entity-mega.js
@@ -0,0 +1,16 @@
+var sax = require('../');
+var xml = '<r>';
+var text = '';
+for (var i in sax.ENTITIES) {
+  xml += '&' + i + ';'
+  text += sax.ENTITIES[i]
+}
+xml += '</r>'
+require(__dirname).test({
+  xml: xml,
+  expect: [
+    ['opentag', {'name':'R', attributes:{}, isSelfClosing: false}],
+    ['text', text],
+    ['closetag', 'R']
+  ]
+});
diff --git a/node_modules/xml2js/node_modules/sax/test/index.js b/node_modules/xml2js/node_modules/sax/test/index.js
new file mode 100644
index 0000000..d4e1ef4
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/index.js
@@ -0,0 +1,86 @@
+var globalsBefore = JSON.stringify(Object.keys(global))
+  , util = require("util")
+  , assert = require("assert")
+  , fs = require("fs")
+  , path = require("path")
+  , sax = require("../lib/sax")
+
+exports.sax = sax
+
+// handy way to do simple unit tests
+// if the options contains an xml string, it'll be written and the parser closed.
+// otherwise, it's assumed that the test will write and close.
+exports.test = function test (options) {
+  var xml = options.xml
+    , parser = sax.parser(options.strict, options.opt)
+    , expect = options.expect
+    , e = 0
+  sax.EVENTS.forEach(function (ev) {
+    parser["on" + ev] = function (n) {
+      if (process.env.DEBUG) {
+        console.error({ expect: expect[e]
+                      , actual: [ev, n] })
+      }
+      if (e >= expect.length && (ev === "end" || ev === "ready")) return
+      assert.ok( e < expect.length,
+        "expectation #"+e+" "+util.inspect(expect[e])+"\n"+
+        "Unexpected event: "+ev+" "+(n ? util.inspect(n) : ""))
+      var inspected = n instanceof Error ? "\n"+ n.message : util.inspect(n)
+      assert.equal(ev, expect[e][0],
+        "expectation #"+e+"\n"+
+        "Didn't get expected event\n"+
+        "expect: "+expect[e][0] + " " +util.inspect(expect[e][1])+"\n"+
+        "actual: "+ev+" "+inspected+"\n")
+      if (ev === "error") assert.equal(n.message, expect[e][1])
+      else assert.deepEqual(n, expect[e][1],
+        "expectation #"+e+"\n"+
+        "Didn't get expected argument\n"+
+        "expect: "+expect[e][0] + " " +util.inspect(expect[e][1])+"\n"+
+        "actual: "+ev+" "+inspected+"\n")
+      e++
+      if (ev === "error") parser.resume()
+    }
+  })
+  if (xml) parser.write(xml).close()
+  return parser
+}
+
+if (module === require.main) {
+  var running = true
+    , failures = 0
+
+  function fail (file, er) {
+    util.error("Failed: "+file)
+    util.error(er.stack || er.message)
+    failures ++
+  }
+
+  fs.readdir(__dirname, function (error, files) {
+    files = files.filter(function (file) {
+      return (/\.js$/.exec(file) && file !== 'index.js')
+    })
+    var n = files.length
+      , i = 0
+    console.log("0.." + n)
+    files.forEach(function (file) {
+      // run this test.
+      try {
+        require(path.resolve(__dirname, file))
+        var globalsAfter = JSON.stringify(Object.keys(global))
+        if (globalsAfter !== globalsBefore) {
+          var er = new Error("new globals introduced\n"+
+                             "expected: "+globalsBefore+"\n"+
+                             "actual:   "+globalsAfter)
+          globalsBefore = globalsAfter
+          throw er
+        }
+        console.log("ok " + (++i) + " - " + file)
+      } catch (er) {
+        console.log("not ok "+ (++i) + " - " + file)
+        fail(file, er)
+      }
+    })
+    if (!failures) return console.log("#all pass")
+    else return console.error(failures + " failure" + (failures > 1 ? "s" : ""))
+  })
+}
diff --git a/node_modules/xml2js/node_modules/sax/test/issue-23.js b/node_modules/xml2js/node_modules/sax/test/issue-23.js
new file mode 100644
index 0000000..ccbdc35
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/issue-23.js
@@ -0,0 +1,43 @@
+
+require(__dirname).test
+  ( { xml :
+      "<compileClassesResponse>"+
+        "<result>"+
+          "<bodyCrc>653724009</bodyCrc>"+
+          "<column>-1</column>"+
+          "<id>01pG0000002KoSUIA0</id>"+
+          "<line>-1</line>"+
+          "<name>CalendarController</name>"+
+          "<success>true</success>"+
+        "</result>"+
+      "</compileClassesResponse>"
+
+    , expect :
+      [ [ "opentag", { name: "COMPILECLASSESRESPONSE", attributes: {}, isSelfClosing: false } ]
+      , [ "opentag", { name : "RESULT", attributes: {}, isSelfClosing: false } ]
+      , [ "opentag", { name: "BODYCRC", attributes: {}, isSelfClosing: false } ]
+      , [ "text", "653724009" ]
+      , [ "closetag", "BODYCRC" ]
+      , [ "opentag", { name: "COLUMN", attributes: {}, isSelfClosing: false } ]
+      , [ "text", "-1" ]
+      , [ "closetag", "COLUMN" ]
+      , [ "opentag", { name: "ID", attributes: {}, isSelfClosing: false } ]
+      , [ "text", "01pG0000002KoSUIA0" ]
+      , [ "closetag", "ID" ]
+      , [ "opentag", {name: "LINE", attributes: {}, isSelfClosing: false } ]
+      , [ "text", "-1" ]
+      , [ "closetag", "LINE" ]
+      , [ "opentag", {name: "NAME", attributes: {}, isSelfClosing: false } ]
+      , [ "text", "CalendarController" ]
+      , [ "closetag", "NAME" ]
+      , [ "opentag", {name: "SUCCESS", attributes: {}, isSelfClosing: false } ]
+      , [ "text", "true" ]
+      , [ "closetag", "SUCCESS" ]
+      , [ "closetag", "RESULT" ]
+      , [ "closetag", "COMPILECLASSESRESPONSE" ]
+      ]
+    , strict : false
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xml2js/node_modules/sax/test/issue-30.js b/node_modules/xml2js/node_modules/sax/test/issue-30.js
new file mode 100644
index 0000000..771b14e
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/issue-30.js
@@ -0,0 +1,24 @@
+// https://github.com/isaacs/sax-js/issues/33
+require(__dirname).test
+  ( { xml : "<xml>\n"+
+            "<!-- \n"+
+            "  comment with a single dash- in it\n"+
+            "-->\n"+
+            "<data/>\n"+
+            "</xml>"
+
+    , expect :
+      [ [ "opentag", { name: "xml", attributes: {}, isSelfClosing: false } ]
+      , [ "text", "\n" ]
+      , [ "comment", " \n  comment with a single dash- in it\n" ]
+      , [ "text", "\n" ]
+      , [ "opentag", { name: "data", attributes: {}, isSelfClosing: true } ]
+      , [ "closetag", "data" ]
+      , [ "text", "\n" ]
+      , [ "closetag", "xml" ]
+      ]
+    , strict : true
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xml2js/node_modules/sax/test/issue-35.js b/node_modules/xml2js/node_modules/sax/test/issue-35.js
new file mode 100644
index 0000000..64d67b3
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/issue-35.js
@@ -0,0 +1,15 @@
+// https://github.com/isaacs/sax-js/issues/35
+require(__dirname).test
+  ( { xml : "<xml>&#Xd;&#X0d;\n"+
+            "</xml>"
+
+    , expect :
+      [ [ "opentag", { name: "xml", attributes: {}, isSelfClosing: false } ]
+      , [ "text", "\r\r\n" ]
+      , [ "closetag", "xml" ]
+      ]
+    , strict : true
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xml2js/node_modules/sax/test/issue-47.js b/node_modules/xml2js/node_modules/sax/test/issue-47.js
new file mode 100644
index 0000000..661584a
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/issue-47.js
@@ -0,0 +1,12 @@
+// https://github.com/isaacs/sax-js/issues/47
+require(__dirname).test
+  ( { xml : '<a href="query.svc?x=1&y=2&z=3"/>'
+    , expect : [
+        [ "attribute", { name:'HREF', value:"query.svc?x=1&y=2&z=3"} ],
+        [ "opentag", { name: "A", attributes: { HREF:"query.svc?x=1&y=2&z=3"}, isSelfClosing: true } ],
+        [ "closetag", "A" ]
+      ]
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xml2js/node_modules/sax/test/issue-49.js b/node_modules/xml2js/node_modules/sax/test/issue-49.js
new file mode 100644
index 0000000..ff2fbf7
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/issue-49.js
@@ -0,0 +1,31 @@
+// https://github.com/isaacs/sax-js/issues/49
+require(__dirname).test
+  ( { xml : "<xml><script>hello world</script></xml>"
+    , expect :
+      [ [ "opentag", { name: "xml", attributes: {}, isSelfClosing: false } ]
+      , [ "opentag", { name: "script", attributes: {}, isSelfClosing: false } ]
+      , [ "text", "hello world" ]
+      , [ "closetag", "script" ]
+      , [ "closetag", "xml" ]
+      ]
+    , strict : false
+    , opt : { lowercasetags: true, noscript: true }
+    }
+  )
+
+require(__dirname).test
+  ( { xml : "<xml><script><![CDATA[hello world]]></script></xml>"
+    , expect :
+      [ [ "opentag", { name: "xml", attributes: {}, isSelfClosing: false } ]
+      , [ "opentag", { name: "script", attributes: {}, isSelfClosing: false } ]
+      , [ "opencdata", undefined ]
+      , [ "cdata", "hello world" ]
+      , [ "closecdata", undefined ]
+      , [ "closetag", "script" ]
+      , [ "closetag", "xml" ]
+      ]
+    , strict : false
+    , opt : { lowercasetags: true, noscript: true }
+    }
+  )
+
diff --git a/node_modules/xml2js/node_modules/sax/test/issue-84.js b/node_modules/xml2js/node_modules/sax/test/issue-84.js
new file mode 100644
index 0000000..0e7ee69
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/issue-84.js
@@ -0,0 +1,13 @@
+// https://github.com/isaacs/sax-js/issues/49
+require(__dirname).test
+  ( { xml : "<?has unbalanced \"quotes?><xml>body</xml>"
+    , expect :
+      [ [ "processinginstruction", { name: "has", body: "unbalanced \"quotes" } ],
+        [ "opentag", { name: "xml", attributes: {}, isSelfClosing: false } ]
+      , [ "text", "body" ]
+      , [ "closetag", "xml" ]
+      ]
+    , strict : false
+    , opt : { lowercasetags: true, noscript: true }
+    }
+  )
diff --git a/node_modules/xml2js/node_modules/sax/test/parser-position.js b/node_modules/xml2js/node_modules/sax/test/parser-position.js
new file mode 100644
index 0000000..e4a68b1
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/parser-position.js
@@ -0,0 +1,28 @@
+var sax = require("../lib/sax"),
+    assert = require("assert")
+
+function testPosition(chunks, expectedEvents) {
+  var parser = sax.parser();
+  expectedEvents.forEach(function(expectation) {
+    parser['on' + expectation[0]] = function() {
+      for (var prop in expectation[1]) {
+        assert.equal(parser[prop], expectation[1][prop]);
+      }
+    }
+  });
+  chunks.forEach(function(chunk) {
+    parser.write(chunk);
+  });
+};
+
+testPosition(['<div>abcdefgh</div>'],
+             [ ['opentag',  { position:  5, startTagPosition:  1 }]
+             , ['text',     { position: 19, startTagPosition: 14 }]
+             , ['closetag', { position: 19, startTagPosition: 14 }]
+             ]);
+
+testPosition(['<div>abcde','fgh</div>'],
+             [ ['opentag',  { position:  5, startTagPosition:  1 }]
+             , ['text',     { position: 19, startTagPosition: 14 }]
+             , ['closetag', { position: 19, startTagPosition: 14 }]
+             ]);
diff --git a/node_modules/xml2js/node_modules/sax/test/script-close-better.js b/node_modules/xml2js/node_modules/sax/test/script-close-better.js
new file mode 100644
index 0000000..f4887b9
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/script-close-better.js
@@ -0,0 +1,12 @@
+require(__dirname).test({
+  xml : "<html><head><script>'<div>foo</div></'</script></head></html>",
+  expect : [
+    ["opentag", {"name": "HTML","attributes": {}, isSelfClosing: false}],
+    ["opentag", {"name": "HEAD","attributes": {}, isSelfClosing: false}],
+    ["opentag", {"name": "SCRIPT","attributes": {}, isSelfClosing: false}],
+    ["script", "'<div>foo</div></'"],
+    ["closetag", "SCRIPT"],
+    ["closetag", "HEAD"],
+    ["closetag", "HTML"]
+  ]
+});
diff --git a/node_modules/xml2js/node_modules/sax/test/script.js b/node_modules/xml2js/node_modules/sax/test/script.js
new file mode 100644
index 0000000..fbda1f6
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/script.js
@@ -0,0 +1,12 @@
+require(__dirname).test({
+  xml : "<html><head><script>if (1 < 0) { console.log('elo there'); }</script></head></html>",
+  expect : [
+    ["opentag", {"name": "HTML","attributes": {}, "isSelfClosing": false}],
+    ["opentag", {"name": "HEAD","attributes": {}, "isSelfClosing": false}],
+    ["opentag", {"name": "SCRIPT","attributes": {}, "isSelfClosing": false}],
+    ["script", "if (1 < 0) { console.log('elo there'); }"],
+    ["closetag", "SCRIPT"],
+    ["closetag", "HEAD"],
+    ["closetag", "HTML"]
+  ]
+});
diff --git a/node_modules/xml2js/node_modules/sax/test/self-closing-child-strict.js b/node_modules/xml2js/node_modules/sax/test/self-closing-child-strict.js
new file mode 100644
index 0000000..3d6e985
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/self-closing-child-strict.js
@@ -0,0 +1,44 @@
+
+require(__dirname).test({
+  xml :
+  "<root>"+
+    "<child>" +
+      "<haha />" +
+    "</child>" +
+    "<monkey>" +
+      "=(|)" +
+    "</monkey>" +
+  "</root>",
+  expect : [
+    ["opentag", {
+     "name": "root",
+     "attributes": {},
+     "isSelfClosing": false
+    }],
+    ["opentag", {
+     "name": "child",
+     "attributes": {},
+     "isSelfClosing": false
+    }],
+    ["opentag", {
+     "name": "haha",
+     "attributes": {},
+     "isSelfClosing": true
+    }],
+    ["closetag", "haha"],
+    ["closetag", "child"],
+    ["opentag", {
+     "name": "monkey",
+     "attributes": {},
+     "isSelfClosing": false
+    }],
+    ["text", "=(|)"],
+    ["closetag", "monkey"],
+    ["closetag", "root"],
+    ["end"],
+    ["ready"]
+  ],
+  strict : true,
+  opt : {}
+});
+
diff --git a/node_modules/xml2js/node_modules/sax/test/self-closing-child.js b/node_modules/xml2js/node_modules/sax/test/self-closing-child.js
new file mode 100644
index 0000000..f31c366
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/self-closing-child.js
@@ -0,0 +1,44 @@
+
+require(__dirname).test({
+  xml :
+  "<root>"+
+    "<child>" +
+      "<haha />" +
+    "</child>" +
+    "<monkey>" +
+      "=(|)" +
+    "</monkey>" +
+  "</root>",
+  expect : [
+    ["opentag", {
+     "name": "ROOT",
+     "attributes": {},
+     "isSelfClosing": false
+    }],
+    ["opentag", {
+     "name": "CHILD",
+     "attributes": {},
+     "isSelfClosing": false
+    }],
+    ["opentag", {
+     "name": "HAHA",
+     "attributes": {},
+     "isSelfClosing": true
+    }],
+    ["closetag", "HAHA"],
+    ["closetag", "CHILD"],
+    ["opentag", {
+     "name": "MONKEY",
+     "attributes": {},
+     "isSelfClosing": false
+    }],
+    ["text", "=(|)"],
+    ["closetag", "MONKEY"],
+    ["closetag", "ROOT"],
+    ["end"],
+    ["ready"]
+  ],
+  strict : false,
+  opt : {}
+});
+
diff --git a/node_modules/xml2js/node_modules/sax/test/self-closing-tag.js b/node_modules/xml2js/node_modules/sax/test/self-closing-tag.js
new file mode 100644
index 0000000..d1d8b7c
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/self-closing-tag.js
@@ -0,0 +1,25 @@
+
+require(__dirname).test({
+  xml :
+  "<root>   "+
+    "<haha /> "+
+    "<haha/>  "+
+    "<monkey> "+
+      "=(|)     "+
+    "</monkey>"+
+  "</root>  ",
+  expect : [
+    ["opentag", {name:"ROOT", attributes:{}, isSelfClosing: false}],
+    ["opentag", {name:"HAHA", attributes:{}, isSelfClosing: true}],
+    ["closetag", "HAHA"],
+    ["opentag", {name:"HAHA", attributes:{}, isSelfClosing: true}],
+    ["closetag", "HAHA"],
+    // ["opentag", {name:"HAHA", attributes:{}}],
+    // ["closetag", "HAHA"],
+    ["opentag", {name:"MONKEY", attributes:{}, isSelfClosing: false}],
+    ["text", "=(|)"],
+    ["closetag", "MONKEY"],
+    ["closetag", "ROOT"]
+  ],
+  opt : { trim : true }
+});
\ No newline at end of file
diff --git a/node_modules/xml2js/node_modules/sax/test/stray-ending.js b/node_modules/xml2js/node_modules/sax/test/stray-ending.js
new file mode 100644
index 0000000..bec467b
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/stray-ending.js
@@ -0,0 +1,17 @@
+// stray ending tags should just be ignored in non-strict mode.
+// https://github.com/isaacs/sax-js/issues/32
+require(__dirname).test
+  ( { xml :
+      "<a><b></c></b></a>"
+    , expect :
+      [ [ "opentag", { name: "A", attributes: {}, isSelfClosing: false } ]
+      , [ "opentag", { name: "B", attributes: {}, isSelfClosing: false } ]
+      , [ "text", "</c>" ]
+      , [ "closetag", "B" ]
+      , [ "closetag", "A" ]
+      ]
+    , strict : false
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xml2js/node_modules/sax/test/trailing-attribute-no-value.js b/node_modules/xml2js/node_modules/sax/test/trailing-attribute-no-value.js
new file mode 100644
index 0000000..222837f
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/trailing-attribute-no-value.js
@@ -0,0 +1,10 @@
+
+require(__dirname).test({
+  xml :
+  "<root attrib>",
+  expect : [
+    ["attribute", {name:"ATTRIB", value:"attrib"}],
+    ["opentag", {name:"ROOT", attributes:{"ATTRIB":"attrib"}, isSelfClosing: false}]
+  ],
+  opt : { trim : true }
+});
diff --git a/node_modules/xml2js/node_modules/sax/test/trailing-non-whitespace.js b/node_modules/xml2js/node_modules/sax/test/trailing-non-whitespace.js
new file mode 100644
index 0000000..619578b
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/trailing-non-whitespace.js
@@ -0,0 +1,18 @@
+
+require(__dirname).test({
+  xml : "<span>Welcome,</span> to monkey land",
+  expect : [
+    ["opentag", {
+     "name": "SPAN",
+     "attributes": {},
+     isSelfClosing: false
+    }],
+    ["text", "Welcome,"],
+    ["closetag", "SPAN"],
+    ["text", " to monkey land"],
+    ["end"],
+    ["ready"]
+  ],
+  strict : false,
+  opt : {}
+});
diff --git a/node_modules/xml2js/node_modules/sax/test/unclosed-root.js b/node_modules/xml2js/node_modules/sax/test/unclosed-root.js
new file mode 100644
index 0000000..f4eeac6
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/unclosed-root.js
@@ -0,0 +1,11 @@
+require(__dirname).test
+  ( { xml : "<root>"
+
+    , expect :
+      [ [ "opentag", { name: "root", attributes: {}, isSelfClosing: false } ]
+      , [ "error", "Unclosed root tag\nLine: 0\nColumn: 6\nChar: " ]
+      ]
+    , strict : true
+    , opt : {}
+    }
+  )
diff --git a/node_modules/xml2js/node_modules/sax/test/unquoted.js b/node_modules/xml2js/node_modules/sax/test/unquoted.js
new file mode 100644
index 0000000..b3a9a81
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/unquoted.js
@@ -0,0 +1,18 @@
+// unquoted attributes should be ok in non-strict mode
+// https://github.com/isaacs/sax-js/issues/31
+require(__dirname).test
+  ( { xml :
+      "<span class=test hello=world></span>"
+    , expect :
+      [ [ "attribute", { name: "CLASS", value: "test" } ]
+      , [ "attribute", { name: "HELLO", value: "world" } ]
+      , [ "opentag", { name: "SPAN",
+                       attributes: { CLASS: "test", HELLO: "world" },
+                       isSelfClosing: false } ]
+      , [ "closetag", "SPAN" ]
+      ]
+    , strict : false
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xml2js/node_modules/sax/test/xmlns-issue-41.js b/node_modules/xml2js/node_modules/sax/test/xmlns-issue-41.js
new file mode 100644
index 0000000..17ab45a
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/xmlns-issue-41.js
@@ -0,0 +1,68 @@
+var t = require(__dirname)
+
+  , xmls = // should be the same both ways.
+    [ "<parent xmlns:a='http://ATTRIBUTE' a:attr='value' />"
+    , "<parent a:attr='value' xmlns:a='http://ATTRIBUTE' />" ]
+
+  , ex1 =
+    [ [ "opennamespace"
+      , { prefix: "a"
+        , uri: "http://ATTRIBUTE"
+        }
+      ]
+    , [ "attribute"
+      , { name: "xmlns:a"
+        , value: "http://ATTRIBUTE"
+        , prefix: "xmlns"
+        , local: "a"
+        , uri: "http://www.w3.org/2000/xmlns/"
+        }
+      ]
+    , [ "attribute"
+      , { name: "a:attr"
+        , local: "attr"
+        , prefix: "a"
+        , uri: "http://ATTRIBUTE"
+        , value: "value"
+        }
+      ]
+    , [ "opentag"
+      , { name: "parent"
+        , uri: ""
+        , prefix: ""
+        , local: "parent"
+        , attributes:
+          { "a:attr":
+            { name: "a:attr"
+            , local: "attr"
+            , prefix: "a"
+            , uri: "http://ATTRIBUTE"
+            , value: "value"
+            }
+          , "xmlns:a":
+            { name: "xmlns:a"
+            , local: "a"
+            , prefix: "xmlns"
+            , uri: "http://www.w3.org/2000/xmlns/"
+            , value: "http://ATTRIBUTE"
+            }
+          }
+        , ns: {"a": "http://ATTRIBUTE"}
+        , isSelfClosing: true
+        }
+      ]
+    , ["closetag", "parent"]
+    , ["closenamespace", { prefix: "a", uri: "http://ATTRIBUTE" }]
+    ]
+
+  // swap the order of elements 2 and 1
+  , ex2 = [ex1[0], ex1[2], ex1[1]].concat(ex1.slice(3))
+  , expected = [ex1, ex2]
+
+xmls.forEach(function (x, i) {
+  t.test({ xml: x
+         , expect: expected[i]
+         , strict: true
+         , opt: { xmlns: true }
+         })
+})
diff --git a/node_modules/xml2js/node_modules/sax/test/xmlns-rebinding.js b/node_modules/xml2js/node_modules/sax/test/xmlns-rebinding.js
new file mode 100644
index 0000000..07e0425
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/xmlns-rebinding.js
@@ -0,0 +1,63 @@
+
+require(__dirname).test
+  ( { xml :
+      "<root xmlns:x='x1' xmlns:y='y1' x:a='x1' y:a='y1'>"+
+        "<rebind xmlns:x='x2'>"+
+          "<check x:a='x2' y:a='y1'/>"+
+        "</rebind>"+
+        "<check x:a='x1' y:a='y1'/>"+
+      "</root>"
+
+    , expect :
+      [ [ "opennamespace", { prefix: "x", uri: "x1" } ]
+      , [ "opennamespace", { prefix: "y", uri: "y1" } ]
+      , [ "attribute", { name: "xmlns:x", value: "x1", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "x" } ]
+      , [ "attribute", { name: "xmlns:y", value: "y1", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "y" } ]
+      , [ "attribute", { name: "x:a", value: "x1", uri: "x1", prefix: "x", local: "a" } ]
+      , [ "attribute", { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } ]
+      , [ "opentag", { name: "root", uri: "", prefix: "", local: "root",
+            attributes: { "xmlns:x": { name: "xmlns:x", value: "x1", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "x" }
+                        , "xmlns:y": { name: "xmlns:y", value: "y1", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "y" }
+                        , "x:a": { name: "x:a", value: "x1", uri: "x1", prefix: "x", local: "a" }
+                        , "y:a": { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } },
+            ns: { x: 'x1', y: 'y1' },
+            isSelfClosing: false } ]
+
+      , [ "opennamespace", { prefix: "x", uri: "x2" } ]
+      , [ "attribute", { name: "xmlns:x", value: "x2", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "x" } ]
+      , [ "opentag", { name: "rebind", uri: "", prefix: "", local: "rebind",
+            attributes: { "xmlns:x": { name: "xmlns:x", value: "x2", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "x" } },
+            ns: { x: 'x2' },
+            isSelfClosing: false } ]
+
+      , [ "attribute", { name: "x:a", value: "x2", uri: "x2", prefix: "x", local: "a" } ]
+      , [ "attribute", { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } ]
+      , [ "opentag", { name: "check", uri: "", prefix: "", local: "check",
+            attributes: { "x:a": { name: "x:a", value: "x2", uri: "x2", prefix: "x", local: "a" }
+                        , "y:a": { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } },
+            ns: { x: 'x2' },
+            isSelfClosing: true } ]
+
+      , [ "closetag", "check" ]
+
+      , [ "closetag", "rebind" ]
+      , [ "closenamespace", { prefix: "x", uri: "x2" } ]
+
+      , [ "attribute", { name: "x:a", value: "x1", uri: "x1", prefix: "x", local: "a" } ]
+      , [ "attribute", { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } ]
+      , [ "opentag", { name: "check", uri: "", prefix: "", local: "check",
+            attributes: { "x:a": { name: "x:a", value: "x1", uri: "x1", prefix: "x", local: "a" }
+                        , "y:a": { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } },
+            ns: { x: 'x1', y: 'y1' },
+            isSelfClosing: true } ]
+      , [ "closetag", "check" ]
+
+      , [ "closetag", "root" ]
+      , [ "closenamespace", { prefix: "x", uri: "x1" } ]
+      , [ "closenamespace", { prefix: "y", uri: "y1" } ]
+      ]
+    , strict : true
+    , opt : { xmlns: true }
+    }
+  )
+
diff --git a/node_modules/xml2js/node_modules/sax/test/xmlns-strict.js b/node_modules/xml2js/node_modules/sax/test/xmlns-strict.js
new file mode 100644
index 0000000..b5e3e51
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/xmlns-strict.js
@@ -0,0 +1,74 @@
+
+require(__dirname).test
+  ( { xml :
+      "<root>"+
+        "<plain attr='normal'/>"+
+        "<ns1 xmlns='uri:default'>"+
+          "<plain attr='normal'/>"+
+        "</ns1>"+
+        "<ns2 xmlns:a='uri:nsa'>"+
+          "<plain attr='normal'/>"+
+          "<a:ns a:attr='namespaced'/>"+
+        "</ns2>"+
+      "</root>"
+
+    , expect :
+      [ [ "opentag", { name: "root", prefix: "", local: "root", uri: "",
+            attributes: {}, ns: {}, isSelfClosing: false } ]
+
+      , [ "attribute", { name: "attr", value: "normal", prefix: "", local: "attr", uri: "" } ]
+      , [ "opentag", { name: "plain", prefix: "", local: "plain", uri: "",
+            attributes: { "attr": { name: "attr", value: "normal", uri: "", prefix: "", local: "attr", uri: "" } },
+            ns: {}, isSelfClosing: true } ]
+      , [ "closetag", "plain" ]
+
+      , [ "opennamespace", { prefix: "", uri: "uri:default" } ]
+
+      , [ "attribute", { name: "xmlns", value: "uri:default", prefix: "xmlns", local: "", uri: "http://www.w3.org/2000/xmlns/" } ]
+      , [ "opentag", { name: "ns1", prefix: "", local: "ns1", uri: "uri:default",
+            attributes: { "xmlns": { name: "xmlns", value: "uri:default", prefix: "xmlns", local: "", uri: "http://www.w3.org/2000/xmlns/" } },
+            ns: { "": "uri:default" }, isSelfClosing: false } ]
+
+      , [ "attribute", { name: "attr", value: "normal", prefix: "", local: "attr", uri: "" } ]
+      , [ "opentag", { name: "plain", prefix: "", local: "plain", uri: "uri:default", ns: { '': 'uri:default' },
+            attributes: { "attr": { name: "attr", value: "normal", prefix: "", local: "attr", uri: "" } },
+            isSelfClosing: true } ]
+      , [ "closetag", "plain" ]
+
+      , [ "closetag", "ns1" ]
+
+      , [ "closenamespace", { prefix: "", uri: "uri:default" } ]
+
+      , [ "opennamespace", { prefix: "a", uri: "uri:nsa" } ]
+
+      , [ "attribute", { name: "xmlns:a", value: "uri:nsa", prefix: "xmlns", local: "a", uri: "http://www.w3.org/2000/xmlns/" } ]
+
+      , [ "opentag", { name: "ns2", prefix: "", local: "ns2", uri: "",
+            attributes: { "xmlns:a": { name: "xmlns:a", value: "uri:nsa", prefix: "xmlns", local: "a", uri: "http://www.w3.org/2000/xmlns/" } },
+            ns: { a: "uri:nsa" }, isSelfClosing: false } ]
+
+      , [ "attribute", { name: "attr", value: "normal", prefix: "", local: "attr", uri: "" } ]
+      , [ "opentag", { name: "plain", prefix: "", local: "plain", uri: "",
+            attributes: { "attr": { name: "attr", value: "normal", prefix: "", local: "attr", uri: "" } },
+            ns: { a: 'uri:nsa' },
+            isSelfClosing: true } ]
+      , [ "closetag", "plain" ]
+
+      , [ "attribute", { name: "a:attr", value: "namespaced", prefix: "a", local: "attr", uri: "uri:nsa" } ]
+      , [ "opentag", { name: "a:ns", prefix: "a", local: "ns", uri: "uri:nsa",
+            attributes: { "a:attr": { name: "a:attr", value: "namespaced", prefix: "a", local: "attr", uri: "uri:nsa" } },
+            ns: { a: 'uri:nsa' },
+            isSelfClosing: true } ]
+      , [ "closetag", "a:ns" ]
+
+      , [ "closetag", "ns2" ]
+
+      , [ "closenamespace", { prefix: "a", uri: "uri:nsa" } ]
+
+      , [ "closetag", "root" ]
+      ]
+    , strict : true
+    , opt : { xmlns: true }
+    }
+  )
+
diff --git a/node_modules/xml2js/node_modules/sax/test/xmlns-unbound-element.js b/node_modules/xml2js/node_modules/sax/test/xmlns-unbound-element.js
new file mode 100644
index 0000000..9d031a2
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/xmlns-unbound-element.js
@@ -0,0 +1,33 @@
+require(__dirname).test(
+  { strict : true
+  , opt : { xmlns: true }
+  , expect :
+    [ [ "error", "Unbound namespace prefix: \"unbound:root\"\nLine: 0\nColumn: 15\nChar: >"]
+    , [ "opentag", { name: "unbound:root", uri: "unbound", prefix: "unbound", local: "root"
+        , attributes: {}, ns: {}, isSelfClosing: true } ]
+    , [ "closetag", "unbound:root" ]
+    ]
+  }
+).write("<unbound:root/>");
+
+require(__dirname).test(
+  { strict : true
+  , opt : { xmlns: true }
+  , expect :
+    [ [ "opennamespace", { prefix: "unbound", uri: "someuri" } ]
+    , [ "attribute", { name: 'xmlns:unbound', value: 'someuri'
+      , prefix: 'xmlns', local: 'unbound'
+      , uri: 'http://www.w3.org/2000/xmlns/' } ]
+    , [ "opentag", { name: "unbound:root", uri: "someuri", prefix: "unbound", local: "root"
+          , attributes: { 'xmlns:unbound': {
+              name: 'xmlns:unbound'
+            , value: 'someuri'
+            , prefix: 'xmlns'
+            , local: 'unbound'
+            , uri: 'http://www.w3.org/2000/xmlns/' } }
+      , ns: { "unbound": "someuri" }, isSelfClosing: true } ]
+    , [ "closetag", "unbound:root" ]
+    , [ "closenamespace", { prefix: 'unbound', uri: 'someuri' }]
+    ]
+  }
+).write("<unbound:root xmlns:unbound=\"someuri\"/>");
diff --git a/node_modules/xml2js/node_modules/sax/test/xmlns-unbound.js b/node_modules/xml2js/node_modules/sax/test/xmlns-unbound.js
new file mode 100644
index 0000000..b740e26
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/xmlns-unbound.js
@@ -0,0 +1,15 @@
+
+require(__dirname).test(
+  { strict : true
+  , opt : { xmlns: true }
+  , expect :
+    [ ["error", "Unbound namespace prefix: \"unbound\"\nLine: 0\nColumn: 28\nChar: >"]
+
+    , [ "attribute", { name: "unbound:attr", value: "value", uri: "unbound", prefix: "unbound", local: "attr" } ]
+    , [ "opentag", { name: "root", uri: "", prefix: "", local: "root",
+          attributes: { "unbound:attr": { name: "unbound:attr", value: "value", uri: "unbound", prefix: "unbound", local: "attr" } },
+          ns: {}, isSelfClosing: true } ]
+    , [ "closetag", "root" ]
+    ]
+  }
+).write("<root unbound:attr='value'/>")
diff --git a/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-ns.js b/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-ns.js
new file mode 100644
index 0000000..b1984d2
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-ns.js
@@ -0,0 +1,31 @@
+var xmlns_attr =
+{
+    name: "xmlns", value: "http://foo", prefix: "xmlns",
+    local: "", uri : "http://www.w3.org/2000/xmlns/"
+};
+
+var attr_attr =
+{
+    name: "attr", value: "bar", prefix: "",
+    local : "attr",  uri : ""
+};
+
+
+require(__dirname).test
+  ( { xml :
+      "<elm xmlns='http://foo' attr='bar'/>"
+    , expect :
+      [ [ "opennamespace", { prefix: "", uri: "http://foo" } ]
+      , [ "attribute", xmlns_attr ]
+      , [ "attribute", attr_attr ]
+      , [ "opentag", { name: "elm", prefix: "", local: "elm", uri : "http://foo",
+                       ns : { "" : "http://foo" },
+                       attributes: { xmlns: xmlns_attr, attr: attr_attr },
+                       isSelfClosing: true } ]
+      , [ "closetag", "elm" ]
+      , [ "closenamespace", { prefix: "", uri: "http://foo"} ]
+      ]
+    , strict : true
+    , opt : {xmlns: true}
+    }
+  )
diff --git a/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-prefix-attribute.js b/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-prefix-attribute.js
new file mode 100644
index 0000000..e41f218
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-prefix-attribute.js
@@ -0,0 +1,36 @@
+require(__dirname).test(
+  { xml : "<root xml:lang='en'/>"
+  , expect :
+    [ [ "attribute"
+      , { name: "xml:lang"
+        , local: "lang"
+        , prefix: "xml"
+        , uri: "http://www.w3.org/XML/1998/namespace"
+        , value: "en"
+        }
+      ]
+    , [ "opentag"
+      , { name: "root"
+        , uri: ""
+        , prefix: ""
+        , local: "root"
+        , attributes:
+          { "xml:lang":
+            { name: "xml:lang"
+            , local: "lang"
+            , prefix: "xml"
+            , uri: "http://www.w3.org/XML/1998/namespace"
+            , value: "en"
+            }
+          }
+        , ns: {}
+        , isSelfClosing: true
+        }
+      ]
+    , ["closetag", "root"]
+    ]
+  , strict : true
+  , opt : { xmlns: true }
+  }
+)
+
diff --git a/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-prefix.js b/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-prefix.js
new file mode 100644
index 0000000..a85b478
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-prefix.js
@@ -0,0 +1,21 @@
+require(__dirname).test(
+  { xml : "<xml:root/>"
+  , expect :
+    [
+      [ "opentag"
+      , { name: "xml:root"
+        , uri: "http://www.w3.org/XML/1998/namespace"
+        , prefix: "xml"
+        , local: "root"
+        , attributes: {}
+        , ns: {}
+        , isSelfClosing: true
+        }
+      ]
+    , ["closetag", "xml:root"]
+    ]
+  , strict : true
+  , opt : { xmlns: true }
+  }
+)
+
diff --git a/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-redefine.js b/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-redefine.js
new file mode 100644
index 0000000..d35d5a0
--- /dev/null
+++ b/node_modules/xml2js/node_modules/sax/test/xmlns-xml-default-redefine.js
@@ -0,0 +1,41 @@
+require(__dirname).test(
+  { xml : "<xml:root xmlns:xml='ERROR'/>"
+  , expect :
+    [ ["error"
+      , "xml: prefix must be bound to http://www.w3.org/XML/1998/namespace\n"
+                        + "Actual: ERROR\n"
+      + "Line: 0\nColumn: 27\nChar: '"
+      ]
+    , [ "attribute"
+      , { name: "xmlns:xml"
+        , local: "xml"
+        , prefix: "xmlns"
+        , uri: "http://www.w3.org/2000/xmlns/"
+        , value: "ERROR"
+        }
+      ]
+    , [ "opentag"
+      , { name: "xml:root"
+        , uri: "http://www.w3.org/XML/1998/namespace"
+        , prefix: "xml"
+        , local: "root"
+        , attributes:
+          { "xmlns:xml":
+            { name: "xmlns:xml"
+            , local: "xml"
+            , prefix: "xmlns"
+            , uri: "http://www.w3.org/2000/xmlns/"
+            , value: "ERROR"
+            }
+          }
+        , ns: {}
+        , isSelfClosing: true
+        }
+      ]
+    , ["closetag", "xml:root"]
+    ]
+  , strict : true
+  , opt : { xmlns: true }
+  }
+)
+
diff --git a/node_modules/xml2js/package.json b/node_modules/xml2js/package.json
new file mode 100644
index 0000000..bc4be7f
--- /dev/null
+++ b/node_modules/xml2js/package.json
@@ -0,0 +1,129 @@
+{
+  "name": "xml2js",
+  "description": "Simple XML to JavaScript object converter.",
+  "keywords": [
+    "xml",
+    "json"
+  ],
+  "homepage": "https://github.com/Leonidas-from-XIV/node-xml2js",
+  "version": "0.2.8",
+  "author": {
+    "name": "Marek Kubica",
+    "email": "marek@xivilization.net",
+    "url": "http://xivilization.net"
+  },
+  "contributors": [
+    {
+      "name": "maqr",
+      "email": "maqr.lollerskates@gmail.com",
+      "url": "https://github.com/maqr"
+    },
+    {
+      "name": "Ben Weaver",
+      "url": "http://benweaver.com/"
+    },
+    {
+      "name": "Jae Kwon",
+      "url": "https://github.com/jaekwon"
+    },
+    {
+      "name": "Jim Robert"
+    },
+    {
+      "name": "Ștefan Rusu",
+      "url": "http://www.saltwaterc.eu/"
+    },
+    {
+      "name": "Carter Cole",
+      "email": "carter.cole@cartercole.com",
+      "url": "http://cartercole.com/"
+    },
+    {
+      "name": "Kurt Raschke",
+      "email": "kurt@kurtraschke.com",
+      "url": "http://www.kurtraschke.com/"
+    },
+    {
+      "name": "Contra",
+      "email": "contra@australia.edu",
+      "url": "https://github.com/Contra"
+    },
+    {
+      "name": "Marcelo Diniz",
+      "email": "marudiniz@gmail.com",
+      "url": "https://github.com/mdiniz"
+    },
+    {
+      "name": "Michael Hart",
+      "url": "https://github.com/mhart"
+    },
+    {
+      "name": "Zachary Scott",
+      "email": "zachary@zacharyscott.net",
+      "url": "http://zacharyscott.net/"
+    },
+    {
+      "name": "Raoul Millais",
+      "url": "https://github.com/raoulmillais"
+    },
+    {
+      "name": "Salsita Software",
+      "url": "http://www.salsitasoft.com/"
+    },
+    {
+      "name": "Mike Schilling",
+      "email": "mike@emotive.com",
+      "url": "http://www.emotive.com/"
+    },
+    {
+      "name": "Jackson Tian",
+      "email": "shyvo1987@gmail.com",
+      "url": "http://weibo.com/shyvo"
+    },
+    {
+      "name": "Mikhail Zyatin",
+      "email": "mikhail.zyatin@gmail.com",
+      "url": "https://github.com/Sitin"
+    },
+    {
+      "name": "Chris Tavares",
+      "email": "ctavares@microsoft.com",
+      "url": "https://github.com/christav"
+    },
+    {
+      "name": "Frank Xu",
+      "email": "yyfrankyy@gmail.com",
+      "url": "http://f2e.us/"
+    }
+  ],
+  "main": "./lib/xml2js",
+  "directories": {
+    "lib": "./lib"
+  },
+  "scripts": {
+    "test": "zap"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/Leonidas-from-XIV/node-xml2js.git"
+  },
+  "dependencies": {
+    "sax": "0.5.x"
+  },
+  "devDependencies": {
+    "coffee-script": ">=1.6.3",
+    "zap": ">=0.2.5",
+    "docco": ">=0.6.2"
+  },
+  "readme": "node-xml2js\n===========\n\nEver had the urge to parse XML? And wanted to access the data in some sane,\neasy way? Don't want to compile a C parser, for whatever reason? Then xml2js is\nwhat you're looking for!\n\nDescription\n===========\n\nSimple XML to JavaScript object converter. Uses\n[sax-js](https://github.com/isaacs/sax-js/).\n\nNote: If you're looking for a full DOM parser, you probably want\n[JSDom](https://github.com/tmpvar/jsdom).\n\nInstallation\n============\n\nSimplest way to install `xml2js` is to use [npm](http://npmjs.org), just `npm\ninstall xml2js` which will download xml2js and all dependencies.\n\nUsage\n=====\n\nNo extensive tutorials required because you are a smart developer! The task of\nparsing XML should be an easy one, so let's make it so! Here's some examples.\n\nShoot-and-forget usage\n----------------------\n\nYou want to parse XML as simple and easy as possible? It's dangerous to go\nalone, take this:\n\n```javascript\nvar parseString = require('xml2js').parseString;\nvar xml = \"<root>Hello xml2js!</root>\"\nparseString(xml, function (err, result) {\n    console.dir(result);\n});\n```\n\nCan't get easier than this, right? This works starting with `xml2js` 0.2.3.\nWith CoffeeScript it looks like this:\n\n```coffeescript\nparseString = require('xml2js').parseString\nxml = \"<root>Hello xml2js!</root>\"\nparseString xml, (err, result) ->\n    console.dir result\n```\n\nIf you need some special options, fear not, `xml2js` supports a number of\noptions (see below), you can specify these as second argument:\n\n```javascript\nparseString(xml, {trim: true}, function (err, result) {\n});\n```\n\nSimple as pie usage\n-------------------\n\nThat's right, if you have been using xml-simple or a home-grown\nwrapper, this is was added in 0.1.11 just for you:\n\n```javascript\nvar fs = require('fs'),\n    xml2js = require('xml2js');\n\nvar parser = new xml2js.Parser();\nfs.readFile(__dirname + '/foo.xml', function(err, data) {\n    parser.parseString(data, function (err, result) {\n        console.dir(result);\n        console.log('Done');\n    });\n});\n```\n\nLook ma, no event listeners!\n\nYou can also use `xml2js` from\n[CoffeeScript](http://jashkenas.github.com/coffee-script/), further reducing\nthe clutter:\n\n```coffeescript\nfs = require 'fs',\nxml2js = require 'xml2js'\n\nparser = new xml2js.Parser()\nfs.readFile __dirname + '/foo.xml', (err, data) ->\n  parser.parseString data, (err, result) ->\n    console.dir result\n    console.log 'Done.'\n```\n\nBut what happens if you forget the `new` keyword to create a new `Parser`? In\nthe middle of a nightly coding session, it might get lost, after all. Worry\nnot, we got you covered! Starting with 0.2.8 you can also leave it out, in\nwhich case `xml2js` will helpfully add it for you, no bad surprises and\ninexplicable bugs!\n\n\"Traditional\" usage\n-------------------\n\nAlternatively you can still use the traditional `addListener` variant that was\nsupported since forever:\n\n```javascript\nvar fs = require('fs'),\n    xml2js = require('xml2js');\n\nvar parser = new xml2js.Parser();\nparser.addListener('end', function(result) {\n    console.dir(result);\n    console.log('Done.');\n});\nfs.readFile(__dirname + '/foo.xml', function(err, data) {\n    parser.parseString(data);\n});\n```\n\nIf you want to parse multiple files, you have multiple possibilites:\n\n  * You can create one `xml2js.Parser` per file. That's the recommended one\n    and is promised to always *just work*.\n  * You can call `reset()` on your parser object.\n  * You can hope everything goes well anyway. This behaviour is not\n    guaranteed work always, if ever. Use option #1 if possible. Thanks!\n\nSo you wanna some JSON?\n-----------------------\n\nJust wrap the `result` object in a call to `JSON.stringify` like this\n`JSON.stringify(result)`. You get a string containing the JSON representation\nof the parsed object that you can feed to JSON-hungry consumers.\n\nDisplaying results\n------------------\n\nYou might wonder why, using `console.dir` or `console.log` the output at some\nlevel is only `[Object]`. Don't worry, this is not because xml2js got lazy.\nThat's because Node uses `util.inspect` to convert the object into strings and\nthat function stops after `depth=2` which is a bit low for most XML.\n\nTo display the whole deal, you can use `console.log(util.inspect(result, false,\nnull))`, which displays the whole result.\n\nSo much for that, but what if you use\n[eyes](https://github.com/cloudhead/eyes.js) for nice colored output and it\ntruncates the output with `…`? Don't fear, there's also a solution for that,\nyou just need to increase the `maxLength` limit by creating a custom inspector\n`var inspect = require('eyes').inspector({maxLength: false})` and then you can\neasily `inspect(result)`.\n\nOptions\n=======\n\nApart from the default settings, there is a number of options that can be\nspecified for the parser. Options are specified by ``new Parser({optionName:\nvalue})``. Possible options are:\n\n  * `attrkey` (default: `$`): Prefix that is used to access the attributes.\n    Version 0.1 default was `@`.\n  * `charkey` (default: `_`): Prefix that is used to access the character\n    content. Version 0.1 default was `#`.\n  * `explicitCharkey` (default: `false`)\n  * `trim` (default: `false`): Trim the whitespace at the beginning and end of\n    text nodes.\n  * `normalizeTags` (default: `false`): Normalize all tag names to lowercase.\n  * `normalize` (default: `false`): Trim whitespaces inside text nodes.\n  * `explicitRoot` (default: `true`): Set this if you want to get the root\n    node in the resulting object.\n  * `emptyTag` (default: `undefined`): what will the value of empty nodes be.\n    Default is `{}`.\n  * `explicitArray` (default: `true`): Always put child nodes in an array if\n    true; otherwise an array is created only if there is more than one.\n  * `ignoreAttrs` (default: `false`): Ignore all XML attributes and only create\n    text nodes.\n  * `mergeAttrs` (default: `false`): Merge attributes and child elements as\n    properties of the parent, instead of keying attributes off a child\n    attribute object. This option is ignored if `ignoreAttrs` is `false`.\n  * `validator` (default `null`): You can specify a callable that validates\n    the resulting structure somehow, however you want. See unit tests\n    for an example.\n  * `xmlns` (default `false`): Give each element a field usually called '$ns'\n    (the first character is the same as attrkey) that contains its local name\n    and namespace URI.\n  * `explicitChildren` (default `false`): Put child elements to separate\n    property. Doesn't work with `mergeAttrs = true`. If element has no children\n    then \"children\" won't be created. Added in 0.2.5.\n  * `childkey` (default `$$`): Prefix that is used to access child elements if\n    `explicitChildren` is set to `true`. Added in 0.2.5.\n  * `charsAsChildren` (default `false`): Determines whether chars should be\n    considered children if `explicitChildren` is on. Added in 0.2.5.\n  * `async` (default `false`): Should the callbacks be async? This *might* be\n    an incompatible change if your code depends on sync execution of callbacks.\n    xml2js 0.3 might change this default, so the recommendation is to not\n    depend on sync execution anyway. Added in 0.2.6.\n  * `strict` (default `true`): Set sax-js to strict or non-strict parsing mode.\n    Defaults to `true` which is *highly* recommended, since parsing HTML which\n    is not well-formed XML might yield just about anything. Added in 0.2.7.\n\nUpdating to new version\n=======================\n\nVersion 0.2 changed the default parsing settings, but version 0.1.14 introduced\nthe default settings for version 0.2, so these settings can be tried before the\nmigration.\n\n```javascript\nvar xml2js = require('xml2js');\nvar parser = new xml2js.Parser(xml2js.defaults[\"0.2\"]);\n```\n\nTo get the 0.1 defaults in version 0.2 you can just use\n`xml2js.defaults[\"0.1\"]` in the same place. This provides you with enough time\nto migrate to the saner way of parsing in xml2js 0.2. We try to make the\nmigration as simple and gentle as possible, but some breakage cannot be\navoided.\n\nSo, what exactly did change and why? In 0.2 we changed some defaults to parse\nthe XML in a more universal and sane way. So we disabled `normalize` and `trim`\nso xml2js does not cut out any text content. You can reenable this at will of\ncourse. A more important change is that we return the root tag in the resulting\nJavaScript structure via the `explicitRoot` setting, so you need to access the\nfirst element. This is useful for anybody who wants to know what the root node\nis and preserves more information. The last major change was to enable\n`explicitArray`, so everytime it is possible that one might embed more than one\nsub-tag into a tag, xml2js >= 0.2 returns an array even if the array just\nincludes one element. This is useful when dealing with APIs that return\nvariable amounts of subtags.\n\nRunning tests, development\n==========================\n\n[![Build Status](https://secure.travis-ci.org/Leonidas-from-XIV/node-xml2js.png?branch=master)](https://travis-ci.org/Leonidas-from-XIV/node-xml2js)\n\nThe development requirements are handled by npm, you just need to install them.\nWe also have a number of unit tests, they can be run using `npm test` directly\nfrom the project root. This runs zap to discover all the tests and execute\nthem.\n\nIf you like to contribute, keep in mind that xml2js is written in CoffeeScript,\nso don't develop on the JavaScript files that are checked into the repository\nfor convenience reasons. Also, please write some unit test to check your\nbehaviour and if it is some user-facing thing, add some documentation to this\nREADME, so people will know it exists. Thanks in advance!\n",
+  "readmeFilename": "README.md",
+  "bugs": {
+    "url": "https://github.com/Leonidas-from-XIV/node-xml2js/issues"
+  },
+  "_id": "xml2js@0.2.8",
+  "dist": {
+    "shasum": "52c0ae5229fcb87a539c9ab2795d12c4caef1f28"
+  },
+  "_from": "xml2js@latest",
+  "_resolved": "https://registry.npmjs.org/xml2js/-/xml2js-0.2.8.tgz"
+}
diff --git a/node_modules/xml2js/text.coffee b/node_modules/xml2js/text.coffee
new file mode 100644
index 0000000..c5d8c66
--- /dev/null
+++ b/node_modules/xml2js/text.coffee
@@ -0,0 +1,11 @@
+fs = require 'fs'
+xml2js = require 'xml2js'
+
+parser = new xml2js.Parser
+
+fs.readFile 'canon.xml', (err, data) ->
+  console.log err
+  parser.parseString (err, result) ->
+    console.log err
+    console.dir result
+
diff --git a/node_modules/xml2js/text.xml b/node_modules/xml2js/text.xml
new file mode 100644
index 0000000..bd3b482
--- /dev/null
+++ b/node_modules/xml2js/text.xml
@@ -0,0 +1,485 @@
+<?xml version="1.0"?>
+ <!DOCTYPE GBSet PUBLIC "-//NCBI//NCBI GBSeq/EN" "http://www.ncbi.nlm.nih.gov/dtd/NCBI_GBSeq.dtd">
+ <GBSet>
+<GBSeq>
+  <GBSeq_locus>AF485783</GBSeq_locus>
+  <GBSeq_length>14758</GBSeq_length>
+  <GBSeq_strandedness>double</GBSeq_strandedness>
+  <GBSeq_moltype>DNA</GBSeq_moltype>
+  <GBSeq_topology>circular</GBSeq_topology>
+  <GBSeq_division>SYN</GBSeq_division>
+  <GBSeq_update-date>15-MAY-2003</GBSeq_update-date>
+  <GBSeq_create-date>21-MAR-2002</GBSeq_create-date>
+  <GBSeq_definition>Binary vector pBI121, complete sequence</GBSeq_definition>
+  <GBSeq_primary-accession>AF485783</GBSeq_primary-accession>
+  <GBSeq_accession-version>AF485783.1</GBSeq_accession-version>
+  <GBSeq_other-seqids>
+    <GBSeqid>gb|AF485783.1|</GBSeqid>
+    <GBSeqid>gi|19569229</GBSeqid>
+  </GBSeq_other-seqids>
+  <GBSeq_source>Binary vector pBI121</GBSeq_source>
+  <GBSeq_organism>Binary vector pBI121</GBSeq_organism>
+  <GBSeq_taxonomy>other sequences; artificial sequences; vectors</GBSeq_taxonomy>
+  <GBSeq_references>
+    <GBReference>
+      <GBReference_reference>1</GBReference_reference>
+      <GBReference_position>1..14758</GBReference_position>
+      <GBReference_authors>
+        <GBAuthor>Chen,P.Y.</GBAuthor>
+        <GBAuthor>Wang,C.K.</GBAuthor>
+        <GBAuthor>Soong,S.C.</GBAuthor>
+        <GBAuthor>To,K.Y.</GBAuthor>
+      </GBReference_authors>
+      <GBReference_title>Complete sequence of the binary vector pBI121 and its application in cloning T-DNA insertion from transgenic plants</GBReference_title>
+      <GBReference_journal>Mol. Breed. 11, 287-293 (2003)</GBReference_journal>
+    </GBReference>
+    <GBReference>
+      <GBReference_reference>2</GBReference_reference>
+      <GBReference_position>1..14758</GBReference_position>
+      <GBReference_authors>
+        <GBAuthor>To,K.Y.</GBAuthor>
+      </GBReference_authors>
+      <GBReference_title>Direct Submission</GBReference_title>
+      <GBReference_journal>Submitted (20-FEB-2002) Institute of BioAgricultural Sciences, Academia Sinica, Taipei 11529, Taiwan</GBReference_journal>
+    </GBReference>
+  </GBSeq_references>
+  <GBSeq_feature-table>
+    <GBFeature>
+      <GBFeature_key>source</GBFeature_key>
+      <GBFeature_location>1..14758</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>1</GBInterval_from>
+          <GBInterval_to>14758</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>organism</GBQualifier_name>
+          <GBQualifier_value>Binary vector pBI121</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>mol_type</GBQualifier_name>
+          <GBQualifier_value>genomic DNA</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>db_xref</GBQualifier_name>
+          <GBQualifier_value>taxon:189807</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>constructed using pB221 from Clontech Laboratories and Bin19 described in GenBank Accession Number U09365</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(13..796)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>796</GBInterval_from>
+          <GBInterval_to>13</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to traF in GenBank Accession Number X54459</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>rep_origin</GBFeature_key>
+      <GBFeature_location>complement(790..1168)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>1168</GBInterval_from>
+          <GBInterval_to>790</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>ColE1 ori; similar to sequence in GenBank Accession Number V00268</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(1161..2344)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>2344</GBInterval_from>
+          <GBInterval_to>1161</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to tetA in GenBank Accession Number X75761</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(2454..2478)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>2478</GBInterval_from>
+          <GBInterval_to>2454</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>T-DNA right border</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>promoter</GBFeature_key>
+      <GBFeature_location>2519..2825</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>2519</GBInterval_from>
+          <GBInterval_to>2825</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>NOS</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>gene</GBFeature_key>
+      <GBFeature_location>2838..3632</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>2838</GBInterval_from>
+          <GBInterval_to>3632</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>gene</GBQualifier_name>
+          <GBQualifier_value>nptII</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>CDS</GBFeature_key>
+      <GBFeature_location>2838..3632</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>2838</GBInterval_from>
+          <GBInterval_to>3632</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>gene</GBQualifier_name>
+          <GBQualifier_value>nptII</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>codon_start</GBQualifier_name>
+          <GBQualifier_value>1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>transl_table</GBQualifier_name>
+          <GBQualifier_value>1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>product</GBQualifier_name>
+          <GBQualifier_value>neomycin phosphotransferase II</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>protein_id</GBQualifier_name>
+          <GBQualifier_value>AAL92039.1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>db_xref</GBQualifier_name>
+          <GBQualifier_value>GI:19569230</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>translation</GBQualifier_name>
+          <GBQualifier_value>MIEQDGLHAGSPAAWVERLFGYDWAQQTIGCSDAAVFRLSAQGRPVLFVKTDLSGALNELQDEAARLSWLATTGVPCAAVLDVVTEAGRDWLLLGEVPGQDLLSSHLAPAEKVSIMADAMRRLHTLDPATCPFDHQAKHRIERARTRMEAGLVDQDDLDEEHQGLAPAELFARLKARMPDGDDLVVTHGDACLPNIMVENGRFSGFIDCGRLGVADRYQDIALATRDIAEELGGEWADRFLVLYGIAAPDSQRIAFYRLLDEFF</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>terminator</GBFeature_key>
+      <GBFeature_location>4022..4277</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>4022</GBInterval_from>
+          <GBInterval_to>4277</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>NOS</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>promoter</GBFeature_key>
+      <GBFeature_location>4974..5808</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>4974</GBInterval_from>
+          <GBInterval_to>5808</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>CaMV 35S</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>gene</GBFeature_key>
+      <GBFeature_location>5845..7656</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>5845</GBInterval_from>
+          <GBInterval_to>7656</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>gene</GBQualifier_name>
+          <GBQualifier_value>gusA</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>CDS</GBFeature_key>
+      <GBFeature_location>5845..7656</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>5845</GBInterval_from>
+          <GBInterval_to>7656</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>gene</GBQualifier_name>
+          <GBQualifier_value>gusA</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>GUS</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>codon_start</GBQualifier_name>
+          <GBQualifier_value>1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>transl_table</GBQualifier_name>
+          <GBQualifier_value>1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>product</GBQualifier_name>
+          <GBQualifier_value>beta-glucuronidase</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>protein_id</GBQualifier_name>
+          <GBQualifier_value>AAL92040.1</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>db_xref</GBQualifier_name>
+          <GBQualifier_value>GI:19569231</GBQualifier_value>
+        </GBQualifier>
+        <GBQualifier>
+          <GBQualifier_name>translation</GBQualifier_name>
+          <GBQualifier_value>MLRPVETPTREIKKLDGLWAFSLDRENCGIDQRWWESALQESRAIAVPGSFNDQFADADIRNYAGNVWYQREVFIPKGWAGQRIVLRFDAVTHYGKVWVNNQEVMEHQGGYTPFEADVTPYVIAGKSVRITVCVNNELNWQTIPPGMVITDENGKKKQSYFHDFFNYAGIHRSVMLYTTPNTWVDDITVVTHVAQDCNHASVDWQVVANGDVSVELRDADQQVVATGQGTSGTLQVVNPHLWQPGEGYLYELCVTAKSQTECDIYPLRVGIRSVAVKGEQFLINHKPFYFTGFGRHEDADLRGKGFDNVLMVHDHALMDWIGANSYRTSHYPYAEEMLDWADEHGIVVIDETAAVGFNLSLGIGFEAGNKPKELYSEEAVNGETQQAHLQAIKELIARDKNHPSVVMWSIANEPDTRPQGAREYFAPLAEATRKLDPTRPITCVNVMFCDAHTDTISDLFDVLCLNRYYGWYVQSGDLETAEKVLEKELLAWQEKLHQPIIITEYGVDTLAGLHSMYTDMWSEEYQCAWLDMYHRVFDRVSAVVGEQVWNFADFATSQGILRVGGNKKGIFTRDRKPKSAAFLLQKRWTGMNFGEKPQQGGKQ</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>terminator</GBFeature_key>
+      <GBFeature_location>7727..7979</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>7727</GBInterval_from>
+          <GBInterval_to>7979</GBInterval_to>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>NOS</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(8621..8646)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>8646</GBInterval_from>
+          <GBInterval_to>8621</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>T-DNA left border</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(9156..10198)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>10198</GBInterval_from>
+          <GBInterval_to>9156</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to tetA in GenBank Accession Number L13842</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(10199..11680)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>11680</GBInterval_from>
+          <GBInterval_to>10199</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to trfA in GenBank Accession Number X00713</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(11681..12673)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>12673</GBInterval_from>
+          <GBInterval_to>11681</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to NPTIII gene in GenBank Accession Number V01547</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(12674..13443)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>13443</GBInterval_from>
+          <GBInterval_to>12674</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to transposable element IS1 in GenBank Accession Number X58999</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(13444..13794)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>13794</GBInterval_from>
+          <GBInterval_to>13444</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similarity to NPT III gene in GenBank Accession Number V01547</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>misc_feature</GBFeature_key>
+      <GBFeature_location>complement(13795..14066)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>14066</GBInterval_from>
+          <GBInterval_to>13795</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>similar to kilA in GenBank Accession Number M62846</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+    <GBFeature>
+      <GBFeature_key>rep_origin</GBFeature_key>
+      <GBFeature_location>complement(14141..14758)</GBFeature_location>
+      <GBFeature_intervals>
+        <GBInterval>
+          <GBInterval_from>14758</GBInterval_from>
+          <GBInterval_to>14141</GBInterval_to>
+          <GBInterval_iscomp value="true"/>
+          <GBInterval_accession>AF485783.1</GBInterval_accession>
+        </GBInterval>
+      </GBFeature_intervals>
+      <GBFeature_quals>
+        <GBQualifier>
+          <GBQualifier_name>note</GBQualifier_name>
+          <GBQualifier_value>ori V; similar to sequence in GenBank Accession Number M20134</GBQualifier_value>
+        </GBQualifier>
+      </GBFeature_quals>
+    </GBFeature>
+  </GBSeq_feature-table>
+  <GBSeq_sequence>tgagcgtcgcaaaggcgctcggtcttgccttgctcgtcggtgatgtacttcaccagctccgcgaagtcgctcttcttgatggagcgcatggggacgtgcttggcaatcacgcgcaccccccggccgttttagcggctaaaaaagtcatggctctgccctcgggcggaccacgcccatcatgaccttgccaagctcgtcctgcttctcttcgatcttcgccagcagggcgaggatcgtggcatcaccgaaccgcgccgtgcgcgggtcgtcggtgagccagagtttcagcaggccgcccaggcggcccaggtcgccattgatgcgggccagctcgcggacgtgctcatagtccacgacgcccgtgattttgtagccctggccgacggccagcaggtaggccgacaggctcatgccggccgccgccgccttttcctcaatcgctcttcgttcgtctggaaggcagtacaccttgataggtgggctgcccttcctggttggcttggtttcatcagccatccgcttgccctcatctgttacgccggcggtagccggccagcctcgcagagcaggattcccgttgagcaccgccaggtgcgaataagggacagtgaagaaggaacacccgctcgcgggtgggcctacttcacctatcctgcccggctgacgccgttggatacaccaaggaaagtctacacgaaccctttggcaaaatcctgtatatcgtgcgaaaaaggatggatataccgaaaaaatcgctataatgaccccgaagcagggttatgcagcggaaaagcgccacgcttcccgaagggagaaaggcggacaggtatccggtaagcggcagggtcggaacaggagagcgcacgagggagcttccagggggaaacgcctggtatctttatagtcctgtcgggtttcgccacctctgacttgagcgtcgatttttgtgatgctcgtcaggggggcggagcctatggaaaaacgccagcaacgcggcctttttacggttcctggccttttgctggccttttgctcacatgttctttcctgcgttatcccctgattctgtggataaccgtattaccgcctttgagtgagctgataccgctcgccgcagccgaacgaccgagcgcagcgagtcagtgagcgaggaagcggaagagcgccagaaggccgccagagaggccgagcgcggccgtgaggcttggacgctagggcagggcatgaaaaagcccgtagcgggctgctacgggcgtctgacgcggtggaaagggggaggggatgttgtctacatggctctgctgtagtgagtgggttgcgctccggcagcggtcctgatcaatcgtcaccctttctcggtccttcaacgttcctgacaacgagcctccttttcgccaatccatcgacaatcaccgcgagtccctgctcgaacgctgcgtccggaccggcttcgtcgaaggcgtctatcgcggcccgcaacagcggcgagagcggagcctgttcaacggtgccgccgcgctcgccggcatcgctgtcgccggcctgctcctcaagcacggccccaacagtgaagtagctgattgtcatcagcgcattgacggcgtccccggccgaaaaacccgcctcgcagaggaagcgaagctgcgcgtcggccgtttccatctgcggtgcgcccggtcgcgtgccggcatggatgcgcgcgccatcgcggtaggcgagcagcgcctgcctgaagctgcgggcattcccgatcagaaatgagcgccagtcgtcgtcggctctcggcaccgaatgcgtatgattctccgccagcatggcttcggccagtgcgtcgagcagcgcccgcttgttcctgaagtgccagtaaagcgccggctgctgaacccccaaccgttccgccagtttgcgtgtcgtcagaccgtctacgccgacctcgttcaacaggtccagggcggcacggatcactgtattcggctgcaactttgtcatgcttgacactttatcactgataaacataatatgtccaccaacttatcagtgataaagaatccgcgcgttcaatcggaccagcggaggctggtccggaggccagacgtgaaacccaacatacccctgatcgtaattctgagcactgtcgcgctcgacgctgtcggcatcggcctgattatgccggtgctgccgggcctcctgcgcgatctggttcactcgaacgacgtcaccgcccactatggcattctgctggcgctgtatgcgttggtgcaatttgcctgcgcacctgtgctgggcgcgctgtcggatcgtttcgggcggcggccaatcttgctcgtctcgctggccggcgccagatctggggaaccctgtggttggcatgcacatacaaatggacgaacggataaaccttttcacgcccttttaaatatccgattattctaataaacgctcttttctcttaggtttacccgccaatatatcctgtcaaacactgatagtttaaactgaaggcgggaaacgacaatctgatcatgagcggagaattaagggagtcacgttatgacccccgccgatgacgcgggacaagccgttttacgtttggaactgacagaaccgcaacgttgaaggagccactcagccgcgggtttctggagtttaatgagctaagcacatacgtcagaaaccattattgcgcgttcaaaagtcgcctaaggtcactatcagctagcaaatatttcttgtcaaaaatgctccactgacgttccataaattcccctcggtatccaattagagtctcatattcactctcaatccaaataatctgcaccggatctggatcgtttcgcatgattgaacaagatggattgcacgcaggttctccggccgcttgggtggagaggctattcggctatgactgggcacaacagacaatcggctgctctgatgccgccgtgttccggctgtcagcgcaggggcgcccggttctttttgtcaagaccgacctgtccggtgccctgaatgaactgcaggacgaggcagcgcggctatcgtggctggccacgacgggcgttccttgcgcagctgtgctcgacgttgtcactgaagcgggaagggactggctgctattgggcgaagtgccggggcaggatctcctgtcatctcaccttgctcctgccgagaaagtatccatcatggctgatgcaatgcggcggctgcatacgcttgatccggctacctgcccattcgaccaccaagcgaaacatcgcatcgagcgagcacgtactcggatggaagccggtcttgtcgatcaggatgatctggacgaagagcatcaggggctcgcgccagccgaactgttcgccaggctcaaggcgcgcatgcccgacggcgatgatctcgtcgtgacccatggcgatgcctgcttgccgaatatcatggtggaaaatggccgcttttctggattcatcgactgtggccggctgggtgtggcggaccgctatcaggacatagcgttggctacccgtgatattgctgaagagcttggcggcgaatgggctgaccgcttcctcgtgctttacggtatcgccgctcccgattcgcagcgcatcgccttctatcgccttcttgacgagttcttctgagcgggactctggggttcgaaatgaccgaccaagcgacgcccaacctgccatcacgagatttcgattccaccgccgccttctatgaaaggttgggcttcggaatcgttttccgggacgccggctggatgatcctccagcgcggggatctcatgctggagttcttcgcccacgggatctctgcggaacaggcggtcgaaggtgccgatatcattacgacagcaacggccgacaagcacaacgccacgatcctgagcgacaatatgatcgggcccggcgtccacatcaacggcgtcggcggcgactgcccaggcaagaccgagatgcaccgcgatatcttgctgcgttcggatattttcgtggagttcccgccacagacccggatgatccccgatcgttcaaacatttggcaataaagtttcttaagattgaatcctgttgccggtcttgcgatgattatcatataatttctgttgaattacgttaagcatgtaataattaacatgtaatgcatgacgttatttatgagatgggtttttatgattagagtcccgcaattatacatttaatacgcgatagaaaacaaaatatagcgcgcaaactaggataaattatcgcgcgcggtgtcatctatgttactagatcgggcctcctgtcaatgctggcggcggctctggtggtggttctggtggcggctctgagggtggtggctctgagggtggcggttctgagggtggcggctctgagggaggcggttccggtggtggctctggttccggtgattttgattatgaaaagatggcaaacgctaataagggggctatgaccgaaaatgccgatgaaaacgcgctacagtctgacgctaaaggcaaacttgattctgtcgctactgattacggtgctgctatcgatggtttcattggtgacgtttccggccttgctaatggtaatggtgctactggtgattttgctggctctaattcccaaatggctcaagtcggtgacggtgataattcacctttaatgaataatttccgtcaatatttaccttccctccctcaatcggttgaatgtcgcccttttgtctttggcccaatacgcaaaccgcctctccccgcgcgttggccgattcattaatgcagctggcacgacaggtttcccgactggaaagcgggcagtgagcgcaacgcaattaatgtgagttagctcactcattaggcaccccaggctttacactttatgcttccggctcgtatgttgtgtggaattgtgagcggataacaatttcacacaggaaacagctatgaccatgattacgccaagcttgcatgcctgcaggtccccagattagccttttcaatttcagaaagaatgctaacccacagatggttagagaggcttacgcagcaggtctcatcaagacgatctacccgagcaataatctccaggaaatcaaataccttcccaagaaggttaaagatgcagtcaaaagattcaggactaactgcatcaagaacacagagaaagatatatttctcaagatcagaagtactattccagtatggacgattcaaggcttgcttcacaaaccaaggcaagtaatagagattggagtctctaaaaaggtagttcccactgaatcaaaggccatggagtcaaagattcaaatagaggacctaacagaactcgccgtaaagactggcgaacagttcatacagagtctcttacgactcaatgacaagaagaaaatcttcgtcaacatggtggagcacgacacacttgtctactccaaaaatatcaaagatacagtctcagaagaccaaagggcaattgagacttttcaacaaagggtaatatccggaaacctcctcggattccattgcccagctatctgtcactttattgtgaagatagtggaaaaggaaggtggctcctacaaatgccatcattgcgataaaggaaaggccatcgttgaagatgcctctgccgacagtggtcccaaagatggacccccacccacgaggagcatcgtggaaaaagaagacgttccaaccacgtcttcaaagcaagtggattgatgtgatatctccactgacgtaagggatgacgcacaatcccactatccttcgcaagacccttcctctatataaggaagttcatttcatttggagagaacacgggggactctagaggatccccgggtggtcagtcccttatgttacgtcctgtagaaaccccaacccgtgaaatcaaaaaactcgacggcctgtgggcattcagtctggatcgcgaaaactgtggaattgatcagcgttggtgggaaagcgcgttacaagaaagccgggcaattgctgtgccaggcagttttaacgatcagttcgccgatgcagatattcgtaattatgcgggcaacgtctggtatcagcgcgaagtctttataccgaaaggttgggcaggccagcgtatcgtgctgcgtttcgatgcggtcactcattacggcaaagtgtgggtcaataatcaggaagtgatggagcatcagggcggctatacgccatttgaagccgatgtcacgccgtatgttattgccgggaaaagtgtacgtatcaccgtttgtgtgaacaacgaactgaactggcagactatcccgccgggaatggtgattaccgacgaaaacggcaagaaaaagcagtcttacttccatgatttctttaactatgccggaatccatcgcagcgtaatgctctacaccacgccgaacacctgggtggacgatatcaccgtggtgacgcatgtcgcgcaagactgtaaccacgcgtctgttgactggcaggtggtggccaatggtgatgtcagcgttgaactgcgtgatgcggatcaacaggtggttgcaactggacaaggcactagcgggactttgcaagtggtgaatccgcacctctggcaaccgggtgaaggttatctctatgaactgtgcgtcacagccaaaagccagacagagtgtgatatctacccgcttcgcgtcggcatccggtcagtggcagtgaagggcgaacagttcctgattaaccacaaaccgttctactttactggctttggtcgtcatgaagatgcggacttgcgtggcaaaggattcgataacgtgctgatggtgcacgaccacgcattaatggactggattggggccaactcctaccgtacctcgcattacccttacgctgaagagatgctcgactgggcagatgaacatggcatcgtggtgattgatgaaactgctgctgtcggctttaacctctctttaggcattggtttcgaagcgggcaacaagccgaaagaactgtacagcgaagaggcagtcaacggggaaactcagcaagcgcacttacaggcgattaaagagctgatagcgcgtgacaaaaaccacccaagcgtggtgatgtggagtattgccaacgaaccggatacccgtccgcaaggtgcacgggaatatttcgcgccactggcggaagcaacgcgtaaactcgacccgacgcgtccgatcacctgcgtcaatgtaatgttctgcgacgctcacaccgataccatcagcgatctctttgatgtgctgtgcctgaaccgttattacggatggtatgtccaaagcggcgatttggaaacggcagagaaggtactggaaaaagaacttctggcctggcaggagaaactgcatcagccgattatcatcaccgaatacggcgtggatacgttagccgggctgcactcaatgtacaccgacatgtggagtgaagagtatcagtgtgcatggctggatatgtatcaccgcgtctttgatcgcgtcagcgccgtcgtcggtgaacaggtatggaatttcgccgattttgcgacctcgcaaggcatattgcgcgttggcggtaacaagaaagggatcttcactcgcgaccgcaaaccgaagtcggcggcttttctgctgcaaaaacgctggactggcatgaacttcggtgaaaaaccgcagcagggaggcaaacaatgaatcaacaactctcctggcgcaccatcgtcggctacagcctcgggaattgctaccgagctcgaatttccccgatcgttcaaacatttggcaataaagtttcttaagattgaatcctgttgccggtcttgcgatgattatcatataatttctgttgaattacgttaagcatgtaataattaacatgtaatgcatgacgttatttatgagatgggtttttatgattagagtcccgcaattatacatttaatacgcgatagaaaacaaaatatagcgcgcaaactaggataaattatcgcgcgcggtgtcatctatgttactagatcgggaattcactggccgtcgttttacaacgtcgtgactgggaaaaccctggcgttacccaacttaatcgccttgcagcacatccccctttcgccagctggcgtaatagcgaagaggcccgcaccgatcgcccttcccaacagttgcgcagcctgaatggcgcccgctcctttcgctttcttcccttcctttctcgccacgttcgccggctttccccgtcaagctctaaatcgggggctccctttagggttccgatttagtgctttacggcacctcgaccccaaaaaacttgatttgggtgatggttcacgtagtgggccatcgccctgatagacggtttttcgccctttgacgttggagtccacgttctttaatagtggactcttgttccaaactggaacaacactcaaccctatctcgggctattcttttgatttataagggattttgccgatttcggaaccaccatcaaacaggattttcgcctgctggggcaaaccagcgtggaccgcttgctgcaactctctcagggccaggcggtgaagggcaatcagctgttgcccgtctcactggtgaaaagaaaaaccaccccagtacattaaaaacgtccgcaatgtgttattaagttgtctaagcgtcaatttgtttacaccacaatatatcctgccaccagccagccaacagctccccgaccggcagctcggcacaaaatcaccactcgatacaggcagcccatcagtccgggacggcgtcagcgggagagccgttgtaaggcggcagactttgctcatgttaccgatgctattcggaagaacggcaactaagctgccgggtttgaaacacggatgatctcgcggagggtagcatgttgattgtaacgatgacagagcgttgctgcctgtgatcaaatatcatctccctcgcagagatccgaattatcagccttcttattcatttctcgcttaaccgtgacaggctgtcgatcttgagaactatgccgacataataggaaatcgctggataaagccgctgaggaagctgagtggcgctatttctttagaagtgaacgttgacgatatcaactcccctatccattgctcaccgaatggtacaggtcggggacccgaagttccgactgtcggcctgatgcatccccggctgatcgaccccagatctggggctgagaaagcccagtaaggaaacaactgtaggttcgagtcgcgagatcccccggaaccaaaggaagtaggttaaacccgctccgatcaggccgagccacgccaggccgagaacattggttcctgtaggcatcgggattggcggatcaaacactaaagctactggaacgagcagaagtcctccggccgccagttgccaggcggtaaaggtgagcagaggcacgggaggttgccacttgcgggtcagcacggttccgaacgccatggaaaccgcccccgccaggcccgctgcgacgccgacaggatctagcgctgcgtttggtgtcaacaccaacagcgccacgcccgcagttccgcaaatagcccccaggaccgccatcaatcgtatcgggctacctagcagagcggcagagatgaacacgaccatcagcggctgcacagcgcctaccgtcgccgcgaccccgcccggcaggcggtagaccgaaataaacaacaagctccagaatagcgaaatattaagtgcgccgaggatgaagatgcgcatccaccagattcccgttggaatctgtcggacgatcatcacgagcaataaacccgccggcaacgcccgcagcagcataccggcgacccctcggcctcgctgttcgggctccacgaaaacgccggacagatgcgccttgtgagcgtccttggggccgtcctcctgtttgaagaccgacagcccaatgatctcgccgtcgatgtaggcgccgaatgccacggcatctcgcaaccgttcagcgaacgcctccatgggctttttctcctcgtgctcgtaaacggacccgaacatctctggagctttcttcagggccgacaatcggatctcgcggaaatcctgcacgtcggccgctccaagccgtcgaatctgagccttaatcacaattgtcaattttaatcctctgtttatcggcagttcgtagagcgcgccgtgcgtcccgagcgatactgagcgaagcaagtgcgtcgagcagtgcccgcttgttcctgaaatgccagtaaagcgctggctgctgaacccccagccggaactgaccccacaaggccctagcgtttgcaatgcaccaggtcatcattgacccaggcgtgttccaccaggccgctgcctcgcaactcttcgcaggcttcgccgacctgctcgcgccacttcttcacgcgggtggaatccgatccgcacatgaggcggaaggtttccagcttgagcgggtacggctcccggtgcgagctgaaatagtcgaacatccgtcgggccgtcggcgacagcttgcggtacttctcccatatgaatttcgtgtagtggtcgccagcaaacagcacgacgatttcctcgtcgatcaggacctggcaacgggacgttttcttgccacggtccaggacgcggaagcggtgcagcagcgacaccgattccaggtgcccaacgcggtcggacgtgaagcccatcgccgtcgcctgtaggcgcgacaggcattcctcggccttcgtgtaataccggccattgatcgaccagcccaggtcctggcaaagctcgtagaacgtgaaggtgatcggctcgccgataggggtgcgcttcgcgtactccaacacctgctgccacaccagttcgtcatcgtcggcccgcagctcgacgccggtgtaggtgatcttcacgtccttgttgacgtggaaaatgaccttgttttgcagcgcctcgcgcgggattttcttgttgcgcgtggtgaacagggcagagcgggccgtgtcgtttggcatcgctcgcatcgtgtccggccacggcgcaatatcgaacaaggaaagctgcatttccttgatctgctgcttcgtgtgtttcagcaacgcggcctgcttggcctcgctgacctgttttgccaggtcctcgccggcggtttttcgcttcttggtcgtcatagttcctcgcgtgtcgatggtcatcgacttcgccaaacctgccgcctcctgttcgagacgacgcgaacgctccacggcggccgatggcgcgggcagggcagggggagccagttgcacgctgtcgcgctcgatcttggccgtagcttgctggaccatcgagccgacggactggaaggtttcgcggggcgcacgcatgacggtgcggcttgcgatggtttcggcatcctcggcggaaaaccccgcgtcgatcagttcttgcctgtatgccttccggtcaaacgtccgattcattcaccctccttgcgggattgccccgactcacgccggggcaatgtgcccttattcctgatttgacccgcctggtgccttggtgtccagataatccaccttatcggcaatgaagtcggtcccgtagaccgtctggccgtccttctcgtacttggtattccgaatcttgccctgcacgaataccagcgaccccttgcccaaatacttgccgtgggcctcggcctgagagccaaaacacttgatgcggaagaagtcggtgcgctcctgcttgtcgccggcatcgttgcgccacatctaggtactaaaacaattcatccagtaaaatataatattttattttctcccaatcaggcttgatccccagtaagtcaaaaaatagctcgacatactgttcttccccgatatcctccctgatcgaccggacgcagaaggcaatgtcataccacttgtccgccctgccgcttctcccaagatcaataaagccacttactttgccatctttcacaaagatgttgctgtctcccaggtcgccgtgggaaaagacaagttcctcttcgggcttttccgtctttaaaaaatcatacagctcgcgcggatctttaaatggagtgtcttcttcccagttttcgcaatccacatcggccagatcgttattcagtaagtaatccaattcggctaagcggctgtctaagctattcgtatagggacaatccgatatgtcgatggagtgaaagagcctgatgcactccgcatacagctcgataatcttttcagggctttgttcatcttcatactcttccgagcaaaggacgccatcggcctcactcatgagcagattgctccagccatcatgccgttcaaagtgcaggacctttggaacaggcagctttccttccagccatagcatcatgtccttttcccgttccacatcataggtggtccctttataccggctgtccgtcatttttaaatataggttttcattttctcccaccagcttatataccttagcaggagacattccttccgtatcttttacgcagcggtatttttcgatcagttttttcaattccggtgatattctcattttagccatttattatttccttcctcttttctacagtatttaaagataccccaagaagctaattataacaagacgaactccaattcactgttccttgcattctaaaaccttaaataccagaaaacagctttttcaaagttgttttcaaagttggcgtataacatagtatcgacggagccgattttgaaaccacaattatgggtgatgctgccaacttactgatttagtgtatgatggtgtttttgaggtgctccagtggcttctgtgtctatcagctgtccctcctgttcagctactgacggggtggtgcgtaacggcaaaagcaccgccggacatcagcgctatctctgctctcactgccgtaaaacatggcaactgcagttcacttacaccgcttctcaacccggtacgcaccagaaaatcattgatatggccatgaatggcgttggatgccgggcaacagcccgcattatgggcgttggcctcaacacgattttacgtcacttaaaaaactcaggccgcagtcggtaacctcgcgcatacagccgggcagtgacgtcatcgtctgcgcggaaatggacgaacagtggggctatgtcggggctaaatcgcgccagcgctggctgttttacgcgtatgacagtctccggaagacggttgttgcgcacgtattcggtgaacgcactatggcgacgctggggcgtcttatgagcctgctgtcaccctttgacgtggtgatatggatgacggatggctggccgctgtatgaatcccgcctgaagggaaagctgcacgtaatcagcaagcgatatacgcagcgaattgagcggcataacctgaatctgaggcagcacctggcacggctgggacggaagtcgctgtcgttctcaaaatcggtggagctgcatgacaaagtcatcgggcattatctgaacataaaacactatcaataagttggagtcattacccaattatgatagaatttacaagctataaggttattgtcctgggtttcaagcattagtccatgcaagtttttatgctttgcccattctatagatatattgataagcgcgctgcctatgccttgccccctgaaatccttacatacggcgatatcttctatataaaagatatattatcttatcagtattgtcaatatattcaaggcaatctgcctcctcatcctcttcatcctcttcgtcttggtagctttttaaatatggcgcttcatagagtaattctgtaaaggtccaattctcgttttcatacctcggtataatcttacctatcacctcaaatggttcgctgggtttatcgcacccccgaacacgagcacggcacccgcgaccactatgccaagaatgcccaaggtaaaaattgccggccccgccatgaagtccgtgaatgccccgacggccgaagtgaagggcaggccgccacccaggccgccgccctcactgcccggcacctggtcgctgaatgtcgatgccagcacctgcggcacgtcaatgcttccgggcgtcgcgctcgggctgatcgcccatcccgttactgccccgatcccggcaatggcaaggactgccagcgctgccatttttggggtgaggccgttcgcggccgaggggcgcagcccctggggggatgggaggcccgcgttagcgggccgggagggttcgagaagggggggcaccccccttcggcgtgcgcggtcacgcgcacagggcgcagccctggttaaaaacaaggtttataaatattggtttaaaagcaggttaaaagacaggttagcggtggccgaaaaacgggcggaaacccttgcaaatgctggattttctgcctgtggacagcccctcaaatgtcaataggtgcgcccctcatctgtcagcactctgcccctcaagtgtcaaggatcgcgcccctcatctgtcagtagtcgcgcccctcaagtgtcaataccgcagggcacttatccccaggcttgtccacatcatctgtgggaaactcgcgtaaaatcaggcgttttcgccgatttgcgaggctggccagctccacgtcgccggccgaaatcgagcctgcccctcatctgtcaacgccgcgccgggtgagtcggcccctcaagtgtcaacgtccgcccctcatctgtcagtgagggccaagttttccgcgaggtatccacaacgccggcggccgcggtgtctcgcacacggcttcgacggcgtttctggcgcgtttgcagggccatagacggccgccagcccagcggcgagggcaaccagcccgg</GBSeq_sequence>
+</GBSeq>
+
+</GBSet>
+
diff --git a/node_modules/xmldoc/.npmignore b/node_modules/xmldoc/.npmignore
new file mode 100644
index 0000000..d1c1357
--- /dev/null
+++ b/node_modules/xmldoc/.npmignore
@@ -0,0 +1,2 @@
+# Ignore dependencies
+node_modules
diff --git a/node_modules/xmldoc/LICENSE b/node_modules/xmldoc/LICENSE
new file mode 100644
index 0000000..08d2b8c
--- /dev/null
+++ b/node_modules/xmldoc/LICENSE
@@ -0,0 +1,23 @@
+Copyright 2012 Nick Farina.
+All rights reserved.
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/xmldoc/README.md b/node_modules/xmldoc/README.md
new file mode 100644
index 0000000..e43af70
--- /dev/null
+++ b/node_modules/xmldoc/README.md
@@ -0,0 +1,110 @@
+
+## Introduction
+
+`xmldoc` lets you parse XML documents with ease. It's a pure-JavaScript, one-file XML document class with a single dependency on the excellent [`sax`][sax] parser.
+
+For more on why I wrote this class, see the [blog post][blog].
+
+  [blog]: http://nfarina.com/post/34302964969/a-lightweight-xml-document-class-for-nodejs-javascript
+
+## Installation
+
+    npm install xmldoc
+
+Or just download the repository and include it in your `node_modules` directly. Or just download the [single JS file][blob]!
+
+  [blob]: https://github.com/nfarina/xmldoc/blob/master/lib/xmldoc.js
+
+## Usage
+
+    var xmldoc = require('../lib/xmldoc');
+
+    var document = new xmldoc.XmlDocument("<some>xml</some>");
+
+    ... do things
+
+## Classes
+
+The primary exported class is `XmlDocument`, which you'll use to consume your XML text. `XmlDocument` contains a hierarchy of `XmlElement` instances representing the XML structure.
+
+Both `XmlElement` and `XmlDocument` contain the same members and methods you can call to traverse the document or a subtree.
+
+## Members
+
+* `name` - the node name, like "tat" for `<tat>`.
+* `attr` - an object dict containing attribute properties, like `bookNode.attr.title` for `<book title="...">`.
+* `val` - the string "value" of the node, if any, like "world" for `<hello>world</hello>`.
+* `children` - an array of `XmlElement` children of the node.
+
+Each member defaults to a sensible "empty" value like `{}` for `attr`, `[]` for `children`, and `""` for `val`.
+
+## Methods
+
+All methods with `child` in the name operate only on direct children; they do not do a deep/recursive search.
+
+### eachChild(func)
+
+Similar to [underscore's][underscore] `each` method, it will call `func(child, index, array)` for each child of the given node.
+
+### childNamed(name)
+
+Pass it the name of a child node and it will search for and return the first one found, or `undefined`.
+
+### childrenNamed(name)
+
+Like `childNamed` but returns all matching children in an array, or `[]`.
+
+### childWithAttribute(name,value)
+
+Searches for the first child with the given attribute value. You can omit `value` to just find the first node with the given attribute defined at all.
+
+### descendantWithPath(path)
+
+Searches for a specific "path" uses dot notation. Example:
+
+    <book>
+      <author>
+        <name isProper="true">George R. R. Martin</name>
+        ...
+      </author>
+      ...
+    </book>
+
+If you just want the `<name>` node and you have the `XmlElement` for the `<book>` node, you can say:
+
+    var nameNode = bookNode.descendantWithPath("author.name"); // return <name> node
+
+### valueWithPath(path)
+
+Just like `descendantWithPath`, but goes deeper and extracts the `val` of the node. Example:
+
+    var authorName = bookNode.valueWithPath("author.name"); // return "George R. R. Martin"
+
+You can also use the `@` character to request the value of a particular _attribute_ instead:
+
+    var authorIsProper = bookNode.valueWithPath("author.name@isProper"); // return "true"
+
+This is not [XPath][]! It's just a thing I made up, OK?
+
+### toString()
+
+This is just an override of the standard JavaScript method, it will give you the pretty-printed string representation of your XML document or element. Note that this is for debugging only! It will truncate any long node values.
+  
+    var xml = "<author><name>looooooong value</name></author>";
+    console.log("My document: \n" + new XmlDocument(xml))
+
+Prints:
+
+    My Document:
+    <hello>
+      loooooooo…
+    </hello>
+
+## Feedback
+
+Feel free to file issues or hit me up on [Twitter][twitter].
+
+  [underscore]: http://underscorejs.org
+  [XPath]: http://en.wikipedia.org/wiki/XPath
+  [twitter]: http://twitter.com/nfarina
+  [sax]: https://github.com/isaacs/sax-js
diff --git a/node_modules/xmldoc/examples/example.js b/node_modules/xmldoc/examples/example.js
new file mode 100644
index 0000000..646b71e
--- /dev/null
+++ b/node_modules/xmldoc/examples/example.js
@@ -0,0 +1,52 @@
+
+// Designed to be run from Node.js - i.e. "node example.js"
+
+var XmlDocument = require('../lib/xmldoc').XmlDocument;
+
+// Demonstrate parsing an in-memory XML string
+var xmlString = '<suggestions><book title="Twilight"/><book title="Twister"/></suggestions>'
+
+var suggestions = new XmlDocument(xmlString);
+
+// Demonstrate how toString() will pretty-print an abbreviated version of the XML for debugging
+console.log("Parsed: \n%s", suggestions);
+
+// Demonstrate a simple eachChild() loop, printing our book titles
+suggestions.eachChild(function(book) {
+  console.log("Found book with title: '%s'", book.attr.title);
+});
+
+// Now load an XML file from disk and parse it
+var fs = require('fs'),
+    path = require('path')
+
+fs.readFile(path.join(__dirname, "test.xml"), 'utf8', function (err,data) {
+  
+  if (err) {
+    return console.log(err);
+  }
+
+  // Parse the XML
+  var results = new XmlDocument(data);
+
+  // Pull out the <books> node
+  var books = results.childNamed("books");
+
+  // Print out the ISBNs
+  books.eachChild(function (book) {
+    console.log("Found book with ISBN '%s'", book.attr.isbn);
+  });
+
+  // Look for all children with a certain node name
+  var allBooks = books.childrenNamed("book");
+
+  // The result is an array of <book> XmlElement instances
+  console.log("Found %s books.", allBooks.length);
+
+  // Search for a particular book
+  twilight = books.childWithAttribute("isbn","478-2-23-765712-2");
+
+  // Result is a single XmlElement instance for <book>
+  console.log("Title of book with given ISBN: '%s'", twilight.valueWithPath("title"));
+
+});
\ No newline at end of file
diff --git a/node_modules/xmldoc/examples/test.html b/node_modules/xmldoc/examples/test.html
new file mode 100644
index 0000000..b99e855
--- /dev/null
+++ b/node_modules/xmldoc/examples/test.html
@@ -0,0 +1,25 @@
+<!doctype html>
+
+<html lang="en">
+<head>
+  <title>xmldoc browser test</title>
+  <script type="text/javascript" src="../node_modules/sax/lib/sax.js"></script>
+  <script type="text/javascript" src="../lib/xmldoc.js"></script>
+  <script type="text/javascript">
+    // Demonstrate parsing an in-memory XML string
+    var xmlString = '<suggestions><book title="Twilight"/><book title="Twister"/></suggestions>'
+
+    var suggestions = new XmlDocument(xmlString);
+
+    // Demonstrate how toString() will pretty-print an abbreviated version of the XML for debugging
+    console.log("Parsed: \n" + suggestions);
+
+    // Demonstrate a simple eachChild() loop, printing our book titles
+    suggestions.eachChild(function(book) {
+      document.write("<p>Found book with title: '" + book.attr.title + "'</p>");
+    });
+</script>
+</head>
+<body>
+</body>
+</html>
diff --git a/node_modules/xmldoc/examples/test.xml b/node_modules/xmldoc/examples/test.xml
new file mode 100644
index 0000000..8a52f31
--- /dev/null
+++ b/node_modules/xmldoc/examples/test.xml
@@ -0,0 +1,20 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<results totalResults="74">
+    <books>
+        <book isbn="978-3-16-148410-0">
+            <title>Harry Potter and the Half-Blood Prince</title>
+            <price>29.95</price>
+            <authors>
+                <author>J.K. Rowling</author>
+            </authors>
+        </book>
+        <book isbn="478-2-23-765712-2">
+            <title>Twilight</title>
+            <price>19.95</price>
+            <authors>
+                <author>Stephenie Meyer</author>
+                <author>The Hand of God</author>
+            </authors>
+        </book>
+    </books> 
+</results>
\ No newline at end of file
diff --git a/node_modules/xmldoc/index.js b/node_modules/xmldoc/index.js
new file mode 100644
index 0000000..f1948a5
--- /dev/null
+++ b/node_modules/xmldoc/index.js
@@ -0,0 +1,3 @@
+// This file is just added for convenience so this repository can be
+// directly checked out into a project's deps folder
+module.exports = require('./lib/xmldoc');
diff --git a/node_modules/xmldoc/lib/xmldoc.js b/node_modules/xmldoc/lib/xmldoc.js
new file mode 100644
index 0000000..03f9b49
--- /dev/null
+++ b/node_modules/xmldoc/lib/xmldoc.js
@@ -0,0 +1,210 @@
+(function () {
+
+// global on the server, window in the browser
+var sax, root = this;
+
+if (typeof module !== 'undefined' && module.exports) {
+  sax = require('sax');
+  root = module.exports;
+}
+else {
+  sax = root.sax;
+  if (!sax) // no sax for you!
+    throw new Error("Expected sax to be defined. Make sure you're including sax.js before this file.");
+}
+
+/*
+XmlElement is our basic building block. Everything is an XmlElement; even XmlDocument
+behaves like an XmlElement by inheriting its attributes and functions.
+*/
+
+function XmlElement(tag) {
+  this.name = tag.name;
+  this.attr = tag.attributes || {};
+  this.val = "";
+  this.children = [];
+}
+
+// SaxParser handlers
+
+XmlElement.prototype._opentag = function(tag) {
+
+  var child = new XmlElement(tag);
+  
+  // add to our children array
+  this.children.push(child);
+
+  // update first/last pointers
+  if (!this.firstChild) this.firstChild = child;
+  this.lastChild = child;
+
+  delegates.unshift(child);
+}
+
+XmlElement.prototype._closetag = function() {
+  delegates.shift();
+}
+
+XmlElement.prototype._text = function(text) {
+  if (text) this.val += text;
+}
+
+XmlElement.prototype._cdata = function(cdata) {
+  if (cdata) this.val += cdata;
+}
+
+// Useful functions
+
+XmlElement.prototype.eachChild = function(iterator, context) {
+  for (var i=0, l=this.children.length; i<l; i++)
+    if (iterator.call(context, this.children[i], i, this.children) === false) return;
+}
+
+XmlElement.prototype.childNamed = function(name) {
+  for (var i=0, l=this.children.length; i<l; i++) {
+    var child = this.children[i];
+    if (child.name === name) return child;
+  }
+}
+
+XmlElement.prototype.childrenNamed = function(name) {
+  var matches = [];
+
+  for (var i=0, l=this.children.length; i<l; i++)
+    if (this.children[i].name === name)
+      matches.push(this.children[i]);
+
+  return matches;
+}
+
+XmlElement.prototype.childWithAttribute = function(name,value) {
+  for (var i=0, l=this.children.length; i<l; i++) {
+    var child = this.children[i];
+    if ( (value && child.attr[name] === value) || (!value && child.attr[name]) )
+      return child;
+  }
+}
+
+XmlElement.prototype.descendantWithPath = function(path) {
+  var descendant = this;
+  var components = path.split('.');
+
+  for (var i=0, l=components.length; i<l; i++)
+    if (descendant)
+      descendant = descendant.childNamed(components[i]);
+    else
+      return undefined;
+
+  return descendant;
+}
+
+XmlElement.prototype.valueWithPath = function(path) {
+  var components = path.split('@');
+  var descendant = this.descendantWithPath(components[0]);
+  if (descendant)
+    return components.length > 1 ? descendant.attr[components[1]] : descendant.val;
+}
+
+// String formatting (for debugging)
+
+XmlElement.prototype.toString = function() {
+  return this.toStringWithIndent("");
+}
+
+XmlElement.prototype.toStringWithIndent = function(indent) {
+  var s = "";
+  s += indent + "<" + this.name;
+  
+  for (var name in this.attr)
+    s += " " + name + '="' + this.attr[name] + '"';
+
+  var trimVal = this.val.trim();
+
+  if (trimVal.length > 25)
+    trimVal = trimVal.substring(0,25).trim() + "…";
+  
+  if (this.children.length) {
+    s += ">\n";
+    
+    var childIndent = indent + "  ";
+    
+    if (trimVal.length)
+      s += childIndent + trimVal + "\n";
+
+    for (var i=0, l=this.children.length; i<l; i++)
+      s += this.children[i].toStringWithIndent(childIndent) + "\n";
+    
+    s += indent + "</" + this.name + ">";
+  }
+  else if (trimVal.length) {
+    s += ">" + trimVal + "</" + this.name +">";
+  }
+  else s += "/>";
+  
+  return s;
+}
+
+/*
+XmlDocument is the class we expose to the user; it uses the sax parser to create a hierarchy
+of XmlElements.
+*/
+
+function XmlDocument(xml) {
+  xml && (xml = xml.toString().trim());
+
+  if (!xml)
+    throw new Error("No XML to parse!")
+
+  var parser = sax.parser(true) // strict
+  addParserEvents(parser);
+
+  // We'll use the file-scoped "delegates" var to remember what elements we're currently
+  // parsing; they will push and pop off the stack as we get deeper into the XML hierarchy.
+  // It's safe to use a global because JS is single-threaded.
+  delegates = [this];
+  
+  parser.write(xml);
+}
+
+// make XmlDocument inherit XmlElement's methods
+extend(XmlDocument.prototype, XmlElement.prototype);
+
+XmlDocument.prototype._opentag = function(tag) {
+  if (typeof this.children === 'undefined')
+    // the first tag we encounter should be the root - we'll "become" the root XmlElement
+    XmlElement.call(this,tag);
+  else
+    // all other tags will be the root element's children
+    XmlElement.prototype._opentag.apply(this,arguments);
+}
+
+// file-scoped global stack of delegates
+var delegates = null;
+
+/*
+Helper functions
+*/
+
+function addParserEvents(parser) {
+  parser.onopentag = parser_opentag;
+  parser.onclosetag = parser_closetag;
+  parser.ontext = parser_text;
+  parser.oncdata = parser_cdata;
+}
+
+// create these closures and cache them by keeping them file-scoped
+function parser_opentag() { delegates[0]._opentag.apply(delegates[0],arguments) }
+function parser_closetag() { delegates[0]._closetag.apply(delegates[0],arguments) }
+function parser_text() { delegates[0]._text.apply(delegates[0],arguments) }
+function parser_cdata() { delegates[0]._cdata.apply(delegates[0],arguments) }
+
+// a relatively standard extend method
+function extend(destination, source) {
+  for (var prop in source)
+    if (source.hasOwnProperty(prop))
+      destination[prop] = source[prop];
+}
+
+root.XmlDocument = XmlDocument;
+
+})()
\ No newline at end of file
diff --git a/node_modules/xmldoc/node_modules/sax/AUTHORS b/node_modules/xmldoc/node_modules/sax/AUTHORS
new file mode 100644
index 0000000..6a6005a
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/AUTHORS
@@ -0,0 +1,10 @@
+# contributors sorted by whether or not they're me.
+Isaac Z. Schlueter <i@izs.me>
+Stein Martin Hustad <stein@hustad.com>
+Mikeal Rogers <mikeal.rogers@gmail.com>
+Laurie Harper <laurie@holoweb.net>
+Jann Horn <jann@Jann-PC.fritz.box>
+Elijah Insua <tmpvar@gmail.com>
+Henry Rawas <henryr@schakra.com>
+Justin Makeig <jmpublic@makeig.com>
+Mike <mike@emotive.com>
diff --git a/node_modules/xmldoc/node_modules/sax/LICENSE b/node_modules/xmldoc/node_modules/sax/LICENSE
new file mode 100644
index 0000000..05a4010
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/LICENSE
@@ -0,0 +1,23 @@
+Copyright 2009, 2010, 2011 Isaac Z. Schlueter.
+All rights reserved.
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/xmldoc/node_modules/sax/README.md b/node_modules/xmldoc/node_modules/sax/README.md
new file mode 100644
index 0000000..7de646e
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/README.md
@@ -0,0 +1,216 @@
+# sax js
+
+A sax-style parser for XML and HTML.
+
+Designed with [node](http://nodejs.org/) in mind, but should work fine in
+the browser or other CommonJS implementations.
+
+## What This Is
+
+* A very simple tool to parse through an XML string.
+* A stepping stone to a streaming HTML parser.
+* A handy way to deal with RSS and other mostly-ok-but-kinda-broken XML 
+  docs.
+
+## What This Is (probably) Not
+
+* An HTML Parser - That's a fine goal, but this isn't it.  It's just
+  XML.
+* A DOM Builder - You can use it to build an object model out of XML,
+  but it doesn't do that out of the box.
+* XSLT - No DOM = no querying.
+* 100% Compliant with (some other SAX implementation) - Most SAX
+  implementations are in Java and do a lot more than this does.
+* An XML Validator - It does a little validation when in strict mode, but
+  not much.
+* A Schema-Aware XSD Thing - Schemas are an exercise in fetishistic 
+  masochism.
+* A DTD-aware Thing - Fetching DTDs is a much bigger job.
+
+## Regarding `<!DOCTYPE`s and `<!ENTITY`s
+
+The parser will handle the basic XML entities in text nodes and attribute
+values: `&amp; &lt; &gt; &apos; &quot;`. It's possible to define additional
+entities in XML by putting them in the DTD. This parser doesn't do anything
+with that. If you want to listen to the `ondoctype` event, and then fetch
+the doctypes, and read the entities and add them to `parser.ENTITIES`, then
+be my guest.
+
+Unknown entities will fail in strict mode, and in loose mode, will pass
+through unmolested.
+
+## Usage
+
+    var sax = require("./lib/sax"),
+      strict = true, // set to false for html-mode
+      parser = sax.parser(strict);
+
+    parser.onerror = function (e) {
+      // an error happened.
+    };
+    parser.ontext = function (t) {
+      // got some text.  t is the string of text.
+    };
+    parser.onopentag = function (node) {
+      // opened a tag.  node has "name" and "attributes"
+    };
+    parser.onattribute = function (attr) {
+      // an attribute.  attr has "name" and "value"
+    };
+    parser.onend = function () {
+      // parser stream is done, and ready to have more stuff written to it.
+    };
+
+    parser.write('<xml>Hello, <who name="world">world</who>!</xml>').close();
+
+    // stream usage
+    // takes the same options as the parser
+    var saxStream = require("sax").createStream(strict, options)
+    saxStream.on("error", function (e) {
+      // unhandled errors will throw, since this is a proper node
+      // event emitter.
+      console.error("error!", e)
+      // clear the error
+      this._parser.error = null
+      this._parser.resume()
+    })
+    saxStream.on("opentag", function (node) {
+      // same object as above
+    })
+    // pipe is supported, and it's readable/writable
+    // same chunks coming in also go out.
+    fs.createReadStream("file.xml")
+      .pipe(saxStream)
+      .pipe(fs.createReadStream("file-copy.xml"))
+
+
+
+## Arguments
+
+Pass the following arguments to the parser function.  All are optional.
+
+`strict` - Boolean. Whether or not to be a jerk. Default: `false`.
+
+`opt` - Object bag of settings regarding string formatting.  All default to `false`.
+
+Settings supported:
+
+* `trim` - Boolean. Whether or not to trim text and comment nodes.
+* `normalize` - Boolean. If true, then turn any whitespace into a single
+  space.
+* `lowercase` - Boolean. If true, then lowercase tag names and attribute names
+  in loose mode, rather than uppercasing them.
+* `xmlns` - Boolean. If true, then namespaces are supported.
+* `position` - Boolean. If false, then don't track line/col/position.
+
+## Methods
+
+`write` - Write bytes onto the stream. You don't have to do this all at
+once. You can keep writing as much as you want.
+
+`close` - Close the stream. Once closed, no more data may be written until
+it is done processing the buffer, which is signaled by the `end` event.
+
+`resume` - To gracefully handle errors, assign a listener to the `error`
+event. Then, when the error is taken care of, you can call `resume` to
+continue parsing. Otherwise, the parser will not continue while in an error
+state.
+
+## Members
+
+At all times, the parser object will have the following members:
+
+`line`, `column`, `position` - Indications of the position in the XML
+document where the parser currently is looking.
+
+`startTagPosition` - Indicates the position where the current tag starts.
+
+`closed` - Boolean indicating whether or not the parser can be written to.
+If it's `true`, then wait for the `ready` event to write again.
+
+`strict` - Boolean indicating whether or not the parser is a jerk.
+
+`opt` - Any options passed into the constructor.
+
+`tag` - The current tag being dealt with.
+
+And a bunch of other stuff that you probably shouldn't touch.
+
+## Events
+
+All events emit with a single argument. To listen to an event, assign a
+function to `on<eventname>`. Functions get executed in the this-context of
+the parser object. The list of supported events are also in the exported
+`EVENTS` array.
+
+When using the stream interface, assign handlers using the EventEmitter
+`on` function in the normal fashion.
+
+`error` - Indication that something bad happened. The error will be hanging
+out on `parser.error`, and must be deleted before parsing can continue. By
+listening to this event, you can keep an eye on that kind of stuff. Note:
+this happens *much* more in strict mode. Argument: instance of `Error`.
+
+`text` - Text node. Argument: string of text.
+
+`doctype` - The `<!DOCTYPE` declaration. Argument: doctype string.
+
+`processinginstruction` - Stuff like `<?xml foo="blerg" ?>`. Argument:
+object with `name` and `body` members. Attributes are not parsed, as
+processing instructions have implementation dependent semantics.
+
+`sgmldeclaration` - Random SGML declarations. Stuff like `<!ENTITY p>`
+would trigger this kind of event. This is a weird thing to support, so it
+might go away at some point. SAX isn't intended to be used to parse SGML,
+after all.
+
+`opentag` - An opening tag. Argument: object with `name` and `attributes`.
+In non-strict mode, tag names are uppercased, unless the `lowercase`
+option is set.  If the `xmlns` option is set, then it will contain
+namespace binding information on the `ns` member, and will have a
+`local`, `prefix`, and `uri` member.
+
+`closetag` - A closing tag. In loose mode, tags are auto-closed if their
+parent closes. In strict mode, well-formedness is enforced. Note that
+self-closing tags will have `closeTag` emitted immediately after `openTag`.
+Argument: tag name.
+
+`attribute` - An attribute node.  Argument: object with `name` and `value`.
+In non-strict mode, attribute names are uppercased, unless the `lowercase`
+option is set.  If the `xmlns` option is set, it will also contains namespace
+information.
+
+`comment` - A comment node.  Argument: the string of the comment.
+
+`opencdata` - The opening tag of a `<![CDATA[` block.
+
+`cdata` - The text of a `<![CDATA[` block. Since `<![CDATA[` blocks can get
+quite large, this event may fire multiple times for a single block, if it
+is broken up into multiple `write()`s. Argument: the string of random
+character data.
+
+`closecdata` - The closing tag (`]]>`) of a `<![CDATA[` block.
+
+`opennamespace` - If the `xmlns` option is set, then this event will
+signal the start of a new namespace binding.
+
+`closenamespace` - If the `xmlns` option is set, then this event will
+signal the end of a namespace binding.
+
+`end` - Indication that the closed stream has ended.
+
+`ready` - Indication that the stream has reset, and is ready to be written
+to.
+
+`noscript` - In non-strict mode, `<script>` tags trigger a `"script"`
+event, and their contents are not checked for special xml characters.
+If you pass `noscript: true`, then this behavior is suppressed.
+
+## Reporting Problems
+
+It's best to write a failing test if you find an issue.  I will always
+accept pull requests with failing tests if they demonstrate intended
+behavior, but it is very hard to figure out what issue you're describing
+without a test.  Writing a test is also the best way for you yourself
+to figure out if you really understand the issue you think you have with
+sax-js.
diff --git a/node_modules/xmldoc/node_modules/sax/examples/big-not-pretty.xml b/node_modules/xmldoc/node_modules/sax/examples/big-not-pretty.xml
new file mode 100644
index 0000000..fb5265d
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/examples/big-not-pretty.xml
@@ -0,0 +1,8002 @@
+<big>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
+</big>
diff --git a/node_modules/xmldoc/node_modules/sax/examples/example.js b/node_modules/xmldoc/node_modules/sax/examples/example.js
new file mode 100644
index 0000000..f6bcef1
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/examples/example.js
@@ -0,0 +1,41 @@
+
+var fs = require("fs"),
+  util = require('util'),
+  path = require("path"),
+  xml = fs.cat(path.join(__dirname, "test.xml")),
+  sax = require("../lib/sax"),
+  strict = sax.parser(true),
+  loose = sax.parser(false, {trim:true}),
+  inspector = function (ev) { return function (data) {
+    // util.error("");
+    // util.error(ev+": "+util.inspect(data));
+    // for (var i in data) util.error(i+ " "+util.inspect(data[i]));
+    // util.error(this.line+":"+this.column);
+  }};
+
+xml.addCallback(function (xml) {
+  // strict.write(xml);
+  
+  sax.EVENTS.forEach(function (ev) {
+    loose["on"+ev] = inspector(ev);
+  });
+  loose.onend = function () {
+    // util.error("end");
+    // util.error(util.inspect(loose));
+  };
+  
+  // do this one char at a time to verify that it works.
+  // (function () {
+  //   if (xml) {
+  //     loose.write(xml.substr(0,1000));
+  //     xml = xml.substr(1000);
+  //     process.nextTick(arguments.callee);
+  //   } else loose.close();
+  // })();
+  
+  for (var i = 0; i < 1000; i ++) {
+    loose.write(xml);
+    loose.close();
+  }
+
+});
diff --git a/node_modules/xmldoc/node_modules/sax/examples/get-products.js b/node_modules/xmldoc/node_modules/sax/examples/get-products.js
new file mode 100644
index 0000000..9e8d74a
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/examples/get-products.js
@@ -0,0 +1,58 @@
+// pull out /GeneralSearchResponse/categories/category/items/product tags
+// the rest we don't care about.
+
+var sax = require("../lib/sax.js")
+var fs = require("fs")
+var path = require("path")
+var xmlFile = path.resolve(__dirname, "shopping.xml")
+var util = require("util")
+var http = require("http")
+
+fs.readFile(xmlFile, function (er, d) {
+  http.createServer(function (req, res) {
+    if (er) throw er
+    var xmlstr = d.toString("utf8")
+
+    var parser = sax.parser(true)
+    var products = []
+    var product = null
+    var currentTag = null
+
+    parser.onclosetag = function (tagName) {
+      if (tagName === "product") {
+        products.push(product)
+        currentTag = product = null
+        return
+      }
+      if (currentTag && currentTag.parent) {
+        var p = currentTag.parent
+        delete currentTag.parent
+        currentTag = p
+      }
+    }
+
+    parser.onopentag = function (tag) {
+      if (tag.name !== "product" && !product) return
+      if (tag.name === "product") {
+        product = tag
+      }
+      tag.parent = currentTag
+      tag.children = []
+      tag.parent && tag.parent.children.push(tag)
+      currentTag = tag
+    }
+
+    parser.ontext = function (text) {
+      if (currentTag) currentTag.children.push(text)
+    }
+
+    parser.onend = function () {
+      var out = util.inspect(products, false, 3, true)
+      res.writeHead(200, {"content-type":"application/json"})
+      res.end("{\"ok\":true}")
+      // res.end(JSON.stringify(products))
+    }
+
+    parser.write(xmlstr).end()
+  }).listen(1337)
+})
diff --git a/node_modules/xmldoc/node_modules/sax/examples/hello-world.js b/node_modules/xmldoc/node_modules/sax/examples/hello-world.js
new file mode 100644
index 0000000..cbfa518
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/examples/hello-world.js
@@ -0,0 +1,4 @@
+require("http").createServer(function (req, res) {
+  res.writeHead(200, {"content-type":"application/json"})
+  res.end(JSON.stringify({ok: true}))
+}).listen(1337)
diff --git a/node_modules/xmldoc/node_modules/sax/examples/not-pretty.xml b/node_modules/xmldoc/node_modules/sax/examples/not-pretty.xml
new file mode 100644
index 0000000..9592852
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/examples/not-pretty.xml
@@ -0,0 +1,8 @@
+<root>
+		something<else>  blerm <slurm 
+		
+		
+	attrib = 
+	"blorg"       ></else><!-- COMMENT!
+	
+--><![CDATA[processing...]]>  <selfclosing tag="blr>&quot;"/> a bit down here</root>
diff --git a/node_modules/xmldoc/node_modules/sax/examples/pretty-print.js b/node_modules/xmldoc/node_modules/sax/examples/pretty-print.js
new file mode 100644
index 0000000..cd6aca9
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/examples/pretty-print.js
@@ -0,0 +1,74 @@
+var sax = require("../lib/sax")
+  , printer = sax.createStream(false, {lowercasetags:true, trim:true})
+  , fs = require("fs")
+
+function entity (str) {
+  return str.replace('"', '&quot;')
+}
+
+printer.tabstop = 2
+printer.level = 0
+printer.indent = function () {
+  print("\n")
+  for (var i = this.level; i > 0; i --) {
+    for (var j = this.tabstop; j > 0; j --) {
+      print(" ")
+    }
+  }
+}
+printer.on("opentag", function (tag) {
+  this.indent()
+  this.level ++
+  print("<"+tag.name)
+  for (var i in tag.attributes) {
+    print(" "+i+"=\""+entity(tag.attributes[i])+"\"")
+  }
+  print(">")
+})
+
+printer.on("text", ontext)
+printer.on("doctype", ontext)
+function ontext (text) {
+  this.indent()
+  print(text)
+}
+
+printer.on("closetag", function (tag) {
+  this.level --
+  this.indent()
+  print("</"+tag+">")
+})
+
+printer.on("cdata", function (data) {
+  this.indent()
+  print("<![CDATA["+data+"]]>")
+})
+
+printer.on("comment", function (comment) {
+  this.indent()
+  print("<!--"+comment+"-->")
+})
+
+printer.on("error", function (error) {
+  console.error(error)
+  throw error
+})
+
+if (!process.argv[2]) {
+  throw new Error("Please provide an xml file to prettify\n"+
+    "TODO: read from stdin or take a file")
+}
+var xmlfile = require("path").join(process.cwd(), process.argv[2])
+var fstr = fs.createReadStream(xmlfile, { encoding: "utf8" })
+
+function print (c) {
+  if (!process.stdout.write(c)) {
+    fstr.pause()
+  }
+}
+
+process.stdout.on("drain", function () {
+  fstr.resume()
+})
+
+fstr.pipe(printer)
diff --git a/node_modules/xmldoc/node_modules/sax/examples/shopping.xml b/node_modules/xmldoc/node_modules/sax/examples/shopping.xml
new file mode 100644
index 0000000..223c6c6
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/examples/shopping.xml
@@ -0,0 +1,2 @@
+
+<GeneralSearchResponse xmlns="urn:types.partner.api.shopping.com"><serverDetail><apiEnv>sandbox</apiEnv><apiVersion>3.1 r31.Kadu4DC.phase3</apiVersion><buildNumber>5778</buildNumber><buildTimestamp>2011.10.06 15:37:23 PST</buildTimestamp><requestId>p2.a121bc2aaf029435dce6</requestId><timestamp>2011-10-21T18:38:45.982-04:00</timestamp><responseTime>P0Y0M0DT0H0M0.169S</responseTime></serverDetail><exceptions exceptionCount="1"><exception type="warning"><code>1112</code><message>You are currently using the SDC API sandbox environment!  No clicks to merchant URLs from this response will be paid.  Please change the host of your API requests to 'publisher.api.shopping.com' when you have finished development and testing</message></exception></exceptions><clientTracking height="19" type="logo" width="106"><sourceURL>http://statTest.dealtime.com/pixel/noscript?PV_EvnTyp=APPV&amp;APPV_APITSP=10%2F21%2F11_06%3A38%3A45_PM&amp;APPV_DSPRQSID=p2.a121bc2aaf029435dce6&amp;APPV_IMGURL=http://img.shopping.com/sc/glb/sdc_logo_106x19.gif&amp;APPV_LI_LNKINID=7000610&amp;APPV_LI_SBMKYW=nikon&amp;APPV_MTCTYP=1000&amp;APPV_PRTID=2002&amp;APPV_BrnID=14804</sourceURL><hrefURL>http://www.shopping.com/digital-cameras/products</hrefURL><titleText>Digital Cameras</titleText><altText>Digital Cameras</altText></clientTracking><searchHistory><categorySelection id="3"><name>Electronics</name><categoryURL>http://www.shopping.com/xCH-electronics-nikon~linkin_id-7000610?oq=nikon</categoryURL></categorySelection><categorySelection id="449"><name>Cameras and Photography</name><categoryURL>http://www.shopping.com/xCH-cameras_and_photography-nikon~linkin_id-7000610?oq=nikon</categoryURL></categorySelection><categorySelection id="7185"><name>Digital Cameras</name><categoryURL>http://www.shopping.com/digital-cameras/nikon/products?oq=nikon&amp;linkin_id=7000610</categoryURL></categorySelection><dynamicNavigationHistory><keywordSearch dropped="false" modified="false"><originalKeyword>nikon</originalKeyword><resultKeyword>nikon</resultKeyword></keywordSearch></dynamicNavigationHistory></searchHistory><categories matchedCategoryCount="1" returnedCategoryCount="1"><category id="7185"><name>Digital Cameras</name><categoryURL>http://www.shopping.com/digital-cameras/nikon/products?oq=nikon&amp;linkin_id=7000610</categoryURL><items matchedItemCount="322" pageNumber="1" returnedItemCount="5"><product id="101677489"><name>Nikon D3100 Digital Camera</name><shortDescription>14.2 Megapixel, SLR Camera, 3 in. LCD Screen, With High Definition Video, Weight: 1 lb.</shortDescription><fullDescription>The Nikon D3100 digital SLR camera speaks to the growing ranks of enthusiastic D-SLR users and aspiring photographers by providing an easy-to-use and affordable entrance to the world of Nikon D-SLR’s. The 14.2-megapixel D3100 has powerful features, such as the enhanced Guide Mode that makes it easy to unleash creative potential and capture memories with still images and full HD video. Like having a personal photo tutor at your fingertips, this unique feature provides a simple graphical interface on the camera’s LCD that guides users by suggesting and/or adjusting camera settings to achieve the desired end result images. The D3100 is also the world’s first D-SLR to introduce full time auto focus (AF) in Live View and D-Movie mode to effortlessly achieve the critical focus needed when shooting Full HD 1080p video.</fullDescription><images><image available="true" height="100" width="100"><sourceURL>http://di1.shopping.com/images/pi/93/bc/04/101677489-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di1.shopping.com/images/pi/93/bc/04/101677489-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di1.shopping.com/images/pi/93/bc/04/101677489-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di1.shopping.com/images/pi/93/bc/04/101677489-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="500" width="606"><sourceURL>http://di1.shopping.com/images/pi/93/bc/04/101677489-606x500-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></images><rating><reviewCount>9</reviewCount><rating>4.56</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/pr/sdc_stars_sm_4.5.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/Nikon-D3100/reviews~linkin_id-7000610</reviewURL></rating><minPrice>429.00</minPrice><maxPrice>1360.00</maxPrice><productOffersURL>http://www.shopping.com/Nikon-D3100/prices~linkin_id-7000610</productOffersURL><productSpecsURL>http://www.shopping.com/Nikon-D3100/info~linkin_id-7000610</productSpecsURL><offers matchedOfferCount="64" pageNumber="1" returnedOfferCount="5"><offer featured="false" id="-ZW6BMZqz6fbS-aULwga_g==" smartBuy="false" used="false"><name>Nikon D3100 Digital SLR Camera with 18-55mm NIKKOR VR Lens</name><description>The Nikon D3100 Digital SLR Camera is an affordable  compact  and lightweight photographic power-house. It features the all-purpose 18-55mm VR lens  a high-resolution 14.2 MP CMOS sensor along with a feature set that's comprehensive yet easy to navigate - the intuitive onboard learn-as-you grow guide mode allows the photographer to understand what the 3100 can do quickly and easily. Capture beautiful pictures and amazing Full HD 1080p movies with sound and full-time autofocus.  Availabilty: In Stock!</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di102.shopping.com/images/di/2d/5a/57/36424d5a717a366662532d61554c7767615f67-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di102.shopping.com/images/di/2d/5a/57/36424d5a717a366662532d61554c7767615f67-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di102.shopping.com/images/di/2d/5a/57/36424d5a717a366662532d61554c7767615f67-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="350" width="350"><sourceURL>http://di102.shopping.com/images/di/2d/5a/57/36424d5a717a366662532d61554c7767615f67-350x350-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Free Shipping with Any Purchase!</storeNotes><basePrice currency="USD">529.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">799.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=647&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=475674&amp;crawler_id=475674&amp;dealId=-ZW6BMZqz6fbS-aULwga_g%3D%3D&amp;url=http%3A%2F%2Fwww.fumfie.com%2Fproduct%2F343.5%2Fshopping-com%3F&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D3100+Digital+SLR+Camera+with+18-55mm+NIKKOR+VR+Lens&amp;dlprc=529.0&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=1&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=101677489&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=1&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=1&amp;SL=1&amp;FS=1&amp;code=&amp;acode=658&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="475674" trusted="true"><name>FumFie</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/475674.gif</sourceURL></logo><phoneNumber>866 666 9198</phoneNumber><ratingInfo><reviewCount>560</reviewCount><rating>4.27</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_45.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_fumfie~MRD-475674~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>F343C5</sku></offer><offer featured="false" id="md1e9lD8vdOu4FHQfJqKng==" smartBuy="false" used="false"><name>Nikon Nikon D3100 14.2MP Digital SLR Camera with 18-55mm f/3.5-5.6 AF-S DX VR, Cameras</name><description>Nikon D3100 14.2MP Digital SLR Camera with 18-55mm f/3.5-5.6 AF-S DX VR</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di109.shopping.com/images/di/6d/64/31/65396c443876644f7534464851664a714b6e67-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di109.shopping.com/images/di/6d/64/31/65396c443876644f7534464851664a714b6e67-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di109.shopping.com/images/di/6d/64/31/65396c443876644f7534464851664a714b6e67-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="352" width="385"><sourceURL>http://di109.shopping.com/images/di/6d/64/31/65396c443876644f7534464851664a714b6e67-385x352-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">549.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">549.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=779&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=305814&amp;crawler_id=305814&amp;dealId=md1e9lD8vdOu4FHQfJqKng%3D%3D&amp;url=http%3A%2F%2Fwww.electronics-expo.com%2Findex.php%3Fpage%3Ditem%26id%3DNIKD3100%26source%3DSideCar%26scpid%3D8%26scid%3Dscsho318727%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+Nikon+D3100+14.2MP+Digital+SLR+Camera+with+18-55mm+f%2F3.5-5.6+AF-S+DX+VR%2C+Cameras&amp;dlprc=549.0&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=9&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=101677489&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=9&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=771&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="305814" trusted="true"><name>Electronics Expo</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/305814.gif</sourceURL></logo><phoneNumber>1-888-707-EXPO</phoneNumber><ratingInfo><reviewCount>371</reviewCount><rating>3.90</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_4.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_electronics_expo~MRD-305814~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>NIKD3100</sku></offer><offer featured="false" id="yYuaXnDFtCY7rDUjkY2aaw==" smartBuy="false" used="false"><name>Nikon D3100 14.2-Megapixel Digital SLR Camera With 18-55mm Zoom-Nikkor Lens, Black</name><description>Split-second shutter response captures shots other cameras may have missed Helps eliminate the frustration of shutter delay! 14.2-megapixels for enlargements worth framing and hanging. Takes breathtaking 1080p HD movies. ISO sensitivity from 100-1600 for bright or dimly lit settings. 3.0in. color LCD for beautiful, wide-angle framing and viewing. In-camera image editing lets you retouch with no PC. Automatic scene modes include Child, Sports, Night Portrait and more. Accepts SDHC memory cards. Nikon D3100 14.2-Megapixel Digital SLR Camera With 18-55mm Zoom-Nikkor Lens, Black is one of many Digital SLR Cameras available through Office Depot. Made by Nikon.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di109.shopping.com/images/di/79/59/75/61586e4446744359377244556a6b5932616177-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di109.shopping.com/images/di/79/59/75/61586e4446744359377244556a6b5932616177-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="250" width="250"><sourceURL>http://di109.shopping.com/images/di/79/59/75/61586e4446744359377244556a6b5932616177-250x250-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">549.99</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">699.99</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=698&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=467671&amp;crawler_id=467671&amp;dealId=yYuaXnDFtCY7rDUjkY2aaw%3D%3D&amp;url=http%3A%2F%2Flink.mercent.com%2Fredirect.ashx%3Fmr%3AmerchantID%3DOfficeDepot%26mr%3AtrackingCode%3DCEC9669E-6ABC-E011-9F24-0019B9C043EB%26mr%3AtargetUrl%3Dhttp%3A%2F%2Fwww.officedepot.com%2Fa%2Fproducts%2F486292%2FNikon-D3100-142-Megapixel-Digital-SLR%2F%253fcm_mmc%253dMercent-_-Shopping-_-Cameras_and_Camcorders-_-486292&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D3100+14.2-Megapixel+Digital+SLR+Camera+With+18-55mm+Zoom-Nikkor+Lens%2C+Black&amp;dlprc=549.99&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=10&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=101677489&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=10&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=1&amp;SL=1&amp;FS=1&amp;code=&amp;acode=690&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="467671" trusted="true"><name>Office Depot</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/467671.gif</sourceURL></logo><phoneNumber>1-800-GO-DEPOT</phoneNumber><ratingInfo><reviewCount>135</reviewCount><rating>2.37</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_office_depot_4158555~MRD-467671~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>486292</sku></offer><offer featured="false" id="Rl56U7CuiTYsH4MGZ02lxQ==" smartBuy="false" used="false"><name>Nikon® D3100™ 14.2MP Digital SLR with 18-55mm Lens</name><description>The Nikon D3100 DSLR will surprise you with its simplicity and impress you with superb results.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di103.shopping.com/images/di/52/6c/35/36553743756954597348344d475a30326c7851-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di103.shopping.com/images/di/52/6c/35/36553743756954597348344d475a30326c7851-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="220" width="220"><sourceURL>http://di103.shopping.com/images/di/52/6c/35/36553743756954597348344d475a30326c7851-220x220-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">549.99</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.05</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">549.99</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=504&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=332477&amp;crawler_id=332477&amp;dealId=Rl56U7CuiTYsH4MGZ02lxQ%3D%3D&amp;url=http%3A%2F%2Ftracking.searchmarketing.com%2Fgsic.asp%3Faid%3D903483107%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon%C2%AE+D3100%E2%84%A2+14.2MP+Digital+SLR+with+18-55mm+Lens&amp;dlprc=549.99&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=11&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=101677489&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=11&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=496&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="332477" trusted="false"><name>RadioShack</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/332477.gif</sourceURL></logo><ratingInfo><reviewCount>24</reviewCount><rating>2.25</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_radioshack_9689~MRD-332477~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>9614867</sku></offer><offer featured="false" id="huS6xZKDKaKMTMP71eI6DA==" smartBuy="false" used="false"><name>Nikon D3100 SLR w/Nikon 18-55mm VR &amp; 55-200mm VR Lenses</name><description>14.2 Megapixels3" LCDLive ViewHD 1080p Video w/ Sound &amp; Autofocus11-point Autofocus3 Frames per Second ShootingISO 100 to 3200 (Expand to 12800-Hi2)Self Cleaning SensorEXPEED 2, Image Processing EngineScene Recognition System</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di105.shopping.com/images/di/68/75/53/36785a4b444b614b4d544d5037316549364441-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di105.shopping.com/images/di/68/75/53/36785a4b444b614b4d544d5037316549364441-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di105.shopping.com/images/di/68/75/53/36785a4b444b614b4d544d5037316549364441-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="345" width="345"><sourceURL>http://di105.shopping.com/images/di/68/75/53/36785a4b444b614b4d544d5037316549364441-345x345-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">695.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">695.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=371&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=487342&amp;crawler_id=487342&amp;dealId=huS6xZKDKaKMTMP71eI6DA%3D%3D&amp;url=http%3A%2F%2Fwww.rythercamera.com%2Fcatalog%2Fproduct_info.php%3Fcsv%3Dsh%26products_id%3D32983%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D3100+SLR+w%2FNikon+18-55mm+VR+%26+55-200mm+VR+Lenses&amp;dlprc=695.0&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=15&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=101677489&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=15&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=379&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="487342" trusted="false"><name>RytherCamera.com</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/487342.gif</sourceURL></logo><phoneNumber>1-877-644-7593</phoneNumber><ratingInfo><reviewCount>0</reviewCount></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>32983</sku></offer></offers></product><product id="95397883"><name>Nikon COOLPIX S203 Digital Camera</name><shortDescription>10 Megapixel, Ultra-Compact Camera, 2.5 in. LCD Screen, 3x Optical Zoom, With Video Capability, Weight: 0.23 lb.</shortDescription><fullDescription>With 10.34 mega pixel, electronic VR vibration reduction, 5-level brightness adjustment, 3x optical zoom, and TFT LCD, Nikon Coolpix s203 fulfills all the demands of any photographer. The digital camera has an inbuilt memory of 44MB and an external memory slot made for all kinds of SD (Secure Digital) cards.</fullDescription><images><image available="true" height="100" width="100"><sourceURL>http://di1.shopping.com/images/pi/c4/ef/1b/95397883-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di1.shopping.com/images/pi/c4/ef/1b/95397883-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di1.shopping.com/images/pi/c4/ef/1b/95397883-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di1.shopping.com/images/pi/c4/ef/1b/95397883-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="499" width="500"><sourceURL>http://di1.shopping.com/images/pi/c4/ef/1b/95397883-500x499-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image></images><rating><reviewCount>0</reviewCount></rating><minPrice>139.00</minPrice><maxPrice>139.00</maxPrice><productOffersURL>http://www.shopping.com/Nikon-Coolpix-S203/prices~linkin_id-7000610</productOffersURL><productSpecsURL>http://www.shopping.com/Nikon-Coolpix-S203/info~linkin_id-7000610</productSpecsURL><offers matchedOfferCount="1" pageNumber="1" returnedOfferCount="1"><offer featured="false" id="sBd2JnIEPM-A_lBAM1RZgQ==" smartBuy="false" used="false"><name>Nikon Coolpix S203 Digital Camera (Red)</name><description>With 10.34 mega pixel, electronic VR vibration reduction, 5-level brightness adjustment, 3x optical zoom, and TFT LCD, Nikon Coolpix s203 fulfills all the demands of any photographer. The digital camera has an inbuilt memory of 44MB and an external memory slot made for all kinds of SD (Secure Digital) cards.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di108.shopping.com/images/di/73/42/64/324a6e4945504d2d415f6c42414d31525a6751-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di108.shopping.com/images/di/73/42/64/324a6e4945504d2d415f6c42414d31525a6751-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di108.shopping.com/images/di/73/42/64/324a6e4945504d2d415f6c42414d31525a6751-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di108.shopping.com/images/di/73/42/64/324a6e4945504d2d415f6c42414d31525a6751-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="500" width="500"><sourceURL>http://di108.shopping.com/images/di/73/42/64/324a6e4945504d2d415f6c42414d31525a6751-500x500-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Fantastic prices with ease &amp; comfort of Amazon.com!</storeNotes><basePrice currency="USD">139.00</basePrice><shippingCost currency="USD">9.50</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">139.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=566&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=301531&amp;crawler_id=1903313&amp;dealId=sBd2JnIEPM-A_lBAM1RZgQ%3D%3D&amp;url=http%3A%2F%2Fwww.amazon.com%2Fdp%2FB002T964IM%2Fref%3Dasc_df_B002T964IM1751618%3Fsmid%3DA22UHVNXG98FAT%26tag%3Ddealtime-ce-mp01feed-20%26linkCode%3Dasn%26creative%3D395105%26creativeASIN%3DB002T964IM&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+Coolpix+S203+Digital+Camera+%28Red%29&amp;dlprc=139.0&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=63&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=95397883&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=63&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=518&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="301531" trusted="false"><name>Amazon Marketplace</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/301531.gif</sourceURL></logo><ratingInfo><reviewCount>213</reviewCount><rating>2.73</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_amazon_marketplace_9689~MRD-301531~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>B002T964IM</sku></offer></offers></product><product id="106834268"><name>Nikon S3100 Digital Camera</name><shortDescription>14.5 Megapixel, Compact Camera, 2.7 in. LCD Screen, 5x Optical Zoom, With High Definition Video, Weight: 0.23 lb.</shortDescription><fullDescription>This digital camera features a wide-angle optical Zoom-NIKKOR glass lens that allows you to capture anything from landscapes to portraits to action shots. The high-definition movie mode with one-touch recording makes it easy to capture video clips.</fullDescription><images><image available="true" height="100" width="100"><sourceURL>http://di1.shopping.com/images/pi/66/2d/33/106834268-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di1.shopping.com/images/pi/66/2d/33/106834268-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di1.shopping.com/images/pi/66/2d/33/106834268-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di1.shopping.com/images/pi/66/2d/33/106834268-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="387" width="507"><sourceURL>http://di1.shopping.com/images/pi/66/2d/33/106834268-507x387-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image></images><rating><reviewCount>1</reviewCount><rating>2.00</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/pr/sdc_stars_sm_2.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/nikon-s3100/reviews~linkin_id-7000610</reviewURL></rating><minPrice>99.95</minPrice><maxPrice>134.95</maxPrice><productOffersURL>http://www.shopping.com/nikon-s3100/prices~linkin_id-7000610</productOffersURL><productSpecsURL>http://www.shopping.com/nikon-s3100/info~linkin_id-7000610</productSpecsURL><offers matchedOfferCount="67" pageNumber="1" returnedOfferCount="5"><offer featured="false" id="UUyGoqV8r0-xrkn-rnGNbg==" smartBuy="false" used="false"><name>CoolPix S3100 14 Megapixel Compact Digital Camera- Red</name><description>Nikon Coolpix S3100 - Digital camera - compact - 14.0 Mpix - optical zoom: 5 x - supported memory: SD, SDXC, SDHC - red</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di111.shopping.com/images/di/55/55/79/476f71563872302d78726b6e2d726e474e6267-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di111.shopping.com/images/di/55/55/79/476f71563872302d78726b6e2d726e474e6267-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di111.shopping.com/images/di/55/55/79/476f71563872302d78726b6e2d726e474e6267-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di111.shopping.com/images/di/55/55/79/476f71563872302d78726b6e2d726e474e6267-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Get 30 days FREE SHIPPING w/ ShipVantage</storeNotes><basePrice currency="USD">119.95</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.95</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">139.95</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=578&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=485615&amp;crawler_id=485615&amp;dealId=UUyGoqV8r0-xrkn-rnGNbg%3D%3D&amp;url=http%3A%2F%2Fsears.rdr.channelintelligence.com%2Fgo.asp%3FfVhzOGNRAAQIASNiE1NbQBJpFHJ3Yx0CTAICI2BbH1lEFmgKP3QvUVpEREdlfUAUHAQPLVpFTVdtJzxAHUNYW3AhQBM0QhFvEXAbYh8EAAVmDAJeU1oyGG0GcBdhGwUGCAVqYF9SO0xSN1sZdmA7dmMdBQAJB24qX1NbQxI6AjA2ME5dVFULPDsGPFcQTTdaLTA6SR0OFlQvPAwMDxYcYlxIVkcoLTcCDA%3D%3D%26nAID%3D13736960%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=CoolPix+S3100+14+Megapixel+Compact+Digital+Camera-+Red&amp;dlprc=119.95&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=28&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=106834268&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=28&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=1&amp;FS=0&amp;code=&amp;acode=583&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="485615" trusted="true"><name>Sears</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/485615.gif</sourceURL></logo><phoneNumber>1-800-349-4358</phoneNumber><ratingInfo><reviewCount>888</reviewCount><rating>2.85</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_3.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_sears_4189479~MRD-485615~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>00337013000</sku></offer><offer featured="false" id="X87AwXlW1dXoMXk4QQDToQ==" smartBuy="false" used="false"><name>COOLPIX S3100 Pink</name><description>Nikon Coolpix S3100 - Digital camera - compact - 14.0 Mpix - optical zoom: 5 x - supported memory: SD, SDXC, SDHC - pink</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di111.shopping.com/images/di/58/38/37/4177586c573164586f4d586b34515144546f51-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di111.shopping.com/images/di/58/38/37/4177586c573164586f4d586b34515144546f51-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di111.shopping.com/images/di/58/38/37/4177586c573164586f4d586b34515144546f51-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di111.shopping.com/images/di/58/38/37/4177586c573164586f4d586b34515144546f51-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Get 30 days FREE SHIPPING w/ ShipVantage</storeNotes><basePrice currency="USD">119.95</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.95</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">139.95</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=578&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=485615&amp;crawler_id=485615&amp;dealId=X87AwXlW1dXoMXk4QQDToQ%3D%3D&amp;url=http%3A%2F%2Fsears.rdr.channelintelligence.com%2Fgo.asp%3FfVhzOGNRAAQIASNiE1NbQBJpFHJxYx0CTAICI2BbH1lEFmgKP3QvUVpEREdlfUAUHAQPLVpFTVdtJzxAHUNYW3AhQBM0QhFvEXAbYh8EAAVmb2JcUFxDEGsPc3QDEkFZVQ0WFhdRW0MWbgYWDlxzdGMdAVQWRi0xDAwPFhw9TSobb05eWVVYKzsLTFVVQi5RICs3SA8MU1s2MQQKD1wf%26nAID%3D13736960%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=COOLPIX+S3100+Pink&amp;dlprc=119.95&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=31&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=106834268&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=31&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=1&amp;FS=0&amp;code=&amp;acode=583&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="485615" trusted="true"><name>Sears</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/485615.gif</sourceURL></logo><phoneNumber>1-800-349-4358</phoneNumber><ratingInfo><reviewCount>888</reviewCount><rating>2.85</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_3.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_sears_4189479~MRD-485615~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>00337015000</sku></offer><offer featured="false" id="nvFwnpfA4rlA1Dbksdsa0w==" smartBuy="false" used="false"><name>Nikon Coolpix S3100 14.0 MP Digital Camera - Silver</name><description>Nikon Coolpix S3100 14.0 MP Digital Camera - Silver</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di109.shopping.com/images/di/6e/76/46/776e70664134726c413144626b736473613077-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di109.shopping.com/images/di/6e/76/46/776e70664134726c413144626b736473613077-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="270" width="270"><sourceURL>http://di109.shopping.com/images/di/6e/76/46/776e70664134726c413144626b736473613077-270x270-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">109.97</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">109.97</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=803&amp;BEFID=7185&amp;aon=%5E&amp;MerchantID=475774&amp;crawler_id=475774&amp;dealId=nvFwnpfA4rlA1Dbksdsa0w%3D%3D&amp;url=http%3A%2F%2Fwww.thewiz.com%2Fcatalog%2Fproduct.jsp%3FmodelNo%3DS3100SILVER%26gdftrk%3DgdfV2677_a_7c996_a_7c4049_a_7c26262&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+Coolpix+S3100+14.0+MP+Digital+Camera+-+Silver&amp;dlprc=109.97&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=33&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=106834268&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=33&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=797&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="475774" trusted="false"><name>TheWiz.com</name><logo available="false" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/475774.gif</sourceURL></logo><phoneNumber>877-542-6988</phoneNumber><ratingInfo><reviewCount>0</reviewCount></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>26262</sku></offer><offer featured="false" id="5GtaN2NeryKwps-Se2l-4g==" smartBuy="false" used="false"><name>Nikon� COOLPIX� S3100 14MP Digital Camera (Silver)</name><description>The Nikon COOLPIX S3100 is the easy way to share your life and stay connected.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di102.shopping.com/images/di/35/47/74/614e324e6572794b7770732d5365326c2d3467-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di102.shopping.com/images/di/35/47/74/614e324e6572794b7770732d5365326c2d3467-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="220" width="220"><sourceURL>http://di102.shopping.com/images/di/35/47/74/614e324e6572794b7770732d5365326c2d3467-220x220-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">119.99</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.05</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">119.99</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=504&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=332477&amp;crawler_id=332477&amp;dealId=5GtaN2NeryKwps-Se2l-4g%3D%3D&amp;url=http%3A%2F%2Ftracking.searchmarketing.com%2Fgsic.asp%3Faid%3D848064082%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon%C3%AF%C2%BF%C2%BD+COOLPIX%C3%AF%C2%BF%C2%BD+S3100+14MP+Digital+Camera+%28Silver%29&amp;dlprc=119.99&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=37&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=106834268&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=37&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=509&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="332477" trusted="false"><name>RadioShack</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/332477.gif</sourceURL></logo><ratingInfo><reviewCount>24</reviewCount><rating>2.25</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_radioshack_9689~MRD-332477~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>10101095</sku></offer><offer featured="false" id="a43m0RXulX38zCnQjU59jw==" smartBuy="false" used="false"><name>COOLPIX S3100 Yellow</name><description>Nikon Coolpix S3100 - Digital camera - compact - 14.0 Mpix - optical zoom: 5 x - supported memory: SD, SDXC, SDHC - yellow</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di107.shopping.com/images/di/61/34/33/6d305258756c5833387a436e516a5535396a77-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di107.shopping.com/images/di/61/34/33/6d305258756c5833387a436e516a5535396a77-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di107.shopping.com/images/di/61/34/33/6d305258756c5833387a436e516a5535396a77-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di107.shopping.com/images/di/61/34/33/6d305258756c5833387a436e516a5535396a77-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Get 30 days FREE SHIPPING w/ ShipVantage</storeNotes><basePrice currency="USD">119.95</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.95</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">139.95</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=578&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=485615&amp;crawler_id=485615&amp;dealId=a43m0RXulX38zCnQjU59jw%3D%3D&amp;url=http%3A%2F%2Fsears.rdr.channelintelligence.com%2Fgo.asp%3FfVhzOGNRAAQIASNiE1NbQBJpFHJwYx0CTAICI2BbH1lEFmgKP3QvUVpEREdlfUAUHAQPLVpFTVdtJzxAHUNYW3AhQBM0QhFvEXAbYh8EAAVmb2JcUFxDEGoPc3QDEkFZVQ0WFhdRW0MWbgYWDlxzdGMdAVQWRi0xDAwPFhw9TSobb05eWVVYKzsLTFVVQi5RICs3SA8MU1s2MQQKD1wf%26nAID%3D13736960%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=COOLPIX+S3100+Yellow&amp;dlprc=119.95&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=38&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=106834268&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=38&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=1&amp;FS=0&amp;code=&amp;acode=583&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="485615" trusted="true"><name>Sears</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/485615.gif</sourceURL></logo><phoneNumber>1-800-349-4358</phoneNumber><ratingInfo><reviewCount>888</reviewCount><rating>2.85</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_3.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_sears_4189479~MRD-485615~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>00337014000</sku></offer></offers></product><product id="99671132"><name>Nikon D90 Digital Camera</name><shortDescription>12.3 Megapixel, Point and Shoot Camera, 3 in. LCD Screen, With Video Capability, Weight: 1.36 lb.</shortDescription><fullDescription>Untitled Document Nikon D90 SLR Digital Camera With 28-80mm 75-300mm Lens Kit The Nikon D90 SLR Digital Camera, with its 12.3-megapixel DX-format CMOS, 3" High resolution LCD display, Scene Recognition System, Picture Control, Active D-Lighting, and one-button Live View, provides photo enthusiasts with the image quality and performance they need to pursue their own vision while still being intuitive enough for use as an everyday camera.</fullDescription><images><image available="true" height="100" width="100"><sourceURL>http://di1.shopping.com/images/pi/52/fb/d3/99671132-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di1.shopping.com/images/pi/52/fb/d3/99671132-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di1.shopping.com/images/pi/52/fb/d3/99671132-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di1.shopping.com/images/pi/52/fb/d3/99671132-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="255" width="499"><sourceURL>http://di1.shopping.com/images/pi/52/fb/d3/99671132-499x255-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image></images><rating><reviewCount>7</reviewCount><rating>5.00</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/pr/sdc_stars_sm_5.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/Nikon-D90-with-18-270mm-Lens/reviews~linkin_id-7000610</reviewURL></rating><minPrice>689.00</minPrice><maxPrice>2299.00</maxPrice><productOffersURL>http://www.shopping.com/Nikon-D90-with-18-270mm-Lens/prices~linkin_id-7000610</productOffersURL><productSpecsURL>http://www.shopping.com/Nikon-D90-with-18-270mm-Lens/info~linkin_id-7000610</productSpecsURL><offers matchedOfferCount="43" pageNumber="1" returnedOfferCount="5"><offer featured="false" id="GU5JJkpUAxe5HujB7fkwAA==" smartBuy="false" used="false"><name>Nikon® D90 12.3MP Digital SLR Camera (Body Only)</name><description>The Nikon D90 will make you rethink what a digital SLR camera can achieve.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di106.shopping.com/images/di/47/55/35/4a4a6b70554178653548756a4237666b774141-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di106.shopping.com/images/di/47/55/35/4a4a6b70554178653548756a4237666b774141-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="220" width="220"><sourceURL>http://di106.shopping.com/images/di/47/55/35/4a4a6b70554178653548756a4237666b774141-220x220-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">1015.99</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.05</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">1015.99</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=504&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=332477&amp;crawler_id=332477&amp;dealId=GU5JJkpUAxe5HujB7fkwAA%3D%3D&amp;url=http%3A%2F%2Ftracking.searchmarketing.com%2Fgsic.asp%3Faid%3D851830266%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon%C2%AE+D90+12.3MP+Digital+SLR+Camera+%28Body+Only%29&amp;dlprc=1015.99&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=14&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=99671132&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=14&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=496&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="332477" trusted="false"><name>RadioShack</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/332477.gif</sourceURL></logo><ratingInfo><reviewCount>24</reviewCount><rating>2.25</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_radioshack_9689~MRD-332477~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>10148659</sku></offer><offer featured="false" id="XhURuSC-spBbTIDfo4qfzQ==" smartBuy="false" used="false"><name>Nikon D90 SLR Digital Camera (Camera Body)</name><description>The Nikon D90 SLR Digital Camera  with its 12.3-megapixel DX-format CCD  3" High resolution LCD display  Scene Recognition System  Picture Control  Active D-Lighting  and one-button Live View  provides photo enthusiasts with the image quality and performance they need to pursue their own vision while still being intuitive enough for use as an everyday camera. In addition  the D90 introduces the D-Movie mode  allowing for the first time  an interchangeable lens SLR camera that is capable of recording 720p HD movie clips.  Availabilty: In Stock</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di109.shopping.com/images/di/58/68/55/527553432d73704262544944666f3471667a51-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di109.shopping.com/images/di/58/68/55/527553432d73704262544944666f3471667a51-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di109.shopping.com/images/di/58/68/55/527553432d73704262544944666f3471667a51-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="350" width="350"><sourceURL>http://di109.shopping.com/images/di/58/68/55/527553432d73704262544944666f3471667a51-350x350-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Free Shipping with Any Purchase!</storeNotes><basePrice currency="USD">689.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">900.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=647&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=475674&amp;crawler_id=475674&amp;dealId=XhURuSC-spBbTIDfo4qfzQ%3D%3D&amp;url=http%3A%2F%2Fwww.fumfie.com%2Fproduct%2F169.5%2Fshopping-com%3F&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+SLR+Digital+Camera+%28Camera+Body%29&amp;dlprc=689.0&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=16&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=99671132&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=16&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=1&amp;SL=1&amp;FS=1&amp;code=&amp;acode=658&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="475674" trusted="true"><name>FumFie</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/475674.gif</sourceURL></logo><phoneNumber>866 666 9198</phoneNumber><ratingInfo><reviewCount>560</reviewCount><rating>4.27</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_45.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_fumfie~MRD-475674~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>F169C5</sku></offer><offer featured="false" id="o0Px_XLWDbrxAYRy3rCmyQ==" smartBuy="false" used="false"><name>Nikon D90 SLR w/Nikon 18-105mm VR &amp; 55-200mm VR Lenses</name><description>12.3 MegapixelDX Format CMOS Sensor3" VGA LCD DisplayLive ViewSelf Cleaning SensorD-Movie ModeHigh Sensitivity (ISO 3200)4.5 fps BurstIn-Camera Image Editing</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di101.shopping.com/images/di/6f/30/50/785f584c5744627278415952793372436d7951-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di101.shopping.com/images/di/6f/30/50/785f584c5744627278415952793372436d7951-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di101.shopping.com/images/di/6f/30/50/785f584c5744627278415952793372436d7951-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di101.shopping.com/images/di/6f/30/50/785f584c5744627278415952793372436d7951-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="500" width="500"><sourceURL>http://di101.shopping.com/images/di/6f/30/50/785f584c5744627278415952793372436d7951-500x500-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">1189.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">1189.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=371&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=487342&amp;crawler_id=487342&amp;dealId=o0Px_XLWDbrxAYRy3rCmyQ%3D%3D&amp;url=http%3A%2F%2Fwww.rythercamera.com%2Fcatalog%2Fproduct_info.php%3Fcsv%3Dsh%26products_id%3D30619%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+SLR+w%2FNikon+18-105mm+VR+%26+55-200mm+VR+Lenses&amp;dlprc=1189.0&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=20&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=99671132&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=20&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=379&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="487342" trusted="false"><name>RytherCamera.com</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/487342.gif</sourceURL></logo><phoneNumber>1-877-644-7593</phoneNumber><ratingInfo><reviewCount>0</reviewCount></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>30619</sku></offer><offer featured="false" id="4HgbWJSJ8ssgIf8B0MXIwA==" smartBuy="false" used="false"><name>Nikon D90 12.3 Megapixel Digital SLR Camera (Body Only)</name><description>Fusing 12.3 megapixel image quality and a cinematic 24fps D-Movie Mode, the Nikon D90 exceeds the demands of passionate photographers. Coupled with Nikon's EXPEED image processing technologies and NIKKOR optics, breathtaking image fidelity is assured. Combined with fast 0.15ms power-up and split-second 65ms shooting lag, dramatic action and decisive moments are captured easily. Effective 4-frequency, ultrasonic sensor cleaning frees image degrading dust particles from the sensor's optical low pass filter.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di110.shopping.com/images/di/34/48/67/62574a534a3873736749663842304d58497741-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di110.shopping.com/images/di/34/48/67/62574a534a3873736749663842304d58497741-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di110.shopping.com/images/di/34/48/67/62574a534a3873736749663842304d58497741-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>FREE FEDEX 2-3 DAY DELIVERY</storeNotes><basePrice currency="USD">899.95</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">899.95</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=269&amp;BEFID=7185&amp;aon=%5E&amp;MerchantID=9296&amp;crawler_id=811558&amp;dealId=4HgbWJSJ8ssgIf8B0MXIwA%3D%3D&amp;url=http%3A%2F%2Fwww.pcnation.com%2Foptics-gallery%2Fdetails.asp%3Faffid%3D305%26item%3D2N145P&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+12.3+Megapixel+Digital+SLR+Camera+%28Body+Only%29&amp;dlprc=899.95&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=21&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=99671132&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=21&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=257&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="9296" trusted="true"><name>PCNation</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/9296.gif</sourceURL></logo><phoneNumber>800-470-7079</phoneNumber><ratingInfo><reviewCount>1622</reviewCount><rating>4.43</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_45.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_pcnation_9689~MRD-9296~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>2N145P</sku></offer><offer featured="false" id="UNDa3uMDZXOnvD_7sTILYg==" smartBuy="false" used="false"><name>Nikon D90 12.3MP Digital SLR Camera (Body Only)</name><description>Fusing 12.3-megapixel image quality inherited from the award-winning D300 with groundbreaking features, the D90's breathtaking, low-noise image quality is further advanced with EXPEED image processing. Split-second shutter response and continuous shooting at up to 4.5 frames-per-second provide the power to capture fast action and precise moments perfectly, while Nikon's exclusive Scene Recognition System contributes to faster 11-area autofocus performance, finer white balance detection and more. The D90 delivers the control passionate photographers demand, utilizing comprehensive exposure functions and the intelligence of 3D Color Matrix Metering II. Stunning results come to life on a 3-inch 920,000-dot color LCD monitor, providing accurate image review, Live View composition and brilliant playback of the D90's cinematic-quality 24-fps HD D-Movie mode.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di102.shopping.com/images/di/55/4e/44/6133754d445a584f6e76445f377354494c5967-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di102.shopping.com/images/di/55/4e/44/6133754d445a584f6e76445f377354494c5967-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di102.shopping.com/images/di/55/4e/44/6133754d445a584f6e76445f377354494c5967-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di102.shopping.com/images/di/55/4e/44/6133754d445a584f6e76445f377354494c5967-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="500" width="500"><sourceURL>http://di102.shopping.com/images/di/55/4e/44/6133754d445a584f6e76445f377354494c5967-500x500-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Fantastic prices with ease &amp; comfort of Amazon.com!</storeNotes><basePrice currency="USD">780.00</basePrice><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">780.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=566&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=301531&amp;crawler_id=1903313&amp;dealId=UNDa3uMDZXOnvD_7sTILYg%3D%3D&amp;url=http%3A%2F%2Fwww.amazon.com%2Fdp%2FB001ET5U92%2Fref%3Dasc_df_B001ET5U921751618%3Fsmid%3DAHF4SYKP09WBH%26tag%3Ddealtime-ce-mp01feed-20%26linkCode%3Dasn%26creative%3D395105%26creativeASIN%3DB001ET5U92&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+12.3MP+Digital+SLR+Camera+%28Body+Only%29&amp;dlprc=780.0&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=29&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=99671132&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=29&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=520&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="301531" trusted="false"><name>Amazon Marketplace</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/301531.gif</sourceURL></logo><ratingInfo><reviewCount>213</reviewCount><rating>2.73</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_amazon_marketplace_9689~MRD-301531~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>B001ET5U92</sku></offer></offers></product><product id="70621646"><name>Nikon D90 Digital Camera with 18-105mm lens</name><shortDescription>12.9 Megapixel, SLR Camera, 3 in. LCD Screen, 5.8x Optical Zoom, With Video Capability, Weight: 2.3 lb.</shortDescription><fullDescription>Its 12.3 megapixel DX-format CMOS image sensor and EXPEED image processing system offer outstanding image quality across a wide ISO light sensitivity range. Live View mode lets you compose and shoot via the high-resolution 3-inch LCD monitor, and an advanced Scene Recognition System and autofocus performance help capture images with astounding accuracy. Movies can be shot in Motion JPEG format using the D-Movie function. The camera’s large image sensor ensures exceptional movie image quality and you can create dramatic effects by shooting with a wide range of interchangeable NIKKOR lenses, from wide-angle to macro to fisheye, or by adjusting the lens aperture and experimenting with depth-of-field. The D90 – designed to fuel your passion for photography.</fullDescription><images><image available="true" height="100" width="100"><sourceURL>http://di1.shopping.com/images/pi/57/6a/4f/70621646-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di1.shopping.com/images/pi/57/6a/4f/70621646-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di1.shopping.com/images/pi/57/6a/4f/70621646-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di1.shopping.com/images/pi/57/6a/4f/70621646-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="489" width="490"><sourceURL>http://di1.shopping.com/images/pi/57/6a/4f/70621646-490x489-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=2&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image></images><rating><reviewCount>32</reviewCount><rating>4.81</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/pr/sdc_stars_sm_5.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/Nikon-D90-with-18-105mm-lens/reviews~linkin_id-7000610</reviewURL></rating><minPrice>849.95</minPrice><maxPrice>1599.95</maxPrice><productOffersURL>http://www.shopping.com/Nikon-D90-with-18-105mm-lens/prices~linkin_id-7000610</productOffersURL><productSpecsURL>http://www.shopping.com/Nikon-D90-with-18-105mm-lens/info~linkin_id-7000610</productSpecsURL><offers matchedOfferCount="25" pageNumber="1" returnedOfferCount="5"><offer featured="false" id="3o5e1VghgJPfhLvT1JFKTA==" smartBuy="false" used="false"><name>Nikon D90 18-105mm VR Lens</name><description>The Nikon D90 SLR Digital Camera  with its 12.3-megapixel DX-format CMOS  3" High resolution LCD display  Scene Recognition System  Picture Control  Active D-Lighting  and one-button Live View  prov</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di111.shopping.com/images/di/33/6f/35/6531566768674a5066684c7654314a464b5441-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di111.shopping.com/images/di/33/6f/35/6531566768674a5066684c7654314a464b5441-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image><image available="true" height="260" width="260"><sourceURL>http://di111.shopping.com/images/di/33/6f/35/6531566768674a5066684c7654314a464b5441-260x260-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=1</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">849.95</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">849.95</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=419&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=9390&amp;crawler_id=1905054&amp;dealId=3o5e1VghgJPfhLvT1JFKTA%3D%3D&amp;url=http%3A%2F%2Fwww.ajrichard.com%2FNikon-D90-18-105mm-VR-Lens%2Fp-292%3Frefid%3DShopping%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+18-105mm+VR+Lens&amp;dlprc=849.95&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=2&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=70621646&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=2&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=425&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="9390" trusted="false"><name>AJRichard</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/9390.gif</sourceURL></logo><phoneNumber>1-888-871-1256</phoneNumber><ratingInfo><reviewCount>3124</reviewCount><rating>4.48</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_45.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_ajrichard~MRD-9390~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>292</sku></offer><offer featured="false" id="_lYWj_jbwfsSkfcwUcDuww==" smartBuy="false" used="false"><name>Nikon D90 SLR w/Nikon 18-105mm VR Lens</name><description>12.3 MegapixelDX Format CMOS Sensor3" VGA LCD DisplayLive ViewSelf Cleaning SensorD-Movie ModeHigh Sensitivity (ISO 3200)4.5 fps BurstIn-Camera Image Editing</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di108.shopping.com/images/di/5f/6c/59/576a5f6a62776673536b666377556344757777-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di108.shopping.com/images/di/5f/6c/59/576a5f6a62776673536b666377556344757777-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di108.shopping.com/images/di/5f/6c/59/576a5f6a62776673536b666377556344757777-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di108.shopping.com/images/di/5f/6c/59/576a5f6a62776673536b666377556344757777-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image><image available="true" height="500" width="500"><sourceURL>http://di108.shopping.com/images/di/5f/6c/59/576a5f6a62776673536b666377556344757777-500x500-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=2</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">909.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">909.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=371&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=487342&amp;crawler_id=487342&amp;dealId=_lYWj_jbwfsSkfcwUcDuww%3D%3D&amp;url=http%3A%2F%2Fwww.rythercamera.com%2Fcatalog%2Fproduct_info.php%3Fcsv%3Dsh%26products_id%3D30971%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+SLR+w%2FNikon+18-105mm+VR+Lens&amp;dlprc=909.0&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=3&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=70621646&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=3&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=1&amp;code=&amp;acode=379&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="487342" trusted="false"><name>RytherCamera.com</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/487342.gif</sourceURL></logo><phoneNumber>1-877-644-7593</phoneNumber><ratingInfo><reviewCount>0</reviewCount></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>30971</sku></offer><offer featured="false" id="1KCclCGuWvty2XKU9skadg==" smartBuy="false" used="false"><name>25448/D90 12.3 Megapixel Digital Camera 18-105mm Zoom Lens w/ 3" Screen - Black</name><description>Nikon D90 - Digital camera - SLR - 12.3 Mpix - Nikon AF-S DX 18-105mm lens - optical zoom: 5.8 x - supported memory: SD, SDHC</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di110.shopping.com/images/di/31/4b/43/636c4347755776747932584b5539736b616467-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di110.shopping.com/images/di/31/4b/43/636c4347755776747932584b5539736b616467-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di110.shopping.com/images/di/31/4b/43/636c4347755776747932584b5539736b616467-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image><image available="true" height="400" width="400"><sourceURL>http://di110.shopping.com/images/di/31/4b/43/636c4347755776747932584b5539736b616467-400x400-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=3</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Get 30 days FREE SHIPPING w/ ShipVantage</storeNotes><basePrice currency="USD">1199.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">8.20</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">1199.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=578&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=485615&amp;crawler_id=485615&amp;dealId=1KCclCGuWvty2XKU9skadg%3D%3D&amp;url=http%3A%2F%2Fsears.rdr.channelintelligence.com%2Fgo.asp%3FfVhzOGNRAAQIASNiE1NbQBRtFXpzYx0CTAICI2BbH1lEFmgKP3QvUVpEREdlfUAUHAQPLVpFTVdtJzxAHUNYW3AhQBM0QhFvEXAbYh8EAAVmb2JcVlhCGGkPc3QDEkFZVQ0WFhdRW0MWbgYWDlxzdGMdAVQWRi0xDAwPFhw9TSobb05eWVVYKzsLTFVVQi5RICs3SA8MU1s2MQQKD1wf%26nAID%3D13736960%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=25448%2FD90+12.3+Megapixel+Digital+Camera+18-105mm+Zoom+Lens+w%2F+3%22+Screen+-+Black&amp;dlprc=1199.0&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=4&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=70621646&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=4&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=586&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="485615" trusted="true"><name>Sears</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/485615.gif</sourceURL></logo><phoneNumber>1-800-349-4358</phoneNumber><ratingInfo><reviewCount>888</reviewCount><rating>2.85</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_3.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_sears_4189479~MRD-485615~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>00353197000</sku></offer><offer featured="false" id="3-VOSfVV5Jo7HlA4kJtanA==" smartBuy="false" used="false"><name>Nikon® D90 12.3MP Digital SLR with 18-105mm Lens</name><description>The Nikon D90 will make you rethink what a digital SLR camera can achieve.</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di101.shopping.com/images/di/33/2d/56/4f53665656354a6f37486c41346b4a74616e41-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di101.shopping.com/images/di/33/2d/56/4f53665656354a6f37486c41346b4a74616e41-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="300" width="300"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image><image available="true" height="220" width="220"><sourceURL>http://di101.shopping.com/images/di/33/2d/56/4f53665656354a6f37486c41346b4a74616e41-220x220-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=4</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><basePrice currency="USD">1350.99</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">6.05</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">1350.99</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=504&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=332477&amp;crawler_id=332477&amp;dealId=3-VOSfVV5Jo7HlA4kJtanA%3D%3D&amp;url=http%3A%2F%2Ftracking.searchmarketing.com%2Fgsic.asp%3Faid%3D982673361%26&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon%C2%AE+D90+12.3MP+Digital+SLR+with+18-105mm+Lens&amp;dlprc=1350.99&amp;crn=&amp;istrsmrc=0&amp;isathrsl=0&amp;AR=5&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=70621646&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=5&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=0&amp;FS=0&amp;code=&amp;acode=496&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="332477" trusted="false"><name>RadioShack</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/332477.gif</sourceURL></logo><ratingInfo><reviewCount>24</reviewCount><rating>2.25</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_25.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_radioshack_9689~MRD-332477~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>11148905</sku></offer><offer featured="false" id="kQnB6rS4AjN5dx5h2_631g==" smartBuy="false" used="false"><name>Nikon D90 Kit 12.3-megapixel Digital SLR with 18-105mm VR Lens</name><description>Photographers, take your passion further!Now is the time for new creativity, and to rethink what a digital SLR camera can achieve. It's time for the D90, a camera with everything you would expect from Nikon's next-generation D-SLRs, and some unexpected surprises, as well. The stunning image quality is inherited from the D300, Nikon's DX-format flagship. The D90 also has Nikon's unmatched ergonomics and high performance, and now takes high-quality movies with beautifully cinematic results. The world of photography has changed, and with the D90 in your hands, it's time to make your own rules.AF-S DX NIKKOR 18-105mm f/3.5-5.6G ED VR LensWide-ratio 5.8x zoom Compact, versatile and ideal for a broad range of shooting situations, ranging from interiors and landscapes to beautiful portraits� a perfect everyday zoom. Nikon VR (Vibration Reduction) image stabilization Vibration Reduction is engineered specifically for each VR NIKKOR lens and enables handheld shooting at up to 3 shutter speeds slower than would</description><categoryId>7185</categoryId><manufacturer>Nikon</manufacturer><imageList><image available="true" height="100" width="100"><sourceURL>http://di110.shopping.com/images/di/6b/51/6e/4236725334416a4e3564783568325f36333167-100x100-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="200" width="200"><sourceURL>http://di110.shopping.com/images/di/6b/51/6e/4236725334416a4e3564783568325f36333167-200x200-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="300" width="300"><sourceURL>http://di110.shopping.com/images/di/6b/51/6e/4236725334416a4e3564783568325f36333167-300x300-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="false" height="400" width="400"><sourceURL>http://img.shopping.com/sc/ds/no_image_100X100.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image><image available="true" height="232" width="300"><sourceURL>http://di110.shopping.com/images/di/6b/51/6e/4236725334416a4e3564783568325f36333167-300x232-0-0.jpg?p=p2.a121bc2aaf029435dce6&amp;a=1&amp;c=1&amp;l=7000610&amp;t=111021183845&amp;r=5</sourceURL></image></imageList><stockStatus>in-stock</stockStatus><storeNotes>Shipping Included!</storeNotes><basePrice currency="USD">1050.00</basePrice><tax checkSite="true"></tax><shippingCost currency="USD">0.00</shippingCost><totalPrice checkSite="true"></totalPrice><originalPrice currency="USD">1199.00</originalPrice><offerURL>http://statTest.dealtime.com/DealFrame/DealFrame.cmp?bm=135&amp;BEFID=7185&amp;aon=%5E1&amp;MerchantID=313162&amp;crawler_id=313162&amp;dealId=kQnB6rS4AjN5dx5h2_631g%3D%3D&amp;url=http%3A%2F%2Fonecall.rdr.channelintelligence.com%2Fgo.asp%3FfVhzOGNRAAQIASNiE1pZSxNoWHFwLx8GTAICa2ZeH1sPXTZLNzRpAh1HR0BxPQEGCBJNMhFHUElsFCFCVkVTTHAcBggEHQ4aHXNpGERGH3RQODsbAgdechJtbBt8fx8JAwhtZFAzJj1oGgIWCxRlNyFOUV9UUGIxBgo0T0IyTSYqJ0RWHw4QPCIBAAQXRGMDICg6TllZVBhh%26nAID%3D13736960&amp;linkin_id=7000610&amp;Issdt=111021183845&amp;searchID=p2.a121bc2aaf029435dce6&amp;DealName=Nikon+D90+Kit+12.3-megapixel+Digital+SLR+with+18-105mm+VR+Lens&amp;dlprc=1050.0&amp;crn=&amp;istrsmrc=1&amp;isathrsl=0&amp;AR=6&amp;NG=20&amp;NDP=200&amp;PN=1&amp;ST=7&amp;DB=sdcprod&amp;MT=phx-pkadudc2&amp;FPT=DSP&amp;NDS=&amp;NMS=&amp;MRS=&amp;PD=70621646&amp;brnId=14804&amp;IsFtr=0&amp;IsSmart=0&amp;DMT=&amp;op=&amp;CM=&amp;DlLng=1&amp;RR=6&amp;cid=&amp;semid1=&amp;semid2=&amp;IsLps=0&amp;CC=0&amp;SL=1&amp;FS=1&amp;code=&amp;acode=143&amp;category=&amp;HasLink=&amp;frameId=&amp;ND=&amp;MN=&amp;PT=&amp;prjID=&amp;GR=&amp;lnkId=&amp;VK=</offerURL><store authorizedReseller="false" id="313162" trusted="true"><name>OneCall</name><logo available="true" height="31" width="88"><sourceURL>http://img.shopping.com/cctool/merch_logos/313162.gif</sourceURL></logo><phoneNumber>1.800.398.0766</phoneNumber><ratingInfo><reviewCount>180</reviewCount><rating>4.44</rating><ratingImage height="18" width="91"><sourceURL>http://img.shopping.com/sc/mr/sdc_checks_45.gif</sourceURL></ratingImage><reviewURL>http://www.shopping.com/xMR-store_onecall_9689~MRD-313162~S-1~linkin_id-7000610</reviewURL></ratingInfo><countryFlag height="11" width="18"><sourceURL>http://img.shopping.com/sc/glb/flag/US.gif</sourceURL><countryCode>US</countryCode></countryFlag></store><sku>92826</sku></offer></offers></product></items><attributes matchedAttributeCount="5" returnedAttributeCount="5"><attribute id="Dynamic_Price_Range"><name>Price range</name><attributeURL>http://www.shopping.com/digital-cameras/nikon/products?oq=nikon&amp;linkin_id=7000610</attributeURL><attributeValues matchedValueCount="2" returnedValueCount="2"><attributeValue id="price_range_24_4012" matchingItemsCount="1"><name>$24 - $4012</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon/products?minPrice=24&amp;maxPrice=4012&amp;linkin_id=7000610</attributeValueURL></attributeValue><attributeValue id="price_range_4012_7999" matchingItemsCount="1"><name>$4012 - $7999</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon/products?minPrice=4012&amp;maxPrice=7999&amp;linkin_id=7000610</attributeValueURL></attributeValue></attributeValues></attribute><attribute id="9688_brand"><name>Brand</name><attributeURL>http://www.shopping.com/digital-cameras/nikon/products~all-9688-brand~MS-1?oq=nikon&amp;linkin_id=7000610</attributeURL><attributeValues matchedValueCount="7" returnedValueCount="5"><attributeValue id="brand_nikon" matchingItemsCount="2261"><name>Nikon</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+brand-nikon/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="9688_brand_crane" matchingItemsCount="17"><name>Crane</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+9688-brand-crane/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="ikelite" matchingItemsCount="2"><name>Ikelite</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+ikelite/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="bower" matchingItemsCount="1"><name>Bower</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+bower/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="brand_fuji" matchingItemsCount="2"><name>FUJIFILM</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+brand-fuji/products~linkin_id-7000610</attributeValueURL></attributeValue></attributeValues></attribute><attribute id="store"><name>Store</name><attributeURL>http://www.shopping.com/digital-cameras/nikon/products~all-store~MS-1?oq=nikon&amp;linkin_id=7000610</attributeURL><attributeValues matchedValueCount="35" returnedValueCount="5"><attributeValue id="store_amazon_marketplace_9689" matchingItemsCount="808"><name>Amazon Marketplace</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+store-amazon-marketplace-9689/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="store_amazon" matchingItemsCount="83"><name>Amazon</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+store-amazon/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="store_adorama" matchingItemsCount="81"><name>Adorama</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+store-adorama/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="store_j_r_music_and_computer_world" matchingItemsCount="78"><name>J&amp;R Music and Computer World</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+store-j-r-music-and-computer-world/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="store_rythercamera_com" matchingItemsCount="78"><name>RytherCamera.com</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+store-rythercamera-com/products~linkin_id-7000610</attributeValueURL></attributeValue></attributeValues></attribute><attribute id="21885_resolution"><name>Resolution</name><attributeURL>http://www.shopping.com/digital-cameras/nikon/products~all-21885-resolution~MS-1?oq=nikon&amp;linkin_id=7000610</attributeURL><attributeValues matchedValueCount="13" returnedValueCount="5"><attributeValue id="under_4_megapixel" matchingItemsCount="3"><name>Under 4 Megapixel</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+under-4-megapixel/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="5_megapixel_digital_cameras" matchingItemsCount="1085"><name>At least 5 Megapixel</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+5-megapixel-digital-cameras/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="6_megapixel_digital_cameras" matchingItemsCount="1080"><name>At least 6 Megapixel</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+6-megapixel-digital-cameras/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="7_megapixel_digital_cameras" matchingItemsCount="1066"><name>At least 7 Megapixel</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+7-megapixel-digital-cameras/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="8_megapixel_digital_cameras" matchingItemsCount="1056"><name>At least 8 Megapixel</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+8-megapixel-digital-cameras/products~linkin_id-7000610</attributeValueURL></attributeValue></attributeValues></attribute><attribute id="32804-features"><name>Features</name><attributeURL>http://www.shopping.com/digital-cameras/nikon/products~all-32804-features~MS-1?oq=nikon&amp;linkin_id=7000610</attributeURL><attributeValues matchedValueCount="12" returnedValueCount="5"><attributeValue id="32804_features_shockproof" matchingItemsCount="7"><name>Shockproof</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+32804-features-shockproof/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="32804_features_waterproof" matchingItemsCount="32"><name>Waterproof</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+32804-features-waterproof/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="32804_features_freezeproof" matchingItemsCount="7"><name>Freezeproof</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+32804-features-freezeproof/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="32804_features_dust_proof" matchingItemsCount="23"><name>Dust proof</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+32804-features-dust-proof/products~linkin_id-7000610</attributeValueURL></attributeValue><attributeValue id="32804_features_image_stabilization" matchingItemsCount="797"><name>Image Stabilization</name><attributeValueURL>http://www.shopping.com/digital-cameras/nikon+32804-features-image-stabilization/products~linkin_id-7000610</attributeValueURL></attributeValue></attributeValues></attribute></attributes><contentType>hybrid</contentType></category></categories><relatedTerms><term>digital camera</term><term>g1</term><term>sony</term><term>camera</term><term>canon</term><term>nikon</term><term>kodak digital camera</term><term>kodak</term><term>sony cybershot</term><term>kodak easyshare digital camera</term><term>nikon coolpix</term><term>olympus</term><term>pink digital camera</term><term>canon powershot</term></relatedTerms></GeneralSearchResponse>
\ No newline at end of file
diff --git a/node_modules/xmldoc/node_modules/sax/examples/strict.dtd b/node_modules/xmldoc/node_modules/sax/examples/strict.dtd
new file mode 100644
index 0000000..b274559
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/examples/strict.dtd
@@ -0,0 +1,870 @@
+<!--
+    This is HTML 4.01 Strict DTD, which excludes the presentation 
+    attributes and elements that W3C expects to phase out as 
+    support for style sheets matures. Authors should use the Strict
+    DTD when possible, but may use the Transitional DTD when support
+    for presentation attribute and elements is required.
+    
+    HTML 4 includes mechanisms for style sheets, scripting,
+    embedding objects, improved support for right to left and mixed
+    direction text, and enhancements to forms for improved
+    accessibility for people with disabilities.
+
+          Draft: $Date: 1999/12/24 23:37:48 $
+
+          Authors:
+              Dave Raggett <dsr@w3.org>
+              Arnaud Le Hors <lehors@w3.org>
+              Ian Jacobs <ij@w3.org>
+
+    Further information about HTML 4.01 is available at:
+
+        http://www.w3.org/TR/1999/REC-html401-19991224
+
+
+    The HTML 4.01 specification includes additional
+    syntactic constraints that cannot be expressed within
+    the DTDs.
+
+-->
+<!--
+    Typical usage:
+
+    <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+            "http://www.w3.org/TR/html4/strict.dtd">
+    <html>
+    <head>
+    ...
+    </head>
+    <body>
+    ...
+    </body>
+    </html>
+
+    The URI used as a system identifier with the public identifier allows
+    the user agent to download the DTD and entity sets as needed.
+
+    The FPI for the Transitional HTML 4.01 DTD is:
+
+        "-//W3C//DTD HTML 4.01 Transitional//EN"
+
+    This version of the transitional DTD is:
+
+        http://www.w3.org/TR/1999/REC-html401-19991224/loose.dtd
+
+    If you are writing a document that includes frames, use 
+    the following FPI:
+
+        "-//W3C//DTD HTML 4.01 Frameset//EN"
+
+    This version of the frameset DTD is:
+
+        http://www.w3.org/TR/1999/REC-html401-19991224/frameset.dtd
+
+    Use the following (relative) URIs to refer to 
+    the DTDs and entity definitions of this specification:
+
+    "strict.dtd"
+    "loose.dtd"
+    "frameset.dtd"
+    "HTMLlat1.ent"
+    "HTMLsymbol.ent"
+    "HTMLspecial.ent"
+
+-->
+
+<!--================== Imported Names ====================================-->
+<!-- Feature Switch for frameset documents -->
+<!ENTITY % HTML.Frameset "IGNORE">
+
+<!ENTITY % ContentType "CDATA"
+    -- media type, as per [RFC2045]
+    -->
+
+<!ENTITY % ContentTypes "CDATA"
+    -- comma-separated list of media types, as per [RFC2045]
+    -->
+
+<!ENTITY % Charset "CDATA"
+    -- a character encoding, as per [RFC2045]
+    -->
+
+<!ENTITY % Charsets "CDATA"
+    -- a space-separated list of character encodings, as per [RFC2045]
+    -->
+
+<!ENTITY % LanguageCode "NAME"
+    -- a language code, as per [RFC1766]
+    -->
+
+<!ENTITY % Character "CDATA"
+    -- a single character from [ISO10646] 
+    -->
+
+<!ENTITY % LinkTypes "CDATA"
+    -- space-separated list of link types
+    -->
+
+<!ENTITY % MediaDesc "CDATA"
+    -- single or comma-separated list of media descriptors
+    -->
+
+<!ENTITY % URI "CDATA"
+    -- a Uniform Resource Identifier,
+       see [URI]
+    -->
+
+<!ENTITY % Datetime "CDATA" -- date and time information. ISO date format -->
+
+
+<!ENTITY % Script "CDATA" -- script expression -->
+
+<!ENTITY % StyleSheet "CDATA" -- style sheet data -->
+
+
+
+<!ENTITY % Text "CDATA">
+
+
+<!-- Parameter Entities -->
+
+<!ENTITY % head.misc "SCRIPT|STYLE|META|LINK|OBJECT" -- repeatable head elements -->
+
+<!ENTITY % heading "H1|H2|H3|H4|H5|H6">
+
+<!ENTITY % list "UL | OL">
+
+<!ENTITY % preformatted "PRE">
+
+
+<!--================ Character mnemonic entities =========================-->
+
+<!ENTITY % HTMLlat1 PUBLIC
+   "-//W3C//ENTITIES Latin1//EN//HTML"
+   "HTMLlat1.ent">
+%HTMLlat1;
+
+<!ENTITY % HTMLsymbol PUBLIC
+   "-//W3C//ENTITIES Symbols//EN//HTML"
+   "HTMLsymbol.ent">
+%HTMLsymbol;
+
+<!ENTITY % HTMLspecial PUBLIC
+   "-//W3C//ENTITIES Special//EN//HTML"
+   "HTMLspecial.ent">
+%HTMLspecial;
+<!--=================== Generic Attributes ===============================-->
+
+<!ENTITY % coreattrs
+ "id          ID             #IMPLIED  -- document-wide unique id --
+  class       CDATA          #IMPLIED  -- space-separated list of classes --
+  style       %StyleSheet;   #IMPLIED  -- associated style info --
+  title       %Text;         #IMPLIED  -- advisory title --"
+  >
+
+<!ENTITY % i18n
+ "lang        %LanguageCode; #IMPLIED  -- language code --
+  dir         (ltr|rtl)      #IMPLIED  -- direction for weak/neutral text --"
+  >
+
+<!ENTITY % events
+ "onclick     %Script;       #IMPLIED  -- a pointer button was clicked --
+  ondblclick  %Script;       #IMPLIED  -- a pointer button was double clicked--
+  onmousedown %Script;       #IMPLIED  -- a pointer button was pressed down --
+  onmouseup   %Script;       #IMPLIED  -- a pointer button was released --
+  onmouseover %Script;       #IMPLIED  -- a pointer was moved onto --
+  onmousemove %Script;       #IMPLIED  -- a pointer was moved within --
+  onmouseout  %Script;       #IMPLIED  -- a pointer was moved away --
+  onkeypress  %Script;       #IMPLIED  -- a key was pressed and released --
+  onkeydown   %Script;       #IMPLIED  -- a key was pressed down --
+  onkeyup     %Script;       #IMPLIED  -- a key was released --"
+  >
+
+<!-- Reserved Feature Switch -->
+<!ENTITY % HTML.Reserved "IGNORE">
+
+<!-- The following attributes are reserved for possible future use -->
+<![ %HTML.Reserved; [
+<!ENTITY % reserved
+ "datasrc     %URI;          #IMPLIED  -- a single or tabular Data Source --
+  datafld     CDATA          #IMPLIED  -- the property or column name --
+  dataformatas (plaintext|html) plaintext -- text or html --"
+  >
+]]>
+
+<!ENTITY % reserved "">
+
+<!ENTITY % attrs "%coreattrs; %i18n; %events;">
+
+
+<!--=================== Text Markup ======================================-->
+
+<!ENTITY % fontstyle
+ "TT | I | B | BIG | SMALL">
+
+<!ENTITY % phrase "EM | STRONG | DFN | CODE |
+                   SAMP | KBD | VAR | CITE | ABBR | ACRONYM" >
+
+<!ENTITY % special
+   "A | IMG | OBJECT | BR | SCRIPT | MAP | Q | SUB | SUP | SPAN | BDO">
+
+<!ENTITY % formctrl "INPUT | SELECT | TEXTAREA | LABEL | BUTTON">
+
+<!-- %inline; covers inline or "text-level" elements -->
+<!ENTITY % inline "#PCDATA | %fontstyle; | %phrase; | %special; | %formctrl;">
+
+<!ELEMENT (%fontstyle;|%phrase;) - - (%inline;)*>
+<!ATTLIST (%fontstyle;|%phrase;)
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!ELEMENT (SUB|SUP) - - (%inline;)*    -- subscript, superscript -->
+<!ATTLIST (SUB|SUP)
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!ELEMENT SPAN - - (%inline;)*         -- generic language/style container -->
+<!ATTLIST SPAN
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  %reserved;			       -- reserved for possible future use --
+  >
+
+<!ELEMENT BDO - - (%inline;)*          -- I18N BiDi over-ride -->
+<!ATTLIST BDO
+  %coreattrs;                          -- id, class, style, title --
+  lang        %LanguageCode; #IMPLIED  -- language code --
+  dir         (ltr|rtl)      #REQUIRED -- directionality --
+  >
+
+
+<!ELEMENT BR - O EMPTY                 -- forced line break -->
+<!ATTLIST BR
+  %coreattrs;                          -- id, class, style, title --
+  >
+
+<!--================== HTML content models ===============================-->
+
+<!--
+    HTML has two basic content models:
+
+        %inline;     character level elements and text strings
+        %block;      block-like elements e.g. paragraphs and lists
+-->
+
+<!ENTITY % block
+     "P | %heading; | %list; | %preformatted; | DL | DIV | NOSCRIPT |
+      BLOCKQUOTE | FORM | HR | TABLE | FIELDSET | ADDRESS">
+
+<!ENTITY % flow "%block; | %inline;">
+
+<!--=================== Document Body ====================================-->
+
+<!ELEMENT BODY O O (%block;|SCRIPT)+ +(INS|DEL) -- document body -->
+<!ATTLIST BODY
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  onload          %Script;   #IMPLIED  -- the document has been loaded --
+  onunload        %Script;   #IMPLIED  -- the document has been removed --
+  >
+
+<!ELEMENT ADDRESS - - (%inline;)* -- information on author -->
+<!ATTLIST ADDRESS
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!ELEMENT DIV - - (%flow;)*            -- generic language/style container -->
+<!ATTLIST DIV
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+
+<!--================== The Anchor Element ================================-->
+
+<!ENTITY % Shape "(rect|circle|poly|default)">
+<!ENTITY % Coords "CDATA" -- comma-separated list of lengths -->
+
+<!ELEMENT A - - (%inline;)* -(A)       -- anchor -->
+<!ATTLIST A
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  charset     %Charset;      #IMPLIED  -- char encoding of linked resource --
+  type        %ContentType;  #IMPLIED  -- advisory content type --
+  name        CDATA          #IMPLIED  -- named link end --
+  href        %URI;          #IMPLIED  -- URI for linked resource --
+  hreflang    %LanguageCode; #IMPLIED  -- language code --
+  rel         %LinkTypes;    #IMPLIED  -- forward link types --
+  rev         %LinkTypes;    #IMPLIED  -- reverse link types --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  shape       %Shape;        rect      -- for use with client-side image maps --
+  coords      %Coords;       #IMPLIED  -- for use with client-side image maps --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  >
+
+<!--================== Client-side image maps ============================-->
+
+<!-- These can be placed in the same document or grouped in a
+     separate document although this isn't yet widely supported -->
+
+<!ELEMENT MAP - - ((%block;) | AREA)+ -- client-side image map -->
+<!ATTLIST MAP
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  name        CDATA          #REQUIRED -- for reference by usemap --
+  >
+
+<!ELEMENT AREA - O EMPTY               -- client-side image map area -->
+<!ATTLIST AREA
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  shape       %Shape;        rect      -- controls interpretation of coords --
+  coords      %Coords;       #IMPLIED  -- comma-separated list of lengths --
+  href        %URI;          #IMPLIED  -- URI for linked resource --
+  nohref      (nohref)       #IMPLIED  -- this region has no action --
+  alt         %Text;         #REQUIRED -- short description --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  >
+
+<!--================== The LINK Element ==================================-->
+
+<!--
+  Relationship values can be used in principle:
+
+   a) for document specific toolbars/menus when used
+      with the LINK element in document head e.g.
+        start, contents, previous, next, index, end, help
+   b) to link to a separate style sheet (rel=stylesheet)
+   c) to make a link to a script (rel=script)
+   d) by stylesheets to control how collections of
+      html nodes are rendered into printed documents
+   e) to make a link to a printable version of this document
+      e.g. a postscript or pdf version (rel=alternate media=print)
+-->
+
+<!ELEMENT LINK - O EMPTY               -- a media-independent link -->
+<!ATTLIST LINK
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  charset     %Charset;      #IMPLIED  -- char encoding of linked resource --
+  href        %URI;          #IMPLIED  -- URI for linked resource --
+  hreflang    %LanguageCode; #IMPLIED  -- language code --
+  type        %ContentType;  #IMPLIED  -- advisory content type --
+  rel         %LinkTypes;    #IMPLIED  -- forward link types --
+  rev         %LinkTypes;    #IMPLIED  -- reverse link types --
+  media       %MediaDesc;    #IMPLIED  -- for rendering on these media --
+  >
+
+<!--=================== Images ===========================================-->
+
+<!-- Length defined in strict DTD for cellpadding/cellspacing -->
+<!ENTITY % Length "CDATA" -- nn for pixels or nn% for percentage length -->
+<!ENTITY % MultiLength "CDATA" -- pixel, percentage, or relative -->
+
+<![ %HTML.Frameset; [
+<!ENTITY % MultiLengths "CDATA" -- comma-separated list of MultiLength -->
+]]>
+
+<!ENTITY % Pixels "CDATA" -- integer representing length in pixels -->
+
+
+<!-- To avoid problems with text-only UAs as well as 
+   to make image content understandable and navigable 
+   to users of non-visual UAs, you need to provide
+   a description with ALT, and avoid server-side image maps -->
+<!ELEMENT IMG - O EMPTY                -- Embedded image -->
+<!ATTLIST IMG
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  src         %URI;          #REQUIRED -- URI of image to embed --
+  alt         %Text;         #REQUIRED -- short description --
+  longdesc    %URI;          #IMPLIED  -- link to long description
+                                          (complements alt) --
+  name        CDATA          #IMPLIED  -- name of image for scripting --
+  height      %Length;       #IMPLIED  -- override height --
+  width       %Length;       #IMPLIED  -- override width --
+  usemap      %URI;          #IMPLIED  -- use client-side image map --
+  ismap       (ismap)        #IMPLIED  -- use server-side image map --
+  >
+
+<!-- USEMAP points to a MAP element which may be in this document
+  or an external document, although the latter is not widely supported -->
+
+<!--==================== OBJECT ======================================-->
+<!--
+  OBJECT is used to embed objects as part of HTML pages 
+  PARAM elements should precede other content. SGML mixed content
+  model technicality precludes specifying this formally ...
+-->
+
+<!ELEMENT OBJECT - - (PARAM | %flow;)*
+ -- generic embedded object -->
+<!ATTLIST OBJECT
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  declare     (declare)      #IMPLIED  -- declare but don't instantiate flag --
+  classid     %URI;          #IMPLIED  -- identifies an implementation --
+  codebase    %URI;          #IMPLIED  -- base URI for classid, data, archive--
+  data        %URI;          #IMPLIED  -- reference to object's data --
+  type        %ContentType;  #IMPLIED  -- content type for data --
+  codetype    %ContentType;  #IMPLIED  -- content type for code --
+  archive     CDATA          #IMPLIED  -- space-separated list of URIs --
+  standby     %Text;         #IMPLIED  -- message to show while loading --
+  height      %Length;       #IMPLIED  -- override height --
+  width       %Length;       #IMPLIED  -- override width --
+  usemap      %URI;          #IMPLIED  -- use client-side image map --
+  name        CDATA          #IMPLIED  -- submit as part of form --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+<!ELEMENT PARAM - O EMPTY              -- named property value -->
+<!ATTLIST PARAM
+  id          ID             #IMPLIED  -- document-wide unique id --
+  name        CDATA          #REQUIRED -- property name --
+  value       CDATA          #IMPLIED  -- property value --
+  valuetype   (DATA|REF|OBJECT) DATA   -- How to interpret value --
+  type        %ContentType;  #IMPLIED  -- content type for value
+                                          when valuetype=ref --
+  >
+
+
+<!--=================== Horizontal Rule ==================================-->
+
+<!ELEMENT HR - O EMPTY -- horizontal rule -->
+<!ATTLIST HR
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--=================== Paragraphs =======================================-->
+
+<!ELEMENT P - O (%inline;)*            -- paragraph -->
+<!ATTLIST P
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--=================== Headings =========================================-->
+
+<!--
+  There are six levels of headings from H1 (the most important)
+  to H6 (the least important).
+-->
+
+<!ELEMENT (%heading;)  - - (%inline;)* -- heading -->
+<!ATTLIST (%heading;)
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--=================== Preformatted Text ================================-->
+
+<!-- excludes markup for images and changes in font size -->
+<!ENTITY % pre.exclusion "IMG|OBJECT|BIG|SMALL|SUB|SUP">
+
+<!ELEMENT PRE - - (%inline;)* -(%pre.exclusion;) -- preformatted text -->
+<!ATTLIST PRE
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--===================== Inline Quotes ==================================-->
+
+<!ELEMENT Q - - (%inline;)*            -- short inline quotation -->
+<!ATTLIST Q
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  cite        %URI;          #IMPLIED  -- URI for source document or msg --
+  >
+
+<!--=================== Block-like Quotes ================================-->
+
+<!ELEMENT BLOCKQUOTE - - (%block;|SCRIPT)+ -- long quotation -->
+<!ATTLIST BLOCKQUOTE
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  cite        %URI;          #IMPLIED  -- URI for source document or msg --
+  >
+
+<!--=================== Inserted/Deleted Text ============================-->
+
+
+<!-- INS/DEL are handled by inclusion on BODY -->
+<!ELEMENT (INS|DEL) - - (%flow;)*      -- inserted text, deleted text -->
+<!ATTLIST (INS|DEL)
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  cite        %URI;          #IMPLIED  -- info on reason for change --
+  datetime    %Datetime;     #IMPLIED  -- date and time of change --
+  >
+
+<!--=================== Lists ============================================-->
+
+<!-- definition lists - DT for term, DD for its definition -->
+
+<!ELEMENT DL - - (DT|DD)+              -- definition list -->
+<!ATTLIST DL
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!ELEMENT DT - O (%inline;)*           -- definition term -->
+<!ELEMENT DD - O (%flow;)*             -- definition description -->
+<!ATTLIST (DT|DD)
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+
+<!ELEMENT OL - - (LI)+                 -- ordered list -->
+<!ATTLIST OL
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!-- Unordered Lists (UL) bullet styles -->
+<!ELEMENT UL - - (LI)+                 -- unordered list -->
+<!ATTLIST UL
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+
+
+<!ELEMENT LI - O (%flow;)*             -- list item -->
+<!ATTLIST LI
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--================ Forms ===============================================-->
+<!ELEMENT FORM - - (%block;|SCRIPT)+ -(FORM) -- interactive form -->
+<!ATTLIST FORM
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  action      %URI;          #REQUIRED -- server-side form handler --
+  method      (GET|POST)     GET       -- HTTP method used to submit the form--
+  enctype     %ContentType;  "application/x-www-form-urlencoded"
+  accept      %ContentTypes; #IMPLIED  -- list of MIME types for file upload --
+  name        CDATA          #IMPLIED  -- name of form for scripting --
+  onsubmit    %Script;       #IMPLIED  -- the form was submitted --
+  onreset     %Script;       #IMPLIED  -- the form was reset --
+  accept-charset %Charsets;  #IMPLIED  -- list of supported charsets --
+  >
+
+<!-- Each label must not contain more than ONE field -->
+<!ELEMENT LABEL - - (%inline;)* -(LABEL) -- form field label text -->
+<!ATTLIST LABEL
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  for         IDREF          #IMPLIED  -- matches field ID value --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  >
+
+<!ENTITY % InputType
+  "(TEXT | PASSWORD | CHECKBOX |
+    RADIO | SUBMIT | RESET |
+    FILE | HIDDEN | IMAGE | BUTTON)"
+   >
+
+<!-- attribute name required for all but submit and reset -->
+<!ELEMENT INPUT - O EMPTY              -- form control -->
+<!ATTLIST INPUT
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  type        %InputType;    TEXT      -- what kind of widget is needed --
+  name        CDATA          #IMPLIED  -- submit as part of form --
+  value       CDATA          #IMPLIED  -- Specify for radio buttons and checkboxes --
+  checked     (checked)      #IMPLIED  -- for radio buttons and check boxes --
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  readonly    (readonly)     #IMPLIED  -- for text and passwd --
+  size        CDATA          #IMPLIED  -- specific to each type of field --
+  maxlength   NUMBER         #IMPLIED  -- max chars for text fields --
+  src         %URI;          #IMPLIED  -- for fields with images --
+  alt         CDATA          #IMPLIED  -- short description --
+  usemap      %URI;          #IMPLIED  -- use client-side image map --
+  ismap       (ismap)        #IMPLIED  -- use server-side image map --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  onselect    %Script;       #IMPLIED  -- some text was selected --
+  onchange    %Script;       #IMPLIED  -- the element value was changed --
+  accept      %ContentTypes; #IMPLIED  -- list of MIME types for file upload --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+<!ELEMENT SELECT - - (OPTGROUP|OPTION)+ -- option selector -->
+<!ATTLIST SELECT
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  name        CDATA          #IMPLIED  -- field name --
+  size        NUMBER         #IMPLIED  -- rows visible --
+  multiple    (multiple)     #IMPLIED  -- default is single selection --
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  onchange    %Script;       #IMPLIED  -- the element value was changed --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+<!ELEMENT OPTGROUP - - (OPTION)+ -- option group -->
+<!ATTLIST OPTGROUP
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  label       %Text;         #REQUIRED -- for use in hierarchical menus --
+  >
+
+<!ELEMENT OPTION - O (#PCDATA)         -- selectable choice -->
+<!ATTLIST OPTION
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  selected    (selected)     #IMPLIED
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  label       %Text;         #IMPLIED  -- for use in hierarchical menus --
+  value       CDATA          #IMPLIED  -- defaults to element content --
+  >
+
+<!ELEMENT TEXTAREA - - (#PCDATA)       -- multi-line text field -->
+<!ATTLIST TEXTAREA
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  name        CDATA          #IMPLIED
+  rows        NUMBER         #REQUIRED
+  cols        NUMBER         #REQUIRED
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  readonly    (readonly)     #IMPLIED
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  onselect    %Script;       #IMPLIED  -- some text was selected --
+  onchange    %Script;       #IMPLIED  -- the element value was changed --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+<!--
+  #PCDATA is to solve the mixed content problem,
+  per specification only whitespace is allowed there!
+ -->
+<!ELEMENT FIELDSET - - (#PCDATA,LEGEND,(%flow;)*) -- form control group -->
+<!ATTLIST FIELDSET
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!ELEMENT LEGEND - - (%inline;)*       -- fieldset legend -->
+
+<!ATTLIST LEGEND
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  >
+
+<!ELEMENT BUTTON - -
+     (%flow;)* -(A|%formctrl;|FORM|FIELDSET)
+     -- push button -->
+<!ATTLIST BUTTON
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  name        CDATA          #IMPLIED
+  value       CDATA          #IMPLIED  -- sent to server when submitted --
+  type        (button|submit|reset) submit -- for use as form button --
+  disabled    (disabled)     #IMPLIED  -- unavailable in this context --
+  tabindex    NUMBER         #IMPLIED  -- position in tabbing order --
+  accesskey   %Character;    #IMPLIED  -- accessibility key character --
+  onfocus     %Script;       #IMPLIED  -- the element got the focus --
+  onblur      %Script;       #IMPLIED  -- the element lost the focus --
+  %reserved;                           -- reserved for possible future use --
+  >
+
+<!--======================= Tables =======================================-->
+
+<!-- IETF HTML table standard, see [RFC1942] -->
+
+<!--
+ The BORDER attribute sets the thickness of the frame around the
+ table. The default units are screen pixels.
+
+ The FRAME attribute specifies which parts of the frame around
+ the table should be rendered. The values are not the same as
+ CALS to avoid a name clash with the VALIGN attribute.
+
+ The value "border" is included for backwards compatibility with
+ <TABLE BORDER> which yields frame=border and border=implied
+ For <TABLE BORDER=1> you get border=1 and frame=implied. In this
+ case, it is appropriate to treat this as frame=border for backwards
+ compatibility with deployed browsers.
+-->
+<!ENTITY % TFrame "(void|above|below|hsides|lhs|rhs|vsides|box|border)">
+
+<!--
+ The RULES attribute defines which rules to draw between cells:
+
+ If RULES is absent then assume:
+     "none" if BORDER is absent or BORDER=0 otherwise "all"
+-->
+
+<!ENTITY % TRules "(none | groups | rows | cols | all)">
+  
+<!-- horizontal placement of table relative to document -->
+<!ENTITY % TAlign "(left|center|right)">
+
+<!-- horizontal alignment attributes for cell contents -->
+<!ENTITY % cellhalign
+  "align      (left|center|right|justify|char) #IMPLIED
+   char       %Character;    #IMPLIED  -- alignment char, e.g. char=':' --
+   charoff    %Length;       #IMPLIED  -- offset for alignment char --"
+  >
+
+<!-- vertical alignment attributes for cell contents -->
+<!ENTITY % cellvalign
+  "valign     (top|middle|bottom|baseline) #IMPLIED"
+  >
+
+<!ELEMENT TABLE - -
+     (CAPTION?, (COL*|COLGROUP*), THEAD?, TFOOT?, TBODY+)>
+<!ELEMENT CAPTION  - - (%inline;)*     -- table caption -->
+<!ELEMENT THEAD    - O (TR)+           -- table header -->
+<!ELEMENT TFOOT    - O (TR)+           -- table footer -->
+<!ELEMENT TBODY    O O (TR)+           -- table body -->
+<!ELEMENT COLGROUP - O (COL)*          -- table column group -->
+<!ELEMENT COL      - O EMPTY           -- table column -->
+<!ELEMENT TR       - O (TH|TD)+        -- table row -->
+<!ELEMENT (TH|TD)  - O (%flow;)*       -- table header cell, table data cell-->
+
+<!ATTLIST TABLE                        -- table element --
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  summary     %Text;         #IMPLIED  -- purpose/structure for speech output--
+  width       %Length;       #IMPLIED  -- table width --
+  border      %Pixels;       #IMPLIED  -- controls frame width around table --
+  frame       %TFrame;       #IMPLIED  -- which parts of frame to render --
+  rules       %TRules;       #IMPLIED  -- rulings between rows and cols --
+  cellspacing %Length;       #IMPLIED  -- spacing between cells --
+  cellpadding %Length;       #IMPLIED  -- spacing within cells --
+  %reserved;                           -- reserved for possible future use --
+  datapagesize CDATA         #IMPLIED  -- reserved for possible future use --
+  >
+
+
+<!ATTLIST CAPTION
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--
+COLGROUP groups a set of COL elements. It allows you to group
+several semantically related columns together.
+-->
+<!ATTLIST COLGROUP
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  span        NUMBER         1         -- default number of columns in group --
+  width       %MultiLength;  #IMPLIED  -- default width for enclosed COLs --
+  %cellhalign;                         -- horizontal alignment in cells --
+  %cellvalign;                         -- vertical alignment in cells --
+  >
+
+<!--
+ COL elements define the alignment properties for cells in
+ one or more columns.
+
+ The WIDTH attribute specifies the width of the columns, e.g.
+
+     width=64        width in screen pixels
+     width=0.5*      relative width of 0.5
+
+ The SPAN attribute causes the attributes of one
+ COL element to apply to more than one column.
+-->
+<!ATTLIST COL                          -- column groups and properties --
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  span        NUMBER         1         -- COL attributes affect N columns --
+  width       %MultiLength;  #IMPLIED  -- column width specification --
+  %cellhalign;                         -- horizontal alignment in cells --
+  %cellvalign;                         -- vertical alignment in cells --
+  >
+
+<!--
+    Use THEAD to duplicate headers when breaking table
+    across page boundaries, or for static headers when
+    TBODY sections are rendered in scrolling panel.
+
+    Use TFOOT to duplicate footers when breaking table
+    across page boundaries, or for static footers when
+    TBODY sections are rendered in scrolling panel.
+
+    Use multiple TBODY sections when rules are needed
+    between groups of table rows.
+-->
+<!ATTLIST (THEAD|TBODY|TFOOT)          -- table section --
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  %cellhalign;                         -- horizontal alignment in cells --
+  %cellvalign;                         -- vertical alignment in cells --
+  >
+
+<!ATTLIST TR                           -- table row --
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  %cellhalign;                         -- horizontal alignment in cells --
+  %cellvalign;                         -- vertical alignment in cells --
+  >
+
+
+<!-- Scope is simpler than headers attribute for common tables -->
+<!ENTITY % Scope "(row|col|rowgroup|colgroup)">
+
+<!-- TH is for headers, TD for data, but for cells acting as both use TD -->
+<!ATTLIST (TH|TD)                      -- header or data cell --
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  abbr        %Text;         #IMPLIED  -- abbreviation for header cell --
+  axis        CDATA          #IMPLIED  -- comma-separated list of related headers--
+  headers     IDREFS         #IMPLIED  -- list of id's for header cells --
+  scope       %Scope;        #IMPLIED  -- scope covered by header cells --
+  rowspan     NUMBER         1         -- number of rows spanned by cell --
+  colspan     NUMBER         1         -- number of cols spanned by cell --
+  %cellhalign;                         -- horizontal alignment in cells --
+  %cellvalign;                         -- vertical alignment in cells --
+  >
+
+
+<!--================ Document Head =======================================-->
+<!-- %head.misc; defined earlier on as "SCRIPT|STYLE|META|LINK|OBJECT" -->
+<!ENTITY % head.content "TITLE & BASE?">
+
+<!ELEMENT HEAD O O (%head.content;) +(%head.misc;) -- document head -->
+<!ATTLIST HEAD
+  %i18n;                               -- lang, dir --
+  profile     %URI;          #IMPLIED  -- named dictionary of meta info --
+  >
+
+<!-- The TITLE element is not considered part of the flow of text.
+       It should be displayed, for example as the page header or
+       window title. Exactly one title is required per document.
+    -->
+<!ELEMENT TITLE - - (#PCDATA) -(%head.misc;) -- document title -->
+<!ATTLIST TITLE %i18n>
+
+
+<!ELEMENT BASE - O EMPTY               -- document base URI -->
+<!ATTLIST BASE
+  href        %URI;          #REQUIRED -- URI that acts as base URI --
+  >
+
+<!ELEMENT META - O EMPTY               -- generic metainformation -->
+<!ATTLIST META
+  %i18n;                               -- lang, dir, for use with content --
+  http-equiv  NAME           #IMPLIED  -- HTTP response header name  --
+  name        NAME           #IMPLIED  -- metainformation name --
+  content     CDATA          #REQUIRED -- associated information --
+  scheme      CDATA          #IMPLIED  -- select form of content --
+  >
+
+<!ELEMENT STYLE - - %StyleSheet        -- style info -->
+<!ATTLIST STYLE
+  %i18n;                               -- lang, dir, for use with title --
+  type        %ContentType;  #REQUIRED -- content type of style language --
+  media       %MediaDesc;    #IMPLIED  -- designed for use with these media --
+  title       %Text;         #IMPLIED  -- advisory title --
+  >
+
+<!ELEMENT SCRIPT - - %Script;          -- script statements -->
+<!ATTLIST SCRIPT
+  charset     %Charset;      #IMPLIED  -- char encoding of linked resource --
+  type        %ContentType;  #REQUIRED -- content type of script language --
+  src         %URI;          #IMPLIED  -- URI for an external script --
+  defer       (defer)        #IMPLIED  -- UA may defer execution of script --
+  event       CDATA          #IMPLIED  -- reserved for possible future use --
+  for         %URI;          #IMPLIED  -- reserved for possible future use --
+  >
+
+<!ELEMENT NOSCRIPT - - (%block;)+
+  -- alternate content container for non script-based rendering -->
+<!ATTLIST NOSCRIPT
+  %attrs;                              -- %coreattrs, %i18n, %events --
+  >
+
+<!--================ Document Structure ==================================-->
+<!ENTITY % html.content "HEAD, BODY">
+
+<!ELEMENT HTML O O (%html.content;)    -- document root element -->
+<!ATTLIST HTML
+  %i18n;                               -- lang, dir --
+  >
diff --git a/node_modules/xmldoc/node_modules/sax/examples/switch-bench.js b/node_modules/xmldoc/node_modules/sax/examples/switch-bench.js
new file mode 100755
index 0000000..4d3cf14
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/examples/switch-bench.js
@@ -0,0 +1,45 @@
+#!/usr/local/bin/node-bench
+
+var Promise = require("events").Promise;
+
+var xml = require("posix").cat("test.xml").wait(),
+  path = require("path"),
+  sax = require("../lib/sax"),
+  saxT = require("../lib/sax-trampoline"),
+  
+  parser = sax.parser(false, {trim:true}),
+  parserT = saxT.parser(false, {trim:true}),
+  
+  sys = require("sys");
+
+
+var count = exports.stepsPerLap = 500,
+  l = xml.length,
+  runs = 0;
+exports.countPerLap = 1000;
+exports.compare = {
+  "switch" : function () {
+    // sys.debug("switch runs: "+runs++);
+    // for (var x = 0; x < l; x += 1000) {
+    //   parser.write(xml.substr(x, 1000))
+    // }
+    // for (var i = 0; i < count; i ++) {
+      parser.write(xml);
+      parser.close();
+    // }
+    // done();
+  },
+  trampoline : function () {
+    // sys.debug("trampoline runs: "+runs++);
+    // for (var x = 0; x < l; x += 1000) {
+    //   parserT.write(xml.substr(x, 1000))
+    // }
+    // for (var i = 0; i < count; i ++) {
+      parserT.write(xml);
+      parserT.close();
+    // }
+    // done();
+  },
+};
+
+sys.debug("rock and roll...");
\ No newline at end of file
diff --git a/node_modules/xmldoc/node_modules/sax/examples/test.html b/node_modules/xmldoc/node_modules/sax/examples/test.html
new file mode 100644
index 0000000..61f8f1a
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/examples/test.html
@@ -0,0 +1,15 @@
+<!doctype html>
+
+<html lang="en">
+<head>
+	<title>testing the parser</title>
+</head>
+<body>
+
+<p>hello
+
+<script>
+
+</script>
+</body>
+</html>
diff --git a/node_modules/xmldoc/node_modules/sax/examples/test.xml b/node_modules/xmldoc/node_modules/sax/examples/test.xml
new file mode 100644
index 0000000..801292d
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/examples/test.xml
@@ -0,0 +1,1254 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE RootElement [
+	<!ENTITY e SYSTEM "001.ent">
+]>
+<RootElement param="value">
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+    <FirstElement>
+        Some Text
+    </FirstElement>
+    <?some_pi some_attr="some_value"?>
+    <!-- this is a comment -- but this isnt part of the comment -->
+    <!-- this is a comment == and this is a part of the comment -->
+    <!-- this is a comment > and this is also part of the thing -->
+    <!invalid comment>
+    <![CDATA[ this is random stuff. & and < and > are ok in here. ]]>
+    <SecondElement param2="something">
+        Pre-Text &amp; <Inline>Inlined text</Inline> Post-text.
+        &#xF8FF;
+    </SecondElement>
+</RootElement>
\ No newline at end of file
diff --git a/node_modules/xmldoc/node_modules/sax/lib/sax.js b/node_modules/xmldoc/node_modules/sax/lib/sax.js
new file mode 100644
index 0000000..8f3e071
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/lib/sax.js
@@ -0,0 +1,1016 @@
+// wrapper for non-node envs
+;(function (sax) {
+
+sax.parser = function (strict, opt) { return new SAXParser(strict, opt) }
+sax.SAXParser = SAXParser
+sax.SAXStream = SAXStream
+sax.createStream = createStream
+
+// When we pass the MAX_BUFFER_LENGTH position, start checking for buffer overruns.
+// When we check, schedule the next check for MAX_BUFFER_LENGTH - (max(buffer lengths)),
+// since that's the earliest that a buffer overrun could occur.  This way, checks are
+// as rare as required, but as often as necessary to ensure never crossing this bound.
+// Furthermore, buffers are only tested at most once per write(), so passing a very
+// large string into write() might have undesirable effects, but this is manageable by
+// the caller, so it is assumed to be safe.  Thus, a call to write() may, in the extreme
+// edge case, result in creating at most one complete copy of the string passed in.
+// Set to Infinity to have unlimited buffers.
+sax.MAX_BUFFER_LENGTH = 64 * 1024
+
+var buffers = [
+  "comment", "sgmlDecl", "textNode", "tagName", "doctype",
+  "procInstName", "procInstBody", "entity", "attribName",
+  "attribValue", "cdata", "script"
+]
+
+sax.EVENTS = // for discoverability.
+  [ "text"
+  , "processinginstruction"
+  , "sgmldeclaration"
+  , "doctype"
+  , "comment"
+  , "attribute"
+  , "opentag"
+  , "closetag"
+  , "opencdata"
+  , "cdata"
+  , "closecdata"
+  , "error"
+  , "end"
+  , "ready"
+  , "script"
+  , "opennamespace"
+  , "closenamespace"
+  ]
+
+function SAXParser (strict, opt) {
+  if (!(this instanceof SAXParser)) return new SAXParser(strict, opt)
+
+  var parser = this
+  clearBuffers(parser)
+  parser.q = parser.c = ""
+  parser.bufferCheckPosition = sax.MAX_BUFFER_LENGTH
+  parser.opt = opt || {}
+  parser.opt.lowercase = parser.opt.lowercase || parser.opt.lowercasetags;
+  parser.looseCase = parser.opt.lowercase ? "toLowerCase" : "toUpperCase"
+  parser.tags = []
+  parser.closed = parser.closedRoot = parser.sawRoot = false
+  parser.tag = parser.error = null
+  parser.strict = !!strict
+  parser.noscript = !!(strict || parser.opt.noscript)
+  parser.state = S.BEGIN
+  parser.ENTITIES = Object.create(sax.ENTITIES)
+  parser.attribList = []
+
+  // namespaces form a prototype chain.
+  // it always points at the current tag,
+  // which protos to its parent tag.
+  if (parser.opt.xmlns) parser.ns = Object.create(rootNS)
+
+  // mostly just for error reporting
+  parser.trackPosition = parser.opt.position !== false
+  if (parser.trackPosition) {
+    parser.position = parser.line = parser.column = 0
+  }
+  emit(parser, "onready")
+}
+
+if (!Object.create) Object.create = function (o) {
+  function f () { this.__proto__ = o }
+  f.prototype = o
+  return new f
+}
+
+if (!Object.getPrototypeOf) Object.getPrototypeOf = function (o) {
+  return o.__proto__
+}
+
+if (!Object.keys) Object.keys = function (o) {
+  var a = []
+  for (var i in o) if (o.hasOwnProperty(i)) a.push(i)
+  return a
+}
+
+function checkBufferLength (parser) {
+  var maxAllowed = Math.max(sax.MAX_BUFFER_LENGTH, 10)
+    , maxActual = 0
+  for (var i = 0, l = buffers.length; i < l; i ++) {
+    var len = parser[buffers[i]].length
+    if (len > maxAllowed) {
+      // Text/cdata nodes can get big, and since they're buffered,
+      // we can get here under normal conditions.
+      // Avoid issues by emitting the text node now,
+      // so at least it won't get any bigger.
+      switch (buffers[i]) {
+        case "textNode":
+          closeText(parser)
+        break
+
+        case "cdata":
+          emitNode(parser, "oncdata", parser.cdata)
+          parser.cdata = ""
+        break
+
+        case "script":
+          emitNode(parser, "onscript", parser.script)
+          parser.script = ""
+        break
+
+        default:
+          error(parser, "Max buffer length exceeded: "+buffers[i])
+      }
+    }
+    maxActual = Math.max(maxActual, len)
+  }
+  // schedule the next check for the earliest possible buffer overrun.
+  parser.bufferCheckPosition = (sax.MAX_BUFFER_LENGTH - maxActual)
+                             + parser.position
+}
+
+function clearBuffers (parser) {
+  for (var i = 0, l = buffers.length; i < l; i ++) {
+    parser[buffers[i]] = ""
+  }
+}
+
+SAXParser.prototype =
+  { end: function () { end(this) }
+  , write: write
+  , resume: function () { this.error = null; return this }
+  , close: function () { return this.write(null) }
+  }
+
+try {
+  var Stream = require("stream").Stream
+} catch (ex) {
+  var Stream = function () {}
+}
+
+
+var streamWraps = sax.EVENTS.filter(function (ev) {
+  return ev !== "error" && ev !== "end"
+})
+
+function createStream (strict, opt) {
+  return new SAXStream(strict, opt)
+}
+
+function SAXStream (strict, opt) {
+  if (!(this instanceof SAXStream)) return new SAXStream(strict, opt)
+
+  Stream.apply(me)
+
+  this._parser = new SAXParser(strict, opt)
+  this.writable = true
+  this.readable = true
+
+
+  var me = this
+
+  this._parser.onend = function () {
+    me.emit("end")
+  }
+
+  this._parser.onerror = function (er) {
+    me.emit("error", er)
+
+    // if didn't throw, then means error was handled.
+    // go ahead and clear error, so we can write again.
+    me._parser.error = null
+  }
+
+  streamWraps.forEach(function (ev) {
+    Object.defineProperty(me, "on" + ev, {
+      get: function () { return me._parser["on" + ev] },
+      set: function (h) {
+        if (!h) {
+          me.removeAllListeners(ev)
+          return me._parser["on"+ev] = h
+        }
+        me.on(ev, h)
+      },
+      enumerable: true,
+      configurable: false
+    })
+  })
+}
+
+SAXStream.prototype = Object.create(Stream.prototype,
+  { constructor: { value: SAXStream } })
+
+SAXStream.prototype.write = function (data) {
+  this._parser.write(data.toString())
+  this.emit("data", data)
+  return true
+}
+
+SAXStream.prototype.end = function (chunk) {
+  if (chunk && chunk.length) this._parser.write(chunk.toString())
+  this._parser.end()
+  return true
+}
+
+SAXStream.prototype.on = function (ev, handler) {
+  var me = this
+  if (!me._parser["on"+ev] && streamWraps.indexOf(ev) !== -1) {
+    me._parser["on"+ev] = function () {
+      var args = arguments.length === 1 ? [arguments[0]]
+               : Array.apply(null, arguments)
+      args.splice(0, 0, ev)
+      me.emit.apply(me, args)
+    }
+  }
+
+  return Stream.prototype.on.call(me, ev, handler)
+}
+
+
+
+// character classes and tokens
+var whitespace = "\r\n\t "
+  // this really needs to be replaced with character classes.
+  // XML allows all manner of ridiculous numbers and digits.
+  , number = "0124356789"
+  , letter = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
+  // (Letter | "_" | ":")
+  , nameStart = letter+"_:"
+  , nameBody = nameStart+number+"-."
+  , quote = "'\""
+  , entity = number+letter+"#"
+  , attribEnd = whitespace + ">"
+  , CDATA = "[CDATA["
+  , DOCTYPE = "DOCTYPE"
+  , XML_NAMESPACE = "http://www.w3.org/XML/1998/namespace"
+  , XMLNS_NAMESPACE = "http://www.w3.org/2000/xmlns/"
+  , rootNS = { xml: XML_NAMESPACE, xmlns: XMLNS_NAMESPACE }
+
+// turn all the string character sets into character class objects.
+whitespace = charClass(whitespace)
+number = charClass(number)
+letter = charClass(letter)
+nameStart = charClass(nameStart)
+nameBody = charClass(nameBody)
+quote = charClass(quote)
+entity = charClass(entity)
+attribEnd = charClass(attribEnd)
+
+function charClass (str) {
+  return str.split("").reduce(function (s, c) {
+    s[c] = true
+    return s
+  }, {})
+}
+
+function is (charclass, c) {
+  return charclass[c]
+}
+
+function not (charclass, c) {
+  return !charclass[c]
+}
+
+var S = 0
+sax.STATE =
+{ BEGIN                     : S++
+, TEXT                      : S++ // general stuff
+, TEXT_ENTITY               : S++ // &amp and such.
+, OPEN_WAKA                 : S++ // <
+, SGML_DECL                 : S++ // <!BLARG
+, SGML_DECL_QUOTED          : S++ // <!BLARG foo "bar
+, DOCTYPE                   : S++ // <!DOCTYPE
+, DOCTYPE_QUOTED            : S++ // <!DOCTYPE "//blah
+, DOCTYPE_DTD               : S++ // <!DOCTYPE "//blah" [ ...
+, DOCTYPE_DTD_QUOTED        : S++ // <!DOCTYPE "//blah" [ "foo
+, COMMENT_STARTING          : S++ // <!-
+, COMMENT                   : S++ // <!--
+, COMMENT_ENDING            : S++ // <!-- blah -
+, COMMENT_ENDED             : S++ // <!-- blah --
+, CDATA                     : S++ // <![CDATA[ something
+, CDATA_ENDING              : S++ // ]
+, CDATA_ENDING_2            : S++ // ]]
+, PROC_INST                 : S++ // <?hi
+, PROC_INST_BODY            : S++ // <?hi there
+, PROC_INST_QUOTED          : S++ // <?hi "there
+, PROC_INST_ENDING          : S++ // <?hi "there" ?
+, OPEN_TAG                  : S++ // <strong
+, OPEN_TAG_SLASH            : S++ // <strong /
+, ATTRIB                    : S++ // <a
+, ATTRIB_NAME               : S++ // <a foo
+, ATTRIB_NAME_SAW_WHITE     : S++ // <a foo _
+, ATTRIB_VALUE              : S++ // <a foo=
+, ATTRIB_VALUE_QUOTED       : S++ // <a foo="bar
+, ATTRIB_VALUE_UNQUOTED     : S++ // <a foo=bar
+, ATTRIB_VALUE_ENTITY_Q     : S++ // <foo bar="&quot;"
+, ATTRIB_VALUE_ENTITY_U     : S++ // <foo bar=&quot;
+, CLOSE_TAG                 : S++ // </a
+, CLOSE_TAG_SAW_WHITE       : S++ // </a   >
+, SCRIPT                    : S++ // <script> ...
+, SCRIPT_ENDING             : S++ // <script> ... <
+}
+
+sax.ENTITIES =
+{ "apos" : "'"
+, "quot" : "\""
+, "amp"  : "&"
+, "gt"   : ">"
+, "lt"   : "<"
+}
+
+for (var S in sax.STATE) sax.STATE[sax.STATE[S]] = S
+
+// shorthand
+S = sax.STATE
+
+function emit (parser, event, data) {
+  parser[event] && parser[event](data)
+}
+
+function emitNode (parser, nodeType, data) {
+  if (parser.textNode) closeText(parser)
+  emit(parser, nodeType, data)
+}
+
+function closeText (parser) {
+  parser.textNode = textopts(parser.opt, parser.textNode)
+  if (parser.textNode) emit(parser, "ontext", parser.textNode)
+  parser.textNode = ""
+}
+
+function textopts (opt, text) {
+  if (opt.trim) text = text.trim()
+  if (opt.normalize) text = text.replace(/\s+/g, " ")
+  return text
+}
+
+function error (parser, er) {
+  closeText(parser)
+  if (parser.trackPosition) {
+    er += "\nLine: "+parser.line+
+          "\nColumn: "+parser.column+
+          "\nChar: "+parser.c
+  }
+  er = new Error(er)
+  parser.error = er
+  emit(parser, "onerror", er)
+  return parser
+}
+
+function end (parser) {
+  if (parser.state !== S.TEXT) error(parser, "Unexpected end")
+  closeText(parser)
+  parser.c = ""
+  parser.closed = true
+  emit(parser, "onend")
+  SAXParser.call(parser, parser.strict, parser.opt)
+  return parser
+}
+
+function strictFail (parser, message) {
+  if (parser.strict) error(parser, message)
+}
+
+function newTag (parser) {
+  if (!parser.strict) parser.tagName = parser.tagName[parser.looseCase]()
+  var parent = parser.tags[parser.tags.length - 1] || parser
+    , tag = parser.tag = { name : parser.tagName, attributes : {} }
+
+  // will be overridden if tag contails an xmlns="foo" or xmlns:foo="bar"
+  if (parser.opt.xmlns) tag.ns = parent.ns
+  parser.attribList.length = 0
+}
+
+function qname (name) {
+  var i = name.indexOf(":")
+    , qualName = i < 0 ? [ "", name ] : name.split(":")
+    , prefix = qualName[0]
+    , local = qualName[1]
+
+  // <x "xmlns"="http://foo">
+  if (name === "xmlns") {
+    prefix = "xmlns"
+    local = ""
+  }
+
+  return { prefix: prefix, local: local }
+}
+
+function attrib (parser) {
+  if (!parser.strict) parser.attribName = parser.attribName[parser.looseCase]()
+  if (parser.opt.xmlns) {
+    var qn = qname(parser.attribName)
+      , prefix = qn.prefix
+      , local = qn.local
+
+    if (prefix === "xmlns") {
+      // namespace binding attribute; push the binding into scope
+      if (local === "xml" && parser.attribValue !== XML_NAMESPACE) {
+        strictFail( parser
+                  , "xml: prefix must be bound to " + XML_NAMESPACE + "\n"
+                  + "Actual: " + parser.attribValue )
+      } else if (local === "xmlns" && parser.attribValue !== XMLNS_NAMESPACE) {
+        strictFail( parser
+                  , "xmlns: prefix must be bound to " + XMLNS_NAMESPACE + "\n"
+                  + "Actual: " + parser.attribValue )
+      } else {
+        var tag = parser.tag
+          , parent = parser.tags[parser.tags.length - 1] || parser
+        if (tag.ns === parent.ns) {
+          tag.ns = Object.create(parent.ns)
+        }
+        tag.ns[local] = parser.attribValue
+      }
+    }
+
+    // defer onattribute events until all attributes have been seen
+    // so any new bindings can take effect; preserve attribute order
+    // so deferred events can be emitted in document order
+    parser.attribList.push([parser.attribName, parser.attribValue])
+  } else {
+    // in non-xmlns mode, we can emit the event right away
+    parser.tag.attributes[parser.attribName] = parser.attribValue
+    emitNode( parser
+            , "onattribute"
+            , { name: parser.attribName
+              , value: parser.attribValue } )
+  }
+
+  parser.attribName = parser.attribValue = ""
+}
+
+function openTag (parser, selfClosing) {
+  if (parser.opt.xmlns) {
+    // emit namespace binding events
+    var tag = parser.tag
+
+    // add namespace info to tag
+    var qn = qname(parser.tagName)
+    tag.prefix = qn.prefix
+    tag.local = qn.local
+    tag.uri = tag.ns[qn.prefix] || qn.prefix
+
+    if (tag.prefix && !tag.uri) {
+      strictFail(parser, "Unbound namespace prefix: "
+                       + JSON.stringify(parser.tagName))
+    }
+
+    var parent = parser.tags[parser.tags.length - 1] || parser
+    if (tag.ns && parent.ns !== tag.ns) {
+      Object.keys(tag.ns).forEach(function (p) {
+        emitNode( parser
+                , "onopennamespace"
+                , { prefix: p , uri: tag.ns[p] } )
+      })
+    }
+
+    // handle deferred onattribute events
+    // Note: do not apply default ns to attributes:
+    //   http://www.w3.org/TR/REC-xml-names/#defaulting
+    for (var i = 0, l = parser.attribList.length; i < l; i ++) {
+      var nv = parser.attribList[i]
+      var name = nv[0]
+        , value = nv[1]
+        , qualName = qname(name)
+        , prefix = qualName.prefix
+        , local = qualName.local
+        , uri = prefix == "" ? "" : (tag.ns[prefix] || "")
+        , a = { name: name
+              , value: value
+              , prefix: prefix
+              , local: local
+              , uri: uri
+              }
+
+      // if there's any attributes with an undefined namespace,
+      // then fail on them now.
+      if (prefix && prefix != "xmlns" && !uri) {
+        strictFail(parser, "Unbound namespace prefix: "
+                         + JSON.stringify(prefix))
+        a.uri = prefix
+      }
+      parser.tag.attributes[name] = a
+      emitNode(parser, "onattribute", a)
+    }
+    parser.attribList.length = 0
+  }
+
+  // process the tag
+  parser.sawRoot = true
+  parser.tags.push(parser.tag)
+  emitNode(parser, "onopentag", parser.tag)
+  if (!selfClosing) {
+    // special case for <script> in non-strict mode.
+    if (!parser.noscript && parser.tagName.toLowerCase() === "script") {
+      parser.state = S.SCRIPT
+    } else {
+      parser.state = S.TEXT
+    }
+    parser.tag = null
+    parser.tagName = ""
+  }
+  parser.attribName = parser.attribValue = ""
+  parser.attribList.length = 0
+}
+
+function closeTag (parser) {
+  if (!parser.tagName) {
+    strictFail(parser, "Weird empty close tag.")
+    parser.textNode += "</>"
+    parser.state = S.TEXT
+    return
+  }
+  // first make sure that the closing tag actually exists.
+  // <a><b></c></b></a> will close everything, otherwise.
+  var t = parser.tags.length
+  var tagName = parser.tagName
+  if (!parser.strict) tagName = tagName[parser.looseCase]()
+  var closeTo = tagName
+  while (t --) {
+    var close = parser.tags[t]
+    if (close.name !== closeTo) {
+      // fail the first time in strict mode
+      strictFail(parser, "Unexpected close tag")
+    } else break
+  }
+
+  // didn't find it.  we already failed for strict, so just abort.
+  if (t < 0) {
+    strictFail(parser, "Unmatched closing tag: "+parser.tagName)
+    parser.textNode += "</" + parser.tagName + ">"
+    parser.state = S.TEXT
+    return
+  }
+  parser.tagName = tagName
+  var s = parser.tags.length
+  while (s --> t) {
+    var tag = parser.tag = parser.tags.pop()
+    parser.tagName = parser.tag.name
+    emitNode(parser, "onclosetag", parser.tagName)
+
+    var x = {}
+    for (var i in tag.ns) x[i] = tag.ns[i]
+
+    var parent = parser.tags[parser.tags.length - 1] || parser
+    if (parser.opt.xmlns && tag.ns !== parent.ns) {
+      // remove namespace bindings introduced by tag
+      Object.keys(tag.ns).forEach(function (p) {
+        var n = tag.ns[p]
+        emitNode(parser, "onclosenamespace", { prefix: p, uri: n })
+      })
+    }
+  }
+  if (t === 0) parser.closedRoot = true
+  parser.tagName = parser.attribValue = parser.attribName = ""
+  parser.attribList.length = 0
+  parser.state = S.TEXT
+}
+
+function parseEntity (parser) {
+  var entity = parser.entity.toLowerCase()
+    , num
+    , numStr = ""
+  if (parser.ENTITIES[entity]) return parser.ENTITIES[entity]
+  if (entity.charAt(0) === "#") {
+    if (entity.charAt(1) === "x") {
+      entity = entity.slice(2)
+      num = parseInt(entity, 16)
+      numStr = num.toString(16)
+    } else {
+      entity = entity.slice(1)
+      num = parseInt(entity, 10)
+      numStr = num.toString(10)
+    }
+  }
+  entity = entity.replace(/^0+/, "")
+  if (numStr.toLowerCase() !== entity) {
+    strictFail(parser, "Invalid character entity")
+    return "&"+parser.entity + ";"
+  }
+  return String.fromCharCode(num)
+}
+
+function write (chunk) {
+  var parser = this
+  if (this.error) throw this.error
+  if (parser.closed) return error(parser,
+    "Cannot write after close. Assign an onready handler.")
+  if (chunk === null) return end(parser)
+  var i = 0, c = ""
+  while (parser.c = c = chunk.charAt(i++)) {
+    if (parser.trackPosition) {
+      parser.position ++
+      if (c === "\n") {
+        parser.line ++
+        parser.column = 0
+      } else parser.column ++
+    }
+    switch (parser.state) {
+
+      case S.BEGIN:
+        if (c === "<") parser.state = S.OPEN_WAKA
+        else if (not(whitespace,c)) {
+          // have to process this as a text node.
+          // weird, but happens.
+          strictFail(parser, "Non-whitespace before first tag.")
+          parser.textNode = c
+          parser.state = S.TEXT
+        }
+      continue
+
+      case S.TEXT:
+        if (parser.sawRoot && !parser.closedRoot) {
+          var starti = i-1
+          while (c && c!=="<" && c!=="&") {
+            c = chunk.charAt(i++)
+            if (c && parser.trackPosition) {
+              parser.position ++
+              if (c === "\n") {
+                parser.line ++
+                parser.column = 0
+              } else parser.column ++
+            }
+          }
+          parser.textNode += chunk.substring(starti, i-1)
+        }
+        if (c === "<") parser.state = S.OPEN_WAKA
+        else {
+          if (not(whitespace, c) && (!parser.sawRoot || parser.closedRoot))
+            strictFail("Text data outside of root node.")
+          if (c === "&") parser.state = S.TEXT_ENTITY
+          else parser.textNode += c
+        }
+      continue
+
+      case S.SCRIPT:
+        // only non-strict
+        if (c === "<") {
+          parser.state = S.SCRIPT_ENDING
+        } else parser.script += c
+      continue
+
+      case S.SCRIPT_ENDING:
+        if (c === "/") {
+          emitNode(parser, "onscript", parser.script)
+          parser.state = S.CLOSE_TAG
+          parser.script = ""
+          parser.tagName = ""
+        } else {
+          parser.script += "<" + c
+          parser.state = S.SCRIPT
+        }
+      continue
+
+      case S.OPEN_WAKA:
+        // either a /, ?, !, or text is coming next.
+        if (c === "!") {
+          parser.state = S.SGML_DECL
+          parser.sgmlDecl = ""
+        } else if (is(whitespace, c)) {
+          // wait for it...
+        } else if (is(nameStart,c)) {
+          parser.startTagPosition = parser.position - 1
+          parser.state = S.OPEN_TAG
+          parser.tagName = c
+        } else if (c === "/") {
+          parser.startTagPosition = parser.position - 1
+          parser.state = S.CLOSE_TAG
+          parser.tagName = ""
+        } else if (c === "?") {
+          parser.state = S.PROC_INST
+          parser.procInstName = parser.procInstBody = ""
+        } else {
+          strictFail(parser, "Unencoded <")
+          parser.textNode += "<" + c
+          parser.state = S.TEXT
+        }
+      continue
+
+      case S.SGML_DECL:
+        if ((parser.sgmlDecl+c).toUpperCase() === CDATA) {
+          emitNode(parser, "onopencdata")
+          parser.state = S.CDATA
+          parser.sgmlDecl = ""
+          parser.cdata = ""
+        } else if (parser.sgmlDecl+c === "--") {
+          parser.state = S.COMMENT
+          parser.comment = ""
+          parser.sgmlDecl = ""
+        } else if ((parser.sgmlDecl+c).toUpperCase() === DOCTYPE) {
+          parser.state = S.DOCTYPE
+          if (parser.doctype || parser.sawRoot) strictFail(parser,
+            "Inappropriately located doctype declaration")
+          parser.doctype = ""
+          parser.sgmlDecl = ""
+        } else if (c === ">") {
+          emitNode(parser, "onsgmldeclaration", parser.sgmlDecl)
+          parser.sgmlDecl = ""
+          parser.state = S.TEXT
+        } else if (is(quote, c)) {
+          parser.state = S.SGML_DECL_QUOTED
+          parser.sgmlDecl += c
+        } else parser.sgmlDecl += c
+      continue
+
+      case S.SGML_DECL_QUOTED:
+        if (c === parser.q) {
+          parser.state = S.SGML_DECL
+          parser.q = ""
+        }
+        parser.sgmlDecl += c
+      continue
+
+      case S.DOCTYPE:
+        if (c === ">") {
+          parser.state = S.TEXT
+          emitNode(parser, "ondoctype", parser.doctype)
+          parser.doctype = true // just remember that we saw it.
+        } else {
+          parser.doctype += c
+          if (c === "[") parser.state = S.DOCTYPE_DTD
+          else if (is(quote, c)) {
+            parser.state = S.DOCTYPE_QUOTED
+            parser.q = c
+          }
+        }
+      continue
+
+      case S.DOCTYPE_QUOTED:
+        parser.doctype += c
+        if (c === parser.q) {
+          parser.q = ""
+          parser.state = S.DOCTYPE
+        }
+      continue
+
+      case S.DOCTYPE_DTD:
+        parser.doctype += c
+        if (c === "]") parser.state = S.DOCTYPE
+        else if (is(quote,c)) {
+          parser.state = S.DOCTYPE_DTD_QUOTED
+          parser.q = c
+        }
+      continue
+
+      case S.DOCTYPE_DTD_QUOTED:
+        parser.doctype += c
+        if (c === parser.q) {
+          parser.state = S.DOCTYPE_DTD
+          parser.q = ""
+        }
+      continue
+
+      case S.COMMENT:
+        if (c === "-") parser.state = S.COMMENT_ENDING
+        else parser.comment += c
+      continue
+
+      case S.COMMENT_ENDING:
+        if (c === "-") {
+          parser.state = S.COMMENT_ENDED
+          parser.comment = textopts(parser.opt, parser.comment)
+          if (parser.comment) emitNode(parser, "oncomment", parser.comment)
+          parser.comment = ""
+        } else {
+          parser.comment += "-" + c
+          parser.state = S.COMMENT
+        }
+      continue
+
+      case S.COMMENT_ENDED:
+        if (c !== ">") {
+          strictFail(parser, "Malformed comment")
+          // allow <!-- blah -- bloo --> in non-strict mode,
+          // which is a comment of " blah -- bloo "
+          parser.comment += "--" + c
+          parser.state = S.COMMENT
+        } else parser.state = S.TEXT
+      continue
+
+      case S.CDATA:
+        if (c === "]") parser.state = S.CDATA_ENDING
+        else parser.cdata += c
+      continue
+
+      case S.CDATA_ENDING:
+        if (c === "]") parser.state = S.CDATA_ENDING_2
+        else {
+          parser.cdata += "]" + c
+          parser.state = S.CDATA
+        }
+      continue
+
+      case S.CDATA_ENDING_2:
+        if (c === ">") {
+          if (parser.cdata) emitNode(parser, "oncdata", parser.cdata)
+          emitNode(parser, "onclosecdata")
+          parser.cdata = ""
+          parser.state = S.TEXT
+        } else if (c === "]") {
+          parser.cdata += "]"
+        } else {
+          parser.cdata += "]]" + c
+          parser.state = S.CDATA
+        }
+      continue
+
+      case S.PROC_INST:
+        if (c === "?") parser.state = S.PROC_INST_ENDING
+        else if (is(whitespace, c)) parser.state = S.PROC_INST_BODY
+        else parser.procInstName += c
+      continue
+
+      case S.PROC_INST_BODY:
+        if (!parser.procInstBody && is(whitespace, c)) continue
+        else if (c === "?") parser.state = S.PROC_INST_ENDING
+        else if (is(quote, c)) {
+          parser.state = S.PROC_INST_QUOTED
+          parser.q = c
+          parser.procInstBody += c
+        } else parser.procInstBody += c
+      continue
+
+      case S.PROC_INST_ENDING:
+        if (c === ">") {
+          emitNode(parser, "onprocessinginstruction", {
+            name : parser.procInstName,
+            body : parser.procInstBody
+          })
+          parser.procInstName = parser.procInstBody = ""
+          parser.state = S.TEXT
+        } else {
+          parser.procInstBody += "?" + c
+          parser.state = S.PROC_INST_BODY
+        }
+      continue
+
+      case S.PROC_INST_QUOTED:
+        parser.procInstBody += c
+        if (c === parser.q) {
+          parser.state = S.PROC_INST_BODY
+          parser.q = ""
+        }
+      continue
+
+      case S.OPEN_TAG:
+        if (is(nameBody, c)) parser.tagName += c
+        else {
+          newTag(parser)
+          if (c === ">") openTag(parser)
+          else if (c === "/") parser.state = S.OPEN_TAG_SLASH
+          else {
+            if (not(whitespace, c)) strictFail(
+              parser, "Invalid character in tag name")
+            parser.state = S.ATTRIB
+          }
+        }
+      continue
+
+      case S.OPEN_TAG_SLASH:
+        if (c === ">") {
+          openTag(parser, true)
+          closeTag(parser)
+        } else {
+          strictFail(parser, "Forward-slash in opening tag not followed by >")
+          parser.state = S.ATTRIB
+        }
+      continue
+
+      case S.ATTRIB:
+        // haven't read the attribute name yet.
+        if (is(whitespace, c)) continue
+        else if (c === ">") openTag(parser)
+        else if (c === "/") parser.state = S.OPEN_TAG_SLASH
+        else if (is(nameStart, c)) {
+          parser.attribName = c
+          parser.attribValue = ""
+          parser.state = S.ATTRIB_NAME
+        } else strictFail(parser, "Invalid attribute name")
+      continue
+
+      case S.ATTRIB_NAME:
+        if (c === "=") parser.state = S.ATTRIB_VALUE
+        else if (is(whitespace, c)) parser.state = S.ATTRIB_NAME_SAW_WHITE
+        else if (is(nameBody, c)) parser.attribName += c
+        else strictFail(parser, "Invalid attribute name")
+      continue
+
+      case S.ATTRIB_NAME_SAW_WHITE:
+        if (c === "=") parser.state = S.ATTRIB_VALUE
+        else if (is(whitespace, c)) continue
+        else {
+          strictFail(parser, "Attribute without value")
+          parser.tag.attributes[parser.attribName] = ""
+          parser.attribValue = ""
+          emitNode(parser, "onattribute",
+                   { name : parser.attribName, value : "" })
+          parser.attribName = ""
+          if (c === ">") openTag(parser)
+          else if (is(nameStart, c)) {
+            parser.attribName = c
+            parser.state = S.ATTRIB_NAME
+          } else {
+            strictFail(parser, "Invalid attribute name")
+            parser.state = S.ATTRIB
+          }
+        }
+      continue
+
+      case S.ATTRIB_VALUE:
+        if (is(whitespace, c)) continue
+        else if (is(quote, c)) {
+          parser.q = c
+          parser.state = S.ATTRIB_VALUE_QUOTED
+        } else {
+          strictFail(parser, "Unquoted attribute value")
+          parser.state = S.ATTRIB_VALUE_UNQUOTED
+          parser.attribValue = c
+        }
+      continue
+
+      case S.ATTRIB_VALUE_QUOTED:
+        if (c !== parser.q) {
+          if (c === "&") parser.state = S.ATTRIB_VALUE_ENTITY_Q
+          else parser.attribValue += c
+          continue
+        }
+        attrib(parser)
+        parser.q = ""
+        parser.state = S.ATTRIB
+      continue
+
+      case S.ATTRIB_VALUE_UNQUOTED:
+        if (not(attribEnd,c)) {
+          if (c === "&") parser.state = S.ATTRIB_VALUE_ENTITY_U
+          else parser.attribValue += c
+          continue
+        }
+        attrib(parser)
+        if (c === ">") openTag(parser)
+        else parser.state = S.ATTRIB
+      continue
+
+      case S.CLOSE_TAG:
+        if (!parser.tagName) {
+          if (is(whitespace, c)) continue
+          else if (not(nameStart, c)) strictFail(parser,
+            "Invalid tagname in closing tag.")
+          else parser.tagName = c
+        }
+        else if (c === ">") closeTag(parser)
+        else if (is(nameBody, c)) parser.tagName += c
+        else {
+          if (not(whitespace, c)) strictFail(parser,
+            "Invalid tagname in closing tag")
+          parser.state = S.CLOSE_TAG_SAW_WHITE
+        }
+      continue
+
+      case S.CLOSE_TAG_SAW_WHITE:
+        if (is(whitespace, c)) continue
+        if (c === ">") closeTag(parser)
+        else strictFail("Invalid characters in closing tag")
+      continue
+
+      case S.TEXT_ENTITY:
+      case S.ATTRIB_VALUE_ENTITY_Q:
+      case S.ATTRIB_VALUE_ENTITY_U:
+        switch(parser.state) {
+          case S.TEXT_ENTITY:
+            var returnState = S.TEXT, buffer = "textNode"
+          break
+
+          case S.ATTRIB_VALUE_ENTITY_Q:
+            var returnState = S.ATTRIB_VALUE_QUOTED, buffer = "attribValue"
+          break
+
+          case S.ATTRIB_VALUE_ENTITY_U:
+            var returnState = S.ATTRIB_VALUE_UNQUOTED, buffer = "attribValue"
+          break
+        }
+        if (c === ";") {
+          parser[buffer] += parseEntity(parser)
+          parser.entity = ""
+          parser.state = returnState
+        }
+        else if (is(entity, c)) parser.entity += c
+        else {
+          strictFail("Invalid character entity")
+          parser[buffer] += "&" + parser.entity + c
+          parser.entity = ""
+          parser.state = returnState
+        }
+      continue
+
+      default:
+        throw new Error(parser, "Unknown state: " + parser.state)
+    }
+  } // while
+  // cdata blocks can get very big under normal conditions. emit and move on.
+  // if (parser.state === S.CDATA && parser.cdata) {
+  //   emitNode(parser, "oncdata", parser.cdata)
+  //   parser.cdata = ""
+  // }
+  if (parser.position >= parser.bufferCheckPosition) checkBufferLength(parser)
+  return parser
+}
+
+})(typeof exports === "undefined" ? sax = {} : exports)
diff --git a/node_modules/xmldoc/node_modules/sax/package.json b/node_modules/xmldoc/node_modules/sax/package.json
new file mode 100644
index 0000000..36c8856
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/package.json
@@ -0,0 +1,71 @@
+{
+  "name": "sax",
+  "description": "An evented streaming XML parser in JavaScript",
+  "author": {
+    "name": "Isaac Z. Schlueter",
+    "email": "i@izs.me",
+    "url": "http://blog.izs.me/"
+  },
+  "version": "0.4.2",
+  "main": "lib/sax.js",
+  "license": {
+    "type": "MIT",
+    "url": "https://raw.github.com/isaacs/sax-js/master/LICENSE"
+  },
+  "scripts": {
+    "test": "node test/index.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/isaacs/sax-js.git"
+  },
+  "contributors": [
+    {
+      "name": "Isaac Z. Schlueter",
+      "email": "i@izs.me"
+    },
+    {
+      "name": "Stein Martin Hustad",
+      "email": "stein@hustad.com"
+    },
+    {
+      "name": "Mikeal Rogers",
+      "email": "mikeal.rogers@gmail.com"
+    },
+    {
+      "name": "Laurie Harper",
+      "email": "laurie@holoweb.net"
+    },
+    {
+      "name": "Jann Horn",
+      "email": "jann@Jann-PC.fritz.box"
+    },
+    {
+      "name": "Elijah Insua",
+      "email": "tmpvar@gmail.com"
+    },
+    {
+      "name": "Henry Rawas",
+      "email": "henryr@schakra.com"
+    },
+    {
+      "name": "Justin Makeig",
+      "email": "jmpublic@makeig.com"
+    },
+    {
+      "name": "Mike",
+      "email": "mike@emotive.com"
+    }
+  ],
+  "readme": "# sax js\n\nA sax-style parser for XML and HTML.\n\nDesigned with [node](http://nodejs.org/) in mind, but should work fine in\nthe browser or other CommonJS implementations.\n\n## What This Is\n\n* A very simple tool to parse through an XML string.\n* A stepping stone to a streaming HTML parser.\n* A handy way to deal with RSS and other mostly-ok-but-kinda-broken XML \n  docs.\n\n## What This Is (probably) Not\n\n* An HTML Parser - That's a fine goal, but this isn't it.  It's just\n  XML.\n* A DOM Builder - You can use it to build an object model out of XML,\n  but it doesn't do that out of the box.\n* XSLT - No DOM = no querying.\n* 100% Compliant with (some other SAX implementation) - Most SAX\n  implementations are in Java and do a lot more than this does.\n* An XML Validator - It does a little validation when in strict mode, but\n  not much.\n* A Schema-Aware XSD Thing - Schemas are an exercise in fetishistic \n  masochism.\n* A DTD-aware Thing - Fetching DTDs is a much bigger job.\n\n## Regarding `<!DOCTYPE`s and `<!ENTITY`s\n\nThe parser will handle the basic XML entities in text nodes and attribute\nvalues: `&amp; &lt; &gt; &apos; &quot;`. It's possible to define additional\nentities in XML by putting them in the DTD. This parser doesn't do anything\nwith that. If you want to listen to the `ondoctype` event, and then fetch\nthe doctypes, and read the entities and add them to `parser.ENTITIES`, then\nbe my guest.\n\nUnknown entities will fail in strict mode, and in loose mode, will pass\nthrough unmolested.\n\n## Usage\n\n    var sax = require(\"./lib/sax\"),\n      strict = true, // set to false for html-mode\n      parser = sax.parser(strict);\n\n    parser.onerror = function (e) {\n      // an error happened.\n    };\n    parser.ontext = function (t) {\n      // got some text.  t is the string of text.\n    };\n    parser.onopentag = function (node) {\n      // opened a tag.  node has \"name\" and \"attributes\"\n    };\n    parser.onattribute = function (attr) {\n      // an attribute.  attr has \"name\" and \"value\"\n    };\n    parser.onend = function () {\n      // parser stream is done, and ready to have more stuff written to it.\n    };\n\n    parser.write('<xml>Hello, <who name=\"world\">world</who>!</xml>').close();\n\n    // stream usage\n    // takes the same options as the parser\n    var saxStream = require(\"sax\").createStream(strict, options)\n    saxStream.on(\"error\", function (e) {\n      // unhandled errors will throw, since this is a proper node\n      // event emitter.\n      console.error(\"error!\", e)\n      // clear the error\n      this._parser.error = null\n      this._parser.resume()\n    })\n    saxStream.on(\"opentag\", function (node) {\n      // same object as above\n    })\n    // pipe is supported, and it's readable/writable\n    // same chunks coming in also go out.\n    fs.createReadStream(\"file.xml\")\n      .pipe(saxStream)\n      .pipe(fs.createReadStream(\"file-copy.xml\"))\n\n\n\n## Arguments\n\nPass the following arguments to the parser function.  All are optional.\n\n`strict` - Boolean. Whether or not to be a jerk. Default: `false`.\n\n`opt` - Object bag of settings regarding string formatting.  All default to `false`.\n\nSettings supported:\n\n* `trim` - Boolean. Whether or not to trim text and comment nodes.\n* `normalize` - Boolean. If true, then turn any whitespace into a single\n  space.\n* `lowercase` - Boolean. If true, then lowercase tag names and attribute names\n  in loose mode, rather than uppercasing them.\n* `xmlns` - Boolean. If true, then namespaces are supported.\n* `position` - Boolean. If false, then don't track line/col/position.\n\n## Methods\n\n`write` - Write bytes onto the stream. You don't have to do this all at\nonce. You can keep writing as much as you want.\n\n`close` - Close the stream. Once closed, no more data may be written until\nit is done processing the buffer, which is signaled by the `end` event.\n\n`resume` - To gracefully handle errors, assign a listener to the `error`\nevent. Then, when the error is taken care of, you can call `resume` to\ncontinue parsing. Otherwise, the parser will not continue while in an error\nstate.\n\n## Members\n\nAt all times, the parser object will have the following members:\n\n`line`, `column`, `position` - Indications of the position in the XML\ndocument where the parser currently is looking.\n\n`startTagPosition` - Indicates the position where the current tag starts.\n\n`closed` - Boolean indicating whether or not the parser can be written to.\nIf it's `true`, then wait for the `ready` event to write again.\n\n`strict` - Boolean indicating whether or not the parser is a jerk.\n\n`opt` - Any options passed into the constructor.\n\n`tag` - The current tag being dealt with.\n\nAnd a bunch of other stuff that you probably shouldn't touch.\n\n## Events\n\nAll events emit with a single argument. To listen to an event, assign a\nfunction to `on<eventname>`. Functions get executed in the this-context of\nthe parser object. The list of supported events are also in the exported\n`EVENTS` array.\n\nWhen using the stream interface, assign handlers using the EventEmitter\n`on` function in the normal fashion.\n\n`error` - Indication that something bad happened. The error will be hanging\nout on `parser.error`, and must be deleted before parsing can continue. By\nlistening to this event, you can keep an eye on that kind of stuff. Note:\nthis happens *much* more in strict mode. Argument: instance of `Error`.\n\n`text` - Text node. Argument: string of text.\n\n`doctype` - The `<!DOCTYPE` declaration. Argument: doctype string.\n\n`processinginstruction` - Stuff like `<?xml foo=\"blerg\" ?>`. Argument:\nobject with `name` and `body` members. Attributes are not parsed, as\nprocessing instructions have implementation dependent semantics.\n\n`sgmldeclaration` - Random SGML declarations. Stuff like `<!ENTITY p>`\nwould trigger this kind of event. This is a weird thing to support, so it\nmight go away at some point. SAX isn't intended to be used to parse SGML,\nafter all.\n\n`opentag` - An opening tag. Argument: object with `name` and `attributes`.\nIn non-strict mode, tag names are uppercased, unless the `lowercase`\noption is set.  If the `xmlns` option is set, then it will contain\nnamespace binding information on the `ns` member, and will have a\n`local`, `prefix`, and `uri` member.\n\n`closetag` - A closing tag. In loose mode, tags are auto-closed if their\nparent closes. In strict mode, well-formedness is enforced. Note that\nself-closing tags will have `closeTag` emitted immediately after `openTag`.\nArgument: tag name.\n\n`attribute` - An attribute node.  Argument: object with `name` and `value`.\nIn non-strict mode, attribute names are uppercased, unless the `lowercase`\noption is set.  If the `xmlns` option is set, it will also contains namespace\ninformation.\n\n`comment` - A comment node.  Argument: the string of the comment.\n\n`opencdata` - The opening tag of a `<![CDATA[` block.\n\n`cdata` - The text of a `<![CDATA[` block. Since `<![CDATA[` blocks can get\nquite large, this event may fire multiple times for a single block, if it\nis broken up into multiple `write()`s. Argument: the string of random\ncharacter data.\n\n`closecdata` - The closing tag (`]]>`) of a `<![CDATA[` block.\n\n`opennamespace` - If the `xmlns` option is set, then this event will\nsignal the start of a new namespace binding.\n\n`closenamespace` - If the `xmlns` option is set, then this event will\nsignal the end of a namespace binding.\n\n`end` - Indication that the closed stream has ended.\n\n`ready` - Indication that the stream has reset, and is ready to be written\nto.\n\n`noscript` - In non-strict mode, `<script>` tags trigger a `\"script\"`\nevent, and their contents are not checked for special xml characters.\nIf you pass `noscript: true`, then this behavior is suppressed.\n\n## Reporting Problems\n\nIt's best to write a failing test if you find an issue.  I will always\naccept pull requests with failing tests if they demonstrate intended\nbehavior, but it is very hard to figure out what issue you're describing\nwithout a test.  Writing a test is also the best way for you yourself\nto figure out if you really understand the issue you think you have with\nsax-js.\n",
+  "readmeFilename": "README.md",
+  "bugs": {
+    "url": "https://github.com/isaacs/sax-js/issues"
+  },
+  "_id": "sax@0.4.2",
+  "dist": {
+    "shasum": "a6fb7dff50db4a286d2fc0f66fc3717dea4a4107"
+  },
+  "_from": "sax@0.4.2",
+  "_resolved": "https://registry.npmjs.org/sax/-/sax-0.4.2.tgz"
+}
diff --git a/node_modules/xmldoc/node_modules/sax/test/buffer-overrun.js b/node_modules/xmldoc/node_modules/sax/test/buffer-overrun.js
new file mode 100644
index 0000000..8d12fac
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/buffer-overrun.js
@@ -0,0 +1,25 @@
+// set this really low so that I don't have to put 64 MB of xml in here.
+var sax = require("../lib/sax")
+var bl = sax.MAX_BUFFER_LENGTH
+sax.MAX_BUFFER_LENGTH = 5;
+
+require(__dirname).test({
+  expect : [
+    ["error", "Max buffer length exceeded: tagName\nLine: 0\nColumn: 15\nChar: "],
+    ["error", "Max buffer length exceeded: tagName\nLine: 0\nColumn: 30\nChar: "],
+    ["error", "Max buffer length exceeded: tagName\nLine: 0\nColumn: 45\nChar: "],
+    ["opentag", {
+     "name": "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ",
+     "attributes": {}
+    }],
+    ["text", "yo"],
+    ["closetag", "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ"]
+  ]
+}).write("<abcdefghijklmn")
+  .write("opqrstuvwxyzABC")
+  .write("DEFGHIJKLMNOPQR")
+  .write("STUVWXYZ>")
+  .write("yo")
+  .write("</abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ>")
+  .close();
+sax.MAX_BUFFER_LENGTH = bl
diff --git a/node_modules/xmldoc/node_modules/sax/test/case.js b/node_modules/xmldoc/node_modules/sax/test/case.js
new file mode 100644
index 0000000..35ee934
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/case.js
@@ -0,0 +1,47 @@
+// default to uppercase
+require(__dirname).test
+  ( { xml :
+      "<span class=\"test\" hello=\"world\"></span>"
+    , expect :
+      [ [ "attribute", { name: "CLASS", value: "test" } ]
+      , [ "attribute", { name: "HELLO", value: "world" } ]
+      , [ "opentag", { name: "SPAN",
+                       attributes: { CLASS: "test", HELLO: "world" } } ]
+      , [ "closetag", "SPAN" ]
+      ]
+    , strict : false
+    , opt : {}
+    }
+  )
+
+// lowercase option : lowercase tag/attribute names
+require(__dirname).test
+  ( { xml :
+      "<span class=\"test\" hello=\"world\"></span>"
+    , expect :
+      [ [ "attribute", { name: "class", value: "test" } ]
+      , [ "attribute", { name: "hello", value: "world" } ]
+      , [ "opentag", { name: "span",
+                       attributes: { class: "test", hello: "world" } } ]
+      , [ "closetag", "span" ]
+      ]
+    , strict : false
+    , opt : {lowercase:true}
+    }
+  )
+
+// backward compatibility with old lowercasetags opt
+require(__dirname).test
+  ( { xml :
+      "<span class=\"test\" hello=\"world\"></span>"
+    , expect :
+      [ [ "attribute", { name: "class", value: "test" } ]
+      , [ "attribute", { name: "hello", value: "world" } ]
+      , [ "opentag", { name: "span",
+                       attributes: { class: "test", hello: "world" } } ]
+      , [ "closetag", "span" ]
+      ]
+    , strict : false
+    , opt : {lowercasetags:true}
+    }
+  )
diff --git a/node_modules/xmldoc/node_modules/sax/test/cdata-chunked.js b/node_modules/xmldoc/node_modules/sax/test/cdata-chunked.js
new file mode 100644
index 0000000..ccd5ee6
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/cdata-chunked.js
@@ -0,0 +1,11 @@
+
+require(__dirname).test({
+  expect : [
+    ["opentag", {"name": "R","attributes": {}}],
+    ["opencdata", undefined],
+    ["cdata", " this is character data  "],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+}).write("<r><![CDATA[ this is ").write("character data  ").write("]]></r>").close();
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/cdata-end-split.js b/node_modules/xmldoc/node_modules/sax/test/cdata-end-split.js
new file mode 100644
index 0000000..b41bd00
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/cdata-end-split.js
@@ -0,0 +1,15 @@
+
+require(__dirname).test({
+  expect : [
+    ["opentag", {"name": "R","attributes": {}}],
+    ["opencdata", undefined],
+    ["cdata", " this is "],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+})
+  .write("<r><![CDATA[ this is ]")
+  .write("]>")
+  .write("</r>")
+  .close();
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/cdata-fake-end.js b/node_modules/xmldoc/node_modules/sax/test/cdata-fake-end.js
new file mode 100644
index 0000000..07aeac4
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/cdata-fake-end.js
@@ -0,0 +1,28 @@
+
+var p = require(__dirname).test({
+  expect : [
+    ["opentag", {"name": "R","attributes": {}}],
+    ["opencdata", undefined],
+    ["cdata", "[[[[[[[[]]]]]]]]"],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+})
+var x = "<r><![CDATA[[[[[[[[[]]]]]]]]]]></r>"
+for (var i = 0; i < x.length ; i ++) {
+  p.write(x.charAt(i))
+}
+p.close();
+
+
+var p2 = require(__dirname).test({
+  expect : [
+    ["opentag", {"name": "R","attributes": {}}],
+    ["opencdata", undefined],
+    ["cdata", "[[[[[[[[]]]]]]]]"],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+})
+var x = "<r><![CDATA[[[[[[[[[]]]]]]]]]]></r>"
+p2.write(x).close();
diff --git a/node_modules/xmldoc/node_modules/sax/test/cdata-multiple.js b/node_modules/xmldoc/node_modules/sax/test/cdata-multiple.js
new file mode 100644
index 0000000..dab2015
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/cdata-multiple.js
@@ -0,0 +1,15 @@
+
+require(__dirname).test({
+  expect : [
+    ["opentag", {"name": "R","attributes": {}}],
+    ["opencdata", undefined],
+    ["cdata", " this is "],
+    ["closecdata", undefined],
+    ["opencdata", undefined],
+    ["cdata", "character data  "],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+}).write("<r><![CDATA[ this is ]]>").write("<![CDA").write("T").write("A[")
+  .write("character data  ").write("]]></r>").close();
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/cdata.js b/node_modules/xmldoc/node_modules/sax/test/cdata.js
new file mode 100644
index 0000000..0f09cce
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/cdata.js
@@ -0,0 +1,10 @@
+require(__dirname).test({
+  xml : "<r><![CDATA[ this is character data  ]]></r>",
+  expect : [
+    ["opentag", {"name": "R","attributes": {}}],
+    ["opencdata", undefined],
+    ["cdata", " this is character data  "],
+    ["closecdata", undefined],
+    ["closetag", "R"]
+  ]
+});
diff --git a/node_modules/xmldoc/node_modules/sax/test/index.js b/node_modules/xmldoc/node_modules/sax/test/index.js
new file mode 100644
index 0000000..d4e1ef4
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/index.js
@@ -0,0 +1,86 @@
+var globalsBefore = JSON.stringify(Object.keys(global))
+  , util = require("util")
+  , assert = require("assert")
+  , fs = require("fs")
+  , path = require("path")
+  , sax = require("../lib/sax")
+
+exports.sax = sax
+
+// handy way to do simple unit tests
+// if the options contains an xml string, it'll be written and the parser closed.
+// otherwise, it's assumed that the test will write and close.
+exports.test = function test (options) {
+  var xml = options.xml
+    , parser = sax.parser(options.strict, options.opt)
+    , expect = options.expect
+    , e = 0
+  sax.EVENTS.forEach(function (ev) {
+    parser["on" + ev] = function (n) {
+      if (process.env.DEBUG) {
+        console.error({ expect: expect[e]
+                      , actual: [ev, n] })
+      }
+      if (e >= expect.length && (ev === "end" || ev === "ready")) return
+      assert.ok( e < expect.length,
+        "expectation #"+e+" "+util.inspect(expect[e])+"\n"+
+        "Unexpected event: "+ev+" "+(n ? util.inspect(n) : ""))
+      var inspected = n instanceof Error ? "\n"+ n.message : util.inspect(n)
+      assert.equal(ev, expect[e][0],
+        "expectation #"+e+"\n"+
+        "Didn't get expected event\n"+
+        "expect: "+expect[e][0] + " " +util.inspect(expect[e][1])+"\n"+
+        "actual: "+ev+" "+inspected+"\n")
+      if (ev === "error") assert.equal(n.message, expect[e][1])
+      else assert.deepEqual(n, expect[e][1],
+        "expectation #"+e+"\n"+
+        "Didn't get expected argument\n"+
+        "expect: "+expect[e][0] + " " +util.inspect(expect[e][1])+"\n"+
+        "actual: "+ev+" "+inspected+"\n")
+      e++
+      if (ev === "error") parser.resume()
+    }
+  })
+  if (xml) parser.write(xml).close()
+  return parser
+}
+
+if (module === require.main) {
+  var running = true
+    , failures = 0
+
+  function fail (file, er) {
+    util.error("Failed: "+file)
+    util.error(er.stack || er.message)
+    failures ++
+  }
+
+  fs.readdir(__dirname, function (error, files) {
+    files = files.filter(function (file) {
+      return (/\.js$/.exec(file) && file !== 'index.js')
+    })
+    var n = files.length
+      , i = 0
+    console.log("0.." + n)
+    files.forEach(function (file) {
+      // run this test.
+      try {
+        require(path.resolve(__dirname, file))
+        var globalsAfter = JSON.stringify(Object.keys(global))
+        if (globalsAfter !== globalsBefore) {
+          var er = new Error("new globals introduced\n"+
+                             "expected: "+globalsBefore+"\n"+
+                             "actual:   "+globalsAfter)
+          globalsBefore = globalsAfter
+          throw er
+        }
+        console.log("ok " + (++i) + " - " + file)
+      } catch (er) {
+        console.log("not ok "+ (++i) + " - " + file)
+        fail(file, er)
+      }
+    })
+    if (!failures) return console.log("#all pass")
+    else return console.error(failures + " failure" + (failures > 1 ? "s" : ""))
+  })
+}
diff --git a/node_modules/xmldoc/node_modules/sax/test/issue-23.js b/node_modules/xmldoc/node_modules/sax/test/issue-23.js
new file mode 100644
index 0000000..e7991b2
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/issue-23.js
@@ -0,0 +1,43 @@
+
+require(__dirname).test
+  ( { xml :
+      "<compileClassesResponse>"+
+        "<result>"+
+          "<bodyCrc>653724009</bodyCrc>"+
+          "<column>-1</column>"+
+          "<id>01pG0000002KoSUIA0</id>"+
+          "<line>-1</line>"+
+          "<name>CalendarController</name>"+
+          "<success>true</success>"+
+        "</result>"+
+      "</compileClassesResponse>"
+
+    , expect :
+      [ [ "opentag", { name: "COMPILECLASSESRESPONSE", attributes: {} } ]
+      , [ "opentag", { name : "RESULT", attributes: {} } ]
+      , [ "opentag", { name: "BODYCRC", attributes: {} } ]
+      , [ "text", "653724009" ]
+      , [ "closetag", "BODYCRC" ]
+      , [ "opentag", { name: "COLUMN", attributes: {} } ]
+      , [ "text", "-1" ]
+      , [ "closetag", "COLUMN" ]
+      , [ "opentag", { name: "ID", attributes: {} } ]
+      , [ "text", "01pG0000002KoSUIA0" ]
+      , [ "closetag", "ID" ]
+      , [ "opentag", {name: "LINE", attributes: {} } ]
+      , [ "text", "-1" ]
+      , [ "closetag", "LINE" ]
+      , [ "opentag", {name: "NAME", attributes: {} } ]
+      , [ "text", "CalendarController" ]
+      , [ "closetag", "NAME" ]
+      , [ "opentag", {name: "SUCCESS", attributes: {} } ]
+      , [ "text", "true" ]
+      , [ "closetag", "SUCCESS" ]
+      , [ "closetag", "RESULT" ]
+      , [ "closetag", "COMPILECLASSESRESPONSE" ]
+      ]
+    , strict : false
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/issue-30.js b/node_modules/xmldoc/node_modules/sax/test/issue-30.js
new file mode 100644
index 0000000..c2cc809
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/issue-30.js
@@ -0,0 +1,24 @@
+// https://github.com/isaacs/sax-js/issues/33
+require(__dirname).test
+  ( { xml : "<xml>\n"+
+            "<!-- \n"+
+            "  comment with a single dash- in it\n"+
+            "-->\n"+
+            "<data/>\n"+
+            "</xml>"
+
+    , expect :
+      [ [ "opentag", { name: "xml", attributes: {} } ]
+      , [ "text", "\n" ]
+      , [ "comment", " \n  comment with a single dash- in it\n" ]
+      , [ "text", "\n" ]
+      , [ "opentag", { name: "data", attributes: {} } ]
+      , [ "closetag", "data" ]
+      , [ "text", "\n" ]
+      , [ "closetag", "xml" ]
+      ]
+    , strict : true
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/issue-35.js b/node_modules/xmldoc/node_modules/sax/test/issue-35.js
new file mode 100644
index 0000000..7c521c5
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/issue-35.js
@@ -0,0 +1,15 @@
+// https://github.com/isaacs/sax-js/issues/35
+require(__dirname).test
+  ( { xml : "<xml>&#Xd;&#X0d;\n"+
+            "</xml>"
+
+    , expect :
+      [ [ "opentag", { name: "xml", attributes: {} } ]
+      , [ "text", "\r\r\n" ]
+      , [ "closetag", "xml" ]
+      ]
+    , strict : true
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/issue-47.js b/node_modules/xmldoc/node_modules/sax/test/issue-47.js
new file mode 100644
index 0000000..911c7d0
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/issue-47.js
@@ -0,0 +1,13 @@
+// https://github.com/isaacs/sax-js/issues/47
+require(__dirname).test
+  ( { xml : '<a href="query.svc?x=1&y=2&z=3"/>'
+    , expect : [ 
+        [ "attribute", { name:'href', value:"query.svc?x=1&y=2&z=3"} ],
+        [ "opentag", { name: "a", attributes: { href:"query.svc?x=1&y=2&z=3"} } ],
+        [ "closetag", "a" ]
+      ]
+    , strict : true
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/issue-49.js b/node_modules/xmldoc/node_modules/sax/test/issue-49.js
new file mode 100644
index 0000000..2964325
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/issue-49.js
@@ -0,0 +1,31 @@
+// https://github.com/isaacs/sax-js/issues/49
+require(__dirname).test
+  ( { xml : "<xml><script>hello world</script></xml>"
+    , expect :
+      [ [ "opentag", { name: "xml", attributes: {} } ]
+      , [ "opentag", { name: "script", attributes: {} } ]
+      , [ "text", "hello world" ]
+      , [ "closetag", "script" ]
+      , [ "closetag", "xml" ]
+      ]
+    , strict : false
+    , opt : { lowercasetags: true, noscript: true }
+    }
+  )
+
+require(__dirname).test
+  ( { xml : "<xml><script><![CDATA[hello world]]></script></xml>"
+    , expect :
+      [ [ "opentag", { name: "xml", attributes: {} } ]
+      , [ "opentag", { name: "script", attributes: {} } ]
+      , [ "opencdata", undefined ]
+      , [ "cdata", "hello world" ]
+      , [ "closecdata", undefined ]
+      , [ "closetag", "script" ]
+      , [ "closetag", "xml" ]
+      ]
+    , strict : false
+    , opt : { lowercasetags: true, noscript: true }
+    }
+  )
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/parser-position.js b/node_modules/xmldoc/node_modules/sax/test/parser-position.js
new file mode 100644
index 0000000..e4a68b1
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/parser-position.js
@@ -0,0 +1,28 @@
+var sax = require("../lib/sax"),
+    assert = require("assert")
+
+function testPosition(chunks, expectedEvents) {
+  var parser = sax.parser();
+  expectedEvents.forEach(function(expectation) {
+    parser['on' + expectation[0]] = function() {
+      for (var prop in expectation[1]) {
+        assert.equal(parser[prop], expectation[1][prop]);
+      }
+    }
+  });
+  chunks.forEach(function(chunk) {
+    parser.write(chunk);
+  });
+};
+
+testPosition(['<div>abcdefgh</div>'],
+             [ ['opentag',  { position:  5, startTagPosition:  1 }]
+             , ['text',     { position: 19, startTagPosition: 14 }]
+             , ['closetag', { position: 19, startTagPosition: 14 }]
+             ]);
+
+testPosition(['<div>abcde','fgh</div>'],
+             [ ['opentag',  { position:  5, startTagPosition:  1 }]
+             , ['text',     { position: 19, startTagPosition: 14 }]
+             , ['closetag', { position: 19, startTagPosition: 14 }]
+             ]);
diff --git a/node_modules/xmldoc/node_modules/sax/test/script.js b/node_modules/xmldoc/node_modules/sax/test/script.js
new file mode 100644
index 0000000..464c051
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/script.js
@@ -0,0 +1,12 @@
+require(__dirname).test({
+  xml : "<html><head><script>if (1 < 0) { console.log('elo there'); }</script></head></html>",
+  expect : [
+    ["opentag", {"name": "HTML","attributes": {}}],
+    ["opentag", {"name": "HEAD","attributes": {}}],
+    ["opentag", {"name": "SCRIPT","attributes": {}}],
+    ["script", "if (1 < 0) { console.log('elo there'); }"],
+    ["closetag", "SCRIPT"],
+    ["closetag", "HEAD"],
+    ["closetag", "HTML"]
+  ]
+});
diff --git a/node_modules/xmldoc/node_modules/sax/test/self-closing-child-strict.js b/node_modules/xmldoc/node_modules/sax/test/self-closing-child-strict.js
new file mode 100644
index 0000000..ce9c045
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/self-closing-child-strict.js
@@ -0,0 +1,40 @@
+
+require(__dirname).test({
+  xml :
+  "<root>"+
+    "<child>" +
+      "<haha />" +
+    "</child>" +
+    "<monkey>" +
+      "=(|)" +
+    "</monkey>" +
+  "</root>",
+  expect : [
+    ["opentag", {
+     "name": "root",
+     "attributes": {}
+    }],
+    ["opentag", {
+     "name": "child",
+     "attributes": {}
+    }],
+    ["opentag", {
+     "name": "haha",
+     "attributes": {}
+    }],
+    ["closetag", "haha"],
+    ["closetag", "child"],
+    ["opentag", {
+     "name": "monkey",
+     "attributes": {}
+    }],
+    ["text", "=(|)"],
+    ["closetag", "monkey"],
+    ["closetag", "root"],
+    ["end"],
+    ["ready"]
+  ],
+  strict : true,
+  opt : {}
+});
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/self-closing-child.js b/node_modules/xmldoc/node_modules/sax/test/self-closing-child.js
new file mode 100644
index 0000000..bc6b52b
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/self-closing-child.js
@@ -0,0 +1,40 @@
+
+require(__dirname).test({
+  xml :
+  "<root>"+
+    "<child>" +
+      "<haha />" +
+    "</child>" +
+    "<monkey>" +
+      "=(|)" +
+    "</monkey>" +
+  "</root>",
+  expect : [
+    ["opentag", {
+     "name": "ROOT",
+     "attributes": {}
+    }],
+    ["opentag", {
+     "name": "CHILD",
+     "attributes": {}
+    }],
+    ["opentag", {
+     "name": "HAHA",
+     "attributes": {}
+    }],
+    ["closetag", "HAHA"],
+    ["closetag", "CHILD"],
+    ["opentag", {
+     "name": "MONKEY",
+     "attributes": {}
+    }],
+    ["text", "=(|)"],
+    ["closetag", "MONKEY"],
+    ["closetag", "ROOT"],
+    ["end"],
+    ["ready"]
+  ],
+  strict : false,
+  opt : {}
+});
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/self-closing-tag.js b/node_modules/xmldoc/node_modules/sax/test/self-closing-tag.js
new file mode 100644
index 0000000..b2c5736
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/self-closing-tag.js
@@ -0,0 +1,25 @@
+
+require(__dirname).test({
+  xml :
+  "<root>   "+
+    "<haha /> "+
+    "<haha/>  "+
+    "<monkey> "+
+      "=(|)     "+
+    "</monkey>"+
+  "</root>  ",
+  expect : [
+    ["opentag", {name:"ROOT", attributes:{}}],
+    ["opentag", {name:"HAHA", attributes:{}}],
+    ["closetag", "HAHA"],
+    ["opentag", {name:"HAHA", attributes:{}}],
+    ["closetag", "HAHA"],
+    // ["opentag", {name:"HAHA", attributes:{}}],
+    // ["closetag", "HAHA"],
+    ["opentag", {name:"MONKEY", attributes:{}}],
+    ["text", "=(|)"],
+    ["closetag", "MONKEY"],
+    ["closetag", "ROOT"]
+  ],
+  opt : { trim : true }
+});
\ No newline at end of file
diff --git a/node_modules/xmldoc/node_modules/sax/test/stray-ending.js b/node_modules/xmldoc/node_modules/sax/test/stray-ending.js
new file mode 100644
index 0000000..6b0aa7f
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/stray-ending.js
@@ -0,0 +1,17 @@
+// stray ending tags should just be ignored in non-strict mode.
+// https://github.com/isaacs/sax-js/issues/32
+require(__dirname).test
+  ( { xml :
+      "<a><b></c></b></a>"
+    , expect :
+      [ [ "opentag", { name: "A", attributes: {} } ]
+      , [ "opentag", { name: "B", attributes: {} } ]
+      , [ "text", "</c>" ]
+      , [ "closetag", "B" ]
+      , [ "closetag", "A" ]
+      ]
+    , strict : false
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/trailing-non-whitespace.js b/node_modules/xmldoc/node_modules/sax/test/trailing-non-whitespace.js
new file mode 100644
index 0000000..3e1fb2e
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/trailing-non-whitespace.js
@@ -0,0 +1,17 @@
+
+require(__dirname).test({
+  xml : "<span>Welcome,</span> to monkey land",
+  expect : [
+    ["opentag", {
+     "name": "SPAN",
+     "attributes": {}
+    }],
+    ["text", "Welcome,"],
+    ["closetag", "SPAN"],
+    ["text", " to monkey land"],
+    ["end"],
+    ["ready"]
+  ],
+  strict : false,
+  opt : {}
+});
diff --git a/node_modules/xmldoc/node_modules/sax/test/unquoted.js b/node_modules/xmldoc/node_modules/sax/test/unquoted.js
new file mode 100644
index 0000000..dbeb638
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/unquoted.js
@@ -0,0 +1,17 @@
+// unquoted attributes should be ok in non-strict mode
+// https://github.com/isaacs/sax-js/issues/31
+require(__dirname).test
+  ( { xml :
+      "<span class=test hello=world></span>"
+    , expect :
+      [ [ "attribute", { name: "CLASS", value: "test" } ]
+      , [ "attribute", { name: "HELLO", value: "world" } ]
+      , [ "opentag", { name: "SPAN",
+                       attributes: { CLASS: "test", HELLO: "world" } } ]
+      , [ "closetag", "SPAN" ]
+      ]
+    , strict : false
+    , opt : {}
+    }
+  )
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/xmlns-issue-41.js b/node_modules/xmldoc/node_modules/sax/test/xmlns-issue-41.js
new file mode 100644
index 0000000..596d82b
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/xmlns-issue-41.js
@@ -0,0 +1,67 @@
+var t = require(__dirname)
+
+  , xmls = // should be the same both ways.
+    [ "<parent xmlns:a='http://ATTRIBUTE' a:attr='value' />"
+    , "<parent a:attr='value' xmlns:a='http://ATTRIBUTE' />" ]
+
+  , ex1 =
+    [ [ "opennamespace"
+      , { prefix: "a"
+        , uri: "http://ATTRIBUTE"
+        }
+      ]
+    , [ "attribute"
+      , { name: "xmlns:a"
+        , value: "http://ATTRIBUTE"
+        , prefix: "xmlns"
+        , local: "a"
+        , uri: "http://www.w3.org/2000/xmlns/"
+        }
+      ]
+    , [ "attribute"
+      , { name: "a:attr"
+        , local: "attr"
+        , prefix: "a"
+        , uri: "http://ATTRIBUTE"
+        , value: "value"
+        }
+      ]
+    , [ "opentag"
+      , { name: "parent"
+        , uri: ""
+        , prefix: ""
+        , local: "parent"
+        , attributes:
+          { "a:attr":
+            { name: "a:attr"
+            , local: "attr"
+            , prefix: "a"
+            , uri: "http://ATTRIBUTE"
+            , value: "value"
+            }
+          , "xmlns:a":
+            { name: "xmlns:a"
+            , local: "a"
+            , prefix: "xmlns"
+            , uri: "http://www.w3.org/2000/xmlns/"
+            , value: "http://ATTRIBUTE"
+            }
+          }
+        , ns: {"a": "http://ATTRIBUTE"}
+        }
+      ]
+    , ["closetag", "parent"]
+    , ["closenamespace", { prefix: "a", uri: "http://ATTRIBUTE" }]
+    ]
+
+  // swap the order of elements 2 and 1
+  , ex2 = [ex1[0], ex1[2], ex1[1]].concat(ex1.slice(3))
+  , expected = [ex1, ex2]
+
+xmls.forEach(function (x, i) {
+  t.test({ xml: x
+         , expect: expected[i]
+         , strict: true
+         , opt: { xmlns: true }
+         })
+})
diff --git a/node_modules/xmldoc/node_modules/sax/test/xmlns-rebinding.js b/node_modules/xmldoc/node_modules/sax/test/xmlns-rebinding.js
new file mode 100644
index 0000000..f464876
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/xmlns-rebinding.js
@@ -0,0 +1,59 @@
+
+require(__dirname).test
+  ( { xml :
+      "<root xmlns:x='x1' xmlns:y='y1' x:a='x1' y:a='y1'>"+
+        "<rebind xmlns:x='x2'>"+
+          "<check x:a='x2' y:a='y1'/>"+
+        "</rebind>"+
+        "<check x:a='x1' y:a='y1'/>"+
+      "</root>"
+
+    , expect :
+      [ [ "opennamespace", { prefix: "x", uri: "x1" } ]
+      , [ "opennamespace", { prefix: "y", uri: "y1" } ]
+      , [ "attribute", { name: "xmlns:x", value: "x1", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "x" } ]
+      , [ "attribute", { name: "xmlns:y", value: "y1", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "y" } ]
+      , [ "attribute", { name: "x:a", value: "x1", uri: "x1", prefix: "x", local: "a" } ]
+      , [ "attribute", { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } ]
+      , [ "opentag", { name: "root", uri: "", prefix: "", local: "root",
+            attributes: { "xmlns:x": { name: "xmlns:x", value: "x1", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "x" }
+                        , "xmlns:y": { name: "xmlns:y", value: "y1", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "y" }
+                        , "x:a": { name: "x:a", value: "x1", uri: "x1", prefix: "x", local: "a" }
+                        , "y:a": { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } },
+            ns: { x: 'x1', y: 'y1' } } ]
+
+      , [ "opennamespace", { prefix: "x", uri: "x2" } ]
+      , [ "attribute", { name: "xmlns:x", value: "x2", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "x" } ]
+      , [ "opentag", { name: "rebind", uri: "", prefix: "", local: "rebind",
+            attributes: { "xmlns:x": { name: "xmlns:x", value: "x2", uri: "http://www.w3.org/2000/xmlns/", prefix: "xmlns", local: "x" } },
+            ns: { x: 'x2' } } ]
+
+      , [ "attribute", { name: "x:a", value: "x2", uri: "x2", prefix: "x", local: "a" } ]
+      , [ "attribute", { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } ]
+      , [ "opentag", { name: "check", uri: "", prefix: "", local: "check",
+            attributes: { "x:a": { name: "x:a", value: "x2", uri: "x2", prefix: "x", local: "a" }
+                        , "y:a": { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } },
+            ns: { x: 'x2' } } ]
+
+      , [ "closetag", "check" ]
+
+      , [ "closetag", "rebind" ]
+      , [ "closenamespace", { prefix: "x", uri: "x2" } ]
+
+      , [ "attribute", { name: "x:a", value: "x1", uri: "x1", prefix: "x", local: "a" } ]
+      , [ "attribute", { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } ]
+      , [ "opentag", { name: "check", uri: "", prefix: "", local: "check",
+            attributes: { "x:a": { name: "x:a", value: "x1", uri: "x1", prefix: "x", local: "a" }
+                        , "y:a": { name: "y:a", value: "y1", uri: "y1", prefix: "y", local: "a" } },
+            ns: { x: 'x1', y: 'y1' } } ]
+      , [ "closetag", "check" ]
+
+      , [ "closetag", "root" ]
+      , [ "closenamespace", { prefix: "x", uri: "x1" } ]
+      , [ "closenamespace", { prefix: "y", uri: "y1" } ]
+      ]
+    , strict : true
+    , opt : { xmlns: true }
+    }
+  )
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/xmlns-strict.js b/node_modules/xmldoc/node_modules/sax/test/xmlns-strict.js
new file mode 100644
index 0000000..9c7258d
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/xmlns-strict.js
@@ -0,0 +1,71 @@
+
+require(__dirname).test
+  ( { xml :
+      "<root>"+
+        "<plain attr='normal'/>"+
+        "<ns1 xmlns='uri:default'>"+
+          "<plain attr='normal'/>"+
+        "</ns1>"+
+        "<ns2 xmlns:a='uri:nsa'>"+
+          "<plain attr='normal'/>"+
+          "<a:ns a:attr='namespaced'/>"+
+        "</ns2>"+
+      "</root>"
+
+    , expect :
+      [ [ "opentag", { name: "root", prefix: "", local: "root", uri: "",
+            attributes: {}, ns: {} } ]
+
+      , [ "attribute", { name: "attr", value: "normal", prefix: "", local: "attr", uri: "" } ]
+      , [ "opentag", { name: "plain", prefix: "", local: "plain", uri: "",
+            attributes: { "attr": { name: "attr", value: "normal", uri: "", prefix: "", local: "attr", uri: "" } },
+            ns: {} } ]
+      , [ "closetag", "plain" ]
+
+      , [ "opennamespace", { prefix: "", uri: "uri:default" } ]
+
+      , [ "attribute", { name: "xmlns", value: "uri:default", prefix: "xmlns", local: "", uri: "http://www.w3.org/2000/xmlns/" } ]
+      , [ "opentag", { name: "ns1", prefix: "", local: "ns1", uri: "uri:default",
+            attributes: { "xmlns": { name: "xmlns", value: "uri:default", prefix: "xmlns", local: "", uri: "http://www.w3.org/2000/xmlns/" } },
+            ns: { "": "uri:default" } } ]
+
+      , [ "attribute", { name: "attr", value: "normal", prefix: "", local: "attr", uri: "" } ]
+      , [ "opentag", { name: "plain", prefix: "", local: "plain", uri: "uri:default", ns: { '': 'uri:default' },
+            attributes: { "attr": { name: "attr", value: "normal", prefix: "", local: "attr", uri: "" } } } ]
+      , [ "closetag", "plain" ]
+
+      , [ "closetag", "ns1" ]
+
+      , [ "closenamespace", { prefix: "", uri: "uri:default" } ]
+
+      , [ "opennamespace", { prefix: "a", uri: "uri:nsa" } ]
+
+      , [ "attribute", { name: "xmlns:a", value: "uri:nsa", prefix: "xmlns", local: "a", uri: "http://www.w3.org/2000/xmlns/" } ]
+
+      , [ "opentag", { name: "ns2", prefix: "", local: "ns2", uri: "",
+            attributes: { "xmlns:a": { name: "xmlns:a", value: "uri:nsa", prefix: "xmlns", local: "a", uri: "http://www.w3.org/2000/xmlns/" } },
+            ns: { a: "uri:nsa" } } ]
+
+      , [ "attribute", { name: "attr", value: "normal", prefix: "", local: "attr", uri: "" } ]
+      , [ "opentag", { name: "plain", prefix: "", local: "plain", uri: "",
+            attributes: { "attr": { name: "attr", value: "normal", prefix: "", local: "attr", uri: "" } },
+            ns: { a: 'uri:nsa' } } ]
+      , [ "closetag", "plain" ]
+
+      , [ "attribute", { name: "a:attr", value: "namespaced", prefix: "a", local: "attr", uri: "uri:nsa" } ]
+      , [ "opentag", { name: "a:ns", prefix: "a", local: "ns", uri: "uri:nsa",
+            attributes: { "a:attr": { name: "a:attr", value: "namespaced", prefix: "a", local: "attr", uri: "uri:nsa" } },
+            ns: { a: 'uri:nsa' } } ]
+      , [ "closetag", "a:ns" ]
+
+      , [ "closetag", "ns2" ]
+
+      , [ "closenamespace", { prefix: "a", uri: "uri:nsa" } ]
+
+      , [ "closetag", "root" ]
+      ]
+    , strict : true
+    , opt : { xmlns: true }
+    }
+  )
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/xmlns-unbound.js b/node_modules/xmldoc/node_modules/sax/test/xmlns-unbound.js
new file mode 100644
index 0000000..2944b87
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/xmlns-unbound.js
@@ -0,0 +1,15 @@
+
+require(__dirname).test(
+  { strict : true
+  , opt : { xmlns: true }
+  , expect :
+    [ ["error", "Unbound namespace prefix: \"unbound\"\nLine: 0\nColumn: 28\nChar: >"]
+
+    , [ "attribute", { name: "unbound:attr", value: "value", uri: "unbound", prefix: "unbound", local: "attr" } ]
+    , [ "opentag", { name: "root", uri: "", prefix: "", local: "root",
+          attributes: { "unbound:attr": { name: "unbound:attr", value: "value", uri: "unbound", prefix: "unbound", local: "attr" } },
+          ns: {} } ]
+    , [ "closetag", "root" ]
+    ]
+  }
+).write("<root unbound:attr='value'/>")
diff --git a/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-ns.js b/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-ns.js
new file mode 100644
index 0000000..3eab96d
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-ns.js
@@ -0,0 +1,30 @@
+var xmlns_attr =
+{
+    name: "xmlns", value: "http://foo", prefix: "xmlns",
+    local: "", uri : "http://www.w3.org/2000/xmlns/"
+};
+
+var attr_attr =
+{
+    name: "attr", value: "bar", prefix: "",
+    local : "attr",  uri : ""
+};
+
+
+require(__dirname).test
+  ( { xml :
+      "<elm xmlns='http://foo' attr='bar'/>"
+    , expect :
+      [ [ "opennamespace", { prefix: "", uri: "http://foo" } ]
+      , [ "attribute", xmlns_attr ]
+      , [ "attribute", attr_attr ]
+      , [ "opentag", { name: "elm", prefix: "", local: "elm", uri : "http://foo",
+                       ns : { "" : "http://foo" },
+                       attributes: { xmlns: xmlns_attr, attr: attr_attr } } ]
+      , [ "closetag", "elm" ]
+      , [ "closenamespace", { prefix: "", uri: "http://foo"} ]
+      ]
+    , strict : true
+    , opt : {xmlns: true}
+    }
+  )
diff --git a/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-prefix-attribute.js b/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-prefix-attribute.js
new file mode 100644
index 0000000..16da771
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-prefix-attribute.js
@@ -0,0 +1,35 @@
+require(__dirname).test(
+  { xml : "<root xml:lang='en'/>"
+  , expect :
+    [ [ "attribute"
+      , { name: "xml:lang"
+        , local: "lang"
+        , prefix: "xml"
+        , uri: "http://www.w3.org/XML/1998/namespace"
+        , value: "en"
+        }
+      ]
+    , [ "opentag"
+      , { name: "root"
+        , uri: ""
+        , prefix: ""
+        , local: "root"
+        , attributes:
+          { "xml:lang":
+            { name: "xml:lang"
+            , local: "lang"
+            , prefix: "xml"
+            , uri: "http://www.w3.org/XML/1998/namespace"
+            , value: "en"
+            }
+          }
+        , ns: {}
+        }
+      ]
+    , ["closetag", "root"]
+    ]
+  , strict : true
+  , opt : { xmlns: true }
+  }
+)
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-prefix.js b/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-prefix.js
new file mode 100644
index 0000000..9a1ce1b
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-prefix.js
@@ -0,0 +1,20 @@
+require(__dirname).test(
+  { xml : "<xml:root/>"
+  , expect :
+    [
+      [ "opentag"
+      , { name: "xml:root"
+        , uri: "http://www.w3.org/XML/1998/namespace"
+        , prefix: "xml"
+        , local: "root"
+        , attributes: {}
+        , ns: {}
+        }
+      ]
+    , ["closetag", "xml:root"]
+    ]
+  , strict : true
+  , opt : { xmlns: true }
+  }
+)
+
diff --git a/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-redefine.js b/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-redefine.js
new file mode 100644
index 0000000..1eba9c7
--- /dev/null
+++ b/node_modules/xmldoc/node_modules/sax/test/xmlns-xml-default-redefine.js
@@ -0,0 +1,40 @@
+require(__dirname).test(
+  { xml : "<xml:root xmlns:xml='ERROR'/>"
+  , expect :
+    [ ["error"
+      , "xml: prefix must be bound to http://www.w3.org/XML/1998/namespace\n"
+                        + "Actual: ERROR\n"
+      + "Line: 0\nColumn: 27\nChar: '"
+      ]
+    , [ "attribute"
+      , { name: "xmlns:xml"
+        , local: "xml"
+        , prefix: "xmlns"
+        , uri: "http://www.w3.org/2000/xmlns/"
+        , value: "ERROR"
+        }
+      ]
+    , [ "opentag"
+      , { name: "xml:root"
+        , uri: "http://www.w3.org/XML/1998/namespace"
+        , prefix: "xml"
+        , local: "root"
+        , attributes:
+          { "xmlns:xml":
+            { name: "xmlns:xml"
+            , local: "xml"
+            , prefix: "xmlns"
+            , uri: "http://www.w3.org/2000/xmlns/"
+            , value: "ERROR"
+            }
+          }
+        , ns: {}
+        }
+      ]
+    , ["closetag", "xml:root"]
+    ]
+  , strict : true
+  , opt : { xmlns: true }
+  }
+)
+
diff --git a/node_modules/xmldoc/package.json b/node_modules/xmldoc/package.json
new file mode 100644
index 0000000..4a3b5e7
--- /dev/null
+++ b/node_modules/xmldoc/package.json
@@ -0,0 +1,39 @@
+{
+  "name": "xmldoc",
+  "description": "A lightweight XML Document class for JavaScript.",
+  "author": {
+    "name": "Nick Farina",
+    "email": "nfarina@gmail.com",
+    "url": "http://nfarina.com"
+  },
+  "version": "0.1.2",
+  "main": "./index",
+  "dependencies": {
+    "sax": "0.4.2"
+  },
+  "license": {
+    "type": "MIT",
+    "url": "https://raw.github.com/nfarina/xmldoc-js/master/LICENSE"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/nfarina/xmldoc-js.git"
+  },
+  "contributors": [
+    {
+      "name": "Nick Farina",
+      "email": "nfarina@gmail.com"
+    }
+  ],
+  "readmeFilename": "README.md",
+  "readme": "\n## Introduction\n\n`xmldoc` lets you parse XML documents with ease. It's a pure-JavaScript, one-file XML document class with a single dependency on the excellent [`sax`][sax] parser.\n\nFor more on why I wrote this class, see the [blog post][blog].\n\n  [blog]: http://nfarina.com/post/34302964969/a-lightweight-xml-document-class-for-nodejs-javascript\n\n## Installation\n\n    npm install xmldoc\n\nOr just download the repository and include it in your `node_modules` directly. Or just download the [single JS file][blob]!\n\n  [blob]: https://github.com/nfarina/xmldoc/blob/master/lib/xmldoc.js\n\n## Usage\n\n    var xmldoc = require('../lib/xmldoc');\n\n    var document = new xmldoc.XmlDocument(\"<some>xml</some>\");\n\n    ... do things\n\n## Classes\n\nThe primary exported class is `XmlDocument`, which you'll use to consume your XML text. `XmlDocument` contains a hierarchy of `XmlElement` instances representing the XML structure.\n\nBoth `XmlElement` and `XmlDocument` contain the same members and methods you can call to traverse the document or a subtree.\n\n## Members\n\n* `name` - the node name, like \"tat\" for `<tat>`.\n* `attr` - an object dict containing attribute properties, like `bookNode.attr.title` for `<book title=\"...\">`.\n* `val` - the string \"value\" of the node, if any, like \"world\" for `<hello>world</hello>`.\n* `children` - an array of `XmlElement` children of the node.\n\nEach member defaults to a sensible \"empty\" value like `{}` for `attr`, `[]` for `children`, and `\"\"` for `val`.\n\n## Methods\n\nAll methods with `child` in the name operate only on direct children; they do not do a deep/recursive search.\n\n### eachChild(func)\n\nSimilar to [underscore's][underscore] `each` method, it will call `func(child, index, array)` for each child of the given node.\n\n### childNamed(name)\n\nPass it the name of a child node and it will search for and return the first one found, or `undefined`.\n\n### childrenNamed(name)\n\nLike `childNamed` but returns all matching children in an array, or `[]`.\n\n### childWithAttribute(name,value)\n\nSearches for the first child with the given attribute value. You can omit `value` to just find the first node with the given attribute defined at all.\n\n### descendantWithPath(path)\n\nSearches for a specific \"path\" uses dot notation. Example:\n\n    <book>\n      <author>\n        <name isProper=\"true\">George R. R. Martin</name>\n        ...\n      </author>\n      ...\n    </book>\n\nIf you just want the `<name>` node and you have the `XmlElement` for the `<book>` node, you can say:\n\n    var nameNode = bookNode.descendantWithPath(\"author.name\"); // return <name> node\n\n### valueWithPath(path)\n\nJust like `descendantWithPath`, but goes deeper and extracts the `val` of the node. Example:\n\n    var authorName = bookNode.valueWithPath(\"author.name\"); // return \"George R. R. Martin\"\n\nYou can also use the `@` character to request the value of a particular _attribute_ instead:\n\n    var authorIsProper = bookNode.valueWithPath(\"author.name@isProper\"); // return \"true\"\n\nThis is not [XPath][]! It's just a thing I made up, OK?\n\n### toString()\n\nThis is just an override of the standard JavaScript method, it will give you the pretty-printed string representation of your XML document or element. Note that this is for debugging only! It will truncate any long node values.\n  \n    var xml = \"<author><name>looooooong value</name></author>\";\n    console.log(\"My document: \\n\" + new XmlDocument(xml))\n\nPrints:\n\n    My Document:\n    <hello>\n      loooooooo…\n    </hello>\n\n## Feedback\n\nFeel free to file issues or hit me up on [Twitter][twitter].\n\n  [underscore]: http://underscorejs.org\n  [XPath]: http://en.wikipedia.org/wiki/XPath\n  [twitter]: http://twitter.com/nfarina\n  [sax]: https://github.com/isaacs/sax-js\n",
+  "bugs": {
+    "url": "https://github.com/nfarina/xmldoc-js/issues"
+  },
+  "_id": "xmldoc@0.1.2",
+  "dist": {
+    "shasum": "24b5175ec1aeffbb7c9d804cf2aff9ee7fab1592"
+  },
+  "_from": "xmldoc@latest",
+  "_resolved": "https://registry.npmjs.org/xmldoc/-/xmldoc-0.1.2.tgz"
+}
diff --git a/package.json b/package.json
new file mode 100644
index 0000000..bc46532
--- /dev/null
+++ b/package.json
@@ -0,0 +1,27 @@
+{
+    "name": "moocrank"
+  , "description": "Search engine for employees to search courses"
+  , "version": "0.0.1"
+  , "author": [
+      {
+        "name": "Israel Gutiérrez",
+        "email": "igutierrez@inv.it.uc3m.es"
+      },
+      {
+        "name": "Derick Leony",
+        "email": "dleony@it.uc3m.es"
+      }
+    ]
+  , "repository" : { 
+      "type" : "git",
+      "url" : "http://github.com/gootyfer/moocrank.git"
+  } 
+  , "dependencies": {
+      "mongodb": "latest",
+      "xmldoc": "latest"
+  }
+  , "engines": {
+      "node": "0.10.8",
+      "npm": "1.2.23"
+  }
+}
\ No newline at end of file
diff --git a/parser/coursera-parser.js b/parser/coursera-parser.js
new file mode 100644
index 0000000..2d6640b
--- /dev/null
+++ b/parser/coursera-parser.js
@@ -0,0 +1,43 @@
+var data  = require('../data/coursera.json');
+var config = require('../config.json');
+
+//var CourseManager = require('../models/courseManager').CourseManager;
+//var courseManager = new CourseManager(config.database.url, config.database.port, config.database.name);
+
+var courses = [];
+for (id in data.topics){
+	var course = data.topics[id];
+	//console.log(course.name);
+	course._id = id;
+	courses.platform = "coursera";
+	courses.push(course);
+}
+
+
+var MongoClient = require('mongodb').MongoClient
+    , format = require('util').format;    
+
+  MongoClient.connect('mongodb://'+config.database.url+':'+config.database.port+'/'+config.database.name, function(err, db) {
+    if(err) throw err;
+
+    var collection = db.collection('courses');
+    collection.insert(courses, function(err, docs) {
+
+      collection.count(function(err, count) {
+        console.log(format("count = %s courses saved!", count));
+      });
+
+	db.close();
+    console.log("DONE!");     
+    });
+  });
+
+// courseManager.save(courses, function(error, courses2){
+// 	if(error){
+// 		console.log(error);
+// 	}else{
+// 		console.log(courses2[0].name);
+// 	}
+// 	console.log("DONE!");
+// });
+// courseManager.close();
\ No newline at end of file
diff --git a/parser/outcomes-parser.js b/parser/outcomes-parser.js
new file mode 100644
index 0000000..a9893c1
--- /dev/null
+++ b/parser/outcomes-parser.js
@@ -0,0 +1,84 @@
+var xmldoc = require('xmldoc');
+var fs = require('fs');
+var config = require('../config.json');
+var xmlFilePath = './data/outcomes.xml';
+
+fs.exists(xmlFilePath, function(exists){console.log(exists);})
+
+fs.readFile(xmlFilePath, "UTF-8",function(error, xml) {
+	//console.log(xml);
+	var document = new xmldoc.XmlDocument(xml);
+	var rootId = document.attr.id;
+	var catArray = [];
+	document.childrenNamed("LOCassociation").forEach(function(catNode){
+		//search for root categories
+		if(catNode.attr.type == "http://purl.org/net/inloc/LOCrel" && catNode.childNamed("subject").attr.id == rootId && catNode.childNamed("scheme").attr.id == "http://purl.org/net/inloc/hasLOCpart"){
+			var catId = catNode.childNamed("object").attr.id;
+			//search for the name
+			var cat = {};
+			//TODO: should we give the cat a unique id to avoid duplicates?
+			var catDefinition = document.childWithAttribute("id",catId);
+			if(catDefinition){
+				cat.name = catDefinition.valueWithPath("title");
+				//search for sub-categories
+				cat.subcats = [];
+				document.childrenNamed("LOCassociation").forEach(function(subcatNode){
+					if(subcatNode.attr.type == "http://purl.org/net/inloc/LOCrel" && subcatNode.childNamed("subject").attr.id == catId && subcatNode.childNamed("scheme").attr.id == "http://purl.org/net/inloc/hasLOCpart"){
+						var subcatId = subcatNode.childNamed("object").attr.id;
+						//search for the name
+						var subcat = {};
+						var subcatDefinition = document.childWithAttribute("id",subcatId);
+						subcat.name = subcatDefinition.valueWithPath("title");
+						//search for outcomes
+						subcat.outcomes = [];
+						document.childrenNamed("LOCassociation").forEach(function(outcomeNode){
+							if(outcomeNode.attr.type == "http://purl.org/net/inloc/LOCrel" && outcomeNode.childNamed("subject").attr.id == subcatId && outcomeNode.childNamed("scheme").attr.id == "http://purl.org/net/inloc/hasLOCpart"){
+								var outcomeId = outcomeNode.childNamed("object").attr.id;
+								//search for the name
+								var outcome = {};
+								var outcomeDefinition = document.childWithAttribute("id",outcomeId);
+								if(outcomeDefinition){
+									outcome.name = outcomeDefinition.valueWithPath("description");
+									//search for outcome types (several are permitted)
+									outcome.outcomeTypes = [];
+									document.childrenNamed("LOCassociation").forEach(function(outcomeTypeNode){
+										if(outcomeTypeNode.attr.type == "http://purl.org/net/inloc/category" && outcomeTypeNode.childNamed("subject").attr.id == outcomeId && outcomeTypeNode.childNamed("scheme").attr.id == "http://www.eummena.org/inloc/competence-IEEE-ACM-CS2013"){
+											var outcomeTypeName = outcomeTypeNode.valueWithPath("object.label");
+											outcome.outcomeTypes.push(outcomeTypeName);
+										}
+									});
+									subcat.outcomes.push(outcome);
+								}
+							}
+						});
+						cat.subcats.push(subcat);
+					}
+				});
+				catArray.push(cat);
+				console.log(cat);
+			}
+		}
+	});
+	//Save to mongo
+	var MongoClient = require('mongodb').MongoClient
+	    , format = require('util').format;    
+
+	  MongoClient.connect('mongodb://'+config.database.url+':'+config.database.port+'/'+config.database.name, function(err, db) {
+	    if(err) throw err;
+
+	    var collection = db.collection('outcomeCategories');
+	    collection.insert(catArray, function(err, docs) {
+
+	      collection.count(function(err, count) {
+	        console.log(format("count = %s outcomeCategories saved!", count));
+	      });
+
+		db.close();
+	    console.log("DONE!");     
+	    });
+	  });
+	
+	//console.log(document);
+});
+
+
diff --git a/readme.txt b/readme.txt
new file mode 100644
index 0000000..4a59385
--- /dev/null
+++ b/readme.txt
@@ -0,0 +1,13 @@
+Search engine for employees to search courses (MOOCs) based on some parameters: learning objectives of the employees, objectives of the employer, dependencies between courses, courses followed in parallel, etc.
+
+
+How to run it
+
+Install stuff!
+- install node: apt-get install node
+- install mongodb: apt-get install mongodb
+- in the root directory, update dependencies: npm install
+
+Run it!
+- to create in db courses: node parser/coursera-parser.js
+- to create in db outcomes: node parser/outcomes-parser.js