Python version of the MATLAB code in this Stack Overflow post: https://stackoverflow.com/a/18648210/97160
The example shows how to determine the best-fit plane/surface (1st or higher order polynomial) over a set of three-dimensional points.
Implemented in Python + NumPy + SciPy + matplotlib.
Probably not the title that most people expected to see in the #1 slot. I urge everyone to give it a shot though. No other film has ever brought me through a greater spectrum of emotions. It's a supernatural film, but the characters are so well fleshed out and developed that they feel real. I've probably seen a hundred films since, but none have compared.
Director: Yasuhiro Yoshiura - "Sometime in future Japan, androids have been involved in every aspect of peoples lives. One day, upon checking his android's behavioral log, Rikuo, a student, noticed his android's returning times have been odd recently. With his friend Masaki, they found out the place where his android, Sammy, have been visiting: a small cafe called Eve no Jikan where an
| #!/bin/bash | |
| # | |
| # Copy data from a Time Machine volume mounted on a Linux box. | |
| # | |
| # Usage: copy-from-time-machine.sh <source> <target> | |
| # | |
| # source: the source directory inside a time machine backup | |
| # target: the target directory in which to copy the reconstructed | |
| # directory trees. Created if it does not exists. | |
| # |
| #!/usr/bin/env python | |
| """Merge multiple JUnit XML results files into a single results file.""" | |
| # MIT License | |
| # | |
| # Copyright (c) 2012 Corey Goldberg | |
| # | |
| # Permission is hereby granted, free of charge, to any person obtaining a copy | |
| # of this software and associated documentation files (the "Software"), to deal |
| // Ivan Pouzyrevsky, EWSCS'12. | |
| #include <iostream> | |
| #include <functional> | |
| #include <memory> | |
| #include <utility> | |
| // This is a C++ implementation for Seemingly Impossible Functional Program, which in finite time tests whether | |
| // a computable predicate on binary strings yields True for some binary string. It does so by exhaustive search | |
| // on whole space. Some nasty-nasty tricks like call-by-need can make this algorithm run fast. |
