Monday, July 23, 2007
Consolidate to survive
SunRockets demise
SunRocket, providers of VOIP services recently announced their bankruptcy. Thousands of SunRocket’s subscribers were left in a lurch with no telephone service. Today, the telephone is a basic service essential for customers: individual subscribers, small business owners or college students. This spectrum of subscribers in most cases draw their livelihood using a telephone. These cost-sensitive subscribers get easily wooed to low-cost VOIP services provided by “startup” providers. But how do subscribers protect themselves in situations like these? SunRocket had no transition plan for their customers and all they were left with was with a notice on their website. On account of the subscribers, the following should be addressed.
- FCC not having a policy to protect subscribers in cases like these
- VC firms backing up companies providing essential services should be held responsible. Mayfield Ventures which backed SunRocket has conveniently sidelined itself! Lack of business planning was one of the major reasons for their demise
- There should be minimum capital with the company at all times to accommodate these situations
- There should be clear directives to these companies to transition subscribers to another provider in case of a failure
Do you want your essential services managed and operated by a “startup”? I am not sure. Imagine you entrust your electricity services or your heart pacemaker in the hands of a “startup”? Would you do that?
Tuesday, July 10, 2007
Interesting puzzle II
P(x) returns:
true if the number of 1 bits set in the
binary representation of x is prime,
false otherwise.
Next, consider the following function prime_bits:
uint64_t prime_bits(uint64_t a, uint64_t b);
Your implementation should be efficient, and it should be wrapped up nicely such that one can specify a and b on the commandline when running your program. You may expect the range of a and b to be limited to non-negative 64-bit integers, though it would certainly be uncouth for your algorithm to break down for larger values.
Your implementation should have a running time faster than O(n), where n is b - a.
Interesting puzzle I
On an otherwise uneventful visit to one of these casinos, your dear mother has had the misfortune to be enslaved by an evil gambling monster. I call him Gamblor, and it is time to snatch her away from his neon claws.[1]1 ---- 2 ---- 3
| | |
| | |
4 ---- 5 ---- 6
| | |
| | |
7 ---- 8 ---- 9
Unfortunately, Gamblor demands the payment of a great deal of money in return for releasing his hostage.
Luckily, you are a psychic computer scientist. With your powers, you can predict in advance over the next 30 days how much you would win (or lose) if you played at a particular casino on that day. This schedule of winnings is represented by the following nine 30-element arrays:
Travel routes between the casinos are represented by the following adjoinment matrix:wins1 = [ 53,-84, 50,-73, 54, 60, 74, 22,-63,-78, 75, 72,
-46, 99,-33, 24, 6,-66, 77,-61,-60,-46,-52, 84,
91,-21,-52,-72,-39,-41]
wins2 = [ 77,-86,-25, 27,-59,-71,-13,-85, 50, 24,-63, 26,
-4,-10, 25, 62,-85,-68, 96, 92,-29,-64,-54, 18,
-79,-62, 97,-32,-35,-42]
wins3 = [ 27,-57,-28,-98, 69, 12,-70,-43, 27, 80, 80, 64,
6,-23,-45,-68,-60,-31,-36,-63,-39, 34,-27, 7,
-47, -7, 44,-50, 60,-90]
wins4 = [ 7,-12,-48, 79,-11,-78, -8, 19,-21,-81, -1,-40,
83,-95, 36,-62,-63, 76, 6, 0,-87, 67,-66,-15,
-26,-14, 78,-81, 36, 38]
wins5 = [-71,-56,-73,-20,-77, 15, 2, 14,-66, 81, 33, 33,
-59, 16, 37, 77, 53, 73, 53,-40,-26, 66,-73, 7,
-48, 1, 93,-70, 19, 30]
wins6 = [ 68, 47, 73, 94,-72, 96, 10, 30, 11, 44, 11,-56,
-23, 51, 60,-86, 29, 13, 87,-17, 73,-39,-51,-99,
68, 1, 1, 62, 30,-79]
wins7 = [ -8, -1, 68,-34, -7, 96,-37,-96, 26, 73, 47,-62,
-83,-76, 89, 77,-62, 18, -9,-75,-99,-36,-14,-50,
-36,-45, 50, 64,-83,-19]
wins8 = [ 85, 9, 79, 53, 75,-28, 49,-62,-25,-24,-89,-77,
13,-72,-54, 2,-95,-17,-80, -5, 8,-79, 59, 93,
-30,-77,-51,-79, 87,-35]
wins9 = [ 1, 72, 74,-20, 26, 49, 52,-25, 86,-72, 50, 97,
-50,-36,-74, -4, 65,-70, 78, 85, 25,-14,-93,-16,
-20,-24, 7, 28, -3, -5]
You begin on the first day at the location of casino 1.adj = [[1, 1, 0, 1, 0, 0, 0, 0, 0],
[1, 1, 1, 0, 1, 0, 0, 0, 0],
[0, 1, 1, 0, 0, 1, 0, 0, 0],
[1, 0, 0, 1, 1, 0, 1, 0, 0],
[0, 1, 0, 1, 1, 1, 0, 1, 0],
[0, 0, 1, 0, 1, 1, 0, 0, 1],
[0, 0, 0, 1, 0, 0, 1, 1, 0],
[0, 0, 0, 0, 1, 0, 1, 1, 1],
[0, 0, 0, 0, 0, 1, 0, 1, 1]]
For example, if you were at casino #1 on day 1, you would win $53 if you decided to play. Later, if you were at casino #3 on day 4, you would lose $98 if you decided to play. Since you can only travel the distance of one route every night, you cannot reach all the casinos right away - e.g. you would not be able to play at casino #6 on the first day to win $68.
The casino owners don't like your special abilities, but they have agreed to let you play subject to the following conditions:
- At the beginning of the 30 days, you may either begin playing at your current casino immediately or decide to wait until the next day.
- Once you begin playing, you must play each consecutive day until you stop.
- Once you stop playing, you may not play again.
You cannot play a fraction of a day; if a particular day is one where you have chosen to play, you will earn the predicted win or loss for that day.
You wish to determine how many N >= 0 days to not play, how many subsequent M >= 0 consecutive days to play (and how many remaining K >= 0 days you also don't play), and the path to travel between casinos during this 30-day time period such that you maximize your total winnings.
Saturday, June 02, 2007
What Every Computer Scientist Should Know About Floating-Point Arithmetic:
What Every Computer Scientist Should Know About Floating-Point Arithmetic:
http://www.esatechnology.com/library/math/floatingmath.pdf
Tuesday, April 17, 2007
In rememberence for the victims of the Virginia Tech tragedy
-- Nikki Giovanni, University Distinguished Professor at Virginia Tech, poet, activist
Read the spirited address of Nikki to the students of Virginia Tech.
ॐ शांति शांति
वासुदेव कुटुम्बकम ('The whole of earth is a family')
Thursday, April 05, 2007
How long will I take to transfer a petabyte from my home
My DSL connection is 2Mbit/sec on average
So to transfer 1 petabyte from my home it will take approximately 127 years!
USPS can do it much faster than this for sure if you have a drive with that storage ;-)
Wednesday, April 04, 2007
Gore challenges Embedded Designers at ESC 2007
Al Gore's keynote address at the Embedded Systems Conference in San Jose stressed the role of his audience in dealing with the climate crisis, which he referred to as "the moral imperative of our day" and compared it to the launching of Sputnik by the Soviet Union. "For the most part, the effect of population on our climate is balancing itself out over many years, while technology has dramatically accelerated the rate of which the climate has been affected over the past 50 years," he said. "We need to have a much finer-grain mix of money and intelligence in generating our public policies that affect this crisis." Designers must rethink systems to eliminate the "grossly inefficient systems running or energy economy," and create architectures that are built around the idea of energy efficiency, he said. Among his recommendations was to incorporate parallel processing in our day-to-day lives to "alleviate inefficient computing paradigms." Gore also noted the loss of interest in science and engineering among U.S. students, and that designers can impact this trend by displaying the way engineers can change the world and avoid crisis. If the threat level posed by climate change could equal that of Sputnik, the concept could achieve a "moral authority" for change, he said. "Once the possible threat was understood, President Kennedy's goal of landing a man on the moon was achieved fairly quickly."
Technology future is bright
Open Source GPLv3
Tuesday, March 06, 2007
Software Reliability
Interesting read and a awakening call.
"The new US stealth fighter, the F-22 Raptor, was deployed for the first time to Asia earlier this month. On Feb. 11, twelve Raptors flying from Hawaii to Japan were forced to turn back when a software glitch crashed all of the F-22s' on-board computers as they crossed the international date line. The delay in arrival in Japan was previously reported, with rumors of problems with the software. CNN television, however, this morning reported that every fighter completely lost all navigation and communications when they crossed the international date line. They reportedly had to turn around and follow their tankers by visual contact back to Hawaii. According to the CNN story, if they had not been with their tankers, or the weather had been bad, this would have been serious.
http://www.dailytech.com/Lockheeds+F22+Raptor+Gets+Zapped+by+International+Date+Line/article6225.html
Sunday, February 18, 2007
Hyper-Connectivity
John Reese's blog on Hyper-Connectivity has a lot of thought provoking implications for the networking industry. Here were are in the world of 3G, WiFi et al, and yet don't have an ability to be continuously connected. Instead we have continual connections to the network. 4G has a lot of promises in store but how do we have a standardized ubiquitous network that provides access to people irrespective of their geographical location. The Internet is a great equalizer but for countries with poor communications infrastructure are at a big disadvantage. What is needed today is apart from <$100 laptops is a cost effective access to the network. The current dependence of the Internet in spite of its changing traffic patterns over the years has cemented Sun's motto of "The Network is the Computer". I wish one day I will be able to stack all my information on the network in a secure and dependable fashion, thereby reducing the burden on millions of people upgrading their Operating Systems and hardware.
Quantum Computer
A company in Canada(www.dwavesys.com) has demonstrated a successful quantum computer. Alan Turing's Universal Turing Machine has been disproved by the latest advancement of computers in the last two decades. Now with the demonstration by D-Wave Systems, the possibilities are endless for applications of QCs in which computation is based on states called qubits, which is a unique quantum state. The biggest challenge has been quantum hardware which has been a emerging field. D-Wave Systems seems to have broken the ice and have pioneered the first successful quantum computer. The prediction that quantum computers will emerge as the superior computational devices at the very least, and perhaps one day make today's modern computer obsolete is practically true now.
Quantum computation has its origins in highly specialized fields of theoretical physics, but its future undoubtedly lies in the profound effect it will have on the lives of all mankind.
I wonder if the renowned computer manufacturers like HP, IBM etc are working on these and what effects will it have on software(Is Google doing something here?).
Thursday, February 15, 2007
System performance
Not everything that is counted counts, and not everything that counts can be counted.
- Albert Einstein
