ODF Toolkit vs. jOpenDocument

Openoffice.org API allows Java developers to access (read/write/export) the different supported fileformats within OpenOffice.org. The Drawback of this solution is that OpenOffice.org must be installed on client machine to enable your Java application to bootstrap the default OpenOffice.org process on the user machine.This constitutes a limitation, as every Java application using Openoffice API must ship also an OpenOffice.org installation or require user to install it before using the application.
The answer to this Limitation is the ODF Toolkit Project. this library can manipulate ODF files without worrying if OpenOffice.org is installed on client machine.
ODF Toolkit is Great tool but has its limitations too . it is currently only able to read/write ODF files but there is no option to export ODF files as PDF or any other non-ODF format. Sadly, the ODF Toolkit has currently no converters included within the project.
with more research i found another project jOpenDocument which seems to be similar to ODF Project . It is A pure Java library for OASIS Open Document files manipulation . One Great feature of jOpenDocument is that it can be used to create PDF files from ODF files. PDF generation with jOpenDocument requires also the use of the iText library. The iText library is available for free under a multiple license: MPL and LGPL.

Read this tutorial about how to Create a PDF document from a spreadsheet using jOpenDocument and iText.

Advertisements

Algebraic Geometry might solve the P vs. NP challenge

When i first read the cover article in the September Communications of the ACM, I had the feeling that this article was not ordinary and would raise much attention among computer science specialists and even the curious average reader. The subject of the article was very amazing and the reader could not resist the tempting Idea to wonder about this beautiful -Still Not Found- World of P=NP.
The article did Indeed took its promise and more than 10 times the usual number of readers downloaded this popular article. This success was also quoted by NY Times science and technology reporter John Markoff who highlights the allure of the P vs. NP challenge. He reports that if this grand challenge for theoretical computer science and complexity theory is proven, some of the hardest computing challenges may collapse, leading to burst of new economic and technological productivity.
Another reaction to the article was by Communications Editor in Chief Moshe Vardi. He predicts that to investigate the P vs. NP problem, computer scientists may have to start learning a very difficult mathematical field known as algebraic geometry, which offers some hope for proving or disproving the problem.