This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| A Proposal for Posting Digital Humanities 2013 Extended Abstracts to ArXiv | |
| David Bamman | |
| @dbamman | |
| Here's an idea for #DH2013: the official DH long abstract is limited to 1500 | |
| words. Let's post our abstracts to ArXiv right now and fill them out as we see | |
| fit until the conference rolls around. These extended versions can include lots | |
| more detail, including: | |
| - implementational details (good/necessary for reproducibility) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # generate 100-dimensional random walk data so that each data point in a sequence is similar to the last data point | |
| import numpy as np | |
| last=np.random.normal(0, .1, 100) | |
| for i in range(1000): | |
| new=last+np.random.normal(0, .1, 100) | |
| last=new | |
| print ' '.join(str(x) for x in new) |