Posts Tagged ‘University’

Radio astronomy beam forming on GPUs

Tuesday, May 24th, 2011

I am finally publishing my master’s degree thesis, whose title is “Radio astronomy beam forming on GPUs“, on this website. The thesis describes all the work I did on the LOFAR beam former and is one of the starting points of the work I am currently doing at the VU (more on this in the future).

The thesis can be downloaded here in pdf format. I want to thank my supervisors for the great work they did helping me in this project. All the mistakes and errors are, of course, mine.

MSc project presentation

Wednesday, December 15th, 2010

The title of my master project, and my thesis, is “Radio astronomy beam forming on GPUs“. I presented the results in a public session at the VU Amsterdam the 13th of December, just few days ago, and it is time now to share the slides of the presentation here also.

Radio astronomy beam forming on GPUs (presentation) (pdf).

In few months the final version of the thesis, and hopefully also the whole source code.

Information theory analyzer

Monday, August 24th, 2009

Hello :)

I’ve taken an exam those summer called “Information theory” and as a project I’ve developed, with the help of Alfredo Aiello, a program for evaluating entropy (simple, joint and conditional) and mutual information of random variables (and subset of them) from a sample set.

Like every other time I want to share the code (that is licensed with GNU General Public License 3.0) with the whole world, so this is a zip file containing all the code.
There isn’t a makefile right now but you can easily find a way to compile it, the only external dependencies is my ArgumentList library.

After compiling it you can use it on command line just tiping:

./ITA <[-e] | [-j] | [-c] | [-m]> -n <null_char> <set_file> <input_file> <output_file>

Obviously you have to call your binary :)

The first parameter is for the operation wanted (-e for entropy, -j for joint entropy, -c for conditional entropy and -m for mutual information), the second is for setting the null char of the sample set and last three ones are filename.
The first of them (set_file) permits you to control which variable of the sample set is in which subset, I know I can be a little too enigmatic but I’ll provide an example later; the second (input_file)  is the file which contains the sample set and the third (output_file) is where do you want the output will be written.

The sample set format is really sample, is a text file where the columns are the variable and the rows are the samples, something like that:

1 0 n 1
n 2 n n
a 0 2 2
2 c 1 2

This is the description of a sample set with 4 samples and 4 variables.
The format for the set_file is really simple too, again a text file where the first number is the length of first subset and all the others are the indexes (starting from 0) of the columns in the subset.

Let’s for example evaluate the conditional entropy between those two subset of the previously given sample set:

X = {0, 2, 3}
Y = {1}

Then we’ll have to write a file (let’s call it example.set) like this one:

3 0 2 3 1

And, if our sample set is called example.txt, call the program in that way:

./ITA -c -n n example.set example.txt out.txt

Enjoy!

TSP approximation algorithms

Wednesday, July 1st, 2009

Finally I’ve found some time to publish the code I wrote for my BSc thesys, wow! :)

The problem is not in releasing source code but mainly in my lazyness, because I’ve just found the time to write a bash script to download some other code which my code depends on (my ArgumentList library and BlossomV-1.0 from Vladimir Kolmogorov) and create the right objects.

If you want, you can download the script already as a file from there, the only thing you must change is the BASEDIR variable; after the execution of the script you have just to change the INCLUDE constant on the Makefile and use make to compile to source. It is necessary to have wget and git already installed.

The proper source code of my thesys is available, as you can see, from GitHUB; sorry but all the comments and strings are in Italian.

Analisi sperimentale di algoritmi approssimati per il problema del commesso viaggiatore in grafi fortemente metrici

Saturday, April 4th, 2009

Pubblico qui la mia tesi di laurea di primo livello (BSc) in informatica, discussa il giorno 25/03/2009.
La tesi riguarda l’analisi sperimentale di alcuni algoritmi approssimati per il problema del commesso viaggiatore (TSP), pubblicherò anche il codice implementato per le analisi appena possibile.

Tutto il materiale è in italiano.

Buona lettura.

Alessio Sclocco – Analisi sperimentale di algoritmi approssimati per il problema del commesso viaggiatore in grafi fortemente metrici

Alessio Sclocco – Grafici presentazione

Update: Il mio lavoro è servito come analisi sperimentale per questo paper, a firma dei miei relatori.