Skip to content

Instantly share code, notes, and snippets.

View codekansas's full-sized avatar
🏠
Working from home

Ben Bolte codekansas

🏠
Working from home
View GitHub Profile
// Parametric OpenSCAD design for a laptop stand.
// Laptop dimensions.
lwid = 304.1;
lhei = 212.4;
ldep = 15;
// Stand long dimensions.
slen = 200;
sswid = 60;
@codekansas
codekansas / benchmark_self_attention.py
Created April 6, 2023 19:36
Script for benchmarking self attention functions
import argparse
import contextlib
import logging
import math
import random
import time
from dataclasses import dataclass
from pathlib import Path
from typing import Callable
@codekansas
codekansas / benchmark_self_attention.py
Last active March 11, 2023 18:34
Benchmarking script for attention
import argparse
import contextlib
import logging
import math
import random
import time
from dataclasses import dataclass
from pathlib import Path
from typing import Callable
@codekansas
codekansas / camera_mount.scad
Last active February 9, 2023 00:06
Random camera mount part
// Mount for my ESP 32 above my workbench.
cam_diam = 7.7 + 1.0;
cam_offset = 2.1;
other_offset = 1.9;
rect_height = 39.6 + 1.0;
rect_width = 27.0 + 4.0;
cam_from_top = 10.4;
leng = 55;
@codekansas
codekansas / sparse_filtering.py
Last active February 20, 2021 18:12
Implementation of sparse filtering using TensorFlow
"""Implementation of sparse filtering using TensorFlow.
Original MATLAB code: https://github.com/jngiam/sparseFiltering
Paper: https://papers.nips.cc/paper/4334-sparse-filtering.pdf
"""
# For Python 3 compatibility.
from __future__ import print_function
# For building the algorithm.
@codekansas
codekansas / parse_webtime.py
Created December 3, 2020 20:50
Script to parse the Webtime Tracker CSV file and plot it
#!/usr/bin/env python
import argparse
from datetime import datetime
import numpy as np
import pandas as pd
import matplotlib.pyplot as plt
class FastScanner {
BufferedReader br;
StringTokenizer st;
public FastScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
// Total dimensions.
height = 120;
width = 40;
padding = 10;
module col(h, sph=false) {
difference() {
cube([width, width, h]);
if (sph)
translate([width / 2, width / 2, h])
/*
A combination for a lock has 3 wheels, X, Y, and Z, each of which
can be set to eight different positions. The lock is broken and when
any two wheels of the lock are in the correct position, the lock
will open. Thus, anyone can open the lock after 64 tries (let A and
B run through all possible permutations). However, the safe can be
opened in fewer tries! What is the minimum number of tries that can
be guaranteed to open the lock?
*/
#!/usr/bin/env python3
"""Problem statement:
There is a teacher and 2 students in a classroom. The students are A and B.
The teacher thinks of 2 positive integers and tells the sum of those numbers
to student A without student B hearing it. Then tells their product to student
B without student A hearing it. After this, the teacher asks the 2 students
what was the 2 numbers.
First student A says: I don't know.