<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/pick600"><title>BibSonomy bookmarks for /user/pick600</title><link>https://www.bibsonomy.org/user/pick600</link><description>BibSonomy RSS Feed for /user/pick600</description><items><rdf:Seq><rdf:li rdf:resource="http://www.informaworld.com/smpp/1346323483-23225207/content~db=all?content=10.1080/713821211"/><rdf:li rdf:resource="http://www.sciam.com/article.cfm?id=science-2-point-0"/><rdf:li rdf:resource="http://textcite.sourceforge.net/index.html"/><rdf:li rdf:resource="http://en.wikipedia.org/wiki/Comparison_of_reference_management_software"/><rdf:li rdf:resource="http://cf.uba.uva.nl/nl/projecten/academic_social_referencing.pdf"/><rdf:li rdf:resource="http://refbase.sourceforge.net/"/><rdf:li rdf:resource="http://link.aip.org/link/?OPEGAR/47/57003/1"/><rdf:li rdf:resource="http://www.iop.org/EJ/abstract/0266-5611/24/3/034002"/></rdf:Seq></items></channel><item rdf:about="http://www.informaworld.com/smpp/1346323483-23225207/content~db=all?content=10.1080/713821211"><title>A Regularized Iterative Algorithm for Limited-angle Inverse Radon Transform -    Journal of Modern Optics</title><description></description><link>http://www.informaworld.com/smpp/1346323483-23225207/content~db=all?content=10.1080/713821211</link><dc:creator>pick600</dc:creator><dc:date>2008-09-01T10:38:23+02:00</dc:date><dc:subject>&#034;Gerchberg-Papoulis algorithm&#034; tomography </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-09-01T10:38:23+02:00&#034; href=&#034;http://www.informaworld.com/smpp/1346323483-23225207/content~db=all?content=10.1080/713821211&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.informaworld.com/smpp/1346323483-23225207/content~db=all?content=10.1080/713821211&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/&#034;Gerchberg-Papoulis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm&#034;"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tomography"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.sciam.com/article.cfm?id=science-2-point-0"><title>Science 2.0 -- Is Open Access Science the Future?: Scientific American</title><description>Science 2.0 generally refers to new practices of scientists who post raw experimental results, nascent theories, claims of discovery and draft papers on the Web for others to see and comment on.

Proponents say these “open access” practices make scientific progress more collaborative and therefore more productive.

Critics say scientists who put preliminary findings online risk having others copy or exploit the work to gain credit or even patents.

Despite pros and cons, Science 2.0 sites are beginning to proliferate; one notable example is the OpenWetWare project started by biological engi­neers at the Massachusetts Institute of Technology.
</description><link>http://www.sciam.com/article.cfm?id=science-2-point-0</link><dc:creator>pick600</dc:creator><dc:date>2008-07-08T14:15:30+02:00</dc:date><dc:subject>Science2.0 open_access </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Science 2.0 generally refers to new practices of scientists who post raw experimental results, nascent theories, claims of discovery and draft papers on the Web for others to see and comment on.

Proponents say these “open access” practices make scientific progress more collaborative and therefore more productive.

Critics say scientists who put preliminary findings online risk having others copy or exploit the work to gain credit or even patents.

Despite pros and cons, Science 2.0 sites are beginning to proliferate; one notable example is the OpenWetWare project started by biological engi­neers at the Massachusetts Institute of Technology.
&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Science2.0"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/open_access"/></rdf:Bag></taxo:topics></item><item rdf:about="http://textcite.sourceforge.net/index.html"><title>TextCite Publication Quotation Manager</title><description></description><link>http://textcite.sourceforge.net/index.html</link><dc:creator>pick600</dc:creator><dc:date>2008-07-08T14:09:05+02:00</dc:date><dc:subject>bibliographic_reference_manager </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-07-08T14:09:05+02:00&#034; href=&#034;http://textcite.sourceforge.net/index.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://textcite.sourceforge.net/index.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bibliographic_reference_manager"/></rdf:Bag></taxo:topics></item><item rdf:about="http://en.wikipedia.org/wiki/Comparison_of_reference_management_software"><title>Comparison of reference management software - Wikipedia, the free encyclopedia</title><description></description><link>http://en.wikipedia.org/wiki/Comparison_of_reference_management_software</link><dc:creator>pick600</dc:creator><dc:date>2008-07-08T14:08:39+02:00</dc:date><dc:subject>bibliographic_reference_manager </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-07-08T14:08:39+02:00&#034; href=&#034;http://en.wikipedia.org/wiki/Comparison_of_reference_management_software&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://en.wikipedia.org/wiki/Comparison_of_reference_management_software&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bibliographic_reference_manager"/></rdf:Bag></taxo:topics></item><item rdf:about="http://cf.uba.uva.nl/nl/projecten/academic_social_referencing.pdf"><title>Academic Social Referencing tools: a user trial withBibSonomy and Cite-U-Like organized by the Library of theUniversity of Amsterdam</title><description></description><link>http://cf.uba.uva.nl/nl/projecten/academic_social_referencing.pdf</link><dc:creator>pick600</dc:creator><dc:date>2008-07-08T14:07:57+02:00</dc:date><dc:subject>bibliographic_reference_manager </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-07-08T14:07:57+02:00&#034; href=&#034;http://cf.uba.uva.nl/nl/projecten/academic_social_referencing.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://cf.uba.uva.nl/nl/projecten/academic_social_referencing.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bibliographic_reference_manager"/></rdf:Bag></taxo:topics></item><item rdf:about="http://refbase.sourceforge.net/"><title>refbase -- Web Reference Database</title><description></description><link>http://refbase.sourceforge.net/</link><dc:creator>pick600</dc:creator><dc:date>2008-07-08T14:06:44+02:00</dc:date><dc:subject>bibliographic_reference_manager </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-07-08T14:06:44+02:00&#034; href=&#034;http://refbase.sourceforge.net/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://refbase.sourceforge.net/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bibliographic_reference_manager"/></rdf:Bag></taxo:topics></item><item rdf:about="http://link.aip.org/link/?OPEGAR/47/57003/1"><title>Robustness analysis of image watermarking based on discrete fractional random transform</title><description>The robustness of a watermarking scheme based on the discrete fractional random transform has been investigated and demonstrated to be superior to those based on the discrete cosine transform, discrete fractional Fourier transform, and discrete Fourier transform. The spectrum distribution of the discrete fractional random transform is random and uniform, which guarantees good robustness. In addition, the discrete fractional random transform itself can serve as a secret key, and can provide high ...</description><link>http://link.aip.org/link/?OPEGAR/47/57003/1</link><dc:creator>pick600</dc:creator><dc:date>2008-07-06T11:40:21+02:00</dc:date><dc:subject>watermarking </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;The robustness of a watermarking scheme based on the discrete fractional random transform has been investigated and demonstrated to be superior to those based on the discrete cosine transform, discrete fractional Fourier transform, and discrete Fourier transform. The spectrum distribution of the discrete fractional random transform is random and uniform, which guarantees good robustness. In addition, the discrete fractional random transform itself can serve as a secret key, and can provide high ...&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/watermarking"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.iop.org/EJ/abstract/0266-5611/24/3/034002"><title>Smoothing noisy data via regularization: statistical perspectives</title><description></description><link>http://www.iop.org/EJ/abstract/0266-5611/24/3/034002</link><dc:creator>pick600</dc:creator><dc:date>2008-06-28T07:04:31+02:00</dc:date><dc:subject>regularization </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-06-28T07:04:31+02:00&#034; href=&#034;http://www.iop.org/EJ/abstract/0266-5611/24/3/034002&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.iop.org/EJ/abstract/0266-5611/24/3/034002&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/regularization"/></rdf:Bag></taxo:topics></item></rdf:RDF>