<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel rdf:about="http://blogmarks.net/api/marks/search/probability">
<title>Public marks with search probability</title>
<description>Public marks with search probability</description>
<link>http://blogmarks.net/marks/search/probability</link>
<items><rdf:Seq><rdf:li resource="http://blogmarks.net/api/user/tadeufilippini/mark/1058501395"/>
<rdf:li resource="http://blogmarks.net/api/user/karlcow/mark/1058338841"/>
<rdf:li resource="http://blogmarks.net/api/user/ogrisel/mark/1058032351"/>
<rdf:li resource="http://blogmarks.net/api/user/greut/mark/1057575895"/>
<rdf:li resource="http://blogmarks.net/api/user/ogrisel/mark/1057479394"/>
<rdf:li resource="http://blogmarks.net/api/user/ogrisel/mark/1057452227"/>
<rdf:li resource="http://blogmarks.net/api/user/cyberien/mark/1057210081"/>
<rdf:li resource="http://blogmarks.net/api/user/pvergain/mark/1741894"/>
<rdf:li resource="http://blogmarks.net/api/user/cyberien/mark/1330541"/>
<rdf:li resource="http://blogmarks.net/api/user/jlesage/mark/1311071"/>
<rdf:li resource="http://blogmarks.net/api/user/ogrisel/mark/1135501"/>
<rdf:li resource="http://blogmarks.net/api/user/YukuanMark/mark/1146382"/>
<rdf:li resource="http://blogmarks.net/api/user/redivider/mark/1165415"/>
<rdf:li resource="http://blogmarks.net/api/user/4004/mark/674455"/>
<rdf:li resource="http://blogmarks.net/api/user/nhoizey/mark/657925"/>
<rdf:li resource="http://blogmarks.net/api/user/multilinko/mark/640164"/>
<rdf:li resource="http://blogmarks.net/api/user/JayFre/mark/482530"/>
<rdf:li resource="http://blogmarks.net/api/user/geo892/mark/341618"/>
<rdf:li resource="http://blogmarks.net/api/user/geo892/mark/341611"/>
<rdf:li resource="http://blogmarks.net/api/user/geo892/mark/341591"/>
<rdf:li resource="http://blogmarks.net/api/user/brodrigu/mark/380928"/>
<rdf:li resource="http://blogmarks.net/api/user/geosblogs/mark/303506"/>
<rdf:li resource="http://blogmarks.net/api/user/geosblogs/mark/303499"/>
<rdf:li resource="http://blogmarks.net/api/user/geosblogs/mark/303479"/>
<rdf:li resource="http://blogmarks.net/api/user/hokinkong/mark/192411"/>
</rdf:Seq></items>
</channel>
<item rdf:about="http://blogmarks.net/api/user/tadeufilippini/mark/1058501395">
<title>Cambridge Grammar for First Certificate (book audio)</title>
<link>http://www.ingilizcepratik.net/cambridge-grammar-for-first-certificate-book-audio-t-18386.html</link>
<description>Cambridge Grammar for First Certificate (book audio)

Intermediate to Upper-intermediate

This book provides complete coverage of the grammar needed for the Cambridge FCE exam, and develops listening skills at the same time. It includes the full range of FCE exam tasks from the Reading, Writing, Listening, and Use of English papers, and contains helpful grammar explanations and a grammar glossary.

Contents
1. Present tenses: Present simple, present continuous, state verbs;
2. Past tenses: Past simple, past continuous, used to (and to be used to), would;
3. Present perfect simple and past simple: Present perfect and past simple, present perfect simple and continuous;
4. Past perfect: Past perfect simple and continuous;
5. Future 1: Present tenses, will, future continuous;
6. Future 2: Going to, future in the past, present after time adverbs, future perfect, to be about to;
7. Adjectives: Comparative and superlative adjectives, position, order, adjectives ending in -ing and -ed;
8. Adverbs: Formation, adverbs and adjectives easily confused, comparative and superlative adverbs, modifiers, position;
9. Questions: Yes / no questions, short answers, question words, question tags, agreeing;
10. Countable and uncountable nouns, articles: Countable and uncountable nouns, a, the and no article, special uses articles;
11. Pronouns and determiners: Possessives, reflexive pronouns, each other etc, there and it, someone etc, all, most and some, each and every, both, neither etc;
12. Modals 1: Use of modals, obligation, necessity;
13. Modals 2: Permission, requests, offers, suggestions, orders, advice;
14. Modals 3: Ability, deduction: certainty, probability and possibility;
15. Passive: Passive, to have something done;
16. Reported speech: Reporting about the past, reporting about the present, verbs used for reporting, questions;
17. Verbs followed by to-infinitive or -ing: Verb + to-infinitive, verb + infinitive without to, verb + -ing, verb + object + to-infinitive, verb + that, adjectives;
18. Phrasal verbs: Meaning and form, verb + preposition, verb + adverb, verb + preposition + adverb;
19. Conditionals 1: Zero, first, second and third conditionals, mixed conditionals;
20. Conditionals 2: Unless, in case, as / so long as, provided that, I wish / if only, it’s time, I’d rather, otherwise / or else; 21. Prepositions 1: Prepositions of place and time;
22. Prepositions 2: Prepositions which follow verbs and adjectives, prepositions to express who, how and why, expressions with prepositions;
23. Relative clauses: Defining and non-defining relative clauses, relative pronouns and prepositions;
24. Linking words 1: Because, as and since, so and therefore, in order to, to + infinitive and so (that), so and such, enough and too;
25. Linking words 2: In spite of and despite, but, although and though, even though and even if, participle clauses, before and after + -ing, when, while and since + -ing.
</description>
<dc:date>2009-09-13T00:45:37Z</dc:date>
<dc:author>tadeufilippini</dc:author>
<dc:subject>cambridge firstcertificate, cambridge grammar, grammar cambridge, ingilizcepratik english, ingilizcepratik, english ingilizcepratik, certificate, first certificate, certificate first, firstcertificate, firstcertificate cambridge</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.ingilizcepratik.net/cambridge-grammar-for-first-certificate-book-audio-t-18386.html"><img border="0" src="http://blogmarks.net/screenshots/2009/09/13/ddeb5a6bef512650236b8b650352f038.jpg" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.ingilizcepratik.net/cambridge-grammar-for-first-certificate-book-audio-t-18386.html">Cambridge Grammar for First Certificate (book audio)</a></h4>
 
by <a href="http://blogmarks.net/user/tadeufilippini">tadeufilippini</a> 
<p class="description">Cambridge Grammar for First Certificate (book audio)

Intermediate to Upper-intermediate

This book provides complete coverage of the grammar needed for the Cambridge FCE exam, and develops listening skills at the same time. It includes the full range of FCE exam tasks from the Reading, Writing, Listening, and Use of English papers, and contains helpful grammar explanations and a grammar glossary.

Contents
1. Present tenses: Present simple, present continuous, state verbs;
2. Past tenses: Past simple, past continuous, used to (and to be used to), would;
3. Present perfect simple and past simple: Present perfect and past simple, present perfect simple and continuous;
4. Past perfect: Past perfect simple and continuous;
5. Future 1: Present tenses, will, future continuous;
6. Future 2: Going to, future in the past, present after time adverbs, future perfect, to be about to;
7. Adjectives: Comparative and superlative adjectives, position, order, adjectives ending in -ing and -ed;
8. Adverbs: Formation, adverbs and adjectives easily confused, comparative and superlative adverbs, modifiers, position;
9. Questions: Yes / no questions, short answers, question words, question tags, agreeing;
10. Countable and uncountable nouns, articles: Countable and uncountable nouns, a, the and no article, special uses articles;
11. Pronouns and determiners: Possessives, reflexive pronouns, each other etc, there and it, someone etc, all, most and some, each and every, both, neither etc;
12. Modals 1: Use of modals, obligation, necessity;
13. Modals 2: Permission, requests, offers, suggestions, orders, advice;
14. Modals 3: Ability, deduction: certainty, probability and possibility;
15. Passive: Passive, to have something done;
16. Reported speech: Reporting about the past, reporting about the present, verbs used for reporting, questions;
17. Verbs followed by to-infinitive or -ing: Verb + to-infinitive, verb + infinitive without to, verb + -ing, verb + object + to-infinitive, verb + that, adjectives;
18. Phrasal verbs: Meaning and form, verb + preposition, verb + adverb, verb + preposition + adverb;
19. Conditionals 1: Zero, first, second and third conditionals, mixed conditionals;
20. Conditionals 2: Unless, in case, as / so long as, provided that, I wish / if only, it’s time, I’d rather, otherwise / or else; 21. Prepositions 1: Prepositions of place and time;
22. Prepositions 2: Prepositions which follow verbs and adjectives, prepositions to express who, how and why, expressions with prepositions;
23. Relative clauses: Defining and non-defining relative clauses, relative pronouns and prepositions;
24. Linking words 1: Because, as and since, so and therefore, in order to, to + infinitive and so (that), so and such, enough and too;
25. Linking words 2: In spite of and despite, but, although and though, even though and even if, participle clauses, before and after + -ing, when, while and since + -ing.
</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/cambridge%2Bfirstcertificate">cambridge firstcertificate</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/cambridge%2Bgrammar">cambridge grammar</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/grammar%2Bcambridge">grammar cambridge</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/ingilizcepratik%2Benglish">ingilizcepratik english</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/ingilizcepratik">ingilizcepratik</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/english%2Bingilizcepratik">english ingilizcepratik</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/certificate">certificate</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/first%2Bcertificate">first certificate</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/certificate%2Bfirst">certificate first</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/firstcertificate">firstcertificate</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/firstcertificate%2Bcambridge">firstcertificate cambridge</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1058501395">Copy</a> | 
<a href="http://blogmarks.net/link/3341046">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/karlcow/mark/1058338841">
<title>Statistical Data Mining Tutorials</title>
<link>http://www.autonlab.org/tutorials/</link>
<description>&lt;blockquote&gt;&lt;p&gt;set of tutorials on many aspects of statistical data mining, including the foundations of probability, the foundations of statistical data analysis, and most of the classic machine learning and data mining algorithms.&lt;/p&gt;&lt;/blockquote&gt;</description>
<dc:date>2009-05-28T01:07:25Z</dc:date>
<dc:author>karlcow</dc:author>
<dc:subject>stats, datavisualization</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.autonlab.org/tutorials/"><img border="0" src="http://blogmarks.net/screenshots/2009/05/28/b8f04622a7caa4c917bb40c8610f3b10.jpg" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.autonlab.org/tutorials/">Statistical Data Mining Tutorials</a></h4>
 
by <a href="http://blogmarks.net/user/karlcow">karlcow</a> 
<div class="description"><blockquote><p>set of tutorials on many aspects of statistical data mining, including the foundations of probability, the foundations of statistical data analysis, and most of the classic machine learning and data mining algorithms.</p></blockquote></div>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/stats">stats</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/datavisualization">datavisualization</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1058338841">Copy</a> | 
<a href="http://blogmarks.net/link/3209343">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/ogrisel/mark/1058032351">
<title>Conditional Random Fields</title>
<link>http://www.inference.phy.cam.ac.uk/hmw26/crf/</link>
<description>Conditional random fields (CRFs) are a probabilistic framework for labeling and segmenting structured data, such as sequences, trees and lattices. The underlying idea is that of defining a conditional probability distribution over label sequences given a particular observation sequence, rather than a joint distribution over both label and observation sequences. The primary advantage of CRFs over hidden Markov models is their conditional nature, resulting in the relaxation of the independence assumptions required by HMMs in order to ensure tractable inference. Additionally, CRFs avoid the label bias problem, a weakness exhibited by maximum entropy Markov models (MEMMs) and other conditional Markov models based on directed graphical models. CRFs outperform both MEMMs and HMMs on a number of real-world tasks in many fields, including bioinformatics, computational linguistics and speech recognition.</description>
<dc:date>2008-10-23T15:06:26Z</dc:date>
<dc:author>ogrisel</dc:author>
<dc:subject>crf, conditional random fields, machine learning, ai, tutorial</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.inference.phy.cam.ac.uk/hmw26/crf/"><img border="0" src="http://blogmarks.net/screenshots/2008/10/23/a0f1d2225180fcda66ef4516260e1b32.jpg" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.inference.phy.cam.ac.uk/hmw26/crf/">Conditional Random Fields</a></h4>
 
by <a href="http://blogmarks.net/user/ogrisel">ogrisel</a> 
<p class="description">Conditional random fields (CRFs) are a probabilistic framework for labeling and segmenting structured data, such as sequences, trees and lattices. The underlying idea is that of defining a conditional probability distribution over label sequences given a particular observation sequence, rather than a joint distribution over both label and observation sequences. The primary advantage of CRFs over hidden Markov models is their conditional nature, resulting in the relaxation of the independence assumptions required by HMMs in order to ensure tractable inference. Additionally, CRFs avoid the label bias problem, a weakness exhibited by maximum entropy Markov models (MEMMs) and other conditional Markov models based on directed graphical models. CRFs outperform both MEMMs and HMMs on a number of real-world tasks in many fields, including bioinformatics, computational linguistics and speech recognition.</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/crf">crf</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/conditional%2Brandom%2Bfields">conditional random fields</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/machine%2Blearning">machine learning</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/ai">ai</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/tutorial">tutorial</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1058032351">Copy</a> | 
<a href="http://blogmarks.net/link/2942629">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/greut/mark/1057575895">
<title>Statistical Data Mining Tutorials</title>
<link>http://www.autonlab.org/tutorials/index.html</link>
<description>&lt;blockquote&gt;&lt;p&gt;The following links point to a set of tutorials on many aspects of statistical data mining, including the foundations of probability, the foundations of statistical data analysis, and most of the classic machine learning and data mining algorithms.&lt;/p&gt;&lt;/blockquote&gt;</description>
<dc:date>2007-11-25T12:24:00Z</dc:date>
<dc:author>greut</dc:author>
<dc:subject>tutorial, data mining, programmation</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.autonlab.org/tutorials/index.html"><img border="0" src="http://blogmarks.net/screenshots/2007/11/25/29c5d80c3bfff40a36b355bfd3605ecc.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.autonlab.org/tutorials/index.html">Statistical Data Mining Tutorials</a></h4>
 
by <a href="http://blogmarks.net/user/greut">greut</a> 
<div class="description"><blockquote><p>The following links point to a set of tutorials on many aspects of statistical data mining, including the foundations of probability, the foundations of statistical data analysis, and most of the classic machine learning and data mining algorithms.</p></blockquote></div>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/tutorial">tutorial</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/data%2Bmining">data mining</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/programmation">programmation</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1057575895">Copy</a> | 
<a href="http://blogmarks.net/link/2560359">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/ogrisel/mark/1057479394">
<title>Nick Szabo -- Introduction to Algorithmic Information Theory</title>
<link>http://szabo.best.vwh.net/kolmogorov.html</link>
<description>Recent discoveries have unified the fields of computer science and information theory into the field of algorithmic information theory. This field is also known by its main result, Kolmogorov complexity. Kolmogorov complexity gives us a new way to grasp the mathematics of information, which is used to describe the structures of the world. Information is used to describe the cultural structures of science, legal and market institutions, art, music, knowledge, and beliefs. Information is also used in describing the structures and processes of biological phenomena, and phenomena of the physical world. The most obvious application of information is to the engineering domains of computers and communications. This essay will provide an overview of the field; only passing knowledge of computer science and probability theory is required of the reader.</description>
<dc:date>2007-10-10T15:22:49Z</dc:date>
<dc:author>ogrisel</dc:author>
<dc:subject>theory, information, complexity, algorithmic, kolmogorov, turing</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://szabo.best.vwh.net/kolmogorov.html"><img border="0" src="http://blogmarks.net/screenshots/2007/10/10/222705e97ed631968412083a24889dc8.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://szabo.best.vwh.net/kolmogorov.html">Nick Szabo -- Introduction to Algorithmic Information Theory</a></h4>
 
by <a href="http://blogmarks.net/user/ogrisel">ogrisel</a> 
<p class="description">Recent discoveries have unified the fields of computer science and information theory into the field of algorithmic information theory. This field is also known by its main result, Kolmogorov complexity. Kolmogorov complexity gives us a new way to grasp the mathematics of information, which is used to describe the structures of the world. Information is used to describe the cultural structures of science, legal and market institutions, art, music, knowledge, and beliefs. Information is also used in describing the structures and processes of biological phenomena, and phenomena of the physical world. The most obvious application of information is to the engineering domains of computers and communications. This essay will provide an overview of the field; only passing knowledge of computer science and probability theory is required of the reader.</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/theory">theory</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/information">information</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/complexity">complexity</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/algorithmic">algorithmic</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/kolmogorov">kolmogorov</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/turing">turing</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1057479394">Copy</a> | 
<a href="http://blogmarks.net/link/2472122">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/ogrisel/mark/1057452227">
<title>An Intuitive Explanation of the Information Entropy of a Random Variable</title>
<link>http://danielwilkerson.com/entropy.html</link>
<description>There is a popular game called twenty questions that works like this. One person is the &quot;Knower&quot; and picks a point out of the probability space of all objects (thinks of an object). The other is the &quot;Guesser&quot; and asks the Knower to evaluate various random variables (questions) at that point (answer the questions of the object). The Guesser wins if he can guess the object the Knower is thinking about by asking at most twenty questions.</description>
<dc:date>2007-09-22T17:29:16Z</dc:date>
<dc:author>ogrisel</dc:author>
<dc:subject>information theory, entropy, game</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://danielwilkerson.com/entropy.html"><img border="0" src="http://blogmarks.net/screenshots/2007/09/22/a546e4e3115b14acd3359ed45ac081b9.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://danielwilkerson.com/entropy.html">An Intuitive Explanation of the Information Entropy of a Random Variable</a></h4>
 
by <a href="http://blogmarks.net/user/ogrisel">ogrisel</a> 
<p class="description">There is a popular game called twenty questions that works like this. One person is the "Knower" and picks a point out of the probability space of all objects (thinks of an object). The other is the "Guesser" and asks the Knower to evaluate various random variables (questions) at that point (answer the questions of the object). The Guesser wins if he can guess the object the Knower is thinking about by asking at most twenty questions.</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/information%2Btheory">information theory</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/entropy">entropy</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/game">game</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1057452227">Copy</a> | 
<a href="http://blogmarks.net/link/2449573">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/cyberien/mark/1057210081">
<title>Photobucket JWidget</title>
<link>http://photobucket.com/jwidget</link>
<description>Are you looking to offer free image &amp; video hosting and sharing capabilities on your website?

    The Photobucket Jwidget is an industry-first tool that will enable your website users to access and share their Photobucket images and video without ever leaving your site.
What is the Jwidget?

    It is a free plugin that can be implemented in minutes giving any website free image and video hosting and publishing functionality at no additional cost. It's a simple IFRAME that lives on your website, allowing your members to upload as well as publish content from their Photobucket account without leaving your site.
Why should you use it?

    If your site accepts direct links and you want to enable your members to publish user-generated image and video content, the Photobucket Jwidget is for you. It will create a much more content rich engaging experience for your users while leveraging Photobucket's world class infrastructure, storage, bandwidth, and industry leading content moderation system. With Photobucket's 19 million members, there is a high probability that your users are already using Photobucket. The Jwidget will make it much easier for your users to link their Photobucket content onto your site.

    If you want to earn money from the traffic you generate from your Jwidget, join the Photobucket Affiliate Program!. You can earn $10 for every user that upgrades to a Photobucket premium account. To learn more about the affiliate program,</description>
<dc:date>2007-05-22T01:47:05Z</dc:date>
<dc:author>cyberien</dc:author>
<dc:subject>photobucket, widget, photos, tool, video</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://photobucket.com/jwidget"><img border="0" src="http://blogmarks.net/screenshots/2007/05/22/2ee74d62030d9868f9253658f5c17271.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://photobucket.com/jwidget">Photobucket JWidget</a></h4>
 
by <a href="http://blogmarks.net/user/cyberien">cyberien</a> 
 &amp; <a class="public" href="http://blogmarks.net/link/1794533">1 other(s)</a> 
<p class="description">Are you looking to offer free image & video hosting and sharing capabilities on your website?

    The Photobucket Jwidget is an industry-first tool that will enable your website users to access and share their Photobucket images and video without ever leaving your site.
What is the Jwidget?

    It is a free plugin that can be implemented in minutes giving any website free image and video hosting and publishing functionality at no additional cost. It's a simple IFRAME that lives on your website, allowing your members to upload as well as publish content from their Photobucket account without leaving your site.
Why should you use it?

    If your site accepts direct links and you want to enable your members to publish user-generated image and video content, the Photobucket Jwidget is for you. It will create a much more content rich engaging experience for your users while leveraging Photobucket's world class infrastructure, storage, bandwidth, and industry leading content moderation system. With Photobucket's 19 million members, there is a high probability that your users are already using Photobucket. The Jwidget will make it much easier for your users to link their Photobucket content onto your site.

    If you want to earn money from the traffic you generate from your Jwidget, join the Photobucket Affiliate Program!. You can earn $10 for every user that upgrades to a Photobucket premium account. To learn more about the affiliate program,</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/photobucket">photobucket</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/widget">widget</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/photos">photos</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/tool">tool</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/video">video</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1057210081">Copy</a> | 
<a href="http://blogmarks.net/link/1794533">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/pvergain/mark/1741894">
<title>Ddrescue - GNU Project - Free Software Foundation (FSF)</title>
<link>http://www.gnu.org/software/ddrescue/ddrescue.html</link>
<description>GNU ddrescue is a data recovery tool. It copies data from one file or block device (hard disc, cdrom, etc) to another, trying hard to rescue data in case of read errors.

Ddrescue does not truncate the output file if not asked to. So, every time you run it on the same output file, it tries to fill in the gaps.

The basic operation of ddrescue is fully automatic. That is, you don't have to wait for an error, stop the program, read the log, run it in reverse mode, etc.

If you use the logfile feature of ddrescue, the data is rescued very efficiently (only the needed blocks are read). Also you can interrupt the rescue at any time and resume it later at the same point.

Automatic merging of backups: If you have two or more damaged copies of a file, cdrom, etc, and run ddrescue on all of them, one at a time, with the same output file, you will probably obtain a complete and error-free file. This is so because the probability of having damaged areas at the same places on different input files is very low. Using the logfile, only the needed blocks are read from the second and successive copies.

The logfile is periodically saved to disc. So in case of a crash you can resume the rescue with little recopying.

Also, the same logfile can be used for multiple commands that copy different areas of the file, and for multiple recovery attempts over different subsets.

Ddrescue aligns its I/O buffer to the sector size so that it can be used to read from raw devices. For efficiency reasons, also aligns it to the memory page size if page size is a multiple of sector size.
</description>
<dc:date>2007-01-11T14:46:36Z</dc:date>
<dc:author>pvergain</dc:author>
<dc:subject>logiciel libre, tools, sauvegarde, ddrescue</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.gnu.org/software/ddrescue/ddrescue.html"><img border="0" src="http://blogmarks.net/screenshots/2007/01/11/201cfe2ff3b5669115ef339bed6d9186.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.gnu.org/software/ddrescue/ddrescue.html">Ddrescue - GNU Project - Free Software Foundation (FSF)</a></h4>
 
by <a href="http://blogmarks.net/user/pvergain">pvergain</a> 
 &amp; <a class="public" href="http://blogmarks.net/link/1196492">2 other(s)</a> 
<p class="description">GNU ddrescue is a data recovery tool. It copies data from one file or block device (hard disc, cdrom, etc) to another, trying hard to rescue data in case of read errors.

Ddrescue does not truncate the output file if not asked to. So, every time you run it on the same output file, it tries to fill in the gaps.

The basic operation of ddrescue is fully automatic. That is, you don't have to wait for an error, stop the program, read the log, run it in reverse mode, etc.

If you use the logfile feature of ddrescue, the data is rescued very efficiently (only the needed blocks are read). Also you can interrupt the rescue at any time and resume it later at the same point.

Automatic merging of backups: If you have two or more damaged copies of a file, cdrom, etc, and run ddrescue on all of them, one at a time, with the same output file, you will probably obtain a complete and error-free file. This is so because the probability of having damaged areas at the same places on different input files is very low. Using the logfile, only the needed blocks are read from the second and successive copies.

The logfile is periodically saved to disc. So in case of a crash you can resume the rescue with little recopying.

Also, the same logfile can be used for multiple commands that copy different areas of the file, and for multiple recovery attempts over different subsets.

Ddrescue aligns its I/O buffer to the sector size so that it can be used to read from raw devices. For efficiency reasons, also aligns it to the memory page size if page size is a multiple of sector size.
</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/logiciel%2Blibre">logiciel libre</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/tools">tools</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/sauvegarde">sauvegarde</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/ddrescue">ddrescue</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1741894">Copy</a> | 
<a href="http://blogmarks.net/link/1196492">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/cyberien/mark/1330541">
<title>Photobucket JWidget</title>
<link>http://photobucket.com/landing/jwidget.php</link>
<description>Are you looking to offer free image &amp; video hosting and sharing capabilities on your website?

    The Photobucket Jwidget is an industry-first tool that will enable your website users to access and share their Photobucket images and video without ever leaving your site.
What is the Jwidget?

    It is a free plugin that can be implemented in minutes giving any website free image and video hosting and publishing functionality at no additional cost. It's a simple IFRAME that lives on your website, allowing your members to upload as well as publish content from their Photobucket account without leaving your site.
Why should you use it?

    If your site accepts direct links and you want to enable your members to publish user-generated image and video content, the Photobucket Jwidget is for you. It will create a much more content rich engaging experience for your users while leveraging Photobucket's world class infrastructure, storage, bandwidth, and industry leading content moderation system. With Photobucket's 19 million members, there is a high probability that your users are already using Photobucket. The Jwidget will make it much easier for your users to link their Photobucket content onto your site.

    If you want to earn money from the traffic you generate from your Jwidget, join the Photobucket Affiliate Program!. You can earn $10 for every user that upgrades to a Photobucket premium account. To learn more about the affiliate program, click here</description>
<dc:date>2006-12-06T15:08:55Z</dc:date>
<dc:author>cyberien</dc:author>
<dc:subject>video, tool, images, it</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://photobucket.com/landing/jwidget.php"><img border="0" src="http://blogmarks.net/screenshots/2006/12/06/bfc8660de9b92674544fa4184765d77e.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://photobucket.com/landing/jwidget.php">Photobucket JWidget</a></h4>
 
by <a href="http://blogmarks.net/user/cyberien">cyberien</a> 
<p class="description">Are you looking to offer free image & video hosting and sharing capabilities on your website?

    The Photobucket Jwidget is an industry-first tool that will enable your website users to access and share their Photobucket images and video without ever leaving your site.
What is the Jwidget?

    It is a free plugin that can be implemented in minutes giving any website free image and video hosting and publishing functionality at no additional cost. It's a simple IFRAME that lives on your website, allowing your members to upload as well as publish content from their Photobucket account without leaving your site.
Why should you use it?

    If your site accepts direct links and you want to enable your members to publish user-generated image and video content, the Photobucket Jwidget is for you. It will create a much more content rich engaging experience for your users while leveraging Photobucket's world class infrastructure, storage, bandwidth, and industry leading content moderation system. With Photobucket's 19 million members, there is a high probability that your users are already using Photobucket. The Jwidget will make it much easier for your users to link their Photobucket content onto your site.

    If you want to earn money from the traffic you generate from your Jwidget, join the Photobucket Affiliate Program!. You can earn $10 for every user that upgrades to a Photobucket premium account. To learn more about the affiliate program, click here</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/video">video</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/tool">tool</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/images">images</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/it">it</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1330541">Copy</a> | 
<a href="http://blogmarks.net/link/1326438">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/jlesage/mark/1311071">
<title>Low Probability of Racoons - Hypertext and Flash animated poems</title>
<link>http://www.hphoward.demon.co.uk/poetry/petehype.htm</link>
<description>uses the duration of video to make kinetic poetry that has a narrative in the words and beyond them; nice example for students of simple form with complex effects</description>
<dc:date>2006-11-14T00:51:24Z</dc:date>
<dc:author>jlesage</dc:author>
<dc:subject>visualarts, tips, television, Pedagogy, personal, Narrative, NewMedia, digital, digitalculture, hypertext, design, film</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.hphoward.demon.co.uk/poetry/petehype.htm"><img border="0" src="http://blogmarks.net/screenshots/404.php" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.hphoward.demon.co.uk/poetry/petehype.htm">Low Probability of Racoons - Hypertext and Flash animated poems</a></h4>
 
by <a href="http://blogmarks.net/user/jlesage">jlesage</a> 
<p class="description">uses the duration of video to make kinetic poetry that has a narrative in the words and beyond them; nice example for students of simple form with complex effects</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/visualarts">visualarts</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/tips">tips</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/television">television</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/Pedagogy">Pedagogy</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/personal">personal</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/Narrative">Narrative</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/NewMedia">NewMedia</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/digital">digital</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/digitalculture">digitalculture</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/hypertext">hypertext</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/design">design</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/film">film</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1311071">Copy</a> | 
<a href="http://blogmarks.net/link/1315681">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/ogrisel/mark/1135501">
<title>Ddrescue - GNU Project - Free Software Foundation (FSF)</title>
<link>http://www.gnu.org/software/ddrescue/ddrescue.html</link>
<description>GNU ddrescue is a data recovery tool. It copies data from one file or block device (hard disc, cdrom, etc) to another, trying hard to rescue data in case of read errors.

Ddrescue does not truncate the output file if not asked to. So, every time you run it on the same output file, it tries to fill in the gaps.

The basic operation of ddrescue is fully automatic. That is, you don't have to wait for an error, stop the program, read the log, run it in reverse mode, etc.

If you use the logfile feature of ddrescue, the data is rescued very efficiently (only the needed blocks are read). Also you can interrupt the rescue at any time and resume it later at the same point.

Automatic merging of backups: If you have two or more damaged copies of a file, cdrom, etc, and run ddrescue on all of them, one at a time, with the same output file, you will probably obtain a complete and error-free file. This is so because the probability of having damaged areas at the same places on different input files is very low. Using the logfile, only the needed blocks are read from the second and successive copies.

The logfile is periodically saved to disc. So in case of a crash you can resume the rescue with little recopying.

Also, the same logfile can be used for multiple commands that copy different areas of the file, and for multiple recovery attempts over different subsets.

Ddrescue aligns its I/O buffer to the sector size so that it can be used to read from raw devices. For efficiency reasons, also aligns it to the memory page size if page size is a multiple of sector size.
</description>
<dc:date>2006-10-24T10:06:02Z</dc:date>
<dc:author>ogrisel</dc:author>
<dc:subject>recovery, file, disk, harddisk, automatic</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.gnu.org/software/ddrescue/ddrescue.html"><img border="0" src="http://blogmarks.net/screenshots/2007/01/11/201cfe2ff3b5669115ef339bed6d9186.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.gnu.org/software/ddrescue/ddrescue.html">Ddrescue - GNU Project - Free Software Foundation (FSF)</a></h4>
 
by <a href="http://blogmarks.net/user/ogrisel">ogrisel</a> 
 &amp; <a class="public" href="http://blogmarks.net/link/1196492">2 other(s)</a> 
<p class="description">GNU ddrescue is a data recovery tool. It copies data from one file or block device (hard disc, cdrom, etc) to another, trying hard to rescue data in case of read errors.

Ddrescue does not truncate the output file if not asked to. So, every time you run it on the same output file, it tries to fill in the gaps.

The basic operation of ddrescue is fully automatic. That is, you don't have to wait for an error, stop the program, read the log, run it in reverse mode, etc.

If you use the logfile feature of ddrescue, the data is rescued very efficiently (only the needed blocks are read). Also you can interrupt the rescue at any time and resume it later at the same point.

Automatic merging of backups: If you have two or more damaged copies of a file, cdrom, etc, and run ddrescue on all of them, one at a time, with the same output file, you will probably obtain a complete and error-free file. This is so because the probability of having damaged areas at the same places on different input files is very low. Using the logfile, only the needed blocks are read from the second and successive copies.

The logfile is periodically saved to disc. So in case of a crash you can resume the rescue with little recopying.

Also, the same logfile can be used for multiple commands that copy different areas of the file, and for multiple recovery attempts over different subsets.

Ddrescue aligns its I/O buffer to the sector size so that it can be used to read from raw devices. For efficiency reasons, also aligns it to the memory page size if page size is a multiple of sector size.
</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/recovery">recovery</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/file">file</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/disk">disk</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/harddisk">harddisk</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/automatic">automatic</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1135501">Copy</a> | 
<a href="http://blogmarks.net/link/1196492">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/YukuanMark/mark/1146382">
<title>Poisson distribution - Wikipedia, the free encyclopedia</title>
<link>http://en.wikipedia.org/wiki/Poisson_distribution</link>
<description>In probability theory and statistics, the Poisson distribution is a discrete probability distribution. It expresses the probability of a number of events occurring in a fixed period of time if these events occur with a known average rate, and are independ</description>
<dc:date>2006-09-10T05:04:42Z</dc:date>
<dc:author>YukuanMark</dc:author>
<dc:subject>poisson, probability</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://en.wikipedia.org/wiki/Poisson_distribution"><img border="0" src="http://blogmarks.net/screenshots/404.php" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://en.wikipedia.org/wiki/Poisson_distribution">Poisson distribution - Wikipedia, the free encyclopedia</a></h4>
 
by <a href="http://blogmarks.net/user/YukuanMark">YukuanMark</a> 
<p class="description">In probability theory and statistics, the Poisson distribution is a discrete probability distribution. It expresses the probability of a number of events occurring in a fixed period of time if these events occur with a known average rate, and are independ</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/poisson">poisson</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/probability">probability</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1146382">Copy</a> | 
<a href="http://blogmarks.net/link/1198308">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/redivider/mark/1165415">
<title>Science &amp; Technology at Scientific American.com: Miracle on Probability Street -- The Law of Large Numbers guarantees that one-in-a-million miracles happen 295 times a day in America</title>
<link>http://www.sciam.com/article.cfm?chanID=sa006&amp;colID=13&amp;articleID=00094511-E068-10FA-89FB83414B7F0000</link>
<description></description>
<dc:date>2006-07-26T21:56:10Z</dc:date>
<dc:author>redivider</dc:author>
<dc:subject>statistics</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.sciam.com/article.cfm?chanID=sa006&amp;colID=13&amp;articleID=00094511-E068-10FA-89FB83414B7F0000"><img border="0" src="http://blogmarks.net/screenshots/404.php" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.sciam.com/article.cfm?chanID=sa006&amp;colID=13&amp;articleID=00094511-E068-10FA-89FB83414B7F0000">Science &amp; Technology at Scientific American.com: Miracle on Probability Street -- The Law of Large Numbers guarantees that one-in-a-million miracles happen 295 times a day in America</a></h4>
 
by <a href="http://blogmarks.net/user/redivider">redivider</a> 
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/statistics">statistics</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=1165415">Copy</a> | 
<a href="http://blogmarks.net/link/1208557">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/4004/mark/674455">
<title>Introduction to probability - Book.pdf</title>
<link>http://www.dartmouth.edu/~chance/teaching_aids/books_articles/probability_book/book.html</link>
<description>Introduction to probability</description>
<dc:date>2006-07-04T07:14:28Z</dc:date>
<dc:author>4004</dc:author>
<dc:subject>math, book, pdf, probability, sci</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.dartmouth.edu/~chance/teaching_aids/books_articles/probability_book/book.html"><img border="0" src="http://www.blogmarks.net/screenshots/2005/05/09/79401df78bd83ecf6c637c2f74d8f6c1.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.dartmouth.edu/~chance/teaching_aids/books_articles/probability_book/book.html">Introduction to probability - Book.pdf</a></h4>
 
by <a href="http://blogmarks.net/user/4004">4004</a> 
 &amp; <a class="public" href="http://blogmarks.net/link/133799">1 other(s)</a> 
<p class="description">Introduction to probability</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/math">math</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/book">book</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/pdf">pdf</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/probability">probability</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/sci">sci</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=674455">Copy</a> | 
<a href="http://blogmarks.net/link/133799">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/nhoizey/mark/657925">
<title>Magic Quadrant for Horizontal Portal Products, 2006</title>
<link>http://mediaproducts.gartner.com/reprints/oracle/139926.html</link>
<description>Through 2008, less than 10 percent of Global 1000 companies will deploy open-source portals at the enterprise level because of lack of compelling advantages in cost, support, functionality and finish (0.8 probability). However, Gartner does not expect this trend to continue indefinitely. The technology in Java-based horizontal OSS portals, such as that provided by JBoss (recently acquired by Red Hat), is maturing, and vendor-independent portal standards, such as JSR 168, are reducing concerns about vendor lock-in. Additionally, some large ISVs have continued to exploit OSS technology in their portals, highlighted by Sun Microsystems' new strategy of open sourcing its entire infrastructure stack, including its portal. Open-source portal solutions could pose a threat to large ISVs' traditional license sales. At the same time, open source provides large ISVs with opportunities to generate revenue from services supporting open-source initiatives.</description>
<dc:date>2006-06-27T13:27:57Z</dc:date>
<dc:author>nhoizey</dc:author>
<dc:subject>portail, gartner, magic quadrant, logiciel libre, jboss, red hat</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://mediaproducts.gartner.com/reprints/oracle/139926.html"><img border="0" src="http://www.blogmarks.net/screenshots/2006/06/27/e8ec9a46439a95a40f96210373b9f22b.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://mediaproducts.gartner.com/reprints/oracle/139926.html">Magic Quadrant for Horizontal Portal Products, 2006</a></h4>
 
by <a href="http://blogmarks.net/user/nhoizey">nhoizey</a> 
<p class="description">Through 2008, less than 10 percent of Global 1000 companies will deploy open-source portals at the enterprise level because of lack of compelling advantages in cost, support, functionality and finish (0.8 probability). However, Gartner does not expect this trend to continue indefinitely. The technology in Java-based horizontal OSS portals, such as that provided by JBoss (recently acquired by Red Hat), is maturing, and vendor-independent portal standards, such as JSR 168, are reducing concerns about vendor lock-in. Additionally, some large ISVs have continued to exploit OSS technology in their portals, highlighted by Sun Microsystems' new strategy of open sourcing its entire infrastructure stack, including its portal. Open-source portal solutions could pose a threat to large ISVs' traditional license sales. At the same time, open source provides large ISVs with opportunities to generate revenue from services supporting open-source initiatives.</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/portail">portail</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/gartner">gartner</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/magic%2Bquadrant">magic quadrant</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/logiciel%2Blibre">logiciel libre</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/jboss">jboss</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/red%2Bhat">red hat</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=657925">Copy</a> | 
<a href="http://blogmarks.net/link/941982">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/multilinko/mark/640164">
<title>Boing Boing: Psychology of bad probability estimation: why lottos and terrorists matter</title>
<link>http://www.boingboing.net/2006/06/17/psychology_of_bad_pr.html</link>
<description>Here's the audio from a South By Southwest 2006 presentation by Harvard's Daniel Gilbert on the psychology of probability estimation. This is important stuff -- it explains why we're socially willing to commit nigh-infinite social resources to fighting terrorism, though statistically, terrorist attacks almost never happen; though we barely lift a finger to help save people from routine traffic accidents, backyard pool drownings, and asthma, which mow down our neighbors by the thousands. It explains why people buy lottery tickets. It explains a great deal about many kinds of human activity.</description>
<dc:date>2006-06-18T12:14:33Z</dc:date>
<dc:author>multilinko</dc:author>
<dc:subject>probability</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.boingboing.net/2006/06/17/psychology_of_bad_pr.html"><img border="0" src="http://www.blogmarks.net/screenshots/2006/06/18/9825aa970465130f8c3e5cbe612d57a4.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.boingboing.net/2006/06/17/psychology_of_bad_pr.html">Boing Boing: Psychology of bad probability estimation: why lottos and terrorists matter</a></h4>
 
by <a href="http://blogmarks.net/user/multilinko">multilinko</a> 
<p class="description">Here's the audio from a South By Southwest 2006 presentation by Harvard's Daniel Gilbert on the psychology of probability estimation. This is important stuff -- it explains why we're socially willing to commit nigh-infinite social resources to fighting terrorism, though statistically, terrorist attacks almost never happen; though we barely lift a finger to help save people from routine traffic accidents, backyard pool drownings, and asthma, which mow down our neighbors by the thousands. It explains why people buy lottery tickets. It explains a great deal about many kinds of human activity.</p>
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/probability">probability</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=640164">Copy</a> | 
<a href="http://blogmarks.net/link/929870">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/JayFre/mark/482530">
<title>Corlan bridge club: The AUTOVACA online hand probability calculator</title>
<link>http://bridge.corlan.net/avaca.html</link>
<description></description>
<dc:date>2006-04-18T19:52:30Z</dc:date>
<dc:author>JayFre</dc:author>
<dc:subject>software, toreview</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://bridge.corlan.net/avaca.html"><img border="0" src="http://www.blogmarks.net/screenshots/2006/04/18/384b054785a7f5a7f29fe531ca8e812c.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://bridge.corlan.net/avaca.html">Corlan bridge club: The AUTOVACA online hand probability calculator</a></h4>
 
by <a href="http://blogmarks.net/user/JayFre">JayFre</a> 
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/software">software</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/toreview">toreview</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=482530">Copy</a> | 
<a href="http://blogmarks.net/link/734299">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/geo892/mark/341618">
<title>Probability with Maple</title>
<link>http://www.mas.ncl.ac.uk/~ndjw1/teaching/maple/</link>
<description></description>
<dc:date>2006-02-08T00:40:53Z</dc:date>
<dc:author>geo892</dc:author>
<dc:subject>stats</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.mas.ncl.ac.uk/~ndjw1/teaching/maple/"><img border="0" src="http://www.blogmarks.net/screenshots/2006/02/08/08b2b7a4d9e23dde415591d3b7bf38fb.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.mas.ncl.ac.uk/~ndjw1/teaching/maple/">Probability with Maple</a></h4>
 
by <a href="http://blogmarks.net/user/geo892">geo892</a> 
 &amp; <a class="public" href="http://blogmarks.net/link/461856">1 other(s)</a> 
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/stats">stats</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=341618">Copy</a> | 
<a href="http://blogmarks.net/link/461856">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/geo892/mark/341611">
<title>Welcome to Probability by Surprise !</title>
<link>http://www-stat.stanford.edu/~susan/surprise/</link>
<description></description>
<dc:date>2006-02-08T00:40:50Z</dc:date>
<dc:author>geo892</dc:author>
<dc:subject>stats</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www-stat.stanford.edu/~susan/surprise/"><img border="0" src="http://www.blogmarks.net/screenshots/2006/02/08/afd0e4e21e07473a1f312bf2fe62237a.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www-stat.stanford.edu/~susan/surprise/">Welcome to Probability by Surprise !</a></h4>
 
by <a href="http://blogmarks.net/user/geo892">geo892</a> 
 &amp; <a class="public" href="http://blogmarks.net/link/461842">1 other(s)</a> 
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/stats">stats</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=341611">Copy</a> | 
<a href="http://blogmarks.net/link/461842">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/geo892/mark/341591">
<title>Probability Distribution Applets</title>
<link>http://ic.net/~jnbohr/java/CdfDemoMain.html</link>
<description></description>
<dc:date>2006-02-08T00:40:35Z</dc:date>
<dc:author>geo892</dc:author>
<dc:subject>stats</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://ic.net/~jnbohr/java/CdfDemoMain.html"><img border="0" src="http://www.blogmarks.net/screenshots/2006/02/08/2cef0f024b4f285f9360cf2efa35a31b.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://ic.net/~jnbohr/java/CdfDemoMain.html">Probability Distribution Applets</a></h4>
 
by <a href="http://blogmarks.net/user/geo892">geo892</a> 
 &amp; <a class="public" href="http://blogmarks.net/link/461802">1 other(s)</a> 
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/stats">stats</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=341591">Copy</a> | 
<a href="http://blogmarks.net/link/461802">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/brodrigu/mark/380928">
<title>Statistics 131A: Introduction to Probability Theory</title>
<link>http://anson.ucdavis.edu/~iudaltsova/stat131A.htm</link>
<description></description>
<dc:date>2006-01-20T03:17:43Z</dc:date>
<dc:author>brodrigu</dc:author>
<dc:subject>statistics, Winter2006, UCD</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://anson.ucdavis.edu/~iudaltsova/stat131A.htm"><img border="0" src="http://www.blogmarks.net/screenshots/2006/01/20/0ffcb25d04bdc0e0cc5401f876d9b73b.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://anson.ucdavis.edu/~iudaltsova/stat131A.htm">Statistics 131A: Introduction to Probability Theory</a></h4>
 
by <a href="http://blogmarks.net/user/brodrigu">brodrigu</a> 
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/statistics">statistics</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/Winter2006">Winter2006</a>
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/UCD">UCD</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=380928">Copy</a> | 
<a href="http://blogmarks.net/link/574290">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/geosblogs/mark/303506">
<title>Probability with Maple</title>
<link>http://www.mas.ncl.ac.uk/~ndjw1/teaching/maple/</link>
<description></description>
<dc:date>2006-01-16T17:58:06Z</dc:date>
<dc:author>geosblogs</dc:author>
<dc:subject>stats</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.mas.ncl.ac.uk/~ndjw1/teaching/maple/"><img border="0" src="http://www.blogmarks.net/screenshots/2006/02/08/08b2b7a4d9e23dde415591d3b7bf38fb.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.mas.ncl.ac.uk/~ndjw1/teaching/maple/">Probability with Maple</a></h4>
 
by <a href="http://blogmarks.net/user/geosblogs">geosblogs</a> 
 &amp; <a class="public" href="http://blogmarks.net/link/461856">1 other(s)</a> 
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/stats">stats</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=303506">Copy</a> | 
<a href="http://blogmarks.net/link/461856">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/geosblogs/mark/303499">
<title>Welcome to Probability by Surprise !</title>
<link>http://www-stat.stanford.edu/~susan/surprise/</link>
<description></description>
<dc:date>2006-01-16T17:58:04Z</dc:date>
<dc:author>geosblogs</dc:author>
<dc:subject>stats</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www-stat.stanford.edu/~susan/surprise/"><img border="0" src="http://www.blogmarks.net/screenshots/2006/02/08/afd0e4e21e07473a1f312bf2fe62237a.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www-stat.stanford.edu/~susan/surprise/">Welcome to Probability by Surprise !</a></h4>
 
by <a href="http://blogmarks.net/user/geosblogs">geosblogs</a> 
 &amp; <a class="public" href="http://blogmarks.net/link/461842">1 other(s)</a> 
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/stats">stats</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=303499">Copy</a> | 
<a href="http://blogmarks.net/link/461842">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/geosblogs/mark/303479">
<title>Probability Distribution Applets</title>
<link>http://ic.net/~jnbohr/java/CdfDemoMain.html</link>
<description></description>
<dc:date>2006-01-16T17:57:58Z</dc:date>
<dc:author>geosblogs</dc:author>
<dc:subject>stats</dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://ic.net/~jnbohr/java/CdfDemoMain.html"><img border="0" src="http://www.blogmarks.net/screenshots/2006/02/08/2cef0f024b4f285f9360cf2efa35a31b.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://ic.net/~jnbohr/java/CdfDemoMain.html">Probability Distribution Applets</a></h4>
 
by <a href="http://blogmarks.net/user/geosblogs">geosblogs</a> 
 &amp; <a class="public" href="http://blogmarks.net/link/461802">1 other(s)</a> 
<p class="tags">
<a rel="tag" class="tag public_tag" href="http://blogmarks.net/marks/tag/stats">stats</a>
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=303479">Copy</a> | 
<a href="http://blogmarks.net/link/461802">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> <item rdf:about="http://blogmarks.net/api/user/hokinkong/mark/192411">
<title>Amazon.co.uk: Books: Probability One</title>
<link>http://www.amazon.co.uk/exec/obidos/ASIN/0316648299/qid</link>
<description></description>
<dc:date>2005-10-27T02:57:46Z</dc:date>
<dc:author>hokinkong</dc:author>
<dc:subject></dc:subject>
<content:encoded><![CDATA[<div class="mark">
<a href="http://www.amazon.co.uk/exec/obidos/ASIN/0316648299/qid"><img border="0" src="http://www.blogmarks.net/screenshots/2005/10/27/5457d263f31ea27f51a6866808676234.png" alt="" /></a>
<div class="xfolkentry">
<h4><a class="taggedlink" href="http://www.amazon.co.uk/exec/obidos/ASIN/0316648299/qid">Amazon.co.uk: Books: Probability One</a></h4>
 
by <a href="http://blogmarks.net/user/hokinkong">hokinkong</a> 
<p class="tags">
</p>
<div class="action-bar">
<a href="http://blogmarks.net/my/marks,new?id=192411">Copy</a> | 
<a href="http://blogmarks.net/link/288762">React (0)</a></div>
</div>
</div>
]]></content:encoded>
</item> </rdf:RDF>