mahadri

Yes, the discrete Fourier transform (DFT) detects N frequencies in parallel, where N is the block size, and you can disregard the uninteresting frequencies. The fast Fourier transform (FFT) is an efficient algorithm that computes the DFT. For detecting M frequencies where M << N, the Goertzel algorithm requires less computation than the FFT. Also, the Goertzel algorithm allows targeting more exact frequencies regardless of the sampling rate (Fs), while the FFT's bins have a fixed spacing of ±Fs/N.

As with everything, there are trade-offs associated with these three options.

Does this (http://www.howtoforge.com/high-availability-load-balancer-ha...) guide answer your question? Failover of the load balancer is described in sections 1 and 5 (on page 2).

The load balancers share one public IP address. Only one server at a time is assigned that address. To failover: 1. Physically isolate the failed load balancer by removing power and/or disabling its Ethernet port on the switch. 2. Assign the shared public IP address to the new active load balancer. 3. Broadcast an unsolicited ARP reply from the new active load balancer.

You might like this 18 minute TED talk that parallels the article's idea. "People don't buy what you do; they buy why you do it."

http://www.ted.com/talks/simon_sinek_how_great_leaders_inspi...

The decryption key doesn't construct data anymore than the combination to a safe constructs the papers inside it. The data exist independently of anyone's ability to read them.