Noon van der Silk silky

## Tetrahedra-based Volumetric Meshes.txt
Below I collected relevant links and papers more or less pertaining to the subject of tetrahedral meshes.
It's an ever-growing list.

------------------------------
Relevant links:

http://en.wikipedia.org/wiki/Types_of_mesh
http://en.wikipedia.org/wiki/Tetrahedron
http://en.wikipedia.org/wiki/Simplicial_complex

## maps.lean
/-
  Total and partial maps

  This is inspired by [the relevant chapter in Software Foundations]. Unlike
  Software Foundations, these maps are also parameterised over a `Key`
  type, which must supply an implementation of `DecidableEq`.

  [Software Foundations]: https://softwarefoundations.cis.upenn.edu/lf-current/Maps.html
-/
namespace Maps

## Trolling.hs
{-# LAnguage FlexibleInstances #-}
{-# LANGuage FunctionalDependencies #-}
{-# LANGUAge GADTs #-}
{-# LANGUAGE UndecidableInstances #-}
module Trolling where

---------------------------------------------------------------------
-- VARIADIC COMPOSITION IN HASKELL (A LA RAMDA.JS).
--
-- In Haskell, we typeically think of the composition operator (or

## annoying things in ml.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                silky
                / annoying things in ml.md
            
            
              Last active
              April 14, 2020 06:01
            
          
managing folders of data
saving experiments post-fact
waiting for stuff to run
easily seeing all your hyper-parameters
working out what you've done before
trying out different things, and saving them somehow
debugging models
wanting to visualise various outputs arbitrarily
doing things with streaming data?
loss landscape visualisation


## linear_diophantine.py
from collections import Counter
from fractions import Fraction


def _gcd(a, b):
	while a:
		a, b = b % a, a
	return b


## voronoi_indexed.hs
{-# LANGUAGE TupleSections #-}

module Main where

import Graphics.Gloss
import Graphics.Gloss.Raster.Field
import System.Random
import Data.Semigroup
import GHC.Base (NonEmpty(..))

## voronoi_indexed.hs
{-# LANGUAGE TupleSections #-}

module Main where

import Graphics.Gloss
import Graphics.Gloss.Raster.Field
import System.Random
import Data.Semigroup
import GHC.Base (NonEmpty(..))

## gc.c
// http://journal.stuffwithstuff.com/2013/12/08/babys-first-garbage-collector/
//

#define STACK_MAX 256
#define INITIAL_GC_THRESHOLD 2

#include <stdio.h>
#include <stdlib.h>

void gc(); // Pre-Declared for co-recursive usage

## streamlit_prodigy.py
"""
Example of a Streamlit app for an interactive Prodigy dataset viewer that also lets you
run simple training experiments for NER and text classification.

Requires the Prodigy annotation tool to be installed: https://prodi.gy
See here for details on Streamlit: https://streamlit.io.
"""
import streamlit as st
from prodigy.components.db import connect
from prodigy.models.ner import EntityRecognizer, merge_spans, guess_batch_size

## streamlit_prodigy.py
"""
Example of a Streamlit app for an interactive Prodigy dataset viewer that also lets you
run simple training experiments for NER and text classification.

Requires the Prodigy annotation tool to be installed: https://prodi.gy
See here for details on Streamlit: https://streamlit.io.
"""
import streamlit as st
from prodigy.components.db import connect
from prodigy.models.ner import EntityRecognizer, merge_spans, guess_batch_size
	Below I collected relevant links and papers more or less pertaining to the subject of tetrahedral meshes.
	It's an ever-growing list.

	------------------------------
	Relevant links:

	http://en.wikipedia.org/wiki/Types_of_mesh
	http://en.wikipedia.org/wiki/Tetrahedron
	http://en.wikipedia.org/wiki/Simplicial_complex
	/-
	Total and partial maps

	This is inspired by [the relevant chapter in Software Foundations]. Unlike
	Software Foundations, these maps are also parameterised over a `Key`
	type, which must supply an implementation of `DecidableEq`.

	[Software Foundations]: https://softwarefoundations.cis.upenn.edu/lf-current/Maps.html
	-/
	namespace Maps
	{-# LAnguage FlexibleInstances #-}
	{-# LANGuage FunctionalDependencies #-}
	{-# LANGUAge GADTs #-}
	{-# LANGUAGE UndecidableInstances #-}
	module Trolling where

	---------------------------------------------------------------------
	-- VARIADIC COMPOSITION IN HASKELL (A LA RAMDA.JS).
	--
	-- In Haskell, we typeically think of the composition operator (or
	from collections import Counter
	from fractions import Fraction


	def _gcd(a, b):
	while a:
	a, b = b % a, a
	return b
	{-# LANGUAGE TupleSections #-}

	module Main where

	import Graphics.Gloss
	import Graphics.Gloss.Raster.Field
	import System.Random
	import Data.Semigroup
	import GHC.Base (NonEmpty(..))
	// http://journal.stuffwithstuff.com/2013/12/08/babys-first-garbage-collector/
	//

	#define STACK_MAX 256
	#define INITIAL_GC_THRESHOLD 2

	#include <stdio.h>
	#include <stdlib.h>

	void gc(); // Pre-Declared for co-recursive usage
	"""
	Example of a Streamlit app for an interactive Prodigy dataset viewer that also lets you
	run simple training experiments for NER and text classification.

	Requires the Prodigy annotation tool to be installed: https://prodi.gy
	See here for details on Streamlit: https://streamlit.io.
	"""
	import streamlit as st
	from prodigy.components.db import connect
	from prodigy.models.ner import EntityRecognizer, merge_spans, guess_batch_size