Recent Changes - Digital History

Front Page

william.j.turkel — 2009-11-19 17:15:48

Differences for Front Page

Deletions are marked with - .	Additions are marked with +.
Line 13:	Line 13:
- [http://niche.uwo.ca/digital-infrastructure/hackknow "Hacking as a Way of Knowing"] (2009). I organzied a workshop with [http://www.yorku.ca/imhotep Edward Jones-Imhotep] on the theme of "E-waste and environmental data," held at InterAccess in Toronto in May 2009.	+ [http://niche-canada.org/digital-infrastructure/hackknow "Hacking as a Way of Knowing"] (2009). I organzied a workshop with [http://www.yorku.ca/imhotep Edward Jones-Imhotep] on the theme of "E-waste and environmental data," held at InterAccess in Toronto in May 2009.

H9808A 2009 10 Machines

william.j.turkel — 2009-11-17 10:23:43

Differences for H9808A 2009 10 Machines

Deletions are marked with - .	Additions are marked with +.
Line 16:	Line 16:
	+ * Shirky, "[http://www.shirky.com/weblog/2009/11/a-speculative-post-on-the-idea-of-algorithmic-authority/ A Speculative Post on the Idea of Algorithmic Authority]," shirky.com (15 November 2009).

FabWiki Lab equipment

william.j.turkel — 2009-11-16 20:46:18

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 93:	Line 93:
	+ * Tapping Fixture (MicroMark 83146)

FabWiki Lab equipment

william.j.turkel — 2009-11-16 20:39:13

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 76:	Line 76:
	+ * Tool maker's surface gage 4" and 7" (MicroMark 60520)

FabWiki Lab equipment

william.j.turkel — 2009-11-16 20:37:09

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 43:	Line 43:
	+ * 1/8" parallel set, ten pair: 1/2", 5/8", 3/4", 1", 1 1/8", 1 1/4", 1 3/8", 1 1/2", 1,5/8" (MicroMark 83413)

FabWiki Lab equipment

william.j.turkel — 2009-11-16 20:33:56

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 91:	Line 91:
	+ * Press-It Miniature Arbor Press (MicroMark 83539) + * Tooling set, nine-piece (MicroMark 83708) + * Punch set, nine-piece (MicroMark 83709) + * V-plate (MicroMark 84424)

FabWiki 3D Models

william.j.turkel — 2009-11-15 11:06:00

Differences for FabWiki 3D Models

Deletions are marked with - .	Additions are marked with +.
Line 9:	Line 9:
	+ * [http://www.shapeways.com/tutorials/prepping_blender_files_for_3d_printing Prepping Blender Files for 3D Printing] - Shapeways tutorial

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:44:45

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 42:	Line 42:
	+ * Angle Plate 2" x 2" x 2" (MicroMark 20123)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:43:04

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 211:	Line 211:
	+ * Metric M3.0 x 0.50 x 13/16" OD die (MicroMark 82323D)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:40:48

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 81:	Line 81:
	+ * Center square (MicroMark 82285)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:38:55

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 42:	Line 42:
	+ * Lathe Bits + * HSS 1/4" x 1/4" x 2 1/2" lathe tool bit set, eight-piece (MicroMark 82757)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:37:03

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 40:	Line 40:
	+ * Matching V-block and clamp set (MicroMark 14255)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:35:19

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 39:	Line 39:
	+ * Other machining + * 1 1/2" Mini V-Block adapter for small parts (MicroMark 83381)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:32:32

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 75:	Line 75:
	+ * 3" machinist's steel square (MicroMark 10117)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:28:32

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 167:	Line 167:
	+ * Swiss micro pin vise (MicroMark 15116)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:27:49

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 220:	Line 220:
	+ * .010" x 30 tpi saw blades (MicroMark 14347)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:20:08

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 219:	Line 219:
	+ * .010" x 40 tpi saw blades (MicroMark 14346)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:16:01

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 120:	Line 120:
	+ * 61-80 flat drill index set (Excel 55522; MicroMark 60362)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:13:40

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 129:	Line 129:
- * Mini diamond file set (MicroMark 82248)	+ * Mini diamond file set, ten-piece 100x2mm (MicroMark 82248)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:12:17

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 129:	Line 129:
- * Mini diamond file set, six-piece (Mascot H311; MicroMark 82248)	+ * Mini diamond file set (MicroMark 82248) + * Mini reamer set, six-piece (Mascot H311; MicroMark 26108)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:09:40

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 129:	Line 129:
	+ * Mini diamond file set, six-piece (Mascot H311; MicroMark 82248)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:06:32

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 188:	Line 188:
	+ * Castroviejo micro scissors, straight (MicroMark 84440) + * Castroviejo micro scissors, curved (MicroMark 84441)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:02:39

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 157:	Line 157:
	+ * Pearl tweezer (MicroMark 82426)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 17:01:10

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 74:	Line 74:
	+ * 6" machinist's rule (MicroMark 10114)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:58:22

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 154:	Line 154:
- * Metal forming plier set (MicroMark 60398)	+ * Metal forming plier set, four-piece (MicroMark 60398) + * Tweezer set for round objects, four-piece (MicroMark 84255)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:55:29

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 139:	Line 139:
- * 5 piece micro-pick set (Ullman Devices MP-6)	+ * Micro-pick set, five-piece (Ullman Devices MP-6) + * Spatula and carver set, seven-piece (MicroMark 84594)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:51:42

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 149:	Line 149:
- * 5 piece mini pliers set (Mastercraft 58-4788-6)	+ * Mini pliers set, five-piece (Mastercraft 58-4788-6)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:51:22

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 152:	Line 152:
	+ * Micro pliers set, four-piece (MicroMark 60399)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:48:44

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 171:	Line 171:
	+ * Handheld tube cutting jig (MicroMark 84515)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:48:11

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 161:	Line 161:
- * Saws	+ * Saws, Mitre Boxes and Jigs

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:46:18

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 126:	Line 126:
- * 5 1/2" hobby file set (Nicholson 42030)	+ * 5 1/2" six-piece hobby file set (Nicholson 42030)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:45:54

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 127:	Line 127:
	+ * 3 x 180 twelve-piece riffler file set (MicroMark 33111A)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:43:19

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 97:	Line 97:
	+ * Ball end inch set: .050", 1/16", 5/64", 3/32", 7/64", 1/8", 9/64", 5/32" (Wiha 26490; MicroMark 81708)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:41:43

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 98:	Line 98:
- * Ball end metric set: 1.3mm,	+ * Ball end metric set: 1.3mm, 1.5mm, 2.0mm, 2.5mm, 3.0mm (Wiha 26491; MicroMark 81709)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:40:47

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 133:	Line 133:
- * Metric nutdriver set: 2.5, 3.0, 3.5, 4.0, 5, 5.5, 6.0 mm (Wiha 26590; MicroMark 81547)	+ * Metric nutdriver set: 2.5mm, 3.0mm, 3.5mm, 4.0mm, 5mm, 5.5mm, 6.0mm (Wiha 26590; MicroMark 81547)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:40:26

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 98:	Line 98:
	+ * Ball end metric set: 1.3mm,

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:39:37

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 131:	Line 131:
	+ * Nutdrivers + * Metric nutdriver set: 2.5, 3.0, 3.5, 4.0, 5, 5.5, 6.0 mm (Wiha 26590; MicroMark 81547)

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:35:07

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 127:	Line 127:
- * Hammers	+ * Hammers and Mallets

FabWiki Lab equipment

william.j.turkel — 2009-11-14 16:34:56

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 130:	Line 130:
	+ * Brass / Nylon mallet (MicroMark 83434)

H9808A 2009 10 Machines

william.j.turkel — 2009-11-14 11:42:11

Differences for H9808A 2009 10 Machines

Deletions are marked with - .	Additions are marked with +.
Line 4:	Line 4:
- - --> '''The details of this page are not finalized yet... check back closer to day of class''' <--
Line 28:	Line 26:
	+ + '''Do some simple text mining.''' This week you learned about some sophisticated tools that can be used by humanists to process large amounts of text and facilitate exploration. Some of these techniques require programming skills, but many do not. The Canadian [http://portal.tapor.ca/portal/portal TAPoR] project is a wonderful collection of resources that bring text processing and analysis within the reach of any scholar. Starting at the [http://tada.mcmaster.ca/Main/TaporRecipes TAPoR recipes page] try choosing a historical text from [http://www.gutenberg.org/ Gutenberg] and [http://tada.mcmaster.ca/Main/RecipeOneOhTwo generating a concordance]. What kinds of things can you learn about a work this way? Feel free to blog about the assignment if you find something interesting.

H9808A 2009 10 Machines

william.j.turkel — 2009-11-14 11:24:08

Differences for H9808A 2009 10 Machines

Deletions are marked with - .	Additions are marked with +.
Line 11:	Line 11:
- * Gralla, "Ch 33 How Agents Work (Ch 32 in 7th ed.)", "Ch 48 How Internet Sites Can Invade Your Privacy (Ch 46 in 7th ed.)", "Ch 49 The Dangers of Spyware and Phishing (Not in 7th ed.)" - -
Line 17:	Line 14:
- - Cohen, Daniel J. and Roy Rosenzweig. “[http://firstmonday.org/htbin/cgiwrap/bin/ojs/index.php/fm/article/view/1299/1219 Web of Lies? Historical Knowledge on the Internet],” ''First Monday'' 10, no. 12 (15 Nov 2005). - - Garrett, Jeffrey. “[http://hdl.handle.net/2027/spo.3336451.0009.106 KWIC and Dirty? Human Cognition and the Claims of Full-Text Searching],” ''Journal of Electronic Publishing'' 9, no. 1 (Winter 2006). - - Kelly, T. Mills. “[http://chnm.gmu.edu/history/faculty/kelly/blogs/edwired/archives/2006/09/analyzing_traff.html Analyzing Traffic],” edwired (29 Sep 2006). - - Turkel, W. J. “[http://digitalhistoryhacks.blogspot.com/2006/10/searching-for-history.html Searching for History],” Digital History Hacks (12 Oct 2006). - - Unsworth, John. “[http://www.iath.virginia.edu/%7Ejmu2m/sdl.html The Scholar in the Digital Library],” (6 Apr 2000).	+ * Cohen and Rosenzweig, "[http://firstmonday.org/htbin/cgiwrap/bin/ojs/index.php/fm/article/view/1299/1219 Web of Lies? Historical Knowledge on the Internet]," ''First Monday'' 10, no. 12 (15 Nov 2005). + * Garrett, "[http://hdl.handle.net/2027/spo.3336451.0009.106 KWIC and Dirty? Human Cognition and the Claims of Full-Text Searching]," ''Journal of Electronic Publishing'' 9, no. 1 (Winter 2006). + * Gralla, "Ch 33 How Agents Work (Ch 32 in 7th ed.)", "Ch 48 How Internet Sites Can Invade Your Privacy (Ch 46 in 7th ed.)", "Ch 49 The Dangers of Spyware and Phishing (Not in 7th ed.)" + * Kelly, "[http://chnm.gmu.edu/history/faculty/kelly/blogs/edwired/archives/2006/09/analyzing_traff.html Analyzing Traffic]," edwired (29 Sep 2006). + * Turkel, "[http://digitalhistoryhacks.blogspot.com/2006/10/searching-for-history.html Searching for History]," Digital History Hacks (12 Oct 2006). + * Unsworth, "[http://www.iath.virginia.edu/%7Ejmu2m/sdl.html The Scholar in the Digital Library]," (6 Apr 2000).

H9808A 2009 10 Machines

william.j.turkel — 2009-11-14 11:22:11

Differences for H9808A 2009 10 Machines

Deletions are marked with - .	Additions are marked with +.
Line 30:	Line 30:
- The following set of posts describe how to implement one complete data mining project, using trial records from the [http://www.oldbaileyonline.org/ Old Bailey Online]. The links to the source code in my blog are broken, but copies of all of the Python programs can be found [http://digitalhistory.wikispot.org/DHH_Archive here]. If you just want to get an idea of what I did, read posts 1 and 14. The naive bayesian learner is described in post 7.	+ The following set of posts describe how to implement one complete machine learning / data mining project, using trial records from the [http://www.oldbaileyonline.org/ Old Bailey Online]. The links to the source code in my blog are broken, but copies of all of the Python programs can be found [http://digitalhistory.wikispot.org/DHH_Archive here]. If you just want to get an idea of what I did, read posts 1 and 14. The naive bayesian learner is described in post 7.

H9808A 2009 10 Machines

william.j.turkel — 2009-11-14 11:19:37

Differences for H9808A 2009 10 Machines

Deletions are marked with - .	Additions are marked with +.
Line 30:	Line 30:
- The following set of posts describe how to implement one complete data mining project. The links to the source code in my blog are broken, but copies of all of the Python programs can be found [http://digitalhistory.wikispot.org/DHH_Archive here]. If you just want to get an idea of what I did, read posts 1, FOOBAR	+ The following set of posts describe how to implement one complete data mining project, using trial records from the [http://www.oldbaileyonline.org/ Old Bailey Online]. The links to the source code in my blog are broken, but copies of all of the Python programs can be found [http://digitalhistory.wikispot.org/DHH_Archive here]. If you just want to get an idea of what I did, read posts 1 and 14. The naive bayesian learner is described in post 7.
Line 32:	Line 32:
- * Turkel, "A Naive Bayesian in the Old Bailey, parts [http://digitalhistoryhacks.blogspot.com/2008/05/naive-bayesian-in-old-bailey-part-1.html 1], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-2.html 2], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-3.html 3], [ 4], " Digital History Hacks (24 May - 2008).	+ * Turkel, "A Naive Bayesian in the Old Bailey, parts [http://digitalhistoryhacks.blogspot.com/2008/05/naive-bayesian-in-old-bailey-part-1.html 1], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-2.html 2], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-3.html 3], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-4.html 4], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-5.html 5], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-6.html 6], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-7.html 7], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-8.html 8], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-9.html 9], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-10.html 10], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-11.html 11], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-12.html 12], [http://digitalhistoryhacks.blogspot.com/2008/07/naive-bayesian-in-old-bailey-part-13.html 13], and [http://digitalhistoryhacks.blogspot.com/2008/07/naive-bayesian-in-old-bailey-part-14.html 14]," Digital History Hacks (24 May - 3 July 2008).

H9808A 2009 10 Machines

william.j.turkel — 2009-11-14 11:13:40

Differences for H9808A 2009 10 Machines

Deletions are marked with - .	Additions are marked with +.
Line 30:	Line 30:
- The following set of posts describe how to implement one complete data mining project. The blog links to the source code are broken but copies of all of the Python programs can be found [http://digitalhistory.wikispot.org/DHH_Archive here]. If you just want to get an idea of what I did, read posts 1, FOOBAR	+ The following set of posts describe how to implement one complete data mining project. The links to the source code in my blog are broken, but copies of all of the Python programs can be found [http://digitalhistory.wikispot.org/DHH_Archive here]. If you just want to get an idea of what I did, read posts 1, FOOBAR

H9808A 2009 10 Machines

william.j.turkel — 2009-11-14 11:13:10

Differences for H9808A 2009 10 Machines

Deletions are marked with - .	Additions are marked with +.
Line 7:	Line 7:
	+ In ''Data Mining'', Witten and Frank define the subject as “the extraction of implicit, previously unknown, and potentially useful information from data,” as the process of “finding and describing patterns in data.” Machine learning, a sub-discipline of computer science, goes one step further by attempting to use these patterns to classify previously unseen data. Historians are now beginning to use both kinds of techniques in the research process. +
Line 9:	Line 11:
- Gralla, "Ch 33 How Agents Work (Ch 32 in 7th ed.)", "Ch 48 How Internet Sites Can Invade Your Privacy (Ch 46 in 7th ed.)", "Ch 49 The Dangers of Spyware and Phishing (Not in 7th ed.)"	+ * Gralla, "Ch 33 How Agents Work (Ch 32 in 7th ed.)", "Ch 48 How Internet Sites Can Invade Your Privacy (Ch 46 in 7th ed.)", "Ch 49 The Dangers of Spyware and Phishing (Not in 7th ed.)" + + + * Cohen, "[http://www.dancohen.org/blog/posts/mapping_what_americans_did_on_september_11 Mapping What Americans Did on September 11]," dancohen.org (8 Aug 2006). + * Cohen, "[http://www.dancohen.org/blog/posts/intelligence_analysts_and_humanities_scholars Intelligence Analysts and Humanities Scholars]," dancohen.org (13 Nov 2006). + * Cohen, "[http://www.dancohen.org/files/hist_2nd_decade_web.pdf History and the Second Decade of the Web]," ''Rethinking History'' (Jun 2004). + + Cohen, Daniel J. and Roy Rosenzweig. “[http://firstmonday.org/htbin/cgiwrap/bin/ojs/index.php/fm/article/view/1299/1219 Web of Lies? Historical Knowledge on the Internet],” ''First Monday'' 10, no. 12 (15 Nov 2005). + + Garrett, Jeffrey. “[http://hdl.handle.net/2027/spo.3336451.0009.106 KWIC and Dirty? Human Cognition and the Claims of Full-Text Searching],” ''Journal of Electronic Publishing'' 9, no. 1 (Winter 2006). + + Kelly, T. Mills. “[http://chnm.gmu.edu/history/faculty/kelly/blogs/edwired/archives/2006/09/analyzing_traff.html Analyzing Traffic],” edwired (29 Sep 2006). + + Turkel, W. J. “[http://digitalhistoryhacks.blogspot.com/2006/10/searching-for-history.html Searching for History],” Digital History Hacks (12 Oct 2006). + + Unsworth, John. “[http://www.iath.virginia.edu/%7Ejmu2m/sdl.html The Scholar in the Digital Library],” (6 Apr 2000).
Line 13:	Line 30:
	+ The following set of posts describe how to implement one complete data mining project. The blog links to the source code are broken but copies of all of the Python programs can be found [http://digitalhistory.wikispot.org/DHH_Archive here]. If you just want to get an idea of what I did, read posts 1, FOOBAR + + * Turkel, "A Naive Bayesian in the Old Bailey, parts [http://digitalhistoryhacks.blogspot.com/2008/05/naive-bayesian-in-old-bailey-part-1.html 1], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-2.html 2], [http://digitalhistoryhacks.blogspot.com/2008/06/naive-bayesian-in-old-bailey-part-3.html 3], [ 4], " Digital History Hacks (24 May - 2008). +

DHH20080605-01

william.j.turkel — 2009-11-14 11:10:37

Differences for DHH20080605-01

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # split-into-trials.py + # old bailey + # + # split each of the tagged XML files into separate trial files + + import os, sys, re + from BeautifulSoup import BeautifulStoneSoup + + # given a directory string, return a list of file names + def getFileNames(dirstr): + dircommand = 'dir ' + dirstr + ' /B' + filelist = os.popen(dircommand).readlines() + filelist = [x.rstrip() for x in filelist] + return filelist + + # get a list of XML files to process + indirname = 'Tagged_final\Tagged_1830s_Files' + filelist = getFileNames(indirname) + + # if output directory doesn't exist, create it + outdirname = 'Mined_1830s' + if os.path.exists(outdirname) == 0: os.mkdir(outdirname) + + # extract each trial from each XML file and save it separately + for fn in filelist: + + # provide feedback for user + print 'Processing ' + fn + sys.stdout.flush() + + # read XML file into string and parse it + f = open(indirname+'\\'+fn, 'r') + fnxml = f.read() + f.close() + fnsoup = BeautifulStoneSoup(fnxml) + triallist = fnsoup.findAll('trial') + + # extract trial id and use as filename for each trial + trialpattern = re.compile(r'id=\"(t-\d+-\d+)', re.UNICODE) + for tr in triallist: + matchid = trialpattern.search(str(tr)) + outfilename = outdirname + '\\' + matchid.group(1) + '.txt' + f = open(outfilename, 'w') + f.write(str(tr)) + f.close() + }}}

DHH20080607-01

william.j.turkel — 2009-11-14 11:10:00

Differences for DHH20080607-01

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # clean-copy-trials.py + # old bailey + # + # given a directory of trial files each marked with XML + # create a parallel directory of files with all tagging stripped + + import os, sys, re + + # given a directory string, return a list of file names + def getFileNames(dirstr): + dircommand = 'dir ' + dirstr + ' /B' + filelist = os.popen(dircommand).readlines() + filelist = [x.rstrip() for x in filelist] + return filelist + + # given a string containing XML, remove all characters + # between matching pairs of angled brackets, inclusive + def stripTags(xml): + inside = 0 + text = '' + for char in xml: + if char == '<': + inside = 1 + continue + elif (inside == 1 and char == '>'): + inside = 0 + continue + elif inside == 1: + continue + else: + text += char + return text + + # given a local copy of an XML file, return string + # of lowercase text from page + def localXMLFileToText(xmlfile): + f = open(xmlfile, 'r') + xml = f.read() + f.close() + text = stripTags(xml).replace(' ', ' ') + text = text.replace('—', ' ') + text = text.replace('"', '') + return text.lower() + + # given a text string, remove all non-alphanumeric + # characters (using Unicode definition of alphanumeric) + def stripNonAlphaNum(text): + import re + return re.compile(r'\W+', re.UNICODE).split(text) + + # get a list of trial files to process + indirname = 'Mined_1830s' + filelist = getFileNames(indirname) + + # if output directory doesn't exist, create it + outdirname = 'Mined_1830s_clean' + if os.path.exists(outdirname) == 0: os.mkdir(outdirname) + + # page images have 12-digit number + imgpattern = re.compile(r'\d{12}', re.UNICODE) + + for fn in filelist: + + # provide feedback for user + print 'Processing ' + fn + sys.stdout.flush() + + # read XML file into string and remove formatting + infile = indirname + '\\' + fn + instr = localXMLFileToText(infile) + instr = imgpattern.sub(' ', instr) + wordlist = stripNonAlphaNum(instr) + + # output clean lowercase alphanumeric text + outfile = outdirname + '\\' + 'clean_' + fn + f = open(outfile, 'w') + for w in wordlist: f.write(w+' ') + f.close() + }}}

DHH20080609-05

william.j.turkel — 2009-11-14 11:09:33

Differences for DHH20080609-05

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # count-offences.py + # old bailey + # + # using the offence files, quickly count how many + # offences of each type + + import os + + # given a directory string, return a list of file names + def getFileNames(dirstr): + dircommand = 'dir ' + dirstr + ' /B' + filelist = os.popen(dircommand).readlines() + filelist = [x.rstrip() for x in filelist] + return filelist + + # open an output file + resultsfile = open('offence-counts-1830s.txt', 'w') + + # get a list of offence files to process + indirname = 'Offences_1830s' + ofilelist = getFileNames(indirname) + + # process each file + for ofile in ofilelist: + + # get a list of trials for each offence + f = open(indirname+'\\'+ofile, 'r') + triallist = f.readlines() + f.close() + + # write results + resultstr = ofile + '\|' + str(len(triallist)) + '\n' + resultsfile.write(resultstr) + + resultsfile.close() + }}}

DHH20080609-04

william.j.turkel — 2009-11-14 11:09:05

Differences for DHH20080609-04

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # offence-index.py + # old bailey + # + # given a list mapping trial id to offence, create + # lists of trials that fall into each offence category + + import os + + infile = open('offence-categories-1830s.txt', 'r') + triallist = infile.readlines(); + infile.close() + + # get a list of unique offences + alloffences = [] + for tr in triallist: + rowlist = tr.split(',') + offencelist = rowlist[1:] + alloffences += map(lambda x: x.strip(), offencelist) + + print "Total number of offences: " + str(len(alloffences)) + uniqoffences = list(set(alloffences)) + print "Number of unique offences: " + str(len(uniqoffences)) + # print uniqoffences + + # if output directory doesn't exist, create it + outdirname = 'Offences_1830s' + if os.path.exists(outdirname) == 0: os.mkdir(outdirname) + + # create empty dictionary structure + offencedict = {} + for u in uniqoffences: offencedict[u] = [] + + # go through file again, this time adding each trial to + # dictionary of offences + + for tr in triallist: + rowlist = tr.split(',') + trialid = rowlist[0] + # need to get rid of trailing newlines + fulloffencelist = map(lambda x: x.strip(), rowlist[1:]) + # can be charged with multiple counts of same offence + offencelist = list(set(fulloffencelist)) + # update dictionary + map(lambda x: offencedict[x].append(trialid), offencelist) + + # write out each dictionary entry as a separate file + + for k in offencedict.keys(): + outfilename = outdirname + '\\' + k + '.txt' + outfile = open(outfilename, 'w') + for tr in offencedict[k]: outfile.write(tr+'\n') + outfile.close() + }}}

DHH20080609-03

william.j.turkel — 2009-11-14 11:08:23

Differences for DHH20080609-03

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # offence-category.py + # old bailey + # + # given a directory of trial files each marked with XML + # extract a list mapping trial id to offence + + import os, sys, re + from BeautifulSoup import BeautifulStoneSoup + + # given a directory string, return a list of file names + def getFileNames(dirstr): + import os + dircommand = 'dir ' + dirstr + ' /B' + filelist = os.popen(dircommand).readlines() + filelist = [x.rstrip() for x in filelist] + return filelist + + # given an XML tag describing an offence, return as a + # standardized string + def standardizeOffenceTags(offstring): + stdstr = offstring.replace('<', '') + stdstr = stdstr.replace('>', '') + stdstr = stdstr.replace('\"', '') + stdstr = stdstr.replace('category=', '') + stdstr = stdstr.replace(' ', '-') + return stdstr.lower() + + # get a list of trial files to process + indirname = 'Mined_1830s' + filelist = getFileNames(indirname) + + # scrape out the first child node of each offence + offencepattern = re.compile(r'<.*?>', re.UNICODE) + + resultsfile = open('offence-categories-1830s.txt', 'w') + + for fn in filelist: + + outstr = fn + + # read XML file into string and parse it + f = open(indirname+'\\'+fn, 'r') + fnxml = f.read() + f.close() + fnsoup = BeautifulStoneSoup(fnxml) + offencelist = fnsoup.findAll('offence') + + # extract offences + for o in offencelist: + offence = o.contents[0] + # one trial had a blank space in front of first node + if offence == ' ': offence = o.contents[1] + omatch = offencepattern.match(str(offence)) + offstr = omatch.group() + outstr += ',' + standardizeOffenceTags(offstr) + + # write offence data to file + resultsfile.write(outstr+'\n') + resultsfile.flush() + + # provide feedback for user + print outstr + sys.stdout.flush() + + resultsfile.close() + }}}

DHH20080609-02

william.j.turkel — 2009-11-14 11:07:56

Differences for DHH20080609-02

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # get-date-range.py + # old bailey + # + # given a directory of trial files, return + # an ordered list of trial dates + + import os + import re + + # given a directory string, return a list of file names + def getFileNames(dirstr): + dircommand = 'dir ' + dirstr + ' /B' + filelist = os.popen(dircommand).readlines() + filelist = [x.rstrip() for x in filelist] + return filelist + + # get a list of trial files to process + indirname = 'Mined_1830s' + triallist = getFileNames(indirname) + + # strip date out of pre- and post-fixed material + datedict = {} + datepattern = re.compile(r'\d{8}', re.UNICODE) + for tr in triallist: + matchdate = datepattern.search(tr) + datedict[matchdate.group()] = '1' + + # output file consisting of list of dates + keys = datedict.keys() + keys.sort() + outfilename = 'dates-1830s.txt' + f = open(outfilename, 'w') + for k in keys: f.write(str(k)+'\n') + f.close() + }}}

DHH20080609-01

william.j.turkel — 2009-11-14 11:07:20

Differences for DHH20080609-01

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # trial-id-list.py + # old bailey + # + # create a list of trial ids + + import os + + # given a directory string, return a list of file names + def getFileNames(dirstr): + dircommand = 'dir ' + dirstr + ' /B' + filelist = os.popen(dircommand).readlines() + filelist = [x.rstrip() for x in filelist] + return filelist + + # get a list of trial files + indirname = 'Mined_1830s' + triallist = getFileNames(indirname) + + # write it out + resultsfile = open('trial-ids-1830s.txt', 'w') + for tr in triallist: + resultstr = tr + '\n' + resultsfile.write(resultstr) + + resultsfile.close() + }}}

DHH20080612-02

william.j.turkel — 2009-11-14 11:06:35

Differences for DHH20080612-02

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # count-offence-instances.py + # old bailey + # + # given a crossvalidation sample, count the + # number of offence instances in each partition + + import os + + # given a directory string, return a list of file names + def getFileNames(dirstr): + dircommand = 'dir ' + dirstr + ' /B' + filelist = os.popen(dircommand).readlines() + filelist = [x.rstrip() for x in filelist] + return filelist + + # get list of matching trials + offencedir = 'Offences_1830s' + offencefile = 'theft-simplelarceny.txt' + f = open(offencedir + '\\' + offencefile, 'r') + triallist = f.readlines() + f.close() + + # get a list of sample files to process + indirname = 'Samples_1830s' + samplelist = getFileNames(indirname) + + # count instances + instancetotal = 0 + for s in samplelist: + instances = 0 + f = open(indirname + '\\' + s, 'r') + samptriallist = f.readlines() + f.close() + for tr in samptriallist: + if tr in triallist: instances += 1 + print "%s: %d" % (s, instances) + instancetotal += instances + + # sanity check + print "Number of offences: %d" % len(triallist) + print "Sum of offences: %d" % instancetotal + }}}

DHH20080612-01

william.j.turkel — 2009-11-14 11:05:59

Differences for DHH20080612-01

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # tenfold-crossvalidation-sample.py + # old bailey + # + # given a list of trials, shuffle and divide + # into ten samples of approximately equal size + + import os, random + + # if output directory doesn't exist, create it + outdirname = 'Samples_1830s' + if os.path.exists(outdirname) == 0: os.mkdir(outdirname) + + # get a list of trials + f = open('trial-ids-1830s.txt', 'r') + triallist = f.readlines() + f.close() + + # shuffle it, changing list in place + random.shuffle(triallist) + + # do floor division to get basic sample size and remainder + numtrials = len(triallist) + samplesize = numtrials // 10 + base = samplesize * 10 + remainder = numtrials - base + print "Trials: %d; Base sample: %d; Remainder: %d" % (numtrials, samplesize, remainder) + + # get basic samples + sample = {} + for i in range(0,10): + index = i * samplesize + offset = index + samplesize + sample[i] = triallist[index:offset] + + # distribute remainder as equally as possible + tailend = range(base, base+remainder) + i = 0 + for t in tailend: + sample[i].append(triallist[t]) + i += 1 + + # do sanity check + sanity = 0 + for k in sample.keys(): sanity += len(sample[k]) + if sanity != numtrials: + print "Sanity check failed" + quit() + + # write samples to files + for k in sample.keys(): + outfilename = outdirname + '\\sample' + str(k) + '.txt' + f = open(outfilename, 'w') + for tr in sample[k]: f.write(str(tr)) + f.close() + }}}

DHH20080617-01

william.j.turkel — 2009-11-14 11:05:25

Differences for DHH20080617-01

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # cross-validate-learner.py + # old bailey + # + # test performance of learner on a + # cross-validation sample + + import os, string, re, sys + from bayesian import * + + # set learner type to 'coinflip', 'getwords' or 'gettwograms' + learner = 'gettwograms' + + # read the 10 sample files into an array of lists of the form + # samplelist[sample_number][item_number] + sampledir = 'Samples_1830s' + samplelist = [] + for i in range(0, 10): + f = open(sampledir + '\\' + 'sample' + str(i) + '.txt', 'r') + sample = [] + sample = f.readlines() + sample = [x.rstrip() for x in sample] + samplelist.append(sample) + f.close + + # offence being tested + offencedir = 'Offences_1830s' + offencefile = 'theft-simplelarceny.txt' + f = open(offencedir + '\\' + offencefile, 'r') + offencelist = f.readlines() + offencelist = [x.rstrip() for x in offencelist] + f.close() + offencecount = len(offencelist) + + # trials + trialdir = 'Mined_1830s_clean' + + # open output file and write the file header + outfile = 'cross-val-learn.txt' + f = open(outfile, 'w') + f.write('OLD BAILEY Tenfold Cross-Validation Learning Run\n\n') + f.write('Offence: ' + offencedir + '\\' + offencefile + '\n') + if learner == 'coinflip': + f.write('Learning run: coinflip\n') + elif learner == 'getwords': + f.write('Learning run: getwords\n') + else: + f.write('Learning run: gettwograms\n') + f.write("\nRun, %7s, %7s, %7s, %7s\n" % ('Hit', 'Miss', 'FalseP', 'CorrN')) + + # run tests + cl = [] + for i in range(0,10): + + # train a new learner of the appropriate kind for each run + if learner == 'getwords': + cl.append(naivebayes(getwords)) + elif learner == 'gettwograms': + cl.append(naivebayes(gettwograms)) + else: + cl.append('coinflip') + + # response categories + hits = 0 + misses = 0 + falseps = 0 + corrns = 0 + + # set testing sample to i + print str(i) + ' Loading samples...' + testingsample = [] + testingsample = samplelist[i] + + # set training sample to the concatenation of the others + trainingsample = [] + for j in range(0, i): trainingsample.extend(samplelist[j]) + for j in range((i+1), 10): trainingsample.extend(samplelist[j]) + + # train the learner on training sample + if learner != 'coinflip': + + print str(i) + ' Training' + sys.stdout.flush() + + for r in trainingsample: + trialstr = '' + trialstr = open(trialdir + '\\clean_' + r, 'r').read() + if r in offencelist: cl[i].train(trialstr,'y') + else: cl[i].train(trialstr,'n') + + # test the learner on testing sample + print str(i) + ' Testing' + sys.stdout.flush() + + for t in testingsample: + + # read trial into string + trialstr = '' + trialstr = open(trialdir + '\\clean_' + t, 'r').read() + + # use learner to categorize trial + if learner == 'coinflip': + g = coinflip() + else: + g = cl[i].classify(trialstr,default='n') + + # compare categorization with actual category + if t in offencelist: + # hit or miss + if g == 'y': hits+=1 + else: misses+=1 + else: + # false positive or correct negative + if g == 'y': falseps+=1 + else: corrns+=1 + + # write out learner performance + f.write("%03d, %07d, %07d, %07d, %07d\n" % (i, hits, misses, falseps, corrns)) + f.flush() + + print 'Done' + sys.stdout.flush() + + # close output file + f.close() + }}}

DHH20080618-03

william.j.turkel — 2009-11-14 11:04:43

Differences for DHH20080618-03

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # cross-validate-tfidf-learner.py + # old bailey + # + # test performance of TF/IDF based learner on a + # cross-validation sample + + import os, string, re, sys + from bayesian import * + + # the routine to extract features has to be bypassed + # this expects a string made by concatenating terms + # with highest TF/IDF + def passtfidf(doc): + wordlist = doc.split(' ') + return dict([(w,1) for w in wordlist]) + + # set learner type and number of features + learner = 'tfidf' + numfeatures = 40 + + # read the 10 sample files into an array of lists of the form + # samplelist[sample_number][item_number] + sampledir = 'Samples_1830s' + samplelist = [] + for i in range(0, 10): + f = open(sampledir + '\\' + 'sample' + str(i) + '.txt', 'r') + sample = [] + sample = f.readlines() + sample = [x.rstrip() for x in sample] + samplelist.append(sample) + f.close + + # offence being tested + offencedir = 'Offences_1830s' + offencefile = 'theft-simplelarceny.txt' + f = open(offencedir + '\\' + offencefile, 'r') + offencelist = f.readlines() + offencelist = [x.rstrip() for x in offencelist] + f.close() + offencecount = len(offencelist) + + # trials + trialdir = 'TFIDF_1830s' + + # open output file and write the file header + outfile = 'cross-val-tfidf-lrn.txt' + f = open(outfile, 'w') + f.write('OLD BAILEY Tenfold Cross-Validation Learning Run\n\n') + f.write('Offence: ' + offencedir + '\\' + offencefile + '\n') + f.write('Learning run: tfidf, ' + str(numfeatures) + ' features\n') + f.write("\nRun, %7s, %7s, %7s, %7s\n" % ('Hit', 'Miss', 'FalseP', 'CorrN')) + + # run tests + cl = [] + for i in range(0,10): + + # train a new learner for each run + cl.append(naivebayes(passtfidf)) + + # response categories + hits = 0 + misses = 0 + falseps = 0 + corrns = 0 + + # set testing sample to i + print str(i) + ' Loading samples...' + testingsample = [] + testingsample = samplelist[i] + + # set training sample to the concatenation of the others + trainingsample = [] + for j in range(0, i): trainingsample.extend(samplelist[j]) + for j in range((i+1), 10): trainingsample.extend(samplelist[j]) + + # train the learner on training sample + print str(i) + ' Training' + sys.stdout.flush() + + for r in trainingsample: + trialstr = '' + ff = open(trialdir + '\\tfidf_' + r, 'r') + whole = ff.readlines() + feat = min(len(whole)-1, numfeatures) + for k in range(0, feat): + linein = whole[k].split(',') + trialstr += str(linein[0]) + trialstr += ' ' + ff.close() + + if r in offencelist: + # print trialstr.rstrip() + cl[i].train(trialstr.rstrip(),'y') + else: + # print trialstr.rstrip() + cl[i].train(trialstr.rstrip(),'n') + + # test the learner on testing sample + print str(i) + ' Testing' + sys.stdout.flush() + + for t in testingsample: + + # read trial into string + trialstr = '' + ff = open(trialdir + '\\tfidf_' + t, 'r') + whole = ff.readlines() + feat = min(len(whole)-1, numfeatures) + for k in range(0, feat): + linein = whole[k].split(',') + trialstr += str(linein[0]) + trialstr += ' ' + ff.close() + + # use learner to categorize trial + g = cl[i].classify(trialstr.rstrip(),default='n') + + # compare categorization with actual category + if t in offencelist: + # hit or miss + if g == 'y': hits+=1 + else: misses+=1 + else: + # false positive or correct negative + if g == 'y': falseps+=1 + else: corrns+=1 + + # write out learner performance + f.write("%03d, %07d, %07d, %07d, %07d\n" % (i, hits, misses, falseps, corrns)) + f.flush() + + print 'Done' + sys.stdout.flush() + + # close output file + f.close() + }}}

DHH20080618-02

william.j.turkel — 2009-11-14 11:03:53

Differences for DHH20080618-02

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # compute-tfidf.py + # old bailey + # + # compute TF/IDF for each term used in a trial and + # sort in descending order + + import os, sys, re + from math import log + from pysqlite2 import dbapi2 as sqlite + + stopwords = ['a', 'about', 'above', 'across', 'after', 'afterwards'] + stopwords += ['again', 'against', 'all', 'almost', 'alone', 'along'] + stopwords += ['already', 'also', 'although', 'always', 'am', 'among'] + stopwords += ['amongst', 'amoungst', 'amount', 'an', 'and', 'another'] + stopwords += ['any', 'anyhow', 'anyone', 'anything', 'anyway', 'anywhere'] + stopwords += ['are', 'around', 'as', 'at', 'back', 'be', 'became'] + stopwords += ['because', 'become', 'becomes', 'becoming', 'been'] + stopwords += ['before', 'beforehand', 'behind', 'being', 'below'] + stopwords += ['beside', 'besides', 'between', 'beyond', 'bill', 'both'] + stopwords += ['bottom', 'but', 'by', 'call', 'can', 'cannot', 'cant'] + stopwords += ['co', 'computer', 'con', 'could', 'couldnt', 'cry', 'de'] + stopwords += ['describe', 'detail', 'did', 'do', 'done', 'down', 'due'] + stopwords += ['during', 'each', 'eg', 'eight', 'either', 'eleven', 'else'] + stopwords += ['elsewhere', 'empty', 'enough', 'etc', 'even', 'ever'] + stopwords += ['every', 'everyone', 'everything', 'everywhere', 'except'] + stopwords += ['few', 'fifteen', 'fifty', 'fill', 'find', 'fire', 'first'] + stopwords += ['five', 'for', 'former', 'formerly', 'forty', 'found'] + stopwords += ['four', 'from', 'front', 'full', 'further', 'get', 'give'] + stopwords += ['go', 'had', 'has', 'hasnt', 'have', 'he', 'hence', 'her'] + stopwords += ['here', 'hereafter', 'hereby', 'herein', 'hereupon', 'hers'] + stopwords += ['herself', 'him', 'himself', 'his', 'how', 'however'] + stopwords += ['hundred', 'i', 'ie', 'if', 'in', 'inc', 'indeed'] + stopwords += ['interest', 'into', 'is', 'it', 'its', 'itself', 'keep'] + stopwords += ['last', 'latter', 'latterly', 'least', 'less', 'ltd', 'made'] + stopwords += ['many', 'may', 'me', 'meanwhile', 'might', 'mill', 'mine'] + stopwords += ['more', 'moreover', 'most', 'mostly', 'move', 'much'] + stopwords += ['must', 'my', 'myself', 'name', 'namely', 'neither', 'never'] + stopwords += ['nevertheless', 'next', 'nine', 'no', 'nobody', 'none'] + stopwords += ['noone', 'nor', 'not', 'nothing', 'now', 'nowhere', 'of'] + stopwords += ['off', 'often', 'on','once', 'one', 'only', 'onto', 'or'] + stopwords += ['other', 'others', 'otherwise', 'our', 'ours', 'ourselves'] + stopwords += ['out', 'over', 'own', 'part', 'per', 'perhaps', 'please'] + stopwords += ['put', 'rather', 're', 's', 'same', 'see', 'seem', 'seemed'] + stopwords += ['seeming', 'seems', 'serious', 'several', 'she', 'should'] + stopwords += ['show', 'side', 'since', 'sincere', 'six', 'sixty', 'so'] + stopwords += ['some', 'somehow', 'someone', 'something', 'sometime'] + stopwords += ['sometimes', 'somewhere', 'still', 'such', 'system', 'take'] + stopwords += ['ten', 'than', 'that', 'the', 'their', 'them', 'themselves'] + stopwords += ['then', 'thence', 'there', 'thereafter', 'thereby'] + stopwords += ['therefore', 'therein', 'thereupon', 'these', 'they'] + stopwords += ['thick', 'thin', 'third', 'this', 'those', 'though', 'three'] + stopwords += ['three', 'through', 'throughout', 'thru', 'thus', 'to'] + stopwords += ['together', 'too', 'top', 'toward', 'towards', 'twelve'] + stopwords += ['twenty', 'two', 'un', 'under', 'until', 'up', 'upon'] + stopwords += ['us', 'very', 'via', 'was', 'we', 'well', 'were', 'what'] + stopwords += ['whatever', 'when', 'whence', 'whenever', 'where'] + stopwords += ['whereafter', 'whereas', 'whereby', 'wherein', 'whereupon'] + stopwords += ['wherever', 'whether', 'which', 'while', 'whither', 'who'] + stopwords += ['whoever', 'whole', 'whom', 'whose', 'why', 'will', 'with'] + stopwords += ['within', 'without', 'would', 'yet', 'you', 'your'] + stopwords += ['yours', 'yourself', 'yourselves'] + + # given a list of words, remove any that are + # in a list of stop words + def removeStopwords(wordlist, stopwords): + return [w for w in wordlist if w not in stopwords] + + # given a list of words, remove any that include numerals + def removeNumeralwords(wordlist): + numerals = re.compile('\d+') + l = wordlist[:] + for m in l: + if numerals.match(m): + wordlist.remove(m) + return wordlist + + # given a directory string, return a list of file names + def getFileNames(dirstr): + dircommand = 'dir ' + dirstr + ' /B' + filelist = os.popen(dircommand).readlines() + filelist = [x.rstrip() for x in filelist] + return filelist + + # trials + trialdir = 'Mined_1830s_clean' + triallist = getFileNames(trialdir) + numdocs = len(triallist) + + # create tfidf directory if it doesn't exist + tfidfdir = 'TFIDF_1830s' + if os.path.exists(tfidfdir) == 0: os.mkdir(tfidfdir) + + # look up document frequencies in SQLite DB + connection = sqlite.connect('docfreqs.db') + cursor = connection.cursor() + + # process each trial + i = 0 + for t in triallist: + + # provide feedback for user + i += 1 + print 'Processing %06d %s' % (i, t) + sys.stdout.flush() + + # create a dictionary of unique words and word counts from trial + trialstr = '' + trialstr = open(trialdir + '\\' + t, 'r').read() + allwords = trialstr.split(' ') + wordlist = removeStopwords(allwords, stopwords) + wordlist = removeNumeralwords(wordlist) + wordfreq = [wordlist.count(p) for p in wordlist] + dictionary = dict(zip(wordlist,wordfreq)) + + # compute TF/IDF for each term and add to a new dictionary + newdict = {} + for key in dictionary: + getdf = cursor.execute("SELECT freq FROM docfreqs WHERE docterm = '%s'" % (key)).fetchone() + if getdf == None: + print "ERROR: No doc freq for %s" % key + quit() + df = float(getdf[0]) + tf = float(dictionary[key]) + tfidf = log(tf+1.0) * log(numdocs/df) + newdict[key] = tfidf + + # sort TF/IDFs in descending order + aux = [ (newdict[key], key) for key in newdict] + aux.sort() + aux.reverse() + + # write out to text file + trialpattern = re.compile(r'clean_(t-\d+-\d+)', re.UNICODE) + matchid = trialpattern.search(str(t)) + outfile = tfidfdir + '\\' + 'tfidf_' + matchid.group(1) + '.txt' + f = open(outfile, 'w') + for a in aux: + f.write(str(a[1]) + ',' + str(a[0]) + '\n') + f.close() + + }}}

DHH20080618-01

william.j.turkel — 2009-11-14 11:03:04

Differences for DHH20080618-01

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # compute-doc-freqs.py + # old bailey + # + # remove stop words then compute document frequencies + # for all remaining words + + # stores document frequencies in a SQLite DB + + import os, sys, re + from bayesian import * + from pysqlite2 import dbapi2 as sqlite + + stopwords = ['a', 'about', 'above', 'across', 'after', 'afterwards'] + stopwords += ['again', 'against', 'all', 'almost', 'alone', 'along'] + stopwords += ['already', 'also', 'although', 'always', 'am', 'among'] + stopwords += ['amongst', 'amoungst', 'amount', 'an', 'and', 'another'] + stopwords += ['any', 'anyhow', 'anyone', 'anything', 'anyway', 'anywhere'] + stopwords += ['are', 'around', 'as', 'at', 'back', 'be', 'became'] + stopwords += ['because', 'become', 'becomes', 'becoming', 'been'] + stopwords += ['before', 'beforehand', 'behind', 'being', 'below'] + stopwords += ['beside', 'besides', 'between', 'beyond', 'bill', 'both'] + stopwords += ['bottom', 'but', 'by', 'call', 'can', 'cannot', 'cant'] + stopwords += ['co', 'computer', 'con', 'could', 'couldnt', 'cry', 'de'] + stopwords += ['describe', 'detail', 'did', 'do', 'done', 'down', 'due'] + stopwords += ['during', 'each', 'eg', 'eight', 'either', 'eleven', 'else'] + stopwords += ['elsewhere', 'empty', 'enough', 'etc', 'even', 'ever'] + stopwords += ['every', 'everyone', 'everything', 'everywhere', 'except'] + stopwords += ['few', 'fifteen', 'fifty', 'fill', 'find', 'fire', 'first'] + stopwords += ['five', 'for', 'former', 'formerly', 'forty', 'found'] + stopwords += ['four', 'from', 'front', 'full', 'further', 'get', 'give'] + stopwords += ['go', 'had', 'has', 'hasnt', 'have', 'he', 'hence', 'her'] + stopwords += ['here', 'hereafter', 'hereby', 'herein', 'hereupon', 'hers'] + stopwords += ['herself', 'him', 'himself', 'his', 'how', 'however'] + stopwords += ['hundred', 'i', 'ie', 'if', 'in', 'inc', 'indeed'] + stopwords += ['interest', 'into', 'is', 'it', 'its', 'itself', 'keep'] + stopwords += ['last', 'latter', 'latterly', 'least', 'less', 'ltd', 'made'] + stopwords += ['many', 'may', 'me', 'meanwhile', 'might', 'mill', 'mine'] + stopwords += ['more', 'moreover', 'most', 'mostly', 'move', 'much'] + stopwords += ['must', 'my', 'myself', 'name', 'namely', 'neither', 'never'] + stopwords += ['nevertheless', 'next', 'nine', 'no', 'nobody', 'none'] + stopwords += ['noone', 'nor', 'not', 'nothing', 'now', 'nowhere', 'of'] + stopwords += ['off', 'often', 'on','once', 'one', 'only', 'onto', 'or'] + stopwords += ['other', 'others', 'otherwise', 'our', 'ours', 'ourselves'] + stopwords += ['out', 'over', 'own', 'part', 'per', 'perhaps', 'please'] + stopwords += ['put', 'rather', 're', 's', 'same', 'see', 'seem', 'seemed'] + stopwords += ['seeming', 'seems', 'serious', 'several', 'she', 'should'] + stopwords += ['show', 'side', 'since', 'sincere', 'six', 'sixty', 'so'] + stopwords += ['some', 'somehow', 'someone', 'something', 'sometime'] + stopwords += ['sometimes', 'somewhere', 'still', 'such', 'system', 'take'] + stopwords += ['ten', 'than', 'that', 'the', 'their', 'them', 'themselves'] + stopwords += ['then', 'thence', 'there', 'thereafter', 'thereby'] + stopwords += ['therefore', 'therein', 'thereupon', 'these', 'they'] + stopwords += ['thick', 'thin', 'third', 'this', 'those', 'though', 'three'] + stopwords += ['three', 'through', 'throughout', 'thru', 'thus', 'to'] + stopwords += ['together', 'too', 'top', 'toward', 'towards', 'twelve'] + stopwords += ['twenty', 'two', 'un', 'under', 'until', 'up', 'upon'] + stopwords += ['us', 'very', 'via', 'was', 'we', 'well', 'were', 'what'] + stopwords += ['whatever', 'when', 'whence', 'whenever', 'where'] + stopwords += ['whereafter', 'whereas', 'whereby', 'wherein', 'whereupon'] + stopwords += ['wherever', 'whether', 'which', 'while', 'whither', 'who'] + stopwords += ['whoever', 'whole', 'whom', 'whose', 'why', 'will', 'with'] + stopwords += ['within', 'without', 'would', 'yet', 'you', 'your'] + stopwords += ['yours', 'yourself', 'yourselves'] + + # given a list of words, remove any that are + # in a list of stop words + def removeStopwords(wordlist, stopwords): + return [w for w in wordlist if w not in stopwords] + + # given a list of words, remove any that include numerals + def removeNumeralwords(wordlist): + numerals = re.compile('\d+') + l = wordlist[:] + for m in l: + if numerals.match(m): + wordlist.remove(m) + return wordlist + + # return the unique items of a list + def uniqItems(wordlist): + return list(set(wordlist)) + + # given a directory string, return a list of file names + def getFileNames(dirstr): + dircommand = 'dir ' + dirstr + ' /B' + filelist = os.popen(dircommand).readlines() + filelist = [x.rstrip() for x in filelist] + return filelist + + # trials + trialdir = 'Mined_1830s_clean' + triallist = getFileNames(trialdir) + + # document frequencies will be stored in SQLite DB + connection = sqlite.connect('docfreqs.db') + cursor = connection.cursor() + cursor.execute('CREATE TABLE IF NOT EXISTS docfreqs (docterm VARCHAR(50), freq INTEGER)') + cursor.execute('DELETE FROM docfreqs WHERE 1') + + i = 0 + for t in triallist: + i+=1 + print "%06d %s" % (i, t) + sys.stdout.flush() + trialstr = '' + trialstr = open(trialdir + '\\' + t, 'r').read() + allwords = [] + allwords = trialstr.split(' ') + wordlist = [] + wordlist = removeStopwords(allwords, stopwords) + wordlist = removeNumeralwords(wordlist) + + for w in uniqItems(wordlist): + existingrecord = cursor.execute("SELECT freq FROM docfreqs WHERE docterm='%s'" % (w)).fetchone() + if existingrecord == None: + cursor.execute("INSERT INTO docfreqs VALUES ('%s', 1)" % (w)) + else: + count = long(existingrecord[0]) + cursor.execute("UPDATE docfreqs SET freq=%d WHERE docterm='%s'" % (count+1,w)) + connection.commit() + + }}}

DHH20080625-01

william.j.turkel — 2009-11-14 11:01:59

Differences for DHH20080625-01

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
	+ {{{ + # online-learning.py + # old bailey + # + # given labelled, chronological sequence of data + # predicts category for unlabelled current item + # then is trained on labelled item + # outputs statistics + + import os, string, re, sys + from bayesian import * + + # the routine to extract features has to be bypassed + # this expects a string made by concatenating terms + # with highest TF/IDF + def passtfidf(doc): + wordlist = doc.split(' ') + return dict([(w,1) for w in wordlist]) + + # read in a list of trials + f = open('trial-ids-1830s.txt', 'r') + triallist = f.readlines() + f.close() + + # given a trial file name, return long integer + # that can be used for sorting + def trialtoint(trialname): + pattern = re.compile(r'(\d{8})-(\d+)', re.UNICODE) + match = pattern.search(trialname) + date = match.group(1) + id = match.group(2) + return long("%8d%06d" % (long(date), long(id))) + + # sort trial list into chronological order + triallist.sort(lambda x, y: cmp(trialtoint(x),trialtoint(y))) + + # overall sample size + samplesize = len(triallist) + + # output directory + outdir = 'Online_Runs_1830s' + if os.path.exists(outdir) == 0: os.mkdir(outdir) + + # test all offence categories that occur 10 or more times in the data set + offencecountfile = 'offence-counts-1830s.txt' + f = open(offencecountfile, 'r') + offencecountlist = f.readlines() + f.close() + toprocess = [] + for k in offencecountlist: + linein = k.split('\|') + if int(linein[1].rstrip()) > 9: + toprocess.append(linein[0]) + + # run the learner on each offence + for offencefile in toprocess: + + print "Processing ", + print offencefile + sys.stdout.flush() + + # read in a list of trials that belong in the offence category + offencedir = 'Offences_1830s' + f = open(offencedir + '\\' + offencefile, 'r') + offencelist = f.readlines() + offencelist = [x.rstrip() for x in offencelist] + f.close() + + # number of instances of that offence in overall sample + offencecount = len(offencelist) + + # define a learner + learner = 'tfidf' + numfeatures = 50 + cl=naivebayes(passtfidf) + + # response categories + guess = '' + actualcat = '' + hits = 0 + misses = 0 + falseps = 0 + corrns = 0 + + # output style is 'full' or 'fast' + outputstyle = 'full' + + # for 'fast' output style + reportincrement = 40 + + # open output file and write the file header + outfile = outdir + '\\online-tfidf' + str(numfeatures) + '-' + offencefile + f = open(outfile, 'w') + f.write('OLD BAILEY Online Learning Run\n\n') + f.write('Offence: ' + offencedir + '\\' + offencefile + '\n') + f.write('Learning run: tfidf, ' + str(numfeatures) + ' features\n') + if outputstyle == 'full': + f.write("\nTrial, Run, %6s, %3s, %5s, %6s, %7s, %6s\n" % ('Guess', 'Act', 'Hit', 'Miss', 'FalseP', 'CorrN')) + else: + f.write("\nRun, %6s, %7s, %8s, %6s\n" % ('Hit', 'Miss', 'FalseP', 'CorrN')) + + # test and train learner + for i in range(0, samplesize): + t = triallist[i].rstrip() + if outputstyle == 'full': + f.write(str(trialtoint(t))) + f.write(",\t") + + # read trial into string + trialstr = '' + ff = open('TFIDF_1830s\\tfidf_' + t, 'r') + whole = ff.readlines() + feat = min(len(whole)-1, numfeatures) + for k in range(0, feat): + linein = whole[k].split(',') + trialstr += str(linein[0]) + trialstr += ' ' + ff.close() + + # use current state of learner to categorize trial + guess = cl.classify(trialstr.rstrip(),default='n') + + # is this an instance of the offence category? + if t in offencelist: + # hit or miss + actualcat = 'y' + if guess == 'y': hits+=1 + else: misses+=1 + # train a positive instance + cl.train(trialstr,'y') + else: + # false positive or correct negative + actualcat = 'n' + if guess == 'y': falseps+=1 + else: corrns+=1 + # train a negative instance + cl.train(trialstr,'n') + + # write results to data table + if outputstyle == 'full': + f.write("%06d, %3s, %3s, %06d, %06d, %06d, %06d\n" % (i+1, guess, actualcat, hits, misses, falseps, corrns)) + elif (outputstyle == 'fast') and (i % reportincrement == 0): + f.write("%06d, %06d, %06d, %06d, %06d\n" % (i+1, hits, misses, falseps, corrns)) + else: + continue + f.flush() + + f.close() + }}}

FabWiki Electronic components

william.j.turkel — 2009-11-13 18:07:38

Differences for FabWiki Electronic components

Deletions are marked with - .	Additions are marked with +.
Line 23:	Line 23:
	+ * [http://home.comcast.net/~sbernardi/elec/og2/partsub_opamps.html Op Amp Substitution]

FabWiki MakerBot Cupcake

william.j.turkel — 2009-11-12 19:48:04

Differences for FabWiki MakerBot Cupcake

Deletions are marked with - .	Additions are marked with +.
Line 97:	Line 97:
	+ * Power LED on Sanguino doesn't light up even though Arduino software claims that bootloader burns successfully
Line 100:	Line 101:
	+ * Debugging + * The power LED never lights up on the Sanguino
Line 101:	Line 104:
- * Tried connecting LED to Pin 13 and resetting. It doesn't flash, which suggests something may be wrong with bootloader	+ * Tried connecting LED to Pin 13 and resetting. It doesn't flash, which suggests something may be wrong with bootloader. When I power with the ATX power supply and hit the reset button, the Debug light flashes 4 times; the power light doesn't come on at all. + * Tried putting a low voltage through the SMD LEDs that indicate Power and Debug (on the LEDs, cathode is marked with green stripe). Both LEDs work.

FabWiki MakerBot Cupcake

william.j.turkel — 2009-11-12 19:32:32

Differences for FabWiki MakerBot Cupcake

Deletions are marked with - .	Additions are marked with +.
Line 100:	Line 100:
	+ * Unfortunately I am now getting the following error: "avrdude: stk500_recv(): programmer is not responding" + * Tried connecting LED to Pin 13 and resetting. It doesn't flash, which suggests something may be wrong with bootloader

FabWiki MakerBot Cupcake

william.j.turkel — 2009-11-12 18:59:45

Differences for FabWiki MakerBot Cupcake

Deletions are marked with - .	Additions are marked with +.
Line 99:	Line 99:
	+ * Don't forget to copy reprap-r3g-firmware-1.x/libraries/* to arduino-00xx/hardware/libraries/ (otherwise you will get an error that it can't find simplepacket.h)

FabWiki MakerBot Cupcake

william.j.turkel — 2009-11-12 18:48:57

Differences for FabWiki MakerBot Cupcake

Deletions are marked with - .	Additions are marked with +.
Line 95:	Line 95:
- * Used Arduino 0017 on Mac OS X with [http://sanguino.cc/useit Sanguino] support	+ * Used Arduino 0017 on Mac OS X with [http://sanguino.cc/useit Sanguino 1.4-r1] support
Line 97:	Line 97:
	+ * Firmware + * Using RepRap Gen 3 Firmware 1.2

FabWiki MakerBot Cupcake

william.j.turkel — 2009-11-12 18:37:24

Differences for FabWiki MakerBot Cupcake

Deletions are marked with - .	Additions are marked with +.
Line 94:	Line 94:
	+ * Burning the bootloader + * Used Arduino 0017 on Mac OS X with [http://sanguino.cc/useit Sanguino] support + * USBTinyISP needs to have jumper across two pins near cables in order to provide +5V to Sanguino

Lab for Humanistic Fabrication

william.j.turkel — 2009-11-12 12:24:48

Differences for Lab for Humanistic Fabrication

Deletions are marked with - .	Additions are marked with +.
Line 6:	Line 6:
- \|\|RepRap (under construction)\|\|Makerbot (under construction)\|\|Copam 24" vinyl cutter\|\|Drill presses (8" and micro)\|\|	+ \|\|RepRap (under construction)\|\|MakerBots (under construction)\|\|Copam 24" vinyl cutter\|\|Drill presses (8" and micro)\|\|

Lab for Humanistic Fabrication

william.j.turkel — 2009-11-12 12:22:49

Differences for Lab for Humanistic Fabrication

Deletions are marked with - .	Additions are marked with +.
Line 7:	Line 7:
- \|\|[[Image(scope.png)]]\|\|Image(smd-rework-thumb.png)\|\|[[Image(weller-thumb.jpg)]]\|\|[[Image(dremel-thumb.jpg)]]\|\|	+ \|\|[[Image(scope.png)]]\|\|[[Image(smd-rework-thumb.png)]]\|\|[[Image(weller-thumb.jpg)]]\|\|[[Image(dremel-thumb.jpg)]]\|\|

Lab for Humanistic Fabrication

william.j.turkel — 2009-11-12 12:22:21

Differences for Lab for Humanistic Fabrication

No differences found!

Lab for Humanistic Fabrication

william.j.turkel — 2009-11-12 12:22:15

Differences for Lab for Humanistic Fabrication

Deletions are marked with - .	Additions are marked with +.
Line 1:	Line 1:
- As of June 2009, we have the following equipment. For more information, contact [http://history.uwo.ca/faculty/turkel William J. Turkel] or go to the ["Fabrication Wiki"].	+ As of November 2009, we have the following equipment. For more information, contact [http://history.uwo.ca/faculty/turkel William J. Turkel] or go to the ["Fabrication Wiki"].
Line 7:	Line 7:
- \|\|[[Image(scope.png)]]\|\|[[Image(weller-thumb.jpg)]]\|\|[[Image(dremel-thumb.jpg)]]\|\|[[Image(sony-thumb.jpg)]]\|\| - \|\|Oscilloscope\|\|Weller soldering stations\|\|Dremel rotary tools\|\|Video / digital cameras\|\|	+ \|\|[[Image(scope.png)]]\|\|Image(smd-rework-thumb.png)\|\|[[Image(weller-thumb.jpg)]]\|\|[[Image(dremel-thumb.jpg)]]\|\| + \|\|Oscilloscope\|\|SMD rework station\|\|Weller soldering stations\|\|Dremel rotary tools\|\|
Line 11:	Line 11:
- \|\|[[Image(measure-thumb.jpg)]]\|\|[[Image(tablet-thumb.jpg)]]\|\|[[Image(solidworks-thumb.jpg)]]\|\| - \|\|Precision measuring instruments\|\|Tablet computers and PDAs\|\|SolidWorks, Rhino, Vectric\|\|	+ \|\|[[Image(measure-thumb.jpg)]]\|\|[[Image(tablet-thumb.jpg)]]\|\|[[Image(solidworks-thumb.jpg)]]\|\|[[Image(sony-thumb.jpg)]]\|\| + \|\|Precision measuring instruments\|\|Tablet computers and PDAs\|\|SolidWorks, Rhino, Vectric\|\|Video / digital cameras\|\|

Lab for Humanistic Fabrication

william.j.turkel — 2009-11-12 12:22:08

Upload of image smd-rework-thumb.png.

Lab for Humanistic Fabrication

william.j.turkel — 2009-11-12 12:16:48

Differences for Lab for Humanistic Fabrication

Deletions are marked with - .	Additions are marked with +.
Line 6:	Line 6:
- \|\|RepRap (under construction)\|\|Cupcake (under construction)\|\|Copam 24" vinyl cutter\|\|Drill presses (8" and micro)\|\|	+ \|\|RepRap (under construction)\|\|Makerbot (under construction)\|\|Copam 24" vinyl cutter\|\|Drill presses (8" and micro)\|\|

FabWiki Lab equipment

william.j.turkel — 2009-11-12 12:16:09

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 78:	Line 78:
- *Next Engine 3D Desktop Scanner ([http://www.nextengine.com Website])	+ * Next Engine 3D Desktop Scanner ([http://www.nextengine.com Website])
Line 82:	Line 82:
- * Weller WES51 Soldering Station
Line 93:	Line 92:
- * Weller Heat gun
Line 213:	Line 211:
- * Extech Minitech 26 handheld digital multimeter	+ * Fluke 8050A Digital Multimeter (refurbished) + * Extech Minitech 26 handheld Digital Multimeter
Line 215:	Line 214:
- * Extech DC Power Supply	+ * Extech DC Power Supply, 0-18V, 0-3A (382202) + * Xytronic 850D Digital Display SMD Rework Station
Line 217:	Line 217:
	+ * Weller Benchtop Smoke Absorber (WSA350) + * Weller Heat gun

FabWiki Photodetectors

william.j.turkel — 2009-11-10 08:44:47

Differences for FabWiki Photodetectors

Deletions are marked with - .	Additions are marked with +.
Line 21:	Line 21:
- * [http://www.robotroom.com/ReversedLED.html Amplified Color Sensor] from LED and Op Amp	+ * [http://www.robotroom.com/ReversedLED.html Amplified Color Sensor] built from reversed LED and Op Amp

H9808A 2009 11 Locative

william.j.turkel — 2009-11-09 17:47:51

Differences for H9808A 2009 11 Locative

Deletions are marked with - .	Additions are marked with +.
Line 9:	Line 9:
- * Kelly, "[http://www.kk.org/thetechnium/archives/2008/09/everything_too.php Everything, Too Cheaply Metered]," The Technium (15 Sep 2008). * Kelly, "[http://www.kk.org/thetechnium/archives/2008/09/everything_too.php Everything, Too Cheaply Metered]," The Technium (15 Sep 2008).	+ * Kelly, "[http://www.kk.org/thetechnium/archives/2008/09/everything_too.php Everything, Too Cheaply Metered]," The Technium (15 September 2008). + * Sterling, "[http://www.wired.com/beyond_the_beyond/2009/10/augmented-reality-historical-reconstruction/ Augmented Reality: Historical Reconstruction," Beyond the Beyond (28 October 2009).

FabWiki Servo motors

william.j.turkel — 2009-11-08 17:49:53

Differences for FabWiki Servo motors

Deletions are marked with - .	Additions are marked with +.
Line 3:	Line 3:
	+ * [http://www.servodatabase.com/ Online Servo Database] - RC servo specs and reviews

FabWiki Metal

william.j.turkel — 2009-11-08 17:47:20

Differences for FabWiki Metal

Deletions are marked with - .	Additions are marked with +.
Line 8:	Line 8:
	+ * [http://blog.craftzine.com/archive/2009/11/flashback_battle_chic_diy_chai.html How to make your own chainmail]

FabWiki Arduino

william.j.turkel — 2009-11-07 18:34:03

(quick edit)

Differences for FabWiki Arduino

Deletions are marked with - .	Additions are marked with +.
Line 43:	Line 43:
	+ * [http://www.hohlwelt.com/en/presenceweb/examples.html Web Presence Examples]

FabWiki Arduino

william.j.turkel — 2009-11-07 18:33:12

Differences for FabWiki Arduino

Deletions are marked with - .	Additions are marked with +.
Line 81:	Line 81:
- * [http://dimme.net/2008/01/10/webvisitors-blinker/ Web visitors blinker]	+ * [http://dimme.net/2008/01/10/webvisitors-blinker/ Web visitors blinker] -- this link currently broken

H9808A 2009 09 Digitization

william.j.turkel — 2009-11-07 17:33:53

Differences for H9808A 2009 09 Digitization

Deletions are marked with - .	Additions are marked with +.
Line 9:	Line 9:
	+ * Choudhury et al, "[http://www.dlib.org/dlib/march06/choudhury/03choudhury.html Document Recognition for a Million Books]," ''D-Lib Magazine'' 12, no. 3 (March 2006).

H9808A 2009 09 Digitization

william.j.turkel — 2009-11-07 17:31:43

Differences for H9808A 2009 09 Digitization

Deletions are marked with - .	Additions are marked with +.
Line 4:	Line 4:
- - --> '''The details of this page are not finalized yet... check back closer to day of class''' <--
Line 15:	Line 13:
	+ * Stanford University, "[http://cads.stanford.edu/lcshgalaxy/more.html Library of Congress Subject Headings Galaxy]"

H9808A 2009 09 Digitization

william.j.turkel — 2009-11-07 17:20:13

Differences for H9808A 2009 09 Digitization

Deletions are marked with - .	Additions are marked with +.
Line 13:	Line 13:
- * Farid, "[http://www.cs.dartmouth.edu/farid/research/digitaltampering/ Digital Tampering in the Media, Politics and Law]."	+ * Farid, "[http://www.cs.dartmouth.edu/farid/research/digitaltampering/ Photo Tampering throughout History]."

H9808A 2009 09 Digitization

william.j.turkel — 2009-11-07 17:18:02

Differences for H9808A 2009 09 Digitization

Deletions are marked with - .	Additions are marked with +.
Line 7:	Line 7:
	+ The process of digitization extracts some of the information associated with a material entity: documents can be scanned or photographed, objects photographed or measured in three dimensions, and so on. This process greatly changes the information costs associated with doing history. Digital entities will last indefinitely, can be replicated as many times as necessary and can be transmitted at the speed of light. Visualization is concerned with the role that aesthetic considerations play in understanding and usability. The most flexible approach for content creators is to divorce form from content, and to let people or machines create alternative visualizations of underlying information. +
Line 9:	Line 11:
- === Background Readings ===	+ * Cohen, "[http://www.dancohen.org/2007/03/06/its-about-russia/ It’s About Russia]," Dancohen.org (6 Mar 2007). + * Cohen and Rosenzweig, "[http://chnm.gmu.edu/digitalhistory/digitizing/ Becoming Digital]" ''Digital History''. Philadelphia: University of Pennsylvania, 2005. + * Farid, "[http://www.cs.dartmouth.edu/farid/research/digitaltampering/ Digital Tampering in the Media, Politics and Law]." + * Gallagher, "[http://www.guardian.co.uk/environment/2009/aug/23/mount-rushmore-conservation-historic-scotland Scottish Laser Pioneers Lead Way in Preserving World Heritage Treasures], ''The Observer'' (23 August 2009). + * Turkel, "[http://digitalhistoryhacks.blogspot.com/2008/08/traces-of-use.html Traces of Use]," Digital History Hacks (20 August 2008). + * Unsworth, "[http://www3.isrl.uiuc.edu/~unsworth/newberry.04.html The Value of Digitization for Libraries and Humanities Scholarship]," Newberry Library Symposium (17 May 2004). + * Whitelaw, [http://visiblearchive.blogspot.com/ The Visible Archive] (2009).

H9808A 2009 08 Mashups

william.j.turkel — 2009-11-07 17:06:04

Differences for H9808A 2009 08 Mashups

Deletions are marked with - .	Additions are marked with +.
Line 15:	Line 15:
- * Nardi and O’Day. "[http://firstmonday.org/htbin/cgiwrap/bin/ojs/index.php/fm/article/view/670/580 Information Ecologies: Using Technology with Heart]," ''First Monday'' 4, no. 5 (1999).

H9808A 2009 08 Mashups

william.j.turkel — 2009-11-07 17:04:10

Differences for H9808A 2009 08 Mashups

Deletions are marked with - .	Additions are marked with +.
Line 4:	Line 4:
- - --> '''The details of this page are not finalized yet... check back closer to day of class''' <--
Line 16:	Line 14:
- * Koman, "[http://www.oreillynet.com/pub/a/policy/2005/02/24/lessig.html Remixing Culture: An Interview with Lawrence Lessig]," O’Reilly Network (24 Feb 2005).

H9808A 2009 08 Mashups

william.j.turkel — 2009-11-07 17:02:01

Differences for H9808A 2009 08 Mashups

Deletions are marked with - .	Additions are marked with +.
Line 7:	Line 7:
	+ A mashup is a computer program that draws information from a number of different online databases, integrates it on-the-fly, and presents it to the user in the form of a dynamic webpage. The idea behind collective intelligence is to harness the problem-solving capabilities of a networked and communicating group of collaborators. Both phenomena are quintessentially “Web 2.0″. How can / will they change the practice or products of historical research? +
Line 9:	Line 11:
	+ * Cohen, "[http://www.dancohen.org/blog/posts/do_apis_have_a_place_in_the_digital_humanities Do APIs Have a Place in the Digital Humanities?]" dancohen.org (21 Nov 2005). + * Cohen, "[http://www.dancohen.org/blog/posts/when_machines_are_the_audience When Machines Are the Audience]," dancohen.org (2 Mar 2006). + * Cohen, "[http://www.dancohen.org/blog/posts/where_are_the_noncommercial_apis Where Are the Noncommercial APIs?]" dancohen.org (10 Mar 2006).
Line 10:	Line 15:
	+ * Jenkins, "[http://www.henryjenkins.org/2006/11/collective_intelligence_vs_the.html Collective Intelligence vs. The Wisdom of Crowds]," Confessions of an Aca-Fan (27 Nov 2006). + * Koman, "[http://www.oreillynet.com/pub/a/policy/2005/02/24/lessig.html Remixing Culture: An Interview with Lawrence Lessig]," O’Reilly Network (24 Feb 2005).
Line 11:	Line 18:
	+ * Nardi and O’Day. "[http://firstmonday.org/htbin/cgiwrap/bin/ojs/index.php/fm/article/view/670/580 Information Ecologies: Using Technology with Heart]," ''First Monday'' 4, no. 5 (1999).

H9808A 2009 08 Mashups

william.j.turkel — 2009-11-07 16:57:31

Differences for H9808A 2009 08 Mashups

Deletions are marked with - .	Additions are marked with +.
Line 14:	Line 14:
	+ * Spears, "[http://www.gimp.org/tutorials/Lite_Quickies/ GIMPLite Quickies]" +

H9808A 2009 08 Mashups

william.j.turkel — 2009-11-07 16:55:17

Differences for H9808A 2009 08 Mashups

Deletions are marked with - .	Additions are marked with +.
Line 24:	Line 24:
- You can use either your own photos, or [http://www.flickr.com/creativecommons/ images from Flickr that have a Creative Commons license that allows derivative works]. Be sure to work with '''copies''' of your pictures, not the originals. The GIMP has quite a steep learning curve, so don't be too hard on yourself if it takes you a while to get the hang of working with it. Use the results to spruce up your Google website that you've been working on.	+ You can use either your own photos, or [http://www.flickr.com/creativecommons/ images from Flickr that have a Creative Commons license that allows derivative works]. Be sure to work with '''copies''' of your pictures, not the originals. The GIMP has quite a steep learning curve, so don't be too hard on yourself if it takes you a while to get the hang of working with it. Use the results to spruce up your Google website that you've been working on. If you do use someone elses CC-licensed images, don't forget to attribute the source and provide a link to the originals.

H9808A 2009 08 Mashups

william.j.turkel — 2009-11-07 16:54:40

Differences for H9808A 2009 08 Mashups

Deletions are marked with - .	Additions are marked with +.
Line 24:	Line 24:
- You can use either your own photos, or [http://www.flickr.com/creativecommons/ images from Flickr that have a Creative Commons license that allows derivative works]. Be sure to work with '''copies''' of your pictures, not the originals. The GIMP has quite a steep learning curve, so don't be too hard on yourself if it takes you a while to get the hang of working with it.	+ You can use either your own photos, or [http://www.flickr.com/creativecommons/ images from Flickr that have a Creative Commons license that allows derivative works]. Be sure to work with '''copies''' of your pictures, not the originals. The GIMP has quite a steep learning curve, so don't be too hard on yourself if it takes you a while to get the hang of working with it. Use the results to spruce up your Google website that you've been working on.

H9808A 2009 08 Mashups

william.j.turkel — 2009-11-07 16:53:19

Differences for H9808A 2009 08 Mashups

Deletions are marked with - .	Additions are marked with +.
Line 15:	Line 15:
	+ + '''Graphics for your website.''' People who do a lot of work online frequently find themselves in the position of having to resize, crop, colour or otherwise adjust digital photographs. In this assignment, you are going to work with the open source [http://www.gimp.org/ GNU Image Manipulation Program (GIMP)]. Download and install it, then use it to try doing the following: + + * Convert a colour image to greyscale and to black and white + * Create a thumbnail of a large image + * Resize a photo without cropping it + * Crop an image + * Try saving copies of the same image with different resolutions ([http://en.wikipedia.org/wiki/Dots_per_inch DPI or PPI]) + + You can use either your own photos, or [http://www.flickr.com/creativecommons/ images from Flickr that have a Creative Commons license that allows derivative works]. Be sure to work with '''copies''' of your pictures, not the originals. The GIMP has quite a steep learning curve, so don't be too hard on yourself if it takes you a while to get the hang of working with it.

H9808A 2009 08 Mashups

william.j.turkel — 2009-11-07 16:44:36

Differences for H9808A 2009 08 Mashups

Deletions are marked with - .	Additions are marked with +.
Line 9:	Line 9:
- Gralla, "Ch 23 How Web Host Servers Work (Ch 25 7th ed.)", "Ch 24 How Websites Work with Databases (Ch 26 7th ed.)", "Ch 25 How .NET and Web Services Work (Ch 27 7th ed.)", "Ch 29 How Map Sites Work (not in 7th ed.)"	+ * Gralla, "Ch 23 How Web Host Servers Work (Ch 25 7th ed.)", "Ch 24 How Websites Work with Databases (Ch 26 7th ed.)", "Ch 25 How .NET and Web Services Work (Ch 27 7th ed.)", "Ch 29 How Map Sites Work (not in 7th ed.)" + * [http://www.avantgame.com/ McGonigal], "[http://www.avantgame.com/McGonigal_WhyILoveBees_Feb2007.pdf Why I Love Bees: A Case Study in Collective Intelligence Gaming]," in Katie Salen ed. ''The Ecology of Games'' (MIT, 2007).

FabWiki Lab equipment

william.j.turkel — 2009-11-05 18:02:29

(quick edit)

Differences for FabWiki Lab equipment

Deletions are marked with - .	Additions are marked with +.
Line 224:	Line 224:
	+ Digital Audio Recorders + Zoom H4n ([http://www.zoom.co.jp/english/products/h4n/ Website]) + * Zoom H4 ([http://www.zoom.co.jp/english/products/h4/ Website])

FabWiki MakerBot Cupcake

william.j.turkel — 2009-11-05 17:40:54

Differences for FabWiki MakerBot Cupcake

Deletions are marked with - .	Additions are marked with +.
Line 92:	Line 92:
- * Had to hack the ATX power supply unit by grounding sense line (following [http://www.flickr.com/photos/maskedretriever/3534606271/in/set-72157618087637079/ Masked Retriever's hack])	+ * Had to ground the sense line of the ATX power supply unit to get it to power on without a computer attached (following [http://www.flickr.com/photos/maskedretriever/3534606271/in/set-72157618087637079/ Masked Retriever's hack])

FabWiki MakerBot Cupcake

william.j.turkel — 2009-11-05 17:26:14

Differences for FabWiki MakerBot Cupcake

Deletions are marked with - .	Additions are marked with +.
Line 82:	Line 82:
	+ + = Testing the electronics = + + * Opto-endstops + * Checked all connections with dissecting microscope set at 0.7 x 10x + * Re-soldered one loose joint + * Used PB-503 proto-board to build a little test rig for both kinds of connection + * All endstops seem to be working correctly + * Stepper motor drivers + * Checked all SMD and through-hole connections with dissecting microscope + * Had to hack the ATX power supply unit by grounding sense line (following [http://www.flickr.com/photos/maskedretriever/3534606271/in/set-72157618087637079/ Masked Retriever's hack]) + * Checked that green power LED comes on for all stepper motor drivers

H9808A 2009 09 Digitization

william.j.turkel — 2009-11-03 10:01:28

Differences for H9808A 2009 09 Digitization

Deletions are marked with - .	Additions are marked with +.
Line 13:	Line 13:
- '''Into the Time Machine!''' If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of [http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books Mr. Dickens], in this assignment you are going to head for Christmas past. Go to Archive.org and load the [http://www.archive.org/details/eatons19131400eatouoft Eaton's Fall and Winter catalogue from 1913-14]. Starting on page "[http://www.archive.org/stream/eatons19131400eatouoft#page/n282/mode/1up n282]" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. (Some obvious places to search are [http://www.archive.org Archive.org], [http://books.google.com Google Books], and the [http://www.gutenberg.org Gutenberg Project].) Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find. As you're doing this assignment, try to pay attention to the unexpected. When you are writing your blog post try to reflect on what you found the most surprising about the process.	+ '''Into the Time Machine!''' If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of [http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books Mr. Dickens], in this assignment you are going to head for Christmas past. Go to Archive.org and load the [http://www.archive.org/details/eatons19131400eatouoft Eaton's Fall and Winter catalogue from 1913-14]. Starting on page "[http://www.archive.org/stream/eatons19131400eatouoft#page/n282/mode/1up n282]" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. (Some obvious places to search are [http://www.archive.org Archive.org], [http://books.google.com Google Books], and the [http://www.gutenberg.org Gutenberg Project].) Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find. As you're doing this assignment, pay attention to the unexpected. When you are writing your blog post try to reflect on what you found the most surprising about the process.

H9808A 2009 09 Digitization

william.j.turkel — 2009-11-03 10:00:30

Differences for H9808A 2009 09 Digitization

Deletions are marked with - .	Additions are marked with +.
Line 13:	Line 13:
- '''Into the Time Machine!''' If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of [http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books Mr. Dickens], in this assignment you are going to head for Christmas past. Go to Archive.org and load the [http://www.archive.org/details/eatons19131400eatouoft Eaton's Fall and Winter catalogue from 1913-14]. Starting on page "n282" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. (Some obvious places to search are [http://www.archive.org Archive.org], [http://books.google.com Google Books], and the [http://www.gutenberg.org Gutenberg Project].) Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find. As you're doing this assignment, try to pay attention to the unexpected. When you are writing your blog post try to reflect on what you found the most surprising about the process.	+ '''Into the Time Machine!''' If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of [http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books Mr. Dickens], in this assignment you are going to head for Christmas past. Go to Archive.org and load the [http://www.archive.org/details/eatons19131400eatouoft Eaton's Fall and Winter catalogue from 1913-14]. Starting on page "[http://www.archive.org/stream/eatons19131400eatouoft#page/n282/mode/1up n282]" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. (Some obvious places to search are [http://www.archive.org Archive.org], [http://books.google.com Google Books], and the [http://www.gutenberg.org Gutenberg Project].) Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find. As you're doing this assignment, try to pay attention to the unexpected. When you are writing your blog post try to reflect on what you found the most surprising about the process.

H9808A 2009 09 Digitization

william.j.turkel — 2009-11-03 09:59:05

Differences for H9808A 2009 09 Digitization

Deletions are marked with - .	Additions are marked with +.
Line 13:	Line 13:
- '''Into the Time Machine!''' If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of [http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books Mr. Dickens], in this assignment you are going to head for Christmas past. Go to Archive.org and load the [http://www.archive.org/details/eatons19131400eatouoft Eaton's Fall and Winter catalogue from 1913-14]. Starting on page "n282" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. (Some obvious places to search are [http://www.archive.org Archive.org], [http://books.google.com Google Books], and the [http://www.gutenberg.org Gutenberg Project].) Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find.	+ '''Into the Time Machine!''' If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of [http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books Mr. Dickens], in this assignment you are going to head for Christmas past. Go to Archive.org and load the [http://www.archive.org/details/eatons19131400eatouoft Eaton's Fall and Winter catalogue from 1913-14]. Starting on page "n282" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. (Some obvious places to search are [http://www.archive.org Archive.org], [http://books.google.com Google Books], and the [http://www.gutenberg.org Gutenberg Project].) Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find. As you're doing this assignment, try to pay attention to the unexpected. When you are writing your blog post try to reflect on what you found the most surprising about the process.

H9808A 2009 09 Digitization

william.j.turkel — 2009-11-03 09:52:21

Differences for H9808A 2009 09 Digitization

Deletions are marked with - .	Additions are marked with +.
Line 13:	Line 13:
- '''Into the Time Machine!''' If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of [http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books Mr. Dickens], in this assignment you are going to head for Christmas past. Go to Archive.org and load the [http://www.archive.org/details/eatons19131400eatouoft Eaton's Fall and Winter catalogue from 1913-14]. Starting on page "n282" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find.	+ '''Into the Time Machine!''' If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of [http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books Mr. Dickens], in this assignment you are going to head for Christmas past. Go to Archive.org and load the [http://www.archive.org/details/eatons19131400eatouoft Eaton's Fall and Winter catalogue from 1913-14]. Starting on page "n282" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. (Some obvious places to search are [http://www.archive.org Archive.org], [http://books.google.com Google Books], and the [http://www.gutenberg.org Gutenberg Project].) Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find.

H9808A 2009 09 Digitization

william.j.turkel — 2009-11-03 09:49:24

Differences for H9808A 2009 09 Digitization

Deletions are marked with - .	Additions are marked with +.
Line 13:	Line 13:
- '''Into the Time Machine!''' If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of <a href="http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books">Mr. Dickens</a>, in this assignment you are going to head for Christmas past. Go to Archive.org and load the <a href="http://www.archive.org/details/eatons19131400eatouoft">Eaton's Fall and Winter catalogue from 1913-14</a>. Starting on page "n282" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find.	+ '''Into the Time Machine!''' If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of [http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books Mr. Dickens], in this assignment you are going to head for Christmas past. Go to Archive.org and load the [http://www.archive.org/details/eatons19131400eatouoft Eaton's Fall and Winter catalogue from 1913-14]. Starting on page "n282" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find.

H9808A 2009 09 Digitization

william.j.turkel — 2009-11-03 09:48:49

Differences for H9808A 2009 09 Digitization

Deletions are marked with - .	Additions are marked with +.
Line 13:	Line 13:
- <strong>Into the Time Machine!</strong> If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of <a href="http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books">Mr. Dickens</a>, in this assignment you are going to head for Christmas past. Go to Archive.org and load the <a href="http://www.archive.org/details/eatons19131400eatouoft">Eaton's Fall and Winter catalogue from 1913-14</a>. Starting on page "n282" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find.	+ '''Into the Time Machine!''' If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of <a href="http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books">Mr. Dickens</a>, in this assignment you are going to head for Christmas past. Go to Archive.org and load the <a href="http://www.archive.org/details/eatons19131400eatouoft">Eaton's Fall and Winter catalogue from 1913-14</a>. Starting on page "n282" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find.

H9808A 2009 09 Digitization

william.j.turkel — 2009-11-03 09:48:33

Differences for H9808A 2009 09 Digitization

Deletions are marked with - .	Additions are marked with +.
Line 13:	Line 13:
- (Possibly something about database and search engine as non-literary tropes for writing history: response to Steve Anderson's paper from 2nd week readings)	+ <strong>Into the Time Machine!</strong> If you've had a chance to put down the books and get out for a while, you've no doubt noticed that this is the season when everyone goes gift shopping. And what better gift than a nice book? Following the lead of <a href="http://books.google.com/books?q=dickens+christmas+carol&btnG=Search+Books">Mr. Dickens</a>, in this assignment you are going to head for Christmas past. Go to Archive.org and load the <a href="http://www.archive.org/details/eatons19131400eatouoft">Eaton's Fall and Winter catalogue from 1913-14</a>. Starting on page "n282" you will find a list of books that Eaton's was selling that season. Your task is to choose 6-8 of the books advertised in the catalogue and find full online digital copies of them. Write a blog post about your search, and provide a list of links to the books that you found. You can also write about some of the books that you couldn't find.