Posts Tagged ‘link’

How to install MintMenu on Debian (lenny, sid)

Sunday, November 23rd, 2008

I really like (and miss) Linux Mint Menu (mintmenu), so I installed it on my Debian Sid box and here is how I managed it:

  • Install mintsystem and mintmenu deb packages, either by adding mint repository to yout sources.list file or by downloading them from mint packages or simplier, by grabbing them from my blog
  • Help it to recognize your applications by symlinking some files in /etc/xdg/menus (as root):

    ln -s gnome-applications.menu applications.menu
    ln -s gnome-preferences.menu preferences.menu
    ln -s gnome-settings.menu settings.menu

  • Add mintMenu to your Gnome panel..

et voilà! Here are the two deb files I'm using:
mintsystem_61_all
mintmenu_4.2_all

Here is an updated screenshot:
MintMenu complete under Debian Sid

MintMenu complete under Debian Sid

If you also want to enable beagle or tracker, be sure to add the correct search command in the preferences of mintMenu (see the screenshot)

  • Share/Save/Bookmark

New domain: from daniel.graziotin.net to bd-things.net

Sunday, September 21st, 2008

As I previously announced, I purchased a brand new domain for my stuff.
The blog is changing during the months, becoming more than a blog but less than a site.
That's because I decided to buy the domain BD-things.net, because this site contains all of my things, files, thoughts, projects, publications.
The old address daniel.graziotin.net now redirects permanently here and every link should have been updated/rewritten. Please contact me if you encounter problems.
I also took BD-blog.net which points here, too, but I won't renew it the next year.
Some things are different now, but you won't notice it ;)
I obviously lost my decent position at Netcraft's Most Visited Web Sites rank list, but I don't care. It will be funny to advance with the new domain and reach a even better position!
I hope there will be a new beginning and a brand new life with BD-things!

  • Share/Save/Bookmark

BD-blog advances 20000 positions in one month!

Thursday, September 18th, 2008

BD-blog is currently at position 32755 in Netcraft Most visited web sites ranking. This means that I earned about 20k positions in just one month! This is thanks to the link of my review of GOS published on Distrowatch!

BD-blog site ranking, top 30000

BD-blog site ranking, top 30000

I'm very happy with these results but now I want to begin a new race with a brand new domain name! I'm tired of bd-things.net, event if it brought me such great results and knowledge around the Net.
I will announce the new domain name very soon.

  • Share/Save/Bookmark

EHLO Gnu/Linux, I’m back!

Tuesday, July 1st, 2008

After about 5 months of separation from my preferred operating system, the discontent brought by Mac Os X led me to a re-born love with Gnu/Linux.
I Installed Gentoo (~x86, not x86) on my MacBook, following some articles found on the Gentoo wiki and on Ubuntu wiki.
The result is the following:

Clean Desktop

Some things opened: Gnome Menu, Gnome Terminal, Nautilus, Scite

Features:

  • Gnome 2.22.2
  • MurrinaGilouche + Elementary Metacity (link - link)
  • black-white 2 Gloss Icons (link)
  • Screenlets [RingSensors] (link)
  • A wallpaper included in Gnome, still looking for the perfect one

Let's have some fun with Gnu/Linux...again!

  • Share/Save/Bookmark

La portabilità del codice esiste o no?

Tuesday, June 24th, 2008

Immaginate questo pensiero contornato da mille bestemmie..
Perchè uno straccio di programma in C che usa si e no 10 syscalls e un signal handler (tutto standard), compilato con gcc 4.0.1 sotto Mac Os X Leopard, quindi certificato Unix 03, e perfettamente funzionante...NON FUNZIONI su Gnu/Linux 2.6.18 + gcc 4.1.2 e Gnu/Linux 2.6.24 + gcc 4.3.1?
Segmentation Fault a manetta..e si che mi sembrava un po' permissivo gcc 4.0.1 su Mac os X quando lavoravo con puntatori a stringhe e liste linkate..
Caro Gnu/Linux, sto tornando.

  • Share/Save/Bookmark

Hash Maps with linear probing and separate chaining

Monday, April 28th, 2008

Time for two new C programs! At the DSA course I learned something about Hash Tables and collision resolutions.
I just implemented insert/search/print operations.

The first source code is an implementation of a Hash Map with open addressing (linear probing) as collision resolution method.
The following are the interesting functions of the program. As always, take a look at the source code for comments:

// hashMapLinear[] is the hash map
void linearProbingInsert(int value){
    int probe = hash(value);
    while (hashMapLinear[probe]!=0){                            
        probe = fmod((probe+1),SIZE_HASH_MAP);
    }
    hashMapLinear[probe] = value;
}

int linearProbingSearch(int value){
    int probe = hash(value);  
    int i;
    for(i=0;i<size_hash_map ;i++){    
        if(hashMapLinear[probe]==value)
            return TRUE;                            
        probe = fmod((probe+1),SIZE_HASH_MAP);              
    }
    return FALSE;                                          
}
 

Download: hash-map-linear-probing.c

The second program is an implementation of a Hash Map with chaining as collision resolution method.
Interesting functions:

// t_hashTableNode is a struct that is created as single linked list
void chainedHashInsert(int value){
    int probe = hash(value);                        
    if(hashMapChained[probe] == NULL){          
        hashMapChained[probe] = malloc(sizeof(t_hashTableNode));
        hashMapChained[probe]->value = value;
        hashMapChained[probe]->next = NULL;
    }else{
        t_hashTableNode *hashTableNode = hashMapChained[probe];
        while(hashTableNode->next!=NULL){
            hashTableNode = hashTableNode->next;
        }
        hashTableNode->next = malloc(sizeof(t_hashTableNode));
        hashTableNode->next->value = value;
        hashTableNode->next->next = NULL;
    }
}

int chainedHashSearch(int value){
    t_hashTableNode *hashTableNode = hashMapChained[hash(value)];
    while(hashTableNode!=NULL){
        if(hashTableNode->value==value){
            return TRUE;
        }
        hashTableNode = hashTableNode->next;
    }
    return FALSE;
}
 

Download: hash-map-chaining.c

  • Share/Save/Bookmark