This file contains 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
#pragma once | |
/** | |
* Authors: | |
* Felix Moessbauer <felix.moessbauer@siemens.com> | |
* | |
* SPDX-License-Identifier: MIT | |
*/ | |
#include <chrono> | |
#include <condition_variable> |
This file contains 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
#!/bin/bash | |
# Trivial solution to replace placeholders in config files | |
# Finds all .tpl files, replaces keys and stores the result | |
# without .tpl | |
# | |
# Usage: replacer.sh <keyfile> | |
# | |
# Keyfile format: | |
# key=value | |
# key2=value2 |
This file contains 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
#ifndef BGL_WRITE_DIMACS_INC | |
#define BGL_WRITE_DIMACS_INC | |
/** | |
* export boost graph to dimacs graph format | |
*/ | |
template<typename graph_t> | |
void write_dimacs(const graph_t & graph, std::ostream & out){ | |
auto num_edges = boost::num_edges(graph); | |
auto num_vertices = boost::num_vertices(graph); |
This file contains 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/python | |
# | |
# This script create a two-language booklet from two pdfs | |
# The result is a single pdf where the pages of the second input | |
# are reversed and turned by 180 deg so that the reader of the booklet | |
# can start reading with the language he prefers. The other language can be | |
# read by turning and flipping the booklet around | |
import sys | |
import PyPDF2 as pdf |
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
This file contains 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
/* | |
* Notice: Requires C++11 support | |
*/ | |
#include <vector> | |
#include <string> | |
#include <algorithm> | |
/** | |
* Implementation of the Wagner-Fischer algorithm | |
* closely following https://en.wikipedia.org/wiki/Wagner%E2%80%93Fischer_algorithm |
This file contains 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
import os | |
import struct | |
import numpy as np | |
""" | |
Loosely inspired by http://abel.ee.ucla.edu/cvxopt/_downloads/mnist.py | |
which is GPL licensed. | |
""" | |
def read(dataset = "training", path = "."): |