2015-07-27
- Hannah Lorrimore, Cardiff University
- James Campbell, Cardiff University
- Tobenna P. Igwe, University of Liverpool, (Google Summer of Code)
- Vincent Knight, Cardiff University
\documentclass{article} | |
\usepackage{hyperref} | |
\begin{document} | |
If you're awesome you should use \cite{hypothesisx.y}. | |
\bibliographystyle{plain} | |
\bibliography{demo.bib} |
class Pet: | |
noise = "" | |
def make_noise(self): | |
return self.noise | |
class Dog(Pet): | |
noise = "Woof" | |
class Cat(Pet): | |
noise = "Meow" |
""" | |
Code and go | |
""" | |
import random | |
import math | |
import ciw | |
ciw = False |
from __future__ import division | |
import matplotlib.pyplot as plt | |
import matplotlib.gridspec as gridspec | |
import random | |
import math | |
import tqdm | |
def lognormal_cdf(x, m, s): | |
x1 = x[0] | |
x2 = x[1] |
from sympy import Matrix | |
Q = [[-2, 1, 1],[3, -5, 2], [1, 1, -2]] | |
M = Matrix(Q) | |
pi = M.transpose().nullspace()[0] | |
pi = list(pi / sum(pi)) | |
print pi |
count = 0 # Initialising a variable to count numbers divisible by 11 | |
s = 0 # Initialising a variable to add all numbers divisible by 11 | |
powers = 1 # Multiple 2 together as many times as we have numbers divisible by 11 | |
for i in range(101): # Loop over numbers we want | |
if i % 11 == 0: # Identify numbers that are divisible by 11 | |
count += + 1 # Add 1 | |
s += i # Add the number itself | |
powers = powers * 2 # Multiple by 2 |
sed -i "" s/behaviour/classifier/g *py |
import axelrod | |
strategies = axelrod.basic_strategies | |
strategies += axelrod.ordinary_strategies | |
strategies += axelrod.cheating_strategies | |
count = 0 | |
for s in strategies: | |
s = s() | |
if None in s.behaviour.values(): |
\documentclass{article} | |
\usepackage{tikz} | |
\usetikzlibrary{calc} | |
\begin{document} | |
\begin{tikzpicture} | |
\draw (0,0) -- (2,2); | |
\node (first_node) at (2,1) [draw, fill=red!20] {\(x^2\)}; |