- The presentation in PDF format.
- Publishing Landsat on AWS, the use of cloud infrastructure for public data distribution and processing.
- On the size of Google Maps, now larger than most national mapping agencies.
- OpenTripPlanner and OpenStreetMap, how open data and open source leverage each other and are in turn re-consumed by governmnet and civil society.
- Michael H Goldhaber on the attention economy, a prescient take on content and the internet from 1997.
- Google aquires Skybox Imaging.
- Bibiana McHugh on Portland Trimet's [triple open strategy](https://prezi.com/vmydw-uwqalm/copy-of-you-complete
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
| curl -s -N --location https://www.washingtonpost.com/blogs/post-partisan/wp/2016/03/21/a-transcript-of-donald-trumps-meeting-with-the-washington-post-editorial-board/ \ | |
| | perl -0ne 'my @list = $_ =~ m/<p>TRUMP:(.*?)<\/p>/smg; print $list[rand @list]' \ | |
| | say --progress -i -r 300 -v Alex |
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
| #!/usr/bin/env bash | |
| set -e | |
| if [ -e static ]; then | |
| rm -r static | |
| fi | |
| mkdir -p static | |
| sass src/sass/main.scss > static/application.css | |
| $(npm bin)/browserify src/js/main.js > static/application.js |
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
| #include <stdlib.h> | |
| #include <string.h> | |
| #include <stdarg.h> | |
| #include <stdio.h> | |
| #include <stdint.h> | |
| #define WIN32_LEAN_AND_MEAN | |
| #include <windows.h> | |
| void error(const char *str) { |
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
| # many settings from https://raw.githubusercontent.com/mathiasbynens/dotfiles/master/.macos | |
| # many settings from https://raw.githubusercontent.com/thoughtbot/laptop/master/mac | |
| # my previous install notes at https://gist.github.com/llimllib/ee591266e05bd880629a4e7511a61bb3 | |
| fancy_echo() { | |
| local fmt="$1"; shift | |
| # shellcheck disable=SC2059 | |
| printf "\n$fmt\n" "$@" | |
| } |
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
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <stdint.h> | |
| #ifdef _MSC_VER | |
| #include <intrin.h> /* for rdtscp and clflush */ | |
| #pragma optimize("gt",on) | |
| #else | |
| #include <x86intrin.h> /* for rdtscp and clflush */ | |
| #endif |
- Intel 4004, first microprocessor: http://www.computerhistory.org/collections/catalog/102658187
- Intel 8008: http://www.computerhistory.org/collections/catalog/102657982
- Intel 8080: http://www.computerhistory.org/collections/catalog/102658123
- Z80: http://www.computerhistory.org/collections/catalog/102658073
- Federico Faggin, SGT inventor, chip designer for 4004, Z80: http://www.computerhistory.org/collections/catalog/102658025
- Bill Mensch, chip designer on 6800/6502/65C02/65816: http://www.computerhistory.org/collections/catalog/102739969
- Motorolla 68000: http://www.computerhistory.org/collections/catalog/102658109
- 3dfx, Voodoo, the seminal GPU: http://www.computerhistory.org/collections/catalog/102746834
- LSI Logic, EDA/fabless innovator: http://www.computerhistory.org/collections/catalog/102746194
- VLSI Technologies, EDA/fabless innovator: http://www.computerhistory.org/collections/catalog/102746456
A traditional table-based DFA implementation looks like this:
uint8_t table[NUM_STATES][256]
uint8_t run(const uint8_t *start, const uint8_t *end, uint8_t state) {
for (const uint8_t *s = start; s != end; s++)
state = table[state][*s];
return state;
}