The main engine behind a project I’m currently working on is a neural network. Neural networks are based on the way your brain works. Have you ever smelt something and a picture of someone you know appears in your head? This is to do (in VERY basic form) with the neurons firing in your head. What has happened is that over time, you have smelt this smell whenever around that certain person. Everytime this happened  the strength of the synapse (the thing between the neurons) between the picture of the person and the smell of the smell became stronger.

I’m going to take you through making a very basic neural network called a Perceptron. We are going to teach it the OR logic. It’s not exactly the most exciting thing, but seems to be the machine learning version of “Hello World”.

Firstly lets get some neural network basics down:

Our inputs will be in this form:

If we take 0’s as nil and 1 as anything other than nil, then our OR logic would look like this in Ruby: (not the best example, but you get the idea)

As we know, neural networks consist of neurons. A neuron consists of:

Threshold: This is a static amount that determines whether our neuron fires or not.

Weight: The weight is a dynamic number that is used within the activation function.

Activation Function: This is a function that decides whether the neuron fires or not. In this case, our activation function is going to be as shown:

y is used to represent the activation function and g is the function. If the answer is greater than our threshold (in this case 0) then the neuron fires.

This NN (neural network) is split up into two parts. The training part and the recall part. In the next section we will build the outline of the network

In total there are 7 balls that are drawn for the UK National Lottery: 6 normal balls a bonus ball. The seven balls are all drawn from the same batch of 49 balls.

To receive first place you need all 6 normal balls. To understand whats going on here we need to understand factorials.

Factorials

There are 3 people in a room: A, B, C. If we were to ask them to leave the room, what are all possible combinations in which they leave the room:

A way to calculate this is: N = 3×2x1

Now if there were 24 people, the number of combinations would be: N = 24×23x22… Now this equals a rather large number, which would make writing calculation a pain in the ass, so we shorthand them like so:

This is a factorial.

Let’s say we now have 4 people in a room and ask them to leave just like we did before, but this time we only care about the first two people who leave. How many different combination can we have? We can work this out like so:

If we had 24 people and only cared about the first 5 we would calculate it by:

As you can see, it can get a bit boring having to type all of that into a calculator, so we can use this instead:

From this we can work out that:

Back to the lottery…

You may noticed that the method I was just talking about care about order but in the lottery it doesn’t matter if the number 2 comes first or third (disregarding the bonus ball as we have no care in it to win). To disregard order we can calculate the number of ways 6 numbers can arranged:

We take the total number of combinations for 6 balls and divide it by this number:

This means that the probability of us winning first price is 1/13,983,816

This looks messy again, so lets combine this with what we already know:

Number of Combinations - Order Matters

Number of Combinations - No Order

And this is turned into:

Next time we’ll calculate probability of winning other place prizes

Annoyingly I wasn’t very surprised by the craptastic user experience I had.

So, after going through problems with registering next I had to apply for accommodation; so I click applications (I think thats what it said, I can’t find out as the service has now been shutdown due to “problems”). A page comes up showing me that I have 0 applications, nothing new there. Now how the hell do I submit a new application? Theres no sub-menu below the menu that I just clicked, theres no sub-menu in the main window…Oh, there it is! Right in the bottom left, now why would you put it there? It’s like putting Diggs “Submit new” button in the footer!!

Here’s a picture (I’ve cut the side bar off)

They couldn’t even bother to make the background on the help buttons the same colour as the background their sitting on:

After finding my way around I managed to get the the page where I had to accept the terms and conditions. I’m noticing a trend here…They like to put important button in the bottom left! If you look at the picture below, how far do I need to move my mouse to just submit this one fielded form!? Not only that but I’m seeing some terrible logic going on here…(I think this deserves its own paragraph)

It asks you to confirm you have read and understood the T’s and C’s. Next to the writing is a tick box, nothing new here as its normal practice, but then in the bottom left their are two buttons, and “Yes” and a “No”. What!? Am I ticking the box to confirm I have read it and then using the buttons below to confirm I understand it?? What if I don’t tick the box but click yes?

Not only that, but through the whole process I received lots of 503 errors. Now, I can forgive if all of a sudden they received a ton of traffic and weren’t expecting it, but they must have set this date months in advance; not only that, but they go through this same process every bloody year! Buy or hire another 1/2/3 servers just for a day, take EC2 or Mosso for a spin. Your not exactly selling the last 1000 tickets for Leeds and Reading festivals.

I had also sent an email around 10:30 this morning asking whether there were problems their end, I also sent another one telling that the app had told me to contact them. I have yet to hear back for either email. To put them to shame, I emailed Pragmatic Programmers this morning to see whether they could transfer a book I got for my bday to my account. Within an hour it was done!

I got that awesome service for buying a book (well I didn’t actually buy it, which makes the whole service even better), yet we’re paying the university thousands of pounds and we still had to go through this poo bath! Universities can sometimes remind me of those big corporations who know that people need (or think they need) their product so feel that they don’t have to care about their users.

I used the info on Wikipedia to get what type each line is

Some interesting points:

• A large amount of Bakerloo delays happen in the morning rush hour.
• Circle line suffers from a lot of severe delays around both rush hours.
• Metropolitan line has a lot of problems during morning rush hour, but it alright evening rush hour.
• Picadilly line is very reliable compared to other.
• Victoria line has had a spread of planned closures, I believe their doing work on it, but haven’t been on that line for a long time.

I am playing with different ways to see if I can write a program to predict the status of a tube.

I thought I’d post a couple of graphs to show the different statuses of the tubes.

As an example let’s say we are going to keep tossing a coin until we get a head. There for our sample space is…

The possibility of getting a head first time is 1/2, second time is 1/4 and third time 1/8 and so forth. We can represent this as…

We know (from a previous rule) that the sum probability of all items in a sample space must = 1. A geometric series proves this

So to put this to use. Let’s say we want to know the probability of a head turning up after a even throw. Our event E would look like:

Therefore, the probability of getting a head after a even throw is 1/3 and after a odd throw 2/3

Example

A = It will snow tomorrow and it will rain the day after

B = It will snow tomorrow

C = It will rain two days from now

D = It will snow tomorrow or it will rain the next two days

Or lets say that our event (E) = “it will snow tomorrow but will not rain the next day”

By saying the sample space is finite means that, for example, we have a die, we know that the different outcomes go from 1 to 6. The math lingo for this is Finite

Lingo

OK, so lets go back the good old dice example and assign these new names…

So, OHM is the sample space, i is the outcome (elements of our sample space) and E is our event

Event can be described, so this event can be described as the outcome being even.

Therefore we can give each outcome a probability of 1/6 and the probability of our event as…

Distribution functions are the assignment of probability. They have to follow 2 rules:

1. Each probability must be greater than 0 — m(w) > 0 for all w E OHM –
2. Sum of all the probabilities must equal 1

If we go back to our dice example. The die has 6 sides, each side has a probability of 1/6, therefore 6 * 1/6 = 1

A coin example

We are going to toss the coin twice. Now, we have several ways we can display the sample space…

1. Record the toss in the order it occured - OHM = {HH, TH, HT, TT}
2. Record number of header occured - OHM = {0,1,2}
3. Have no regard for the order - OHM = {HH, HT, TT}

For this example we’ll use the first one.

Therefore…

Following the rules? Check! The probability of all outcomes is equal to 1

So lets start working out the probability of different events

An event of at least ONE head comes up

The probability of this event is…

Another event could be…

An event where a tails comes up first

But what if our outcomes aren’t equal?

Imagine this scenario:

• 3 people (A,B,C) are running a race
• Only one person can win
• A and B have the same change of winning
• C has only half the chance of A or B

So, A = (2*C) and so does B = (2*C)

If we remember our second rule, then…

So…

Sooooo….

Let try another event to smooth any rough edges