bryan-lunt

The MIT License (MIT)

Copyright (c) 2015 J Kishore Kumar

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

bryan-lunt

#http://jupyter-notebook.readthedocs.io/en/stable/examples/Notebook/Importing%20Notebooks.html

import io, os, sys, types
from typing import override

import importlib, importlib.abc, importlib.util

from IPython import get_ipython
from nbformat import read
from IPython.core.interactiveshell import InteractiveShell

bryan-lunt

def argmax(a_list,key=lambda x:x):
    index = 0
    maxval = key(a_list[0])
    for i,e in enumerate(a_list[1:],1):
        v = key(e)
        if v > maxval:
            index = i
            maxval = v
    return index

bryan-lunt

// ==UserScript==
// @name        Disable Back Button
// @namespace   http://tampermonkey.net/
// @version      0.1
// @description  Disables the back button for specified URLs
// @author       You
// @match        https://app.dataannotation.tech/workers/tasks/*
// @grant       none
// ==/UserScript==
// Replace "your-target-website-url-here" with the actual URLs you want to target

bryan-lunt

#Copyright 2022 Bryan J. Lunt <bryan.j.lunt@gmail.com>
#
#Licensed under the Apache License, Version 2.0 (the "License");
#you may not use this file except in compliance with the License.
#You may obtain a copy of the License at
#
#    http://www.apache.org/licenses/LICENSE-2.0
#
#Unless required by applicable law or agreed to in writing, software
#distributed under the License is distributed on an "AS IS" BASIS,

bryan-lunt

bryan-lunt

#!/bin/bash
#SBATCH --time=04:00:00
#SBATCH --nodes=1
#SBATCH --ntasks-per-node=12
#SBATCH --exclusive
#SBATCH --job-name subjob-sched-test
#SBATCH -p secondary

module load openmpi/4.1.0-gcc-7.2.0-pmi2 gcc cmake

bryan-lunt

import numpy as np

def LU_recursive(A):
    """LU factorization without pivoting. Will fail if any diagonal is 0.
    Recursive implementation.
    """
    L = np.zeros_like(A,dtype=np.float_)
    U = np.eye(*A.shape,dtype=np.float_)
    
    a = A[0,0]

bryan-lunt

#include <iostream>

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <random>
#include <omp.h>

bryan-lunt

# for gist naming purposes