Wipeer set as default page for new tabs in firefox

Recently I installed Wipeer, but for no use, as I had to uninstall it soon.
But it set a particular search page as default on Firefox.
To remove that I had to delete a folder named "extensions" from
my firefox profile.
Here is how to locate your firefox profile.

Some useful vim commands

qa
do stuff(my favorite : copy paste a number and increment with Ctrl-A
qa
@a to repeat the stuff
-------
* for searching words under cursor
--------
shift i for inserting at the beginning of the line
------
Ctrl-v to select a rectangular block
--------
but It's All Text!

launching multiple commands(applications) from a bat(batch) file

prepend every command
with
START

for e.g.
START a.exe
START b.exe

command for traceroute on windows

tracert

Oracle 10g username password

While installing Oracle 10g I gave orcl orcl as uname password for something.
After installation, and hell lot of effort, figured out that, for running sqlplus
username : system
password : orcl
host string :
oh yeah, don't give anything in the host string field.

flex sorting a datagrid column numerically rather than alphabetically

http://flextricks.wordpress.com/2007/02/03/sorting-numeric-values-in-a-flex-datagrid/

flex datagrid restricting a column to have numeric values

http://weblogs.macromedia.com/pent/archives/2008/05/index.html

flex datagrid with total max average etc

http://seanhess.user.openhosting.com/demos/footerdg/Test.html
extends the work of
http://blogs.adobe.com/aharui/FancyBorders/dg.swf

Inverse ,determinant ,adjoint for NxN matrix

Source URL


With slight modification. Number of
rows will be input by user and adjoint
will also be printed out.


#include<stdlib.h>
#include<stdio.h>
#include<assert.h>
#include<errno.h>
#include <iostream.h>

float determinant(float **matrix,
int size,
int * used_rows,
int * used_cols,
int depth);
float coefficient(float **matrix,int size, int row, int col);
void print_matrix(FILE * fptr,float ** mat,int rows, int cols);
float test_data[8][8] = {
{4.0, 2.0, 4.0, 5.0, 4.0, -2.0, 4.0, 5.0},
{4.0, 2.0, 4.0, 5.0, 3.0, 9.0, 12.0, 1.0 },
{3.0, 9.0, -13.0, 15.0, 3.0, 9.0, 12.0, 15.0},
{3.0, 9.0, 12.0, 15.0, 4.0, 2.0, 7.0, 5.0 },
{2.0, 4.0, -11.0, 10.0, 2.0, 4.0, 11.0, 10.0 },
{2.0, 4.0, 11.0, 10.0, 3.0, -5.0, 12.0, 15.0 },
{1.0, -2.0, 4.0, 10.0, 3.0, 9.0, -12.0, 15.0 } ,
{1.0, 2.0, 4.0, 10.0, 2.0, -4.0, -11.0, 10.0 } ,
};
#define ROWS 8
void print_adjoint(FILE* fptr,float ** mat,int rows,int cols,float det)
{
int i,j;
for(i=0;i<rows;i++)
{
for(j=0;j<cols;j++)
{
fprintf(fptr,"%10.4f ",mat[i][j]*det);
}
fprintf(fptr,"\n");
}
fflush(fptr);

}

int main(int argc, char **argv)
{

float **matrix;
float **inverse;
int rows,i,j;
float determ;
int * used_rows, * used_cols;

//rows = ROWS;
cout << "Input number of rows" << endl;
cin >> rows;
cout << "Now enter the input values" << endl;
/* Allocate markers to record rows and columns to be skipped */

/* during determinant calculation */
used_rows = (int *) malloc(rows*sizeof(*used_rows));
used_cols = (int *) malloc(rows*sizeof(*used_cols));

/* Allocate working copy of matrix and initialize it from static copy */
matrix = (float **) malloc(rows*sizeof(*matrix));
inverse = (float **) malloc(rows*sizeof(*inverse));
for(i=0;i<rows;i++)
{
matrix[i] = (float *) malloc(rows*sizeof(**matrix));
inverse[i] = (float *) malloc(rows*sizeof(**inverse));
for(j=0;j<rows;j++)
//matrix[i][j] = test_data[i][j];
cin >> matrix[i][j];
}

/* Compute and print determinant */
printf("The determinant of\n\n");
print_matrix(stdout,matrix,rows,rows);
determ=determinant(matrix,rows,used_rows,used_cols,0);
printf("\nis %f\n",determ);
fflush(stdout);
assert(determ!=0);

for(i=0;i<rows;i++)
{
for(j=0;j<rows;j++)
{
inverse[j][i] = coefficient(matrix,rows,i,j)/determ;
}
}

printf("The inverse is\n\n");
print_matrix(stdout,inverse,rows,rows);
printf("\n\nThe adjoint is\n\n");
print_adjoint(stdout,inverse,rows,rows,determ);

return 0;
}

float determinant(float **matrix,int size, int * used_rows, int * used_cols, int depth)
{
int col1, col2, row1, row2;
int j,k;
float total=0;
int sign = 1;

/* Find the first unused row */
for(row1=0;row1<size;row1++)
{
for(k=0;k<depth;k++)
{
if(row1==used_rows[k]) break;
}
if(k>=depth) /* this row is not used */
break;
}
assert(row1<size);

if(depth==(size-2))
{
/* There are only 2 unused rows/columns left */

/* Find the second unused row */
for(row2=row1+1;row2<size;row2++)
{
for(k=0;k<depth;k++)
{
if(row2==used_rows[k]) break;
}
if(k>=depth) /* this row is not used */
break;
}
assert(row2<size);

/* Find the first unused column */
for(col1=0;col1<size;col1++)
{
for(k=0;k<depth;k++)
{
if(col1==used_cols[k]) break;
}
if(k>=depth) /* this column is not used */
break;
}
assert(col1<size);

/* Find the second unused column */
for(col2=col1+1;col2<size;col2++)
{
for(k=0;k<depth;k++)
{
if(col2==used_cols[k]) break;
}
if(k>=depth) /* this column is not used */
break;
}
assert(col2<size);

/* Determinant = m11*m22-m12*m21 */
return matrix[row1][col1]*matrix[row2][col2]-matrix[row2][col1]*matrix[row1][col2];
}

/* There are more than 2 rows/columns in the matrix being processed */
/* Compute the determinant as the sum of the product of each element */
/* in the first row and the determinant of the matrix with its row */
/* and column removed */
total = 0;

used_rows[depth] = row1;
for(col1=0;col1<size;col1++)
{
for(k=0;k<depth;k++)
{
if(col1==used_cols[k]) break;
}
if(k<depth) /* This column is used - skip it */
continue;
used_cols[depth] = col1;
total += sign*matrix[row1][col1]*determinant(matrix,size,used_rows,used_cols,depth+1);
sign=(sign==1)?-1:1;
}
return total;

}

void print_matrix(FILE * fptr,float ** mat,int rows, int cols)
{
int i,j;
for(i=0;i<rows;i++)
{
for(j=0;j<cols;j++)
{
fprintf(fptr,"%10.4f ",mat[i][j]);
}
fprintf(fptr,"\n");
}
fflush(fptr);
}


float coefficient(float **matrix,int size, int row, int col)
{
float coef;
int * ur, *uc;

ur = (int*)malloc(size*sizeof(matrix));
uc = (int*)malloc(size*sizeof(matrix));
ur[0]=row;
uc[0]=col;
coef = (((row+col)%2)?-1:1)*determinant(matrix,size,ur,uc,1);
return coef;
}

Bunch tag

I don't know if this feature is already available with
the current DAM vendors, but it would be nice to tag
a bunch(may be hundreds or thousands) of images, movie
clips with a single tag simultaneously.

C code for selection Sort

#include <iostream.h>



void printArray(int a[])

{

 int k;

 for(k=0;k<10;k++)

         cout << a[k] << " ";

 cout << endl;

}



int main()

{

        int a[10] = {1,3,2,4,8,7,5,10,9,6};

        int i,j;

        printArray(a);

        int min,pos;

        for(i=0;i<9;i++)

        {

                min = a[i];

                pos = i;

                for(j=i;j<9;j++)

                {

                  if(a[j] < min)

                  {

                     min = a[j];

                     pos = j;

                  }      

                }

                int t = a[i];

                a[i] = a[pos];

                a[pos] = t;

        }





printArray(a);



}

C code for insertion sort

#include <iostream.h>





void insert(int a[],int i,int j)

{



        //function for inserting ith element at jth position

        int t = a[i];

        int k;

        for (k=i;k>j;k--)

                a[k] = a[k-1];

        a[j] = t;

}



void printArray(int a[])

{

 int k;

 for(k=0;k<10;k++)

         cout << a[k] << " ";

 cout << endl;

}



int main()

{

        int a[10] = {1,3,2,4,8,7,5,10,9,6};

        int i;

        printArray(a);

        for(i=0;i<9;i++)

        {

                if(a[i] > a[i+1])

                {

                        cout << "conflict here" << a[i] << ">" << a[i+1] << endl;

                        //conflict exists

                        //find the appropriate position for i+1 th element

                        int j,pos;

                        for(j=0;j<i+1;j++)

                        {

                           if(a[j] > a[i+1])

                           {

                                   pos = j;

                                   insert(a,i+1,pos);

                                   printArray(a);

                                   break;

                           }

                        }

                                

                }

        }



printArray(a);



}

C code for bubble sort

#include <iostream.h>



int main()

{

        int a[6] = {5,19,11,18,27,22};

        int j;

        for(j=4;j>=0;j--)

                for(int i=0;i<=j;i++)

                {

                        if(a[i] < a[i+1])

                        {

                                int tmp = a[i];

                                a[i] = a[i+1];

                                a[i+1] = tmp;

                        }

                }

        for(j=0;j<6;j++)

                cout << a[j] << " " ;

        cout << endl;

}