Saturday, July 31, 2010

Birthday Wish To My Boss

Solution netduino bar stop gnome-panel Multiplication

Yesterday, as usual everything worked perfectly on my Ubuntu 9.10. Today, suddenly (still do not know why) gnome-panel bar was completely blocked . "Googling" for a while, I found a partial solution, a hack. Process is to kill the gnome-panel, then works again as if nothing had happened.
$ killall gnome-panel


of the panels that come by default in Gnome.
propose another solution , as discussed on ubuntu-life, if something fails, one option is to return to the default values, which is fine for me now. Therefore we can reset the parameters
$ gconftool-2 - recursive-unset / apps / panel

Then reboot the machine and go. I can confirm that goes well, at least to me, I have been solved. life
leave some links from where I got this information.
Ubuntu Ubuntu-es


Tuesday, July 27, 2010

Goldwell Hair Colour Samples



The pencil glides on paper, sculpting sublime words, innocent child of a deep love.

His fingers slide on the wood painted yellow and gray drawing a flower on the paper. His gaze is lost through the bus window. Abstracts in their illusions Sinbo realize the embarrassment we suffer on other passengers, after a sea drowning windows closed to protect us from the flood out there.

Carita of hope, love candid prints after a few sentences to his beloved. Even with her school uniform she thinks back to his home. Incipient affection and attraction, first traces of the love of a child.

Monday, July 26, 2010

Sleep Ezeeffects Time

the Russe in C

Several algorithms for multiplication. One quite interesting and surprising is the multiplication the russe. This algorithm is not to be very educational, in fact is not taught in schools, since it only requires to divide and multiply by 2. In essence, knowing table 2, and of course, know how to add, and it works!.

algorithm and example The best way to understand how the algorithm is a example. Let's multiply 35 * 91: the result should be 3185.

What you do is take the multiplying and dividing by 2 while the result is greater than 1. With the multiplier is the opposite, multiply by 2. The numbers are those parts add up right where the left side is odd. In other words, add up those numbers multiply column where the column is odd divisions. A pseudocode would be something like:
russe (x, y)

begin while (x> = 1)
do if (x a 2) THEN endif x = x / 2;
more than + = y;

y = y * 2;
end
return more;
end

tentador implementation
Result and algorithm. It's simple. If we consider that the multiplications and divisions by 2 are made by shifts to the left and right respectively, it is very easy.
An improvement to this is to put the smallest number as multiplying because so we can save a few iterations. _______________________________________________________ / * russe.c - multiplication algorithm to

russe
* Author: Juan Jose Fumero Alfonso
* Compile: gcc-O3 russe.c -o russe */
#include <stdio.h>
#include <stdlib.h> #include <unistd.h>
/* getopt */

#define AUTHOR "Juan José Fumero Alfonso"

void printf ( "Author: %s
author () {
\n
"
, AUTHOR);
}
void
version () { printf (

"Multiplicación a la Russe, version 0.2 \n }
" );

void

help () {
printf (
  • "Use mode: \n
  • " );
"
\t
$ ./russe -[-hva] x <number1> -y <number2>
\n
"
);


printf (
" \t
-v: print version

\n

")
printf (
" \\ t
-a: print author
\\ n "
)
printf (
" \\ t
-h: show this help
\\ n "
);}
/ * function that performs the russe multicación * / int

mrusse (


AUXA int, int



auxb) {
     
int mult =
0; while
(auxa> = a ) {if
((auxa%

2) == 1

) { than + = auxb;}

auxa = auxa>>
a
; auxb auxb = \u0026lt;\u0026lt;
a ;}
return more;}

/ * Input the two numbers to multiply from the line of
* commands * /


int main ( int argc, char
** argv) { / * Collection numbers ie * /
int x, y; flgn1 int = 0
, flgn2 = 0 ; int opt;
while ((opt = getopt(argc, argv, ":havx:y:" )) != - 1 ) {
switch (opt) { case 'h' : help();
return

0 ;
break ; case 'v' :
version(); return 0
; break;
case 'a' : author ();
return 0
;
break ;
case 'x' :
/ * collection of numbers * /
flgn1 = 1
;

x = atoi (optarg); break
;
case 'and' :
/ * collection of numbers * / flgn2 = 1 ;
y = atoi (optarg); break;
default: / * '? " * /
help (); exit (EXIT_FAILURE); }}
if ((flgn1 == 0) & & (== Flgn2
0)) { fprintf (stderr, "Error in numbers \\ n "
)
return - a ; }

int = mrus than (x, y); printf ( "
\\ t % i *% i =% i
\\ n " , x, y, long); return

0;} _______________________________________________________
The main function is mrusse , which is what makes the multiplication by software. The rest is just to allow various input options to the program. Usage:
$. / Russe-x 35-and 91

Use option-h for assistance.

Wednesday, July 7, 2010

Internal Hdd Error D610

UUID to assign a new virtual machine VirtualBox

If we have more than one copy of a running virtual machine, each machine needs to have its own UUID than the rest. There are at least two ways to do this.

1. Assigning a new UUID manually copy is made with the command cp , for example, and then have to manually assign a new UUID for the machine copied. This is done:
$ VBoxManage internalcommands setvdiuuid copy.vdi


2. Cloning a virtual machine The second method is to use the VirtualBox clonehd . This makes a copy and assigns a UUID to the new machine automatically.
$ VBoxManage clonehd original.vdi copy.vdi