28 Oct 08 Microsoft Unveils Browser-Based Office Apps

snydeq writes "Microsoft followed up its Windows Azure unveiling by announcing that it will deliver lightweight versions of Word, Excel, PowerPoint, and OneNote through the browser, a la Google Apps. Surprisingly, Office Web applications will run in Firefox and Safari, not just Internet Explorer. Far less shocking: You won't get Office Web apps free and clear as you do Google apps. The apps are meant to be an extension to locally installed instances of the next version of Microsoft Office, the same way Outlook Web Access provides access to mail without the fat Outlook client."

Read more of this story at Slashdot.

Tagi: outlook web access, google apps, versis, outlook client, office apps, slashdot, google, office web, web apps, microsoft office, unveiling, firefox, safari, instances, microsoft

03 Oct 09 "Windows 7 Compatible" PCs Must Be 64-bit

Barence writes "Microsoft has started certifying PCs as 'compatible with Windows 7' — and is looking to avoid the mistakes that dogged the Vista-Capable scheme. Whereas Microsoft certified PCs that could only run Vista Home Basic last time around, this time PCs will have to work with all versions of Windows 7 to qualify for the sticker, including 64-bit versions of the OS. Microsoft also claims, 'products that receive the logo are checked for common issues to minimize the number of crashes, hangs, and reboots experienced by the user.'"

Read more of this story at Slashdot.

Tagi: versis, time pcs, compatible pcs, slashdot, th time, microsoft certified, mdash, crashes, last time, microsoft

21 Oct 09 Your Favorite NP-Complete Cheat

Have you ever heard a software engineer refer to a problem as "NP-complete"? That's fancy computer science jargon shorthand for "incredibly hard":

The most notable characteristic of NP-complete problems is that no fast solution to them is known; that is, the time required to solve the problem using any currently known algorithm increases very quickly as the size of the problem grows. As a result, the time required to solve even moderately large versions of many of these problems easily reaches into the billions or trillions of years, using any amount of computing power available today. As a consequence, determining whether or not it is possible to solve these problems quickly is one of the principal unsolved problems in Computer Science today.

While a method for computing the solutions to NP-complete problems using a reasonable amount of time remains undiscovered, computer scientists and programmers still frequently encounter NP-complete problems. An expert programmer should be able to recognize an NP-complete problem so that he or she does not unknowingly waste time trying to solve a problem which so far has eluded generations of computer scientists.

You do want to be an expert programmer, don't you? Of course you do!

NP-complete problems are like hardcore pornography. Nobody can define what makes a problem NP-complete, exactly, but you'll know it when you see it. Just this once, I'll refrain from my usual practice of inserting images to illustrate my point.

(Update: I was shooting for a poetic allusion to the P=NP problem here but based on the comments this is confusing and arguably incorrect. So I'll redact this sentence. Instead, I point you to this P=NP poll (pdf); read the comments from CS professors (including Knuth) to get an idea of how realistic this might be.)

Instead, I'll recommend a book Anthony Scian recommended to me: Computers and Intractability: A Guide to the Theory of NP-Completeness.

Like all the software engineering books I recommend, this book has a timeless quality. It was originally published in 1979, a shining testament to smart people attacking truly difficult problems in computer science: "I can't find an efficient algorithm, but neither can all these famous people."

So how many problems are NP-complete? Lots.

Even if you're a layman, you might have experienced NP-Completeness in the form of Minesweeper, as Ian Stewart explains. But for programmers, I'd argue the most well known NP-completeness problem is the travelling salesman problem.

Given a number of cities and the costs of travelling from any city to any other city, what is the least-cost round-trip route that visits each city exactly once and then returns to the starting city?

The brute-force solution -- trying every possible permutation between the cities -- might work for a very small network of cities, but this quickly becomes untenable. Even if we were to use theoretical CPUs our children might own, or our children's children. What's worse, every other algorithm we come up with to find an optimal path for the salesman has the same problem. That's the common characteristic of NP-complete problems: they are exercises in heuristics and approximation, as illustrated by this xkcd cartoon:

What do expert programmers do when faced by an intractable problem? They cheat. And so should you! Indeed, some of the modern approximations for the Travelling Salesman Problem are remarkably effective.

Various approximation algorithms, which quickly yield good solutions with high probability, have been devised. Modern methods can find solutions for extremely large problems (millions of cities) within a reasonable time, with a high probability of being just 2-3% away from the optimal solution.

Unfortunately, not all NP-complete problems have good approximations. But for those that do, I have to wonder: if we can get so close to an optimal solution by cheating, does it really matter if there's no known algorithm to produce the optimal solution? If I've learned nothing else from NP-complete problems, I've learned this: sometimes coming up with clever cheats can be more interesting than searching in vain for the perfect solution.

Consider the First Fit Decreasing algorithm for the NP-complete Bin Packing problem . It's not perfect, but it's incredibly simple and fast. The algorithm is so simple, in fact, it is regularly demonstrated at time management seminars. Oh, and it guarantees that you will get within 22% of the perfect solution every time. Not bad for a lousy cheat.

So what's your favorite NP-complete cheat?

[advertisement] Peer code review without meetings, paperwork, or stopwatches? No wonder Code Collaborator won the Jolt Award.

Tagi: expert programmer, np problem, cs professors, hardcore pornography, versis, inserting images, fancy computer, billis, solutis, problems in computer, comete, software engineer, timeless quality, engineering books, knuth, computing power, unsolved problems,

06 Nov 09 IBM announces new beta services for cloud software development

IBM announced on Thursday beta versions of new services aimed at developers who want to create and deploy applications on public and private clouds.

Like other vendors, such as Skytap, IBM is pushing cloud services as a way for programmers to get access to computing power quickly, something that can be difficult if many in-house projects are occurring and on-site computing resources are scarce. With the Smart Business Development and Test service, which runs on IBM's public cloud, developers can get a working environment in minutes, according to the vendor.

Tagi: beta services, envirment, versis, test service, smart business, computing resources, computing power, business development, software development, programmers, clouds, developers, skytap

06 Nov 09 Old Android devices may not support Android 2.0

With this week's release of Verizon Wireless' Droid phone comes the first real test of the potential for fragmentation with Android. The Droid will be the first phone to run Android 2.0. After it goes on sale Friday, there will be Android phones on the market running three different versions of the OS.

Tagi: veriz wireless, versis, droid, phe