This for anyone else unfortunate enough to be using the ARMA or VBS2 scripting language. Cheers.
Remember the time I worked at a gym. Who could have seen that in my future, eh? So, I’ve picked up some shifts on the front desk to pad my cheque because, contrary to popular opinion, personal training is not a lucrative business. Unfortunately. So I am currently bored out of my tree because it’s 6am at the gym and I’m sitting on my ass serving my only purpose, which is smiling at people as they walk in… thank God for wikipedia. Sooooo, since I’ve thoroughly exhausted my daily wiki (Happy Polish Mother’s Day) I figured writing to youse guys would be more productive than picking my teeth (although I did have loose-leaf tea this morning…). Who knows, maybe it’ll become a regular thang.
So the other day we had an interesting…encounter…at work. Guy comes in to the front desk, seems to be having trouble articulating his problem but from what I can gather he stopped authorizing payments for his gym membership a few months ago. Yet he kept coming to the gym…not much, but nonetheless… Anyways, turns out he wanted us to wave his service charges. Probably not going to happen but our Assistant Manager is rad so she was at least humouring the poor guy. She asks him why he thought we would be able to do that, to which he responds along the lines of, “Well, I don’t have any money. I’m obliged to give everything away.” “Oh?” “Yes. You see, I’m the Lord and Savior. I was sent by God to save man from the asteroids.”
I shit you not. You would think a false prophet would be more concerned about his health…
And this was a good day.
Had a woman come in this morning for a tan (comes in every second morning, like clockwork, 5:30am). She always asks for a towel to put over her face so she has this super tanned body and ghostly white face. I saw her come in this morning so I said, “Good Morning! Nine minutes in the stand up?” She smiled and said, “You’ve got such a good memory!” Of course I remember you, you look like a goblin.
Chances are only three people might read this (maybe 4 if Soucy’s Dad still looks us up once in a while) so it’s a good thing I know my audience. I miss you guys. Bro-cation needed. Will you guys move to Scotland with me? Before you say no, I have two words for you….Eggplant Lasagna.
And I figure it’s only fitting to wish my three favorite computer scientists a joyous Alan Turing’s Birthday:) and if I had even a moderate amount of technical ability I would have been able to figure out how to insert a picture of him shopped with a birthday hat, but I don’t so I couldn’t. So you’ll just have to use your imagination.
Hello internet, sorry for letting the website become so….DERELICT
Posting this for anyone unlucky enough to have to set this up, and for anyone desperate enough to be searching the blogosphere for help…
Setting up XINU in VirtualBox
XINU is a teaching tool, as such, users will want to make changes to it quickly and frequently. Using VirtualBox, and open-source virtual machine sandbox program, development and back-end environments can be created and linked on an internal network. The development machine will act as a standardized programming machine. It is a basic Debian install that contains the XINU source code. The back-end machine will boot from VirtualBox’s internal network and run the compiled version of the code.
Installing VirtualBox (Linux / OSX )
VirtualBox can be freely downloaded from https://www.virtualbox.org/wiki/Downloads be sure to download the correct version for the distribution you are using.
Alternatively, VirtualBox can be downloaded using a software package manager such as aptitude or apt-get. (sudo apt-get install virtualbox)
Installing VirtualBox (Windows)
VirtualBox can be freely downloaded from https://www.virtualbox.org/wiki/Downloads be sure to download the correct version for the distribution you are using.
XINU is available for many different systems and architectures. The current focus of development is to bring it to even more. This guide focuses on the Virtual Machine implementation.
The VM implementation of XINU is available as two “virtual appliances”, essentially pre configured virtual machine settings, in the public FTP of the University of Purdue.
Connect using FTP to ftp.cs.purdue.edu
Use anonymous login when prompted
execute the ‘bin’ command, for binary transfer
get ‘xinu-appliance.tar.gz’ this contains the two VirtualBox appliances
untar the package
Importing and Configuring XINU
Once the XINU package have been downloaded and extracted, there should be two appliances, develop-end.ova and back-end.ova . Import these two appliances into the newly installed VirtualBox.
Leave all the settings as their defaults, and repeat the import for the second appliance.
In settings, under serial ports, you will want to set BOTH appliances to the same settings, with the addition of checking “Create pipe” for the development machine.
The path setting will vary depending on the operating system you are using. For instance,
in windows, use “\\. \pipe\xinu_com1”. Linux/OSX users will enter something like “/tmp/xinu_com” . This is the link between the two machines. The back-end machine is by default set to boot from the network. Once these settings are edited, you are ready to compile and run XINU!
Running XINU in VirtualBox
XINU is run by first compiling and “uploading” the resulting binary file to a location that the back-end can boot from.
Start the develop-end VM
When prompted, enter ‘xinu’ for the username, and ‘xinurocks’ for the password
Once the system has completed loading, there will be a folder titled xinu-x86-vm
run the upload script with sudo ./upload.sh
XINU has now been placed in the proper location for the back-end to boot when started. However, in order to see the CONSOLE of XINU, you will have to connect using minicom.
back in the VirtualBox menu, start the backend appliance. XINU will start, and run it’s main process, which by default will start the shell module. Congratulations, XINU is now running!
SHORT POST TIME. Which means I thought of this off-hand (and it’s certainly not new information, but is kind of fun).
Coding theory is concerned with encoding messages in a way so as to minimize their length for transmission over some sort of channel. The mathematical formalization of this goes all the way back to Shannon’s Information Theory, so I’ll give some basics and then mention the RANDOM CONNECTION.
Here’s the idea. We have two parties, Alice and Bob, who are trying to communicate over some sort of digital channel. (For convenience, let’s assume that the channel communicates every message that is sent across without corruption). Alice has a message M that she wants to send, and the message is drawn from some alphabet . Concretely, let’s assume the message is drawn from the English alphabet
where we use # as a placeholder for a blank space. Let denote the set of all messages we can compose out of the symbols in the alphabet . For example,
Now, suppose the channel is binary, so it can only send 0s and 1s. Obviously, Alice needs some way to encode her alphabet into the alphabet to send over pressing messages to Bob.
To bring this about, let’s define a binary code to be a function
That is, a binary code is any map from our source alphabet to a sequence of bits. Note that if we have a binary code C we can easily extend it to messages (i.e. to elements of ) by defining, for any sequence of symbols , the map
Now, most codes are useless. Indeed, under our above definition, the map for every English letter is a code. Unfortunately, if Alice used this code over their channel Bob would have a tough time decoding it.
So, we need some condition that allows us to actually decode the bloody things! We’ll start with a useful type of code called a prefix-free code.
Definition: A binary code is prefix-free if, for every pair of symbols neither is a prefix of nor vice-versa.
An example of a prefix-free binary code (for the first four letters of the English alphabet) could be the following:
Let’s encode a message with C: if Alice encoded the message via C and sent it to Bob, Bob would receive
Now, the beautiful property of prefix-free codes is the following: Bob can actually decode this message online. That is, he can do the following: iterate through each of the bits in sequence, and store what order they came in. Once his stored bit sequence matches a sequence in the code, he can automatically decode that character and keep going!
To illustrate, Bob first reads a 1 off the string. He convinces himself that 1 is not the code for anything, so he reads the next bit, a 0. He now has the string “10″, which is a code for b. Now, is it possible that this could be the beginning of a code for another letter? NO! Because “10″ is the code for b and is not the prefix of any other code. So Bob can translate the b, and move on.
We define nonsingular codes to be the set of codes that can actually be decoded. After seeing the above example, it’s clear that prefix-free codes are non-singular. However, is it possible for there to be non-prefix-free, non-singular codes? That is, are there codes that are decodable, but require us to read the entire message before we can decode them? (NOTE: These codes are practically useless, from an efficiency point of view. This is just a thought experiment to test the definition.)
The answer is YES, and a natural example are Gödel numberings! Here is how it works: for each letter in the alphabet choose a distinct positive integer . Now, to encode a message
let M be the positive integer defined as
where is the nth prime number. We then send the binary expansion of M as our message.
How does Bob decrypt it? Easily: he reads ALL of M, factors it, and reads off the powers of the exponents: the order of the message is preserved if we read off in order of lowest prime to highest, where the power of the ith prime is the code of the ith symbol in the message. Bob has to read all of the message (and he has to make sure he’s transcribed it correctly), or else he cannot recover any of it! Marvelously useless.
OR IS IT USELESS? Similar ideas lurk under regular RSA encryption which everyone uses a billion times a day without even realizing it (thank you blaggerwebs). If factoring integers is as hard as complexity theorists believe it is, then Alice has just sent Bob a frustratingly uncrackable message.
I was explaining something in probability theory to somebody last night, and I offhandedly said the following remark:
You know, it’s interesting what sorts of mathematics come up. For example, a usual exercise in undergraduate probability is the following: Flip a coin repeatedly until a heads comes up. What’s the expected number of coin flips required?
The person asked me what the number was, and I realized that I actually didn’t know. I gave an offhand guess of three, since we’re asking about a very particular sequence of coin flips (which has exponentially small density in the measure of all sequences of coin flips, and so it should be small). I sat down to work on it before bed, and rather quickly derived the following expression.
Let be the random variable in with the interpretation that if the th coin flip in a sequence of flips is a head after tails. It’s straightforward to calculate — assuming we’re flipping a fair coin, the probability of getting tails followed by a single head is . This means our expected value will be
And, wait a minute, but this sum is not trivial to evaluate! At first I did what any self-respecting mathematician/computer scientist would do (i.e. HIT IT WITH YOUR HARDEST SLEDGEHAMMERULTRATOOL AND DYNAMITE THE PROBLEM TO ACCESS IT’S SWEET GOOEY INSIDES) and applied generating functions.
This (alas) didn’t work and I fell asleep dejected.
And I woke up with the cutest solution!
To begin, here’s a secret that your math teacher just won’t ever bloody tell you:
(1) Every inequality/sum/identity in the history of mathematics just comes from writing the same thing in two different ways.
Of course, with our friend hindsight bias this is obvious — once we have the identity in front of us, it’s easy to say “oh, well of COURSE , it’s so obvious, duh!”.
Now, here is a second secret that your math teacher won’t ever bloody tell you:
(2) Every result ever obtained in mathematics can be broken down to a sequence of tiny, local, or otherwise easy steps.
When you say something as simple as I did in these two principles the questions of mathematics suddenly become significantly less daunting. To illustrate both of these principles, I’ll use them to evaluate our sum from the probabilistic puzzle above. First, let’s recall what an infinite sum actually is, as it’s kind of easy to forget: the sum
is really defined as a limit of partial sums
So, applying our first principle from above, we’re going to rewrite as another function so that we can actually evaluate the limit above.
Now, how do we do this? First, just to simplify notation for ourselves, let Let’s apply our second principle from above — what are some really stupendously obvious facts about the sum ? Well, since it’s a frigging sum, we know that
Alright, here is a start. If we can apply our first principle to the sum and write it down in another way then maybe we’ll end up somewhere interesting. Well, what about this sum? Let’s write it down explicitly, so that we can actually see some of the structure of the terms. I’m also going to make the substitution and instead write
Time for a side rant. Now, a math teacher, jerks as they are, will tell you to do this kind of substitution because your result is more general (or, even worse, tell you nothing at all, leaving you swimming in a soup of variables/indeterminates with no flotation device).
As usual, this is the correct information but stated in a way so that humans can’t understand it. Another way to say this “generality” assumption is, simply, people hate magic numbers! Notice that NOTHING! about the sums we’ve considered so far have needed the 2 to be there (other than the fact that our problem happens to be about coins). Well, if there’s no reason for it to be there, then why should it be there? The sum is even a bit easier to swallow visually. Anyways, side rant over.
Back on track, here are the sums and , both written down explicitly:
Well, recall that I said that we were trying to rewrite in a way other than
Applying our first principle — and this is really the leap of intuition — let’s just transform into in another way! How? Well, multiply by and compare it to :
We’ve almost got ! The only thing that’s missing is a single copy of each term in the sum! Phrased mathematically, we now have the identity
Now, the sum is a geometric sum which has a simple formula (fact: this simple formula can be derived in a way similar to our current investigation):
So, substituting in this new simple formula gives
and then, finally finishing our application of the first principle, we can apply our early “stupid” identity for and get
The rest is algebra/boilerplate. Collecting the terms on the left hand side, we get
then dividing both sides by finally gives
Taking the limit as and using our knowledge that , we see that the terms involving will disappear. This leaves
Substiting in , we get
And we’re done. In expectation, you will see a heads after 2 coin flips.
You see, math is not mystical. Unless you’re a Newton or an Euler (viz. an absolutely genius), math proceeds pretty much the same for everybody. There are underlying principles and heuristics that help you do math that every established mathematician actually uses — the secret is that no one ever tells you them. Of course, I have a sneaking suspicion that this due to the fact that our high school math teachers don’t actually understand the principles themselves (while this may seem like a bit of an attack, I did graduate with people who were going to be math teachers. Most of those people should not have been math teachers).
Additionally, if the router (in bridge mode) is plugged into any other type of outlet such as a power bar or splitter, it will not properly renew the IP.
…you realize if anyone walked in and saw you, that they would run away screaming.