Mike Plotz Sage hyponymous

Run the server:

npm run start

Test the server by loading http://localhost:8080/ in a browser, or run

time curl http://localhost:8080/

A letter scrambling and object constancy demo based on Mike Bostock's General Update Pattern III.

10,000 poisson-disc samples of Van Gogh’s The Starry Night. Compare to uniform random samples.

	<!DOCTYPE html>
	<head>
	<meta charset="utf-8">
	<script src="https://cdnjs.cloudflare.com/ajax/libs/lodash.js/4.17.15/lodash.min.js"> </script>
	<script src="https://d3js.org/d3.v5.min.js"></script>
	<style type="text/css">

	.timeline {
	pointer-events: all;
	}

	#!/usr/bin/env python

	import itertools
	import numpy as np

	N = 1000
	d = 500

	x_normal = np.random.multivariate_normal([0], [[1]], [N, d]).reshape([N, d])
	x_spherical = x_normal / np.linalg.norm(x_normal, axis=1)[:, np.newaxis]

	import copy

	# fun from Ernest!
	#
	# Given two strings s and t, determine whether some anagram of t is a substring of s.
	# For example: if s = "udacity" and t = "ad", then the function returns True.
	# Your function definition should look like: question1(s, t) and return a boolean True or False.

	def q_mike(s, t):
	def add_to_hist(c, hist):