Hanuman Bajrang Baan Stotra Lyrics

Nishchay Prema Prateet-tay, Vinay Karain Sanmaan,
Tayhi-Kay Karaja Sakala Shubha, Sidhi Karain Hanuman

Jai Hanumanta Santa Hitakaari, Suna Liijay Prabhu Araja hamari
Jana kay kaaja vilambana keejay, Aatura dawrii maha Sukha deejay

Jaisay kooda sindhur kay paara, Sursa badana paithii Vistaara
Aagay jaiyii Lankinii Rokaa, Maarayhu laata gaii sura Loka

Jaayay Vibhishan ko sukha deenha, Sita Nirakhi parama pada Leenhaa
Bajaa ujaari Sindhur Mahana Borah, Ati Aatura Jama Kaatara tora

Akshaya Kumara mara sanhaara, Loama lapaita Lanka-ko Jaarah
Laaha samaan lanka jaari-gai, Jai Jai Dhwani surpur naba Bhai

Aba vilambha kayhi Kaaran Swami, Kripaa Karahhu ura Antaraymii
Jai Jai Lakshmana Praana kay daataa, Aatura hai dukha Karhu Nipaataa

Jai Jai Hanumanta Atibala saagar, Sura Samooha samratha Bhata Naagar
Om Hanu Hanu Hanu Hanumanta Hateelay, Bhairayhhi Maaru Bajrah-Ki Keelay

Om Hrim Hrim Hrim Hanumana Kapisha, Om Hun Hun Hun Hanu Arii Ura Sheesha
Jai Anjani Kumara Balawanta, Shankara Suwana Veera Hanumanta

Badana Karaala kaala kula ghaalaka, Rama sahaa sadaa prati Paalak
Bhoota prayta pishacha nischaara, Agni Baitala kaala maari-mar

Inhain maaru tohi shapatha Ram ki, Raakhu natha Maarayad Naama ki
Satya hahu Hari Shapatha paiikay, Rama doota dharu maaru Jaiikay

Jai Jai Jai Hanumanta Agadha, Dukha Pavata Jaana Kayhi apraadha
Pooja jaapa tapa naima achaara, Nahina Jaanat acchu-das tumhaaraa

Baan upawaan maaga-girigraha manhi, Tumharay Bala hama Darpata Nahin
Janaka Suta Hari Das Kahaaoh, Taaki shapatha Vilamba nalaawoh

Jai Jai Jaya Dhuni Hota Akaasha, Sumirata Hota Dusah Dukha Nasha
Charana pakar jori mana-oan, Yahi awsara aba kayhi gohra-oan

Uthu Uthu Chalu Tohi Rama Duhai, Paayain paroan kara jori manaayaii
Om Cham Cham Cham Cham Chapal Chalantaa, Om Hanu Hanu Hanu Hanu Hanumantaa,
Om Ham Ham Hanka Day-tah Kapi Chanchal, Om San San Sahami Paraanay khal Dala

Apnaay jaana ko turata ubaaro, Sumirata hoya ananda hamaaroh
Yaha Bajaranga Baan Jayhi Maaray, Haahi Kaho phir kahana ubaaray

Paatha karay Bajranga Baana ki, Hanumanata Raksha Karayne Praana ki
Yaha Bajranga Baana Jo Jaapay, Taataay Bhoota Pray-tah Saba Kaampay
Dhoopa-day aru Japayne Hamaayshaa, Takay tana Nahina Rahay Kalesha

Doha:

Prema Pratitee Bhajaay, Sadaa Dhari Ura Dhyaana,
Tayhee Kay Karaja Sakala Shubha, Sidhi Karayne Hanuman.

Siyaa pati Ramachandra ki jai,
Uma Pati Mahadeo ki jai
Pawana suutah Hanumana ki jai


Youtube Link: http://www.youtube.com/watch?v=MHzwJyg-UB4&feature=related

Private Space

I must admit, I am a hardcore Indian and I must admit there are things in western culture that I am really impressed with and staunchly believe that it should have been a part of our treasured culture. One of the many things I admire about is the concept of the Private or Personal space.

It was not a revolutionary concept when I came here, but I am not ashamed to admit, we Indians do not take it seriously. There are gazillions times when a friend of mine has peeped into my personal mail, or a colleague standing behind my back watching me over my shoulders without me knowing about it, or my boss staring at my monitor looking me code. As I was raised in India these things were quite normal for me and haven't had any complaints about it although I m not sure if I liked it.

Things here were quite different. All praises for it. A wife has a space in which a husband does not invade or a friend knocks on the cube wall before entering the cubicle. The people here respects the space. In my opinion everyone needs to and it is outright a great quality. There were numerous time after coming over here in US, I felt the need to tell a friend to knock at least before they come in while I am working. But I think its a cultural thing and it is hard to come if one doesn't try.

There are so many counters to it. A friend of mine will outright jump at me and say, I know all of your secret and I deserved to know everything about you. I agree. I will let my friend know about it when the time is right. One can complaint that a couple has no secret among them. I agree. But it doesn't mean that you don't just poke your nose in everything she/he is doing. They will inform you or let you know when the time is right. Trust on one's partner is an important thing. A colleague can be emailing a personal mail to his wife or can be dealing with a finance stuff which is outright their personal work and no other colleague or boss needs to have a eagle eye on it.

I am no one to preach or teach but just an observation of mine, which I think will help my dozens of Indian friends to succeed here in US and in their life. Respect everyone's personal space and the people will respect you. If you like many of friends feel is mere a formality, which is irrelevant with friends, spouse or family, think again. It is not a formality. It is a gesture letting other people know that you respect them as a person. This simple gesture will gain you an equally well deserved respect.

Patience...!!!

I bet all of you have read this statement somewhere in your life... "Give me Patience and Give it to me NOW"..!!

This virtue comes hard... I myself as person have very less patience and often I have been in a situation where I have regrets of not keeping enough patience... However, there were few occasions where I thought reverse would have benefited me more.. You can find many learned men supporting the former than later.. but in real life I bet you will get so many examples of both to contradict them...

A classic example of describing a former phenomenon is a comrade jumping out of an airplane and waiting patiently till the precise altitude to pop open his parachute to land safely to reach the exact destination.. I can site example of 2 friends who bought car around the same time.. one was eager to get a new one and purchased right away and other was calm and calculative.. waited for right time and bought a better car at the same price... so you can easily conclude Patience pays...for itself.. I have been in situations where I regret my behavior for not being patient enough to handle a talkative colleague, a frustrated friend, and list goes on. Had I been able to keep my patience just for few more minutes, I wouldn't have fought with ex-colleague at office or my glass vase could still be intact and my motorcycle without a dent..!! But is this always true..??

Think about a relationship in which you waited patiently (who said 6 years =P) and the girl went to other guy as you never asked her out waiting "patiently"-  don't you feel like killing yourself. Precisely. Some will contradict that if she din't she was not meant for you..True.. but don't you think some of these life changing decisions are guided by our social obligations and other factors too.. Dozen of examples are spur up in my mind... Me missing an airline deal just because I had lot of patience (I guess the patience owes me 100 bucks now...), a single friend of mine having more patience than his roomy who is with the girl of his dream (patience owes him a girl friend =P ), and the list goes on ......

The aftermath of analyzing if patience was good or not is up to us. To me it has a psychological aspect associated with it.. if patience served him good he is inclined to think it is good and vice-versa.. Isn't that true always... You can always relate it to good or bad depending on what you want to.. as there are infinite P&C (permutation and combinations) which will make an individual feel as he wants to..!!

To end it.. let us just say.. we are the best judge when it comes to deciding how much patience is precisely needed for something...!! If the result turns out to be good you will thank all the wise men for their brilliant philosophical teaching and if it turns otherwise remember there is always a silver lining in the dark cloud..!!

If you are patient enough to reach till this statement.. you are Kunal certified patient reader.. too much to ask for such a piece of literary crap..!! Keep patience this might pay you some day (a silver lining.. =)) !!!

Just like that...

package csc206;

public class BranchandBound {

/**
* @param args
*/

public int[] selectedNodes = new int[5]; //nodes that have been at lease arrived at.
public int[] leftList = new int[5];
public int[] arrivedList = new int[5];
public int[] shortestPath = new int[5];
public int[][] lbResultList = {{-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1}};

public int shortestDistance = 9999;
public int[] finalshortestPath = new int[5];


public static int[][] costArray =  {{0,14,4,10,20},
{14,0,7,8,7},
{4,5,0,7,16},
{11,7,9,0,2} ,
{18,7,17,4,0}};
public int lowerBound = 0;
boolean allVisited = false;
int nodeCount = 0;
public static int itrCnt = 0;



public void resetDataStructures()
{
int i,j;
for(i = 0; i < 5; i++)
{
selectedNodes[i] =  -1;
leftList[i] =  -1;
arrivedList[i] =  -1 ;
shortestPath[i] = -1 ;

}
for(i = 1; i< 5; i++)
{
for(j = 0;j < 5; j++)
{
lbResultList[i][j] = -1;
}
}

nodeCount = 0;
lowerBound = 0;

}

public void findLowerBound()
{

lowerBound = 0;
int lowLeave = 0;
boolean done = false;
int i = 0,row,col;
int emptySlot;
int leftCnt = 0, arriveCnt = 0;

while(!done)
{
emptySlot = selectedNodes[i];
if(emptySlot == -1 || selectedNodes[i] == i)
{
done = true;

}
else
{
//if(selectedNodes[i] == i)
//System.out.print(i+1+"-->");
lowerBound = lowerBound + costArray[i][selectedNodes[i]]; //calculates cost between 2 nodes
System.out.print(i+1);
System.out.print(" --> ");
i = selectedNodes[i];
}


}
System.out.print(i+1 + ":");


//finding lowest cost of leaving all the nodes
/*
* CONDITIONS TO CHECK
*  1) cannot leave for it self
*  2) cannot leave on the node that has already been arrived on
*  3) cannot leave if already left this node once.
*
*/

for(row = 0; row < 5 ; row++)
{

if(leftList[row] < 0) // checks whether we have left from the node or not
{
lowLeave = 9999;
for (col = 0; col < 5 ; col++)
{
if(costArray[row][col] != 0 && costArray[row][col] < lowLeave && arrivedList[col] == -1)
{
if(arrivedList[row] != -1) // if we have already arrived this node
{
if(leftList[col] == -1) // only leave for the node that has not been arrived before (condition 2)
{
lowLeave = costArray[row][col];
}
else
{
if(selectedNodes[row] == row && nodeCount == 4)
{
lowLeave = costArray[row][col];
}

}
}
else
{

lowLeave = costArray[row][col];
}

}

}
if(lowLeave != 9999)
leftCnt = leftCnt + lowLeave;
}
}

//finding lowest cost to arrive at all nodes
/*
* check whether we have arrived to this city once
* check the node we are arriving from is not connected to some other node.
*
*/
for(col = 0; col < 5 ; col++)
{
if(arrivedList[col] == -1) //checks whether we have arrived to this node or not.
{
lowLeave = 9999;
for (row = 0; row < 5 ; row++)
{
if(costArray[row][col] != 0 && leftList[row] == -1 && costArray[row][col] < lowLeave)
{
if(leftList[col] != -1)
{

if(arrivedList[row] == -1)
{
lowLeave = costArray[row][col];
}
else
{
if (selectedNodes[row] == row && nodeCount == 4)
{
lowLeave = costArray[row][col];
}
}
}
else
{
lowLeave = costArray[row][col];
}

}
}
if(lowLeave != 9999)
arriveCnt = arriveCnt + lowLeave;
}
}
lowerBound = lowerBound + (leftCnt + arriveCnt)/2 ;
System.out.print(" "+lowerBound + "\n");
}

public boolean checkDone()
{
boolean done = true;
int i = 0;
for(i = 0;i < 5;i++)
{
if(shortestPath[i] < 0)
{
done = false;

}
}
return done;
}

public int findLowest(int index)
{
int temp = 9999, lowestIndex = 0;
int cnt = 0;

while(cnt<5)
{

if(lbResultList[index][cnt] != -1 && lbResultList[index][cnt] < temp)
{
temp = lbResultList[index][cnt];
lowestIndex = cnt;
}
cnt++;
}
if(index == 0)
lbResultList[index][lowestIndex] = -1;
return(lowestIndex);
}

/*
* functions calculates lower bound and addes the nodes depending on the lowest bound
*
*/
public void tsp(int index)
{
int i = 0;
int newIndex = -1;
selectedNodes[index] = index;
nodeCount++;


while(!checkDone())
{
while(i<5)
{
if(selectedNodes[i] == -1)
{
selectedNodes[i] = i;
selectedNodes[index] = i;
leftList[index] = i;
arrivedList[i] = index;
findLowerBound();
lbResultList[index][i] = lowerBound;
i++;
selectedNodes[i - 1] = -1;
arrivedList[i - 1] = -1;

}
else
{
i++;

}
}
newIndex = findLowest(index);
selectedNodes[index] = newIndex ;
shortestPath[index] = newIndex;
leftList[index] = newIndex;
arrivedList[newIndex] = index;
System.out.println("\n");

if(nodeCount == 4)
{
if(newIndex != 0)
{
shortestPath[newIndex] = 0;
leftList[newIndex] = 0;
}
System.out.print("Shortest Path is : ");
int ind = 0;
System.out.print(ind + 1);

for(int a = 0; a < 5 ; a++)
{

System.out.print(" --> ");
System.out.print(shortestPath[ind] + 1);
ind = shortestPath[ind];
}


}
else
{
tsp(newIndex);
}
}// end of checkDone() while loop

}

public void getShortestPath()
{
int cnt = 1;
int newIndex = 0;
while(cnt <= 4)
{
tsp(newIndex);
resetDataStructures();
newIndex = findLowest(0);
selectedNodes[0] = newIndex;
shortestPath[0] = newIndex;
leftList[0] = newIndex;
arrivedList[newIndex] = 0;
cnt++;
System.out.println("\n----------------");
}

}

public static void main(String[] args) {
// TODO Auto-generated method stub
BranchandBound bb = new BranchandBound();
bb.resetDataStructures();
bb.getShortestPath();

}

}

Taming the time

Have you ever felt the - if you could stop the time for a while?

Just wanted a moment to stop forever or wish for a day that would never end or a night that you wish had no dawn..

In my recent trip to Harrisburg, PA, I sincerely wished if the time could stop for few more weeks. 15 days passed by in a blink of an eye. Catching up with the old chums after 2 years in 2 weeks is kind of an insult to friendship.. but it is rightly said.. true friendship is never torn apart by space or time..

In my opinion best option for taming the time is to move ahead with the time while capturing the beautiful moments in your heart forever and cherish it for life time...

I think this is getting too philosophical for my first post. Let me wait for another moment in time to get back to it.. :)