shankar vembu

Ranch Hand
+ Follow
since May 10, 2001
Merit badge: grant badges
For More
Cows and Likes
Cows
Total received
0
In last 30 days
0
Total given
0
Likes
Total received
0
Received in last 30 days
0
Total given
0
Given in last 30 days
0
Forums and Threads
Scavenger Hunt
expand Ranch Hand Scavenger Hunt
expand Greenhorn Scavenger Hunt

Recent posts by shankar vembu

Originally posted by Ellen Zhao:
I enjoy some songs in Telugu very much, even though I don't understand a single word...Here is an example. (file size: ~6mb)

[ May 20, 2005: Message edited by: Ellen Zhao ]



how about checking
this link...
18 years ago
I seldom concentrate on the lyrics. only the music (melody, rhythm....) interests me. But yes, i listen to songs only in the languages that i know meaning that i CAN understand the lyrics but i mostly never listen to them.

shankar
[ May 20, 2005: Message edited by: shankar vembu ]
18 years ago
9.287
21970
ok enough now
19 years ago

Originally posted by Helen Thomas:
I think it's what you are currently sporting aka a goatee.



I distinguish between a goatee and a french beard...
goatee = hair only on the chin (not on the lower jaw)
french beard = moustache + chin (including lower jaw )



BTW I have this beard i.e. french beard - moustache. I dont know if this in in vogue, but i like it so i am keeping it

shankar
[ January 11, 2005: Message edited by: shankar vembu ]
19 years ago
Nostalgia....
Visakhapatnam (Vizag for short) is my home town. It is definitely a beautiful place to live (beaches, resorts, parks, serenity and much more). The cost of living is not high at all. It was not ~3 years ago and I am sure it's the same now.
Cannot comment on the companies because I dont live there anymore. But yes, it's developing fast in the field of IT, I was told. The next big thing to happen after Hyderabad, in the state.

Shankar.

p.s. >>I heard its a good town to live.
Vizag is a CITY. You are offending a Vizagite

Originally posted by Arjun Shastry:
By the way, anybody from Visakhapatanam ?Some companies are trying to relocate there .
I heard its a good town to live.I think,Navy has some center there.




[ December 13, 2004: Message edited by: shankar vembu ]
19 years ago
BTW, hows Naach performing at the BO...
shankar.
19 years ago

Originally posted by Arjun Shastry:

Diwali celebrates Rama's homecoming,his return to Ayodhya after the defeat of Ravana.Starting of New Hindu Year.Planning starts after Dassera,another festival 18 days before Diwali.Generally here is the sequence:
1)After Dasera,see the Hindu calendar and check when is Diwali.
2)If it comes on Friday or Monday then apply for 1 day vacation,If its not on Friday or Monday,calculate accordingly.
3)Purchase new clothes.
4)Purshase crackers/fireworks for kids.
5)If elders are there in family,be good with them 1 month in advance so that they will help you in making some traditional sweets.Otherwise purchase from market.
6)Clean you house with the help of kids.
7)Purchase lanterns(aakash kandil)/oil lamps.
8)Identify the people to whom you will be giving sweets as gifts.If you want,then you need to give!
9)Ask kids to purshase some Diwali greeting cards which you will be sending to many people(relatives,govt. officers,politicians,friends)
10)On the first day of Diwali,get up at 4 or 4:30 AM.
11) Apply paste of gram flour and fragramt powder to your body.
12)Have a bath.
13)Suggest everybody to go through steps 10/11/12.
14)Get ready to listen ,deafening sounds of crackers played by other people.
15)Join them.
16)Come back home and eat the sweets and other things.(Don't forget to wear those newly purchased clothes)
17)Exchange sweets with neighbours.How soever may be their quality,you must say sweets made by others taste great.
18)Call your relatives which you forgot to send greeting cards.and even if they are 1000 KMs away,request them to come to your house for eating sweets.
19)Now identify the people which are good for your business/job etc.You must courier these gifts in advance to people staying in another town.Go to thoese useful people and give them those gift with big smile on your face.Depending on the relationship,you may also recieve some gift in return.
Diwali goes for 3 days.Step 19 runs for 3days.All above steps should be executed on day 1.
Some other rancher will write steps for day2 and day3 here as Diwali comes closer.



Nice one
But step 10 applies only in Tamil Nadu right? In Andhra Pradesh, I dont think ppl get up early in the morning and burn crackers. It's done in the evening. Or is this the way ppl celebrate in North India?? I do it both in the morning as well as in the evening cos I belong to both the states
Shankar.
[ November 05, 2004: Message edited by: shankar vembu ]
19 years ago

Originally posted by Jesse Torres:


What is RI?

Thanks,



I guess, Reference Implementation...
19 years ago

Originally posted by shankar vembu:


Let me try.
1. No dead races(one winner) = n!
2. 2 winners = nc2*(n-2)!
We have nc2 ways to choose 2 winners. The rest (n-2) can be arranged in (n-2)!

So on and so forth.

Total = nc1*(n-1)! + nc2*(n-2)! + nc3*(n-3)! + ....+ ncn(n-n)!

Notes: First term = n! is essentially point# 1 stated above.
Last term = 1 = all horses are winners


Is this OK?

SHankar.

[ October 25, 2004: Message edited by: shankar vembu ]



I assumed that dead race applies only to position 1.
A more general solution would be:

Let A(n) = total no. of arrangements for n horses(where dead races are possible in every position).
So A(n) = nc1.A(n-1) + nc2.A(n-2) + nc3.A(n-3).........
where (recurse....)
A(n-1) = (n-1)c1.A(n-2) + (n-1)c2.A(n-3) + (n-1)c3.A(n-4)......
A(n-2) = (n-2)c1.A(n-3) + (n-2)c2.A(n-4) + (n-2)c3.A(n-5)......
.
.
.
.
.
I guess I am near to the solution. Any other formulations?
Basically, this would be a "bottom-up" computation.

SHankar
[ October 25, 2004: Message edited by: shankar vembu ]
19 years ago

Originally posted by Arjun Shastry:
Is there any similarity between this and factorization of a number.?
Say number is 24.Factors are 2,2,2,3.Number of ways in which 24 can be factored are
2*(12),2*2*(6),2*3*(4),2*2*2*3,3*(8),4*6



Let me try.
1. No dead races(one winner) = n!
2. 2 winners = nc2*(n-2)!
We have nc2 ways to choose 2 winners. The rest (n-2) can be arranged in (n-2)!

So on and so forth.

Total = nc1*(n-1)! + nc2*(n-2)! + nc3*(n-3)! + ....+ ncn(n-n)!

Notes: First term = n! is essentially point# 1 stated above.
Last term = 1 = all horses are winners


Is this OK?

SHankar.
[ October 25, 2004: Message edited by: shankar vembu ]
19 years ago

Originally posted by K Varun:


Removing Tedulkar from Indian cricket team is as stupid as removing Tedulkar from Indian cricket team (did u got this line? )



:roll:
19 years ago

Originally posted by Chandra Sekhar:
I cdnuolt blveiee taht I cluod aulaclty uesdnatnrd waht I was rdanieg. The
phaonmneal pweor of the hmuan mnid Aoccdrnig to a rscheearch at Cmabrigde
Uinervtisy, it deosn't mttaer inwaht oredr the ltteers in a wrod are, the
olny iprmoatnt tihng is taht the frist and lsat ltteer be in
the rghit pclae. The rset can be a taotl mses and you can sitll raed it
wouthit a porbelm. Tihs is bcuseae the huamn mnid deos not raed ervey lteter
by istlef, but the wrod as a wlohe. Amzanig huh? yaeh and I awlyas thought
slpeling was ipmorantt!


Any Comments
Chandrasekhar



I have come across this before.
I would like to add a few comments on this one.
This ability IMO also stems from the fact that a kind of knowledge base exists in our brain that has evolved over time gradually ever since we started reading/speaking english. And due to this knowledge base, our brain is easily able to cope up with spelling mistakes.

I guess the same does not hold if we are presented a pragraph like the one above in some other language that we may not be familiar with.

What is surprising is the fact that we are able to cope up with words that have their first/last letters intact and the rest being a mess. Would like to know if this is a strict condition....Or some other permutation of the words is possible ?

Enough of my rant.
Back to work.
19 years ago

Originally posted by Maxim Katcharov:
so if abcd = efgh, F is within ijkl, and it's simple from there, otherwise try for:

abcd > efgh
abef vs cdTT

>7)If abef weighs more again,counterfeit is between a and b.
>8)If abef weighs less,counterfeit is between c and d.
>9)If abef weighs same as cdkl,counterfeit is between g and h.

I've heard that there are a number of distinct ways to do this. This is the second I've seen.



Are you assuming that the counterfeit coin is always heavier than the original one?
Assume 'e' is counterfeit and is lighter than the original coin.
1. abcd > efgh holds.
2. if abef < cdTT also holds but the counterfeit is neither c nor d

am i missing something
19 years ago